forked from jaegertracing/jaeger
-
Notifications
You must be signed in to change notification settings - Fork 0
/
process_hashtable.go
82 lines (73 loc) · 2.13 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
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
// 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 json
import (
"strconv"
"github.com/jaegertracing/jaeger/model"
)
type processHashtable struct {
count int
processes map[uint64][]processKey
extHash func(*model.Process) uint64
}
type processKey struct {
process *model.Process
key string
}
// getKey assigns a new unique string key to the process, or returns
// a previously assigned value if the process has already been seen.
func (ph *processHashtable) getKey(process *model.Process) string {
if ph.processes == nil {
ph.processes = make(map[uint64][]processKey)
}
hash := ph.hash(process)
if keys, ok := ph.processes[hash]; ok {
for _, k := range keys {
if k.process.Equal(process) {
return k.key
}
}
key := ph.nextKey()
keys = append(keys, processKey{process: process, key: key})
ph.processes[hash] = keys
return key
}
key := ph.nextKey()
ph.processes[hash] = []processKey{{process: process, key: key}}
return key
}
// getMapping returns the accumulated mapping of string keys to processes.
func (ph *processHashtable) getMapping() map[string]*model.Process {
out := make(map[string]*model.Process)
for _, keys := range ph.processes {
for _, key := range keys {
out[key.key] = key.process
}
}
return out
}
func (ph *processHashtable) nextKey() string {
ph.count++
key := "p" + strconv.Itoa(ph.count)
return key
}
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
}