forked from google/go-jsonnet
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pointermap.go
149 lines (128 loc) · 3.88 KB
/
pointermap.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
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
/*
Copyright 2017 Google Inc. All rights reserved.
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 dump
import "reflect"
type pointerMap struct {
allpointers []uintptr
reusedPointers []uintptr
primitivePointers []uintptr
}
// GetPointers recursively maps all pointers mentioned in a tree, breaking
// circular references, and provides a list of:
// * all pointers
// * all pointers that were referenced at least twice
// * all pointers that point to primitive type
func GetPointers(v reflect.Value) ([]uintptr, []uintptr, []uintptr) {
pm := &pointerMap{
allpointers: []uintptr{},
reusedPointers: []uintptr{},
primitivePointers: []uintptr{},
}
pm.getAllAndReusedPointers(v)
pm.getPrimitivePointers(v)
return pm.allpointers, pm.reusedPointers, pm.primitivePointers
}
func (pm *pointerMap) getPrimitivePointers(v reflect.Value) {
if v.Kind() == reflect.Invalid {
return
}
// if v is a pointer pointing to a primitive value, register it as primitive pointer
if isPrimitivePointer(v) {
pm.addPrimitivePointer(v.Pointer())
return
}
// Now descend into any children of this value
switch v.Kind() {
case reflect.Slice, reflect.Array:
numEntries := v.Len()
for i := 0; i < numEntries; i++ {
pm.getPrimitivePointers(v.Index(i))
}
case reflect.Interface:
pm.getPrimitivePointers(v.Elem())
case reflect.Ptr:
pm.getPrimitivePointers(v.Elem())
case reflect.Map:
for _, key := range v.MapKeys() {
pm.getPrimitivePointers(v.MapIndex(key))
}
case reflect.Struct:
numFields := v.NumField()
for i := 0; i < numFields; i++ {
pm.getPrimitivePointers(v.Field(i))
}
}
}
// Recursively consider v and each of its children, updating pointer information
func (pm *pointerMap) getAllAndReusedPointers(v reflect.Value) {
if v.Kind() == reflect.Invalid {
return
}
if isPointerValue(v) && v.Pointer() != 0 { // pointer is 0 for unexported fields
reused := pm.addPointer(v.Pointer())
if reused {
// No use descending inside this value, since it have been seen before and all its descendants
// have been considered
return
}
}
// Now descend into any children of this value
switch v.Kind() {
case reflect.Slice, reflect.Array:
numEntries := v.Len()
for i := 0; i < numEntries; i++ {
pm.getAllAndReusedPointers(v.Index(i))
}
case reflect.Interface:
pm.getAllAndReusedPointers(v.Elem())
case reflect.Ptr:
pm.getAllAndReusedPointers(v.Elem())
case reflect.Map:
for _, key := range v.MapKeys() {
pm.getAllAndReusedPointers(v.MapIndex(key))
}
case reflect.Struct:
numFields := v.NumField()
for i := 0; i < numFields; i++ {
pm.getAllAndReusedPointers(v.Field(i))
}
}
}
func (pm *pointerMap) addPrimitivePointer(ptr uintptr) {
for _, have := range pm.primitivePointers {
if ptr == have {
return
}
}
pm.primitivePointers = append(pm.primitivePointers, ptr)
}
// addPointer to the pointerMap, update reusedPointers. Returns true if pointer was reused
func (pm *pointerMap) addPointer(ptr uintptr) bool {
// Is this already known to be reused?
for _, have := range pm.reusedPointers {
if ptr == have {
return true
}
}
// Have we seen it once before?
for _, seen := range pm.allpointers {
if ptr == seen {
// Add it to the register of pointers we have seen more than once
pm.reusedPointers = append(pm.reusedPointers, ptr)
return true
}
}
// This pointer was new to us
pm.allpointers = append(pm.allpointers, ptr)
return false
}