forked from jaegertracing/jaeger
-
Notifications
You must be signed in to change notification settings - Fork 0
/
process_hashtable.go
57 lines (51 loc) · 1.64 KB
/
process_hashtable.go
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
// Copyright (c) 2019 The Jaeger Authors.
// Copyright (c) 2017 Uber Technologies, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package zipkin
import (
"github.com/jaegertracing/jaeger/model"
)
type processHashtable struct {
processes map[uint64][]*model.Process
extHash func(*model.Process) uint64
}
func newProcessHashtable() *processHashtable {
processes := make(map[uint64][]*model.Process)
return &processHashtable{processes: processes}
}
func (ph processHashtable) hash(process *model.Process) uint64 {
if ph.extHash != nil {
// for testing collisions
return ph.extHash(process)
}
hc, _ := model.HashCode(process)
return hc
}
// add checks if identical Process already exists in the hash table and returns it.
// Otherwise it adds process to the table and returns it.
func (ph processHashtable) add(process *model.Process) *model.Process {
hash := ph.hash(process)
if pp, ok := ph.processes[hash]; ok {
for _, p := range pp {
if p.Equal(process) {
return p // reuse existing Process object
}
}
pp = append(pp, process)
ph.processes[hash] = pp
} else {
ph.processes[hash] = []*model.Process{process}
}
return process
}