Repository navigation
Expand file tree
/
Copy pathu_clone.go
More file actions
137 lines (120 loc) · 3.14 KB
/
Copy pathu_clone.go
File metadata and controls
137 lines (120 loc) · 3.14 KB
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
package tls
import (
"reflect"
"unsafe"
)
// clone returns a deep copy of the ClientHelloSpec and its extension state.
// Function values are reused as-is.
func (chs *ClientHelloSpec) clone() *ClientHelloSpec {
if chs == nil {
return nil
}
cloned := deepCloneValue(reflect.ValueOf(chs), make(map[deepCloneVisit]reflect.Value))
return cloned.Interface().(*ClientHelloSpec)
}
type deepCloneVisit struct {
ptr uintptr
typ reflect.Type
}
func deepCloneValue(v reflect.Value, seen map[deepCloneVisit]reflect.Value) reflect.Value {
if !v.IsValid() {
return v
}
v = addressableValue(v)
if cloned, ok := seenValue(v, seen); ok {
return cloned
}
switch v.Kind() {
case reflect.Pointer:
if v.IsNil() {
return reflect.Zero(v.Type())
}
cloned := reflect.New(v.Type().Elem())
recordClone(v, cloned, seen)
cloned.Elem().Set(deepCloneValue(v.Elem(), seen))
return cloned
case reflect.Interface:
if v.IsNil() {
return reflect.Zero(v.Type())
}
clonedValue := deepCloneValue(v.Elem(), seen)
cloned := reflect.New(v.Type()).Elem()
cloned.Set(clonedValue)
return cloned
case reflect.Struct:
cloned := reflect.New(v.Type()).Elem()
for i := 0; i < v.NumField(); i++ {
addressableValue(cloned.Field(i)).Set(deepCloneValue(v.Field(i), seen))
}
return cloned
case reflect.Slice:
if v.IsNil() {
return reflect.Zero(v.Type())
}
cloned := reflect.MakeSlice(v.Type(), v.Len(), v.Cap())
recordClone(v, cloned, seen)
for i := 0; i < v.Len(); i++ {
cloned.Index(i).Set(deepCloneValue(v.Index(i), seen))
}
return cloned
case reflect.Array:
cloned := reflect.New(v.Type()).Elem()
for i := 0; i < v.Len(); i++ {
addressableValue(cloned.Index(i)).Set(deepCloneValue(v.Index(i), seen))
}
return cloned
case reflect.Map:
if v.IsNil() {
return reflect.Zero(v.Type())
}
cloned := reflect.MakeMapWithSize(v.Type(), v.Len())
recordClone(v, cloned, seen)
iter := v.MapRange()
for iter.Next() {
cloned.SetMapIndex(deepCloneValue(iter.Key(), seen), deepCloneValue(iter.Value(), seen))
}
return cloned
default:
return v
}
}
func seenValue(v reflect.Value, seen map[deepCloneVisit]reflect.Value) (reflect.Value, bool) {
visit, ok := deepCloneVisitFor(v)
if !ok {
return reflect.Value{}, false
}
cloned, ok := seen[visit]
return cloned, ok
}
func recordClone(v reflect.Value, cloned reflect.Value, seen map[deepCloneVisit]reflect.Value) {
visit, ok := deepCloneVisitFor(v)
if !ok {
return
}
seen[visit] = cloned
}
func deepCloneVisitFor(v reflect.Value) (deepCloneVisit, bool) {
if !v.IsValid() {
return deepCloneVisit{}, false
}
switch v.Kind() {
case reflect.Pointer, reflect.Map:
if v.IsNil() {
return deepCloneVisit{}, false
}
return deepCloneVisit{ptr: v.Pointer(), typ: v.Type()}, true
case reflect.Slice:
if v.IsNil() || v.Pointer() == 0 {
return deepCloneVisit{}, false
}
return deepCloneVisit{ptr: v.Pointer(), typ: v.Type()}, true
default:
return deepCloneVisit{}, false
}
}
func addressableValue(v reflect.Value) reflect.Value {
if !v.IsValid() || v.CanSet() || !v.CanAddr() {
return v
}
return reflect.NewAt(v.Type(), unsafe.Pointer(v.UnsafeAddr())).Elem()
}