This repository has been archived by the owner on Nov 3, 2022. It is now read-only.
forked from apache/beam
-
Notifications
You must be signed in to change notification settings - Fork 0
/
starcgenx.go
770 lines (712 loc) · 22.7 KB
/
starcgenx.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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
// Licensed to the Apache Software Foundation (ASF) under one or more
// contributor license agreements. See the NOTICE file distributed with
// this work for additional information regarding copyright ownership.
// The ASF licenses this file to You 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 starcgenx is a Static Analysis Type Assertion shim and Registration Code Generator
// which provides an extractor to extract types from a package, in order to generate
// approprate shimsr a package so code can be generated for it.
//
// It's written for use by the starcgen tool, but separate to permit
// alternative "go/importer" Importers for accessing types from imported packages.
package starcgenx
import (
"bytes"
"fmt"
"go/ast"
"go/token"
"go/types"
"strconv"
"strings"
"github.com/apache/beam/sdks/go/pkg/beam/core/graph"
"github.com/apache/beam/sdks/go/pkg/beam/internal/errors"
"github.com/apache/beam/sdks/go/pkg/beam/util/shimx"
)
// NewExtractor returns an extractor for the given package.
func NewExtractor(pkg string) *Extractor {
return &Extractor{
Package: pkg,
functions: make(map[string]struct{}),
types: make(map[string]struct{}),
wraps: make(map[string]map[string]*types.Signature),
funcs: make(map[string]*types.Signature),
emits: make(map[string]shimx.Emitter),
iters: make(map[string]shimx.Input),
imports: make(map[string]struct{}),
allExported: true,
}
}
// Extractor contains and uniquifies the cache of types and things that need to be generated.
type Extractor struct {
w bytes.Buffer
Package string
// Debug enables printing out the analysis information to the output.
Debug bool
// LegacyIdentifiers disables parts of the code generator analysis
// requiring a list of identifiers to be passed in. Notably this
// disables RegisterDoFn support.
LegacyIdentifiers bool
// Ids is an optional slice of package local identifiers
Ids []string
// Register and uniquify the needed shims for each kind.
// Functions to Register
functions map[string]struct{}
// Types to Register (structs, essentially)
types map[string]struct{}
// StructuralDoFn wraps needed (receiver type, then method names)
wraps map[string]map[string]*types.Signature
// FuncShims needed
funcs map[string]*types.Signature
// Emitter Shims needed
emits map[string]shimx.Emitter
// Iterator Shims needed
iters map[string]shimx.Input
// list of packages we need to import.
imports map[string]struct{}
allExported bool // Marks if all ptransforms are exported and available in main.
}
// Summary prints out a summary of the shims and registrations to
// be generated to the buffer.
func (e *Extractor) Summary() {
e.Print("\n")
e.Print("Summary\n")
e.Printf("All exported?: %v\n", e.allExported)
e.Printf("%d\t Functions\n", len(e.functions))
e.Printf("%d\t Types\n", len(e.types))
e.Printf("%d\t Wraps\n", len(e.wraps))
e.Printf("%d\t Shims\n", len(e.funcs))
e.Printf("%d\t Emits\n", len(e.emits))
e.Printf("%d\t Inputs\n", len(e.iters))
}
// Bytes forwards to fmt.Fprint to the extractor buffer.
func (e *Extractor) Bytes() []byte {
return e.w.Bytes()
}
// Print forwards to fmt.Fprint to the extractor buffer.
func (e *Extractor) Print(s string) {
if e.Debug {
fmt.Fprint(&e.w, s)
}
}
// Printf forwards to fmt.Printf to the extractor buffer.
func (e *Extractor) Printf(f string, args ...interface{}) {
if e.Debug {
fmt.Fprintf(&e.w, f, args...)
}
}
// FromAsts analyses the contents of a package
func (e *Extractor) FromAsts(imp types.Importer, fset *token.FileSet, files []*ast.File) error {
conf := types.Config{
Importer: imp,
IgnoreFuncBodies: false,
DisableUnusedImportCheck: true,
}
info := &types.Info{
Uses: make(map[*ast.Ident]types.Object),
Defs: make(map[*ast.Ident]types.Object),
}
if e.LegacyIdentifiers {
info.Uses = nil
conf.IgnoreFuncBodies = true
if len(e.Ids) != 0 {
// TODO(lostluck): This becomes unnnecessary iff we can figure out
// which ParDos are being passed to beam.ParDo or beam.Combine.
// If there are ids, we need to also look at function bodies, and uses.
var checkFuncBodies bool
for _, v := range e.Ids {
if strings.Contains(v, ".") {
checkFuncBodies = true
break
}
}
conf.IgnoreFuncBodies = !checkFuncBodies
info.Uses = make(map[*ast.Ident]types.Object)
}
}
if _, err := conf.Check(e.Package, fset, files, info); err != nil {
return errors.Wrapf(err, "failed to type check package %s", e.Package)
}
e.Print("/*\n")
e.Print("CHECKING for RegisterDoFn EXPRs\n")
visitor := findRegisterDoFnCalls{info, e, make(map[string]bool)}
for _, file := range files {
ast.Walk(visitor, file)
}
for id := range visitor.idsToFind {
e.Ids = append(e.Ids, id)
}
var idsRequired, idsFound map[string]bool
if len(e.Ids) > 0 {
e.Printf("Filtering by %d identifiers: %q\n\n", len(e.Ids), strings.Join(e.Ids, ", "))
idsRequired = make(map[string]bool)
idsFound = make(map[string]bool)
for _, id := range e.Ids {
idsRequired[id] = true
}
}
e.Print("CHECKING DEFS\n")
for id, obj := range info.Defs {
e.fromObj(fset, id, obj, idsRequired, idsFound)
}
e.Print("CHECKING USES\n")
for id, obj := range info.Uses {
e.fromObj(fset, id, obj, idsRequired, idsFound)
}
var notFound []string
for _, k := range e.Ids {
if !idsFound[k] {
notFound = append(notFound, k)
}
}
if len(notFound) > 0 {
return errors.Errorf("couldn't find the following identifiers; please check for typos, or remove them: %v", strings.Join(notFound, ", "))
}
e.Print("*/\n")
return nil
}
type findRegisterDoFnCalls struct {
info *types.Info
e *Extractor
idsToFind map[string]bool
}
func (v findRegisterDoFnCalls) Visit(node ast.Node) (w ast.Visitor) {
switch node := node.(type) {
case *ast.CallExpr:
if !v.isRegisterDoFnCall(node) {
return v
}
// We have the RegisterDoFn call, now we need to extract the parameter's local identifier
// for code gen.
param := node.Args[0]
v.e.Printf("\tparam - %v\n", types.ExprString(param))
// Strip the reflect.TypeOf call if present.
if node, ok := param.(*ast.CallExpr); ok {
if !v.isReflectTypeOf(node) {
break
}
param = node.Args[0]
}
switch node := param.(type) {
case *ast.CallExpr: // Strip a (*DoFn)(nil) structure.
param = node.Fun.(*ast.ParenExpr).X.(*ast.StarExpr).X
case *ast.UnaryExpr: // Handle &DoFn{} if present.
param = node.X
v.e.Printf("\t\tpost unary - %v %T\n", types.ExprString(param), param)
}
switch node := param.(type) {
case *ast.CompositeLit: // extract the DoFn from `DoFn{}`
param = node.Type
v.e.Printf("\t\tpost composite - %v %T\n", types.ExprString(param), param)
case *ast.SelectorExpr: // Handle function primitives
str := node.X.(*ast.Ident).String() + "." + node.Sel.Name
if pkgName := v.findPackageRename(node.X.(*ast.Ident)); pkgName != nil {
str = pkgName.Imported().Name() + "." + node.Sel.Name
}
v.e.Printf("\t\thave function - %v %s\n", types.ExprString(param), str)
v.idsToFind[str] = true
// Need to look up package identifiers for renamed imports.
return v
case *ast.Ident: // Already have DoFn.
default:
v.e.Printf("\t\t\t can't handle - %v %T\n", types.ExprString(param), param)
return v
}
iden := param.(*ast.Ident)
v.e.Printf("\t\thave type - %v\n", iden.Name)
v.idsToFind[iden.Name] = true
}
return v
}
func (v findRegisterDoFnCalls) isReflectTypeOf(node *ast.CallExpr) bool {
switch inner := node.Fun.(type) {
case *ast.SelectorExpr:
if inner.Sel.Name != "TypeOf" {
return false
}
iden, ok := inner.X.(*ast.Ident)
if !ok {
return false
}
if iden.Name == "reflect" {
return true
}
}
return false
}
func (v findRegisterDoFnCalls) isRegisterDoFnCall(node *ast.CallExpr) bool {
switch inner := node.Fun.(type) {
case *ast.SelectorExpr:
if inner.Sel.Name != "RegisterDoFn" {
return false
}
// While it's unlikely that there will be other uses of "RegisterDoFn"
// outside of beam related code, from other packages, we should at least
// do some diligence to check that it's from one of the two packages we
// expect that call, either the user facing beam package or the internal
// genx package, and handle if those packages are renamed.
// We can't simply check the fully qualified path due to vendoring.
v.e.Printf("%v\n", types.ExprString(node))
iden, ok := inner.X.(*ast.Ident)
if !ok {
v.e.Printf("\tfail %v!\n", types.ExprString(iden))
return false
}
switch iden.Name {
case "beam", "genx":
v.e.Printf("\t success!\n")
return true
default:
v.e.Printf("\tpackage renamed %v!\n", iden)
// We have a *use* of the identifier, but not the original definition.
// Look up the definition and trust that typechecked name resolution
// is correct.
pkgName := v.findPackageRename(iden)
if pkgName == nil {
return false
}
switch pkgName.Imported().Name() {
case "beam", "genx":
return true
default:
v.e.Printf("\tfail - not likely the beam package? %v\n", types.ObjectString(pkgName, nil))
}
}
}
return false
}
func (v findRegisterDoFnCalls) findPackageRename(iden *ast.Ident) *types.PkgName {
for k, imp := range v.info.Defs {
if k.Name == iden.Name {
if pkgName, ok := imp.(*types.PkgName); ok {
v.e.Printf("\tfound package rename %#v - %v\n", k, types.ObjectString(imp, nil))
return pkgName
}
}
}
v.e.Printf("\tfail - %v not a package\n", types.ExprString(iden))
return nil
}
func (e *Extractor) isRequired(ident string, obj types.Object, idsRequired, idsFound map[string]bool) bool {
if idsRequired == nil {
return true
}
if idsFound == nil {
panic("broken invariant: idsFound map is nil, but idsRequired map exists")
}
// If we're filtering IDs, then it needs to be in the filtered identifiers,
// or it's receiver type identifier needs to be in the filtered identifiers.
if idsRequired[ident] {
idsFound[ident] = true
return true
}
// Check if this is a function.
sig, ok := obj.Type().(*types.Signature)
if !ok {
return false
}
// If this is a function, and it has a receiver, it's a method.
if recv := sig.Recv(); recv != nil && graph.IsLifecycleMethod(ident) {
// We don't want to care about pointers, so dereference to value type.
t := recv.Type()
p, ok := t.(*types.Pointer)
for ok {
t = p.Elem()
p, ok = t.(*types.Pointer)
}
ts := types.TypeString(t, e.qualifier)
e.Printf("recv %v has %v, ts: %s %s--- ", recv, sig, ts, ident)
if !idsRequired[ts] {
e.Print("IGNORE\n")
return false
}
e.Print("KEEP\n")
idsFound[ts] = true
return true
}
return false
}
func (e *Extractor) fromObj(fset *token.FileSet, id *ast.Ident, obj types.Object, idsRequired, idsFound map[string]bool) {
if obj == nil { // Omit the package declaration.
e.Printf("%s: %q has no object, probably a package\n",
fset.Position(id.Pos()), id.Name)
return
}
pkg := obj.Pkg()
if pkg == nil {
e.Printf("%s: %q has no package \n",
fset.Position(id.Pos()), id.Name)
// No meaningful identifier.
return
}
ident := fmt.Sprintf("%s.%s", pkg.Name(), obj.Name())
if pkg.Name() == e.Package {
ident = obj.Name()
}
if !e.isRequired(ident, obj, idsRequired, idsFound) {
return
}
switch ot := obj.(type) {
case *types.Var:
// Vars are tricky since they could be anything, and anywhere (package scope, parameters, etc)
// eg. Flags, or Field Tags, among others.
// I'm increasingly convinced that we should simply igonore vars.
// Do nothing for vars.
case *types.Func:
sig := obj.Type().(*types.Signature)
if recv := sig.Recv(); recv != nil {
// Methods don't need registering, but they do need shim generation.
e.Printf("%s: %q is a method of %v -> %v--- %T %v %v %v\n",
fset.Position(id.Pos()), id.Name, recv.Type(), obj, obj, id, obj.Pkg(), obj.Type())
if !graph.IsLifecycleMethod(id.Name) {
// If this is not a lifecycle method, we should ignore it.
return
}
// This must be a structural DoFn! We should generate a closure wrapper for it.
t := recv.Type()
p, ok := t.(*types.Pointer)
for ok {
t = p.Elem()
p, ok = t.(*types.Pointer)
}
ts := types.TypeString(t, e.qualifier)
mthdMap := e.wraps[ts]
if mthdMap == nil {
mthdMap = make(map[string]*types.Signature)
e.wraps[ts] = mthdMap
}
mthdMap[id.Name] = sig
} else if id.Name != "init" {
// init functions are special and should be ignored.
// Functions need registering, as well as shim generation.
e.Printf("%s: %q is a top level func %v --- %T %v %v %v\n",
fset.Position(id.Pos()), ident, obj, obj, id, obj.Pkg(), obj.Type())
e.functions[ident] = struct{}{}
}
// For functions from other packages.
if pkg.Name() != e.Package {
e.imports[pkg.Path()] = struct{}{}
}
e.funcs[e.sigKey(sig)] = sig
e.extractFromSignature(sig)
e.Printf("\t%v\n", sig)
case *types.TypeName:
e.Printf("%s: %q is a type %v --- %T %v %v %v %v\n",
fset.Position(id.Pos()), id.Name, obj, obj, id, obj.Pkg(), obj.Type(), obj.Name())
// Probably need to sanity check that this type actually is/has a ProcessElement
// or MergeAccumulators defined for this type so unnecessary registrations don't happen,
// and can explicitly produce an error if an explicitly named type *isn't* a DoFn or CombineFn.
e.extractType(ot)
default:
e.Printf("%s: %q defines %v --- %T %v %v %v\n",
fset.Position(id.Pos()), types.ObjectString(obj, e.qualifier), obj, obj, id, obj.Pkg(), obj.Type())
}
}
func (e *Extractor) extractType(ot *types.TypeName) {
name := types.TypeString(ot.Type(), e.qualifier)
// Unwrap an alias by one level.
// Attempting to deference a full chain of aliases runs the risk of crossing
// a visibility boundary such as internal packages.
// A single level is safe since the code we're analysing imports it,
// so we can assume the generated code can access it too.
if ot.IsAlias() {
if t, ok := ot.Type().(*types.Named); ok {
ot = t.Obj()
name = types.TypeString(t, e.qualifier)
}
}
// Only register non-universe types (eg. avoid `error` and similar)
if pkg := ot.Pkg(); pkg != nil {
path := pkg.Path()
e.imports[pkg.Path()] = struct{}{}
// Do not add universal types to be registered.
if path == shimx.TypexImport {
return
}
e.types[name] = struct{}{}
}
}
// Examines the signature and extracts types of parameters and results for
// generating necessary imports and emitter and iterator code.
func (e *Extractor) extractFromSignature(sig *types.Signature) {
e.extractFromTuple(sig.Params())
e.extractFromTuple(sig.Results())
}
// extractFromContainer recurses through nested non-map container types to a non-derived
// element type.
func (e *Extractor) extractFromContainer(t types.Type) types.Type {
// Container types need to be iteratively unwrapped until we're at the base type,
// so we can get the import if necessary.
for {
if s, ok := t.(*types.Slice); ok {
t = s.Elem()
continue
}
if p, ok := t.(*types.Pointer); ok {
t = p.Elem()
continue
}
if a, ok := t.(*types.Array); ok {
t = a.Elem()
continue
}
return t
}
}
func (e *Extractor) extractFromTuple(tuple *types.Tuple) {
for i := 0; i < tuple.Len(); i++ {
s := tuple.At(i) // *types.Var
t := e.extractFromContainer(s.Type())
// Here's where we ensure we register new imports.
if t, ok := t.(*types.Named); ok {
if pkg := t.Obj().Pkg(); pkg != nil {
e.imports[pkg.Path()] = struct{}{}
}
e.extractType(t.Obj())
}
if a, ok := s.Type().(*types.Signature); ok {
// Check if the type is an emitter or iterator for the specialized
// shim generation for those types.
if emt, ok := e.makeEmitter(a); ok {
e.emits[emt.Name] = emt
}
if ipt, ok := e.makeInput(a); ok {
e.iters[ipt.Name] = ipt
}
// Tail recurse on functional signature.
e.extractFromSignature(a)
}
}
}
func (e *Extractor) qualifier(pkg *types.Package) string {
n := tail(pkg.Name())
if n == e.Package {
return ""
}
return n
}
func tail(path string) string {
if i := strings.LastIndex("/", path); i >= 0 {
path = path[i:]
}
return path
}
func (e *Extractor) tupleStrings(t *types.Tuple) []string {
var vs []string
for i := 0; i < t.Len(); i++ {
v := t.At(i)
vs = append(vs, types.TypeString(v.Type(), e.qualifier))
}
return vs
}
// sigKey produces a variable name agnostic key for the function signature.
func (e *Extractor) sigKey(sig *types.Signature) string {
ps, rs := e.tupleStrings(sig.Params()), e.tupleStrings(sig.Results())
return fmt.Sprintf("func(%v) (%v)", strings.Join(ps, ","), strings.Join(rs, ","))
}
// Generate produces an additional file for the Go package that was extracted,
// to be included in a subsequent compilation.
func (e *Extractor) Generate(filename string) []byte {
var functions []string
for fn := range e.functions {
// No extra processing necessary, since these should all be package local.
functions = append(functions, fn)
}
var typs []string
for t := range e.types {
typs = append(typs, t)
}
var wraps []shimx.Wrap
for typ, mthdMap := range e.wraps {
wrap := shimx.Wrap{Type: typ, Name: shimx.Name(typ)}
for mName, mthd := range mthdMap {
shim := e.makeFunc(mthd)
shim.Name = mName
wrap.Methods = append(wrap.Methods, shim)
}
wraps = append(wraps, wrap)
}
var shims []shimx.Func
for sig, t := range e.funcs {
shim := e.makeFunc(t)
shim.Type = sig
shims = append(shims, shim)
}
var emits []shimx.Emitter
for _, t := range e.emits {
emits = append(emits, t)
}
var inputs []shimx.Input
for _, t := range e.iters {
inputs = append(inputs, t)
}
var imports []string
for k := range e.imports {
if k == "" || k == e.Package {
continue
}
imports = append(imports, k)
}
top := shimx.Top{
FileName: filename,
ToolName: "starcgen",
Package: e.Package,
Imports: imports,
Functions: functions,
Types: typs,
Wraps: wraps,
Shims: shims,
Emitters: emits,
Inputs: inputs,
}
e.Print("\n")
shimx.File(&e.w, &top)
return e.w.Bytes()
}
func (e *Extractor) makeFunc(t *types.Signature) shimx.Func {
shim := shimx.Func{}
var inNames []string
in := t.Params() // *types.Tuple
for i := 0; i < in.Len(); i++ {
s := in.At(i) // *types.Var
shim.In = append(shim.In, types.TypeString(s.Type(), e.qualifier))
inNames = append(inNames, e.NameType(s.Type()))
}
var outNames []string
out := t.Results() // *types.Tuple
for i := 0; i < out.Len(); i++ {
s := out.At(i)
shim.Out = append(shim.Out, types.TypeString(s.Type(), e.qualifier))
outNames = append(outNames, e.NameType(s.Type()))
}
shim.Name = shimx.FuncName(inNames, outNames)
return shim
}
func (e *Extractor) makeEmitter(sig *types.Signature) (shimx.Emitter, bool) {
// Emitters must have no return values.
if sig.Results().Len() != 0 {
return shimx.Emitter{}, false
}
p := sig.Params()
emt := shimx.Emitter{Type: e.sigKey(sig)}
switch p.Len() {
case 1:
emt.Time = false
emt.Val = e.varString(p.At(0))
case 2:
// TODO(rebo): Fix this when imports are resolved.
// This is the tricky one... Need to verify what happens with aliases.
// And get a candle to compare this against somehwere. isEventTime(p.At(0)) maybe.
// if p.At(0) == typex.EventTimeType {
// emt.Time = true
// } else {
emt.Key = e.varString(p.At(0))
//}
emt.Val = e.varString(p.At(1))
case 3:
// If there's 3, the first one must be typex.EventTime.
emt.Time = true
emt.Key = e.varString(p.At(1))
emt.Val = e.varString(p.At(2))
default:
return shimx.Emitter{}, false
}
if emt.Time {
emt.Name = fmt.Sprintf("ET%s%s", shimx.Name(emt.Key), shimx.Name(emt.Val))
} else {
emt.Name = fmt.Sprintf("%s%s", shimx.Name(emt.Key), shimx.Name(emt.Val))
}
return emt, true
}
// makeInput checks if the given signature is an iterator or not, and if so,
// returns a shimx.Input struct for the signature for use by the code
// generator. The canonical check for an iterater signature is in the
// funcx.UnfoldIter function which uses the reflect library,
// and this logic is replicated here.
func (e *Extractor) makeInput(sig *types.Signature) (shimx.Input, bool) {
r := sig.Results()
if r.Len() != 1 {
return shimx.Input{}, false
}
// Iterators must return a bool.
if b, ok := r.At(0).Type().(*types.Basic); !ok || b.Kind() != types.Bool {
return shimx.Input{}, false
}
p := sig.Params()
for i := 0; i < p.Len(); i++ {
// All params for iterators must be pointers.
if _, ok := p.At(i).Type().(*types.Pointer); !ok {
return shimx.Input{}, false
}
}
itr := shimx.Input{Type: e.sigKey(sig)}
switch p.Len() {
case 1:
itr.Time = false
itr.Val = e.deref(p.At(0))
case 2:
// TODO(rebo): Fix this when imports are resolved.
// This is the tricky one... Need to verify what happens with aliases.
// And get a candle to compare this against somehwere. isEventTime(p.At(0)) maybe.
// if p.At(0) == typex.EventTimeType {
// itr.Time = true
// } else {
itr.Key = e.deref(p.At(0))
//}
itr.Val = e.deref(p.At(1))
case 3:
// If there's 3, the first one must be typex.EventTime.
itr.Time = true
itr.Key = e.deref(p.At(1))
itr.Val = e.deref(p.At(2))
default:
return shimx.Input{}, false
}
if itr.Time {
itr.Name = fmt.Sprintf("ET%s%s", shimx.Name(itr.Key), shimx.Name(itr.Val))
} else {
itr.Name = fmt.Sprintf("%s%s", shimx.Name(itr.Key), shimx.Name(itr.Val))
}
return itr, true
}
// deref returns the string identifier for the element type of a pointer var.
// deref panics if the var type is not a pointer.
func (e *Extractor) deref(v *types.Var) string {
p := v.Type().(*types.Pointer)
return types.TypeString(p.Elem(), e.qualifier)
}
// varString provides the correct type for a variable within the
// package for which we're generated code.
func (e *Extractor) varString(v *types.Var) string {
return types.TypeString(v.Type(), e.qualifier)
}
// NameType turns a reflect.Type into a string based on it's name.
// It prefixes Emit or Iter if the function satisfies the constrains of those types.
func (e *Extractor) NameType(t types.Type) string {
switch a := t.(type) {
case *types.Signature:
if emt, ok := e.makeEmitter(a); ok {
return "Emit" + emt.Name
}
if ipt, ok := e.makeInput(a); ok {
return "Iter" + ipt.Name
}
return shimx.Name(e.sigKey(a))
case *types.Slice:
return "SliceOf" + e.NameType(a.Elem())
case *types.Map:
return "MapOf" + e.NameType(a.Key()) + "_" + e.NameType(a.Elem())
case *types.Array:
return "ArrayOf" + strconv.Itoa(int(a.Len())) + e.NameType(a.Elem())
default:
return shimx.Name(types.TypeString(t, e.qualifier))
}
}