github.com/lukasz-zimnoch/go-ethereum@v1.9.7/event/feed.go (about) 1 // Copyright 2016 The go-ethereum Authors 2 // This file is part of the go-ethereum library. 3 // 4 // The go-ethereum library is free software: you can redistribute it and/or modify 5 // it under the terms of the GNU Lesser General Public License as published by 6 // the Free Software Foundation, either version 3 of the License, or 7 // (at your option) any later version. 8 // 9 // The go-ethereum library is distributed in the hope that it will be useful, 10 // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 // GNU Lesser General Public License for more details. 13 // 14 // You should have received a copy of the GNU Lesser General Public License 15 // along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>. 16 17 package event 18 19 import ( 20 "errors" 21 "reflect" 22 "sync" 23 ) 24 25 var errBadChannel = errors.New("event: Subscribe argument does not have sendable channel type") 26 27 // Feed implements one-to-many subscriptions where the carrier of events is a channel. 28 // Values sent to a Feed are delivered to all subscribed channels simultaneously. 29 // 30 // Feeds can only be used with a single type. The type is determined by the first Send or 31 // Subscribe operation. Subsequent calls to these methods panic if the type does not 32 // match. 33 // 34 // The zero value is ready to use. 35 type Feed struct { 36 once sync.Once // ensures that init only runs once 37 sendLock chan struct{} // sendLock has a one-element buffer and is empty when held.It protects sendCases. 38 removeSub chan interface{} // interrupts Send 39 sendCases caseList // the active set of select cases used by Send 40 41 // The inbox holds newly subscribed channels until they are added to sendCases. 42 mu sync.Mutex 43 inbox caseList 44 etype reflect.Type 45 closed bool 46 } 47 48 // This is the index of the first actual subscription channel in sendCases. 49 // sendCases[0] is a SelectRecv case for the removeSub channel. 50 const firstSubSendCase = 1 51 52 type feedTypeError struct { 53 got, want reflect.Type 54 op string 55 } 56 57 func (e feedTypeError) Error() string { 58 return "event: wrong type in " + e.op + " got " + e.got.String() + ", want " + e.want.String() 59 } 60 61 func (f *Feed) init() { 62 f.removeSub = make(chan interface{}) 63 f.sendLock = make(chan struct{}, 1) 64 f.sendLock <- struct{}{} 65 f.sendCases = caseList{{Chan: reflect.ValueOf(f.removeSub), Dir: reflect.SelectRecv}} 66 } 67 68 // Subscribe adds a channel to the feed. Future sends will be delivered on the channel 69 // until the subscription is canceled. All channels added must have the same element type. 70 // 71 // The channel should have ample buffer space to avoid blocking other subscribers. 72 // Slow subscribers are not dropped. 73 func (f *Feed) Subscribe(channel interface{}) Subscription { 74 f.once.Do(f.init) 75 76 chanval := reflect.ValueOf(channel) 77 chantyp := chanval.Type() 78 if chantyp.Kind() != reflect.Chan || chantyp.ChanDir()&reflect.SendDir == 0 { 79 panic(errBadChannel) 80 } 81 sub := &feedSub{feed: f, channel: chanval, err: make(chan error, 1)} 82 83 f.mu.Lock() 84 defer f.mu.Unlock() 85 if !f.typecheck(chantyp.Elem()) { 86 panic(feedTypeError{op: "Subscribe", got: chantyp, want: reflect.ChanOf(reflect.SendDir, f.etype)}) 87 } 88 // Add the select case to the inbox. 89 // The next Send will add it to f.sendCases. 90 cas := reflect.SelectCase{Dir: reflect.SelectSend, Chan: chanval} 91 f.inbox = append(f.inbox, cas) 92 return sub 93 } 94 95 // note: callers must hold f.mu 96 func (f *Feed) typecheck(typ reflect.Type) bool { 97 if f.etype == nil { 98 f.etype = typ 99 return true 100 } 101 return f.etype == typ 102 } 103 104 func (f *Feed) remove(sub *feedSub) { 105 // Delete from inbox first, which covers channels 106 // that have not been added to f.sendCases yet. 107 ch := sub.channel.Interface() 108 f.mu.Lock() 109 index := f.inbox.find(ch) 110 if index != -1 { 111 f.inbox = f.inbox.delete(index) 112 f.mu.Unlock() 113 return 114 } 115 f.mu.Unlock() 116 117 select { 118 case f.removeSub <- ch: 119 // Send will remove the channel from f.sendCases. 120 case <-f.sendLock: 121 // No Send is in progress, delete the channel now that we have the send lock. 122 f.sendCases = f.sendCases.delete(f.sendCases.find(ch)) 123 f.sendLock <- struct{}{} 124 } 125 } 126 127 // Send delivers to all subscribed channels simultaneously. 128 // It returns the number of subscribers that the value was sent to. 129 func (f *Feed) Send(value interface{}) (nsent int) { 130 rvalue := reflect.ValueOf(value) 131 132 f.once.Do(f.init) 133 <-f.sendLock 134 135 // Add new cases from the inbox after taking the send lock. 136 f.mu.Lock() 137 f.sendCases = append(f.sendCases, f.inbox...) 138 f.inbox = nil 139 140 if !f.typecheck(rvalue.Type()) { 141 f.sendLock <- struct{}{} 142 panic(feedTypeError{op: "Send", got: rvalue.Type(), want: f.etype}) 143 } 144 f.mu.Unlock() 145 146 // Set the sent value on all channels. 147 for i := firstSubSendCase; i < len(f.sendCases); i++ { 148 f.sendCases[i].Send = rvalue 149 } 150 151 // Send until all channels except removeSub have been chosen. 'cases' tracks a prefix 152 // of sendCases. When a send succeeds, the corresponding case moves to the end of 153 // 'cases' and it shrinks by one element. 154 cases := f.sendCases 155 for { 156 // Fast path: try sending without blocking before adding to the select set. 157 // This should usually succeed if subscribers are fast enough and have free 158 // buffer space. 159 for i := firstSubSendCase; i < len(cases); i++ { 160 if cases[i].Chan.TrySend(rvalue) { 161 nsent++ 162 cases = cases.deactivate(i) 163 i-- 164 } 165 } 166 if len(cases) == firstSubSendCase { 167 break 168 } 169 // Select on all the receivers, waiting for them to unblock. 170 chosen, recv, _ := reflect.Select(cases) 171 if chosen == 0 /* <-f.removeSub */ { 172 index := f.sendCases.find(recv.Interface()) 173 f.sendCases = f.sendCases.delete(index) 174 if index >= 0 && index < len(cases) { 175 // Shrink 'cases' too because the removed case was still active. 176 cases = f.sendCases[:len(cases)-1] 177 } 178 } else { 179 cases = cases.deactivate(chosen) 180 nsent++ 181 } 182 } 183 184 // Forget about the sent value and hand off the send lock. 185 for i := firstSubSendCase; i < len(f.sendCases); i++ { 186 f.sendCases[i].Send = reflect.Value{} 187 } 188 f.sendLock <- struct{}{} 189 return nsent 190 } 191 192 type feedSub struct { 193 feed *Feed 194 channel reflect.Value 195 errOnce sync.Once 196 err chan error 197 } 198 199 func (sub *feedSub) Unsubscribe() { 200 sub.errOnce.Do(func() { 201 sub.feed.remove(sub) 202 close(sub.err) 203 }) 204 } 205 206 func (sub *feedSub) Err() <-chan error { 207 return sub.err 208 } 209 210 type caseList []reflect.SelectCase 211 212 // find returns the index of a case containing the given channel. 213 func (cs caseList) find(channel interface{}) int { 214 for i, cas := range cs { 215 if cas.Chan.Interface() == channel { 216 return i 217 } 218 } 219 return -1 220 } 221 222 // delete removes the given case from cs. 223 func (cs caseList) delete(index int) caseList { 224 return append(cs[:index], cs[index+1:]...) 225 } 226 227 // deactivate moves the case at index into the non-accessible portion of the cs slice. 228 func (cs caseList) deactivate(index int) caseList { 229 last := len(cs) - 1 230 cs[index], cs[last] = cs[last], cs[index] 231 return cs[:last] 232 } 233 234 // func (cs caseList) String() string { 235 // s := "[" 236 // for i, cas := range cs { 237 // if i != 0 { 238 // s += ", " 239 // } 240 // switch cas.Dir { 241 // case reflect.SelectSend: 242 // s += fmt.Sprintf("%v<-", cas.Chan.Interface()) 243 // case reflect.SelectRecv: 244 // s += fmt.Sprintf("<-%v", cas.Chan.Interface()) 245 // } 246 // } 247 // return s + "]" 248 // }