/
func.go
214 lines (176 loc) · 5.42 KB
/
func.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
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
package di
import (
"fmt"
"reflect"
)
type (
targetFuncInput struct {
Object *BindObject
InputIndex int
}
// FuncInjector keeps the data that are needed in order to do the binding injection
// as fast as possible and with the best possible and safest way.
FuncInjector struct {
// the original function, is being used
// only the .Call, which is referring to the same function, always.
fn reflect.Value
typ reflect.Type
goodFunc TypeChecker
inputs []*targetFuncInput
// Length is the number of the valid, final binded input arguments.
Length int
// Valid is True when `Length` is > 0, it's statically set-ed for
// performance reasons.
Has bool
trace string // for debug info.
lost []*missingInput // Author's note: don't change this to a map.
}
)
type missingInput struct {
index int // the function's input argument's index.
found bool
}
func (s *FuncInjector) miss(index int) {
s.lost = append(s.lost, &missingInput{
index: index,
})
}
// MakeFuncInjector returns a new func injector, which will be the object
// that the caller should use to bind input arguments of the "fn" function.
//
// The hijack and the goodFunc are optional, the "values" is the dependencies collection.
func MakeFuncInjector(fn reflect.Value, hijack Hijacker, goodFunc TypeChecker, values ...reflect.Value) *FuncInjector {
typ := IndirectType(fn.Type())
s := &FuncInjector{
fn: fn,
typ: typ,
goodFunc: goodFunc,
}
if !IsFunc(typ) {
return s
}
defer s.refresh()
n := typ.NumIn()
for i := 0; i < n; i++ {
inTyp := typ.In(i)
if hijack != nil {
b, ok := hijack(inTyp)
if ok && b != nil {
s.inputs = append(s.inputs, &targetFuncInput{
InputIndex: i,
Object: b,
})
continue
}
}
matched := false
for j, v := range values {
if s.addValue(i, v) {
matched = true
// remove this value, so it will not try to get binded
// again, a next value even with the same type is able to be
// used to other input arg. One value per input argument, order
// matters if same type of course.
// if len(values) > j+1 {
values = append(values[:j], values[j+1:]...)
//}
break
}
}
if !matched {
// if no binding for this input argument,
// this will make the func injector invalid state,
// but before this let's make a list of failed
// inputs, so they can be used for a re-try
// with different set of binding "values".
s.miss(i)
}
}
return s
}
func (s *FuncInjector) refresh() {
s.Length = len(s.inputs)
s.Has = s.Length > 0
}
func (s *FuncInjector) addValue(inputIndex int, value reflect.Value) bool {
defer s.refresh()
if s.typ.NumIn() < inputIndex {
return false
}
inTyp := s.typ.In(inputIndex)
// the binded values to the func's inputs.
b, err := MakeBindObject(value, s.goodFunc)
if err != nil {
return false
}
if b.IsAssignable(inTyp) {
// fmt.Printf("binded input index: %d for type: %s and value: %v with pointer: %v\n",
// i, b.Type.String(), inTyp.String(), inTyp.Pointer())
s.inputs = append(s.inputs, &targetFuncInput{
InputIndex: inputIndex,
Object: &b,
})
return true
}
return false
}
// Retry used to add missing dependencies, i.e path parameter builtin bindings if not already exists
// in the `hero.Handler`, once, only for that func injector.
func (s *FuncInjector) Retry(retryFn func(inIndex int, inTyp reflect.Type) (reflect.Value, bool)) bool {
for _, missing := range s.lost {
if missing.found {
continue
}
invalidIndex := missing.index
inTyp := s.typ.In(invalidIndex)
v, ok := retryFn(invalidIndex, inTyp)
if !ok {
continue
}
if !s.addValue(invalidIndex, v) {
continue
}
// if this value completes an invalid index
// then remove this from the invalid input indexes.
missing.found = true
}
return s.Length == s.typ.NumIn()
}
// String returns a debug trace text.
func (s *FuncInjector) String() (trace string) {
for i, in := range s.inputs {
bindmethodTyp := bindTypeString(in.Object.BindType)
typIn := s.typ.In(in.InputIndex)
// remember: on methods that are part of a struct (i.e controller)
// the input index = 1 is the begggining instead of the 0,
// because the 0 is the controller receiver pointer of the method.
trace += fmt.Sprintf("[%d] %s binding: '%s' for input position: %d and type: '%s'\n",
i+1, bindmethodTyp, in.Object.Type.String(), in.InputIndex, typIn.String())
}
return
}
// Inject accepts an already created slice of input arguments
// and fills them, the "ctx" is optional and it's used
// on the dependencies that depends on one or more input arguments, these are the "ctx".
func (s *FuncInjector) Inject(in *[]reflect.Value, ctx ...reflect.Value) {
args := *in
for _, input := range s.inputs {
input.Object.Assign(ctx, func(v reflect.Value) {
// fmt.Printf("assign input index: %d for value: %v of type: %s\n",
// input.InputIndex, v.String(), v.Type().Name())
args[input.InputIndex] = v
})
}
*in = args
}
// Call calls the "Inject" with a new slice of input arguments
// that are computed by the length of the input argument from the MakeFuncInjector's "fn" function.
//
// If the function needs a receiver, so
// the caller should be able to in[0] = receiver before injection,
// then the `Inject` method should be used instead.
func (s *FuncInjector) Call(ctx ...reflect.Value) []reflect.Value {
in := make([]reflect.Value, s.Length, s.Length)
s.Inject(&in, ctx...)
return s.fn.Call(in)
}