aboutsummaryrefslogtreecommitdiffstats
path: root/eth/filters/filter_system.go
blob: 1e330b24f05bdbcf1b4acdcce97632fd0f962b26 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
// Copyright 2015 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.

// Package filters implements an ethereum filtering system for block,
// transactions and log events.
package filters

import (
    "encoding/json"
    "errors"
    "fmt"
    "sync"
    "time"

    "github.com/ethereum/go-ethereum/common"
    "github.com/ethereum/go-ethereum/core"
    "github.com/ethereum/go-ethereum/core/types"
    "github.com/ethereum/go-ethereum/core/vm"
    "github.com/ethereum/go-ethereum/event"
    "github.com/ethereum/go-ethereum/rpc"
    "golang.org/x/net/context"
)

// Type determines the kind of filter and is used to put the filter in to
// the correct bucket when added.
type Type byte

const (
    // UnknownSubscription indicates an unkown subscription type
    UnknownSubscription Type = iota
    // LogsSubscription queries for new or removed (chain reorg) logs
    LogsSubscription
    // PendingLogsSubscription queries for logs for the pending block
    PendingLogsSubscription
    // PendingTransactionsSubscription queries tx hashes for pending
    // transactions entering the pending state
    PendingTransactionsSubscription
    // BlocksSubscription queries hashes for blocks that are imported
    BlocksSubscription
)

var (
    ErrInvalidSubscriptionID = errors.New("invalid id")
)

// Log is a helper that can hold additional information about vm.Log
// necessary for the RPC interface.
type Log struct {
    *vm.Log
    Removed bool `json:"removed"`
}

func (l *Log) MarshalJSON() ([]byte, error) {
    fields := map[string]interface{}{
        "address":          l.Address,
        "data":             fmt.Sprintf("0x%x", l.Data),
        "blockNumber":      fmt.Sprintf("%#x", l.BlockNumber),
        "logIndex":         fmt.Sprintf("%#x", l.Index),
        "blockHash":        l.BlockHash,
        "transactionHash":  l.TxHash,
        "transactionIndex": fmt.Sprintf("%#x", l.TxIndex),
        "topics":           l.Topics,
        "removed":          l.Removed,
    }

    return json.Marshal(fields)
}

type subscription struct {
    id        rpc.ID
    typ       Type
    created   time.Time
    logsCrit  FilterCriteria
    logs      chan []Log
    hashes    chan common.Hash
    headers   chan *types.Header
    installed chan struct{} // closed when the filter is installed
    err       chan error    // closed when the filter is uninstalled
}

// EventSystem creates subscriptions, processes events and broadcasts them to the
// subscription which match the subscription criteria.
type EventSystem struct {
    mux       *event.TypeMux
    sub       event.Subscription
    backend   Backend
    lightMode bool
    lastHead  *types.Header
    install   chan *subscription // install filter for event notification
    uninstall chan *subscription // remove filter for event notification
}

// NewEventSystem creates a new manager that listens for event on the given mux,
// parses and filters them. It uses the all map to retrieve filter changes. The
// work loop holds its own index that is used to forward events to filters.
//
// The returned manager has a loop that needs to be stopped with the Stop function
// or by stopping the given mux.
func NewEventSystem(mux *event.TypeMux, backend Backend, lightMode bool) *EventSystem {
    m := &EventSystem{
        mux:       mux,
        backend:   backend,
        lightMode: lightMode,
        install:   make(chan *subscription),
        uninstall: make(chan *subscription),
    }

    go m.eventLoop()

    return m
}

// Subscription is created when the client registers itself for a particular event.
type Subscription struct {
    ID        rpc.ID
    f         *subscription
    es        *EventSystem
    unsubOnce sync.Once
}

// Err returns a channel that is closed when unsubscribed.
func (sub *Subscription) Err() <-chan error {
    return sub.f.err
}

// Unsubscribe uninstalls the subscription from the event broadcast loop.
func (sub *Subscription) Unsubscribe() {
    sub.unsubOnce.Do(func() {
    uninstallLoop:
        for {
            // write uninstall request and consume logs/hashes. This prevents
            // the eventLoop broadcast method to deadlock when writing to the
            // filter event channel while the subscription loop is waiting for
            // this method to return (and thus not reading these events).
            select {
            case sub.es.uninstall <- sub.f:
                break uninstallLoop
            case <-sub.f.logs:
            case <-sub.f.hashes:
            case <-sub.f.headers:
            }
        }

        // wait for filter to be uninstalled in work loop before returning
        // this ensures that the manager won't use the event channel which
        // will probably be closed by the client asap after this method returns.
        <-sub.Err()
    })
}

// subscribe installs the subscription in the event broadcast loop.
func (es *EventSystem) subscribe(sub *subscription) *Subscription {
    es.install <- sub
    <-sub.installed
    return &Subscription{ID: sub.id, f: sub, es: es}
}

// SubscribeLogs creates a subscription that will write all logs matching the
// given criteria to the given logs channel.
func (es *EventSystem) SubscribeLogs(crit FilterCriteria, logs chan []Log) *Subscription {
    sub := &subscription{
        id:        rpc.NewID(),
        typ:       LogsSubscription,
        logsCrit:  crit,
        created:   time.Now(),
        logs:      logs,
        hashes:    make(chan common.Hash),
        headers:   make(chan *types.Header),
        installed: make(chan struct{}),
        err:       make(chan error),
    }

    return es.subscribe(sub)
}

// SubscribePendingLogs creates a subscription that will write pending logs matching the
// given criteria to the given channel.
func (es *EventSystem) SubscribePendingLogs(crit FilterCriteria, logs chan []Log) *Subscription {
    sub := &subscription{
        id:        rpc.NewID(),
        typ:       PendingLogsSubscription,
        logsCrit:  crit,
        created:   time.Now(),
        logs:      logs,
        hashes:    make(chan common.Hash),
        headers:   make(chan *types.Header),
        installed: make(chan struct{}),
        err:       make(chan error),
    }

    return es.subscribe(sub)
}

// SubscribePendingTxEvents creates a sbuscription that writes transaction hashes for
// transactions that enter the transaction pool.
func (es *EventSystem) SubscribePendingTxEvents(hashes chan common.Hash) *Subscription {
    sub := &subscription{
        id:        rpc.NewID(),
        typ:       PendingTransactionsSubscription,
        created:   time.Now(),
        logs:      make(chan []Log),
        hashes:    hashes,
        headers:   make(chan *types.Header),
        installed: make(chan struct{}),
        err:       make(chan error),
    }

    return es.subscribe(sub)
}

// SubscribeNewHeads creates a subscription that writes the header of a block that is
// imported in the chain.
func (es *EventSystem) SubscribeNewHeads(headers chan *types.Header) *Subscription {
    sub := &subscription{
        id:        rpc.NewID(),
        typ:       BlocksSubscription,
        created:   time.Now(),
        logs:      make(chan []Log),
        hashes:    make(chan common.Hash),
        headers:   headers,
        installed: make(chan struct{}),
        err:       make(chan error),
    }

    return es.subscribe(sub)
}

type filterIndex map[Type]map[rpc.ID]*subscription

// broadcast event to filters that match criteria.
func (es *EventSystem) broadcast(filters filterIndex, ev *event.Event) {
    if ev == nil {
        return
    }

    switch e := ev.Data.(type) {
    case vm.Logs:
        if len(e) > 0 {
            for _, f := range filters[LogsSubscription] {
                if ev.Time.After(f.created) {
                    if matchedLogs := filterLogs(convertLogs(e, false), f.logsCrit.Addresses, f.logsCrit.Topics); len(matchedLogs) > 0 {
                        f.logs <- matchedLogs
                    }
                }
            }
        }
    case core.RemovedLogsEvent:
        for _, f := range filters[LogsSubscription] {
            if ev.Time.After(f.created) {
                if matchedLogs := filterLogs(convertLogs(e.Logs, true), f.logsCrit.Addresses, f.logsCrit.Topics); len(matchedLogs) > 0 {
                    f.logs <- matchedLogs
                }
            }
        }
    case core.PendingLogsEvent:
        for _, f := range filters[PendingLogsSubscription] {
            if ev.Time.After(f.created) {
                if matchedLogs := filterLogs(convertLogs(e.Logs, false), f.logsCrit.Addresses, f.logsCrit.Topics); len(matchedLogs) > 0 {
                    f.logs <- matchedLogs
                }
            }
        }
    case core.TxPreEvent:
        for _, f := range filters[PendingTransactionsSubscription] {
            if ev.Time.After(f.created) {
                f.hashes <- e.Tx.Hash()
            }
        }
    case core.ChainEvent:
        for _, f := range filters[BlocksSubscription] {
            if ev.Time.After(f.created) {
                f.headers <- e.Block.Header()
            }
        }
        if es.lightMode && len(filters[LogsSubscription]) > 0 {
            es.lightFilterNewHead(e.Block.Header(), func(header *types.Header, remove bool) {
                for _, f := range filters[LogsSubscription] {
                    if ev.Time.After(f.created) {
                        if matchedLogs := es.lightFilterLogs(header, f.logsCrit.Addresses, f.logsCrit.Topics, remove); len(matchedLogs) > 0 {
                            f.logs <- matchedLogs
                        }
                    }
                }
            })
        }
    }
}

func (es *EventSystem) lightFilterNewHead(newHeader *types.Header, callBack func(*types.Header, bool)) {
    oldh := es.lastHead
    es.lastHead = newHeader
    if oldh == nil {
        return
    }
    newh := newHeader
    // find common ancestor, create list of rolled back and new block hashes
    var oldHeaders, newHeaders []*types.Header
    for oldh.Hash() != newh.Hash() {
        if oldh.GetNumberU64() >= newh.GetNumberU64() {
            oldHeaders = append(oldHeaders, oldh)
            oldh = core.GetHeader(es.backend.ChainDb(), oldh.ParentHash, oldh.Number.Uint64()-1)
        }
        if oldh.GetNumberU64() < newh.GetNumberU64() {
            newHeaders = append(newHeaders, newh)
            newh = core.GetHeader(es.backend.ChainDb(), newh.ParentHash, newh.Number.Uint64()-1)
            if newh == nil {
                // happens when CHT syncing, nothing to do
                newh = oldh
            }
        }
    }
    // roll back old blocks
    for _, h := range oldHeaders {
        callBack(h, true)
    }
    // check new blocks (array is in reverse order)
    for i := len(newHeaders) - 1; i >= 0; i-- {
        callBack(newHeaders[i], false)
    }
}

// filter logs of a single header in light client mode
func (es *EventSystem) lightFilterLogs(header *types.Header, addresses []common.Address, topics [][]common.Hash, remove bool) []Log {
    //fmt.Println("lightFilterLogs", header.Number.Uint64(), remove)
    if bloomFilter(header.Bloom, addresses, topics) {
        //fmt.Println("bloom match")
        // Get the logs of the block
        ctx, _ := context.WithTimeout(context.Background(), time.Second*5)
        receipts, err := es.backend.GetReceipts(ctx, header.Hash())
        if err != nil {
            return nil
        }
        var unfiltered []Log
        for _, receipt := range receipts {
            rl := make([]Log, len(receipt.Logs))
            for i, l := range receipt.Logs {
                rl[i] = Log{l, remove}
            }
            unfiltered = append(unfiltered, rl...)
        }
        logs := filterLogs(unfiltered, addresses, topics)
        //fmt.Println("found", len(logs))
        return logs
    }
    return nil
}

// eventLoop (un)installs filters and processes mux events.
func (es *EventSystem) eventLoop() {
    var (
        index = make(filterIndex)
        sub   = es.mux.Subscribe(core.PendingLogsEvent{}, core.RemovedLogsEvent{}, vm.Logs{}, core.TxPreEvent{}, core.ChainEvent{})
    )
    for {
        select {
        case ev, active := <-sub.Chan():
            if !active { // system stopped
                return
            }
            es.broadcast(index, ev)
        case f := <-es.install:
            if _, found := index[f.typ]; !found {
                index[f.typ] = make(map[rpc.ID]*subscription)
            }
            index[f.typ][f.id] = f
            close(f.installed)
        case f := <-es.uninstall:
            delete(index[f.typ], f.id)
            close(f.err)
        }
    }
}

// convertLogs is a helper utility that converts vm.Logs to []filter.Log.
func convertLogs(in vm.Logs, removed bool) []Log {
    logs := make([]Log, len(in))
    for i, l := range in {
        logs[i] = Log{l, removed}
    }
    return logs
}