-
Notifications
You must be signed in to change notification settings - Fork 18
/
gen_program_expressions.go
822 lines (749 loc) · 25.2 KB
/
gen_program_expressions.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
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
// Copyright 2022, Pulumi Corporation. All rights reserved.
package java
import (
"io"
"math/big"
"strings"
"github.com/hashicorp/hcl/v2"
"github.com/hashicorp/hcl/v2/hclsyntax"
"github.com/zclconf/go-cty/cty"
"github.com/pulumi/pulumi/pkg/v3/codegen"
"github.com/pulumi/pulumi/pkg/v3/codegen/hcl2/model"
"github.com/pulumi/pulumi/pkg/v3/codegen/pcl"
"github.com/pulumi/pulumi/pkg/v3/codegen/schema"
"github.com/pulumi/pulumi/sdk/v3/go/common/util/contract"
"github.com/pulumi/pulumi-java/pkg/codegen/java/names"
)
type nameInfo int
func (nameInfo) Format(name string) string {
return names.MakeValidIdentifier(name)
}
// lowerExpression amends the expression with intrinsics for Java generation.
func (g *generator) lowerExpression(expr model.Expression, typ model.Type) model.Expression {
expr = pcl.RewritePropertyReferences(expr)
applyPromises := false
expr, diags := pcl.RewriteApplies(expr, nameInfo(0), applyPromises)
contract.Assert(len(diags) == 0)
expr, diags = pcl.RewriteConversions(expr, typ)
g.diagnostics = append(g.diagnostics, diags...)
return expr
}
func (g *generator) GetPrecedence(expr model.Expression) int {
// TODO: Current values copied from C# that was copied from Node ;)
// TODO(msh): Current values copied from Node, update based on
// https://docs.microsoft.com/en-us/dotnet/csharp/language-reference/operators/
switch expr := expr.(type) {
case *model.ConditionalExpression:
return 4
case *model.BinaryOpExpression:
switch expr.Operation {
case hclsyntax.OpLogicalOr:
return 5
case hclsyntax.OpLogicalAnd:
return 6
case hclsyntax.OpEqual, hclsyntax.OpNotEqual:
return 11
case hclsyntax.OpGreaterThan, hclsyntax.OpGreaterThanOrEqual, hclsyntax.OpLessThan,
hclsyntax.OpLessThanOrEqual:
return 12
case hclsyntax.OpAdd, hclsyntax.OpSubtract:
return 14
case hclsyntax.OpMultiply, hclsyntax.OpDivide, hclsyntax.OpModulo:
return 15
default:
contract.Failf("unexpected binary expression %v", expr)
}
case *model.UnaryOpExpression:
return 17
case *model.FunctionCallExpression:
return 20
case *model.ForExpression, *model.IndexExpression, *model.RelativeTraversalExpression, *model.SplatExpression,
*model.TemplateJoinExpression:
return 20
case *model.AnonymousFunctionExpression, *model.LiteralValueExpression, *model.ObjectConsExpression,
*model.ScopeTraversalExpression, *model.TemplateExpression, *model.TupleConsExpression:
return 22
default:
contract.Failf("unexpected expression %v of type %T", expr, expr)
}
return 0
}
func (g *generator) GenAnonymousFunctionExpression(w io.Writer, expr *model.AnonymousFunctionExpression) {
switch len(expr.Signature.Parameters) {
case 0:
g.Fgen(w, "()")
case 1:
g.Fgenf(w, "%s", expr.Signature.Parameters[0].Name)
g.Fgenf(w, " -> %v", expr.Body)
default:
g.Fgen(w, "values -> {\n")
g.Indented(func() {
for i, p := range expr.Signature.Parameters {
g.Fgenf(w, "%svar %s = values.t%d;\n", g.Indent, p.Name, i+1)
}
g.Fgenf(w, "%sreturn %v;\n", g.Indent, expr.Body)
})
g.Fgenf(w, "%s}", g.Indent)
}
}
func (g *generator) GenBinaryOpExpression(w io.Writer, expr *model.BinaryOpExpression) {
opstr, precedence := "", g.GetPrecedence(expr)
switch expr.Operation {
case hclsyntax.OpAdd:
opstr = "+"
case hclsyntax.OpDivide:
opstr = "/"
case hclsyntax.OpEqual:
opstr = "=="
case hclsyntax.OpGreaterThan:
opstr = ">"
case hclsyntax.OpGreaterThanOrEqual:
opstr = ">="
case hclsyntax.OpLessThan:
opstr = "<"
case hclsyntax.OpLessThanOrEqual:
opstr = "<="
case hclsyntax.OpLogicalAnd:
opstr = "&&"
case hclsyntax.OpLogicalOr:
opstr = "||"
case hclsyntax.OpModulo:
opstr = "%"
case hclsyntax.OpMultiply:
opstr = "*"
case hclsyntax.OpNotEqual:
opstr = "!="
case hclsyntax.OpSubtract:
opstr = "-"
default:
opstr, precedence = ",", 1
}
g.Fgenf(w, "%.[1]*[2]v %[3]v %.[1]*[4]o", precedence, expr.LeftOperand, opstr, expr.RightOperand)
}
func (g *generator) GenConditionalExpression(w io.Writer, expr *model.ConditionalExpression) {
g.Fgenf(w, "%.4v ? %.4v : %.4v", expr.Condition, expr.TrueResult, expr.FalseResult)
}
func (g *generator) GenForExpression(w io.Writer, expr *model.ForExpression) {
g.genNYI(w, "ForExpression") // TODO
}
func (g *generator) genApply(w io.Writer, expr *model.FunctionCallExpression) {
// Extract the list of outputs and the continuation expression from the `__apply` arguments.
applyArgs, then := pcl.ParseApplyCall(expr)
if len(applyArgs) == 1 {
// If we only have a single output, just generate a normal `.applyValue`
g.Fgenf(w, "%.v.applyValue(%.v)", applyArgs[0], then)
} else {
// Otherwise, generate a call to `Output.tuple(...)`.
g.Fgen(w, "Output.tuple(")
for i, o := range applyArgs {
if i > 0 {
g.Fgen(w, ", ")
}
g.Fgenf(w, "%.v", o)
}
g.Fgenf(w, ").applyValue(%.v)", then)
}
}
func (g *generator) genRange(w io.Writer, call *model.FunctionCallExpression, entries bool) {
g.genNYI(w, "Range %.v %.v", call, entries)
}
// checks whether an expression is a template string making up a path
// for example "${siteDir}/${range.value}" which can be detected as input
// for fileAsset or archiveAsset and be converted to Paths.get(siteDir, range.value)
func isTemplatePathString(expr model.Expression) (bool, []model.Expression) {
switch expr.(type) {
case *model.TemplateExpression:
allTextPartsAreSlashed := true
var exprParts []model.Expression
for _, part := range expr.(*model.TemplateExpression).Parts {
lit, ok := part.(*model.LiteralValueExpression)
if ok {
// literal expression, check that it is a slash
isTextLiteral := model.StringType.AssignableFrom(lit.Type())
slash := isTextLiteral && (lit.Value.AsString() == "./" || lit.Value.AsString() == "/")
allTextPartsAreSlashed = allTextPartsAreSlashed && slash
} else {
// any other expression
exprParts = append(exprParts, part)
}
}
return allTextPartsAreSlashed, exprParts
default:
return false, make([]model.Expression, 0)
}
}
func (g *generator) functionName(tokenArg model.Expression) (string, string) {
token := tokenArg.(*model.TemplateExpression).Parts[0].(*model.LiteralValueExpression).Value.AsString()
tokenRange := tokenArg.SyntaxNode().Range()
// Compute the resource type from the Pulumi type token.
pkg, module, member, _ := pcl.DecomposeToken(token, tokenRange)
if module == "index" || module == "" {
return names.Title(pkg) + "Functions" + "." + member, names.Title(member)
}
return names.Title(module) + "Functions" + "." + member, names.Title(member)
}
func (g *generator) GenFunctionCallExpression(w io.Writer, expr *model.FunctionCallExpression) {
switch expr.Name {
case pcl.IntrinsicConvert:
switch arg := expr.Args[0].(type) {
case *model.ObjectConsExpression:
g.genObjectConsExpression(w, arg, &schema.MapType{ElementType: schema.StringType})
default:
g.Fgenf(w, "%.v", expr.Args[0]) // <- probably wrong w.r.t. precedence
}
case pcl.IntrinsicApply:
g.genApply(w, expr)
case intrinsicOutput:
g.Fgenf(w, "Output.of(%.v)", expr.Args[0])
case "element":
g.Fgenf(w, "%.20v[%.v]", expr.Args[0], expr.Args[1])
case "entries":
// TODO: does not work with java yet
switch model.ResolveOutputs(expr.Args[0].Type()).(type) {
case *model.ListType, *model.TupleType:
if call, ok := expr.Args[0].(*model.FunctionCallExpression); ok && call.Name == "range" {
g.genRange(w, call, true)
return
}
g.Fgenf(w, "%.20v.Select((v, k)", expr.Args[0])
case *model.MapType, *model.ObjectType:
g.genNYI(w, "MapOrObjectEntries")
}
g.Fgenf(w, " => new { Key = k, Value = v })")
case "fileArchive":
isTemplate, templateParts := isTemplatePathString(expr.Args[0])
if isTemplate {
// emit Paths.get(part1, part2 ... partN)
g.Fgen(w, "new FileArchive(Paths.get(")
for index, part := range templateParts {
if index == len(templateParts)-1 {
// last element, no trailing comma
g.Fgenf(w, "%.v", part)
} else {
g.Fgenf(w, "%.v, ", part)
}
}
g.Fgen(w, "))")
} else {
g.Fgenf(w, "new FileArchive(%.v)", expr.Args[0])
}
case "fileAsset":
isTemplate, templateParts := isTemplatePathString(expr.Args[0])
if isTemplate {
// emit Paths.get(part1, part2 ... partN)
g.Fgen(w, "new FileAsset(Paths.get(")
for index, part := range templateParts {
if index == len(templateParts)-1 {
// last element, no trailing comma
g.Fgenf(w, "%.v", part)
} else {
g.Fgenf(w, "%.v, ", part)
}
}
g.Fgen(w, "))")
} else {
g.Fgenf(w, "new FileAsset(%.v)", expr.Args[0])
}
case "file":
g.Fgenf(w, "new String(Files.readAllBytes(Paths.get(%v)), StandardCharsets.UTF_8)", expr.Args[0])
case "filebase64":
g.Fgenf(w, "Base64.getEncoder().encodeToString(Files.readAllBytes(Paths.get(%v)))", expr.Args[0])
case "filebase64sha256":
// Assuming the existence of the following helper method
g.Fgenf(w, "computeFileBase64Sha256(%v)", expr.Args[0])
case pcl.Invoke:
fullyQualifiedName, schemaName := g.functionName(expr.Args[0])
functionSchema, foundFunction := g.findFunctionSchema(schemaName)
if foundFunction {
g.Fprintf(w, "%s(", fullyQualifiedName)
invokeArgumentsExpr := expr.Args[1]
switch invokeArgumentsExpr.(type) {
case *model.ObjectConsExpression:
argumentsExpr := invokeArgumentsExpr.(*model.ObjectConsExpression)
g.genObjectConsExpressionWithTypeName(w, argumentsExpr, functionSchema.Inputs)
}
g.Fprint(w, ")")
return
}
g.Fprintf(w, "%s(", fullyQualifiedName)
isOutput, outArgs, _ := pcl.RecognizeOutputVersionedInvoke(expr)
if isOutput {
//typeName := g.argumentTypeNameWithSuffix(expr, outArgsTy, "Args")
g.genObjectConsExpressionWithTypeName(w, outArgs, &schema.MapType{ElementType: schema.StringType})
} else {
invokeArgumentsExpr := expr.Args[1]
switch invokeArgumentsExpr.(type) {
case *model.ObjectConsExpression:
argumentsExpr := invokeArgumentsExpr.(*model.ObjectConsExpression)
g.genObjectConsExpressionWithTypeName(w, argumentsExpr, &schema.MapType{ElementType: schema.StringType})
}
}
g.Fprint(w, ")")
case "join":
g.Fgenf(w, "String.join(%v, %v)", expr.Args[0], expr.Args[1])
case "length":
g.Fgenf(w, "%.20v.length()", expr.Args[0])
case "lookup":
g.Fgenf(w, "%v[%v]", expr.Args[0], expr.Args[1])
case "range":
g.genRange(w, expr, false)
case "readFile":
g.Fgenf(w, "Files.readString(Paths.get(%v))", expr.Args[0])
case "readDir":
g.Fgenf(w, "readDir(%.v)", expr.Args[0])
case "secret":
g.Fgenf(w, "Output.ofSecret(%v)", expr.Args[0])
case "split":
g.Fgenf(w, "%.20v.split(%v)", expr.Args[1], expr.Args[0])
case "mimeType":
g.Fgenf(w, "Files.probeContentType(%v)", expr.Args[0])
case "base64encode":
g.Fgenf(w, "Base64.getEncoder().encodeToString(%v.getBytes(StandardCharsets.UTF_8))", expr.Args[0])
case "base64decode":
g.Fgenf(w, "new String(Base64.getDecoder().decode(%v), StandardCharsets.UTF_8)", expr.Args[0])
case "toJSON":
// Assumes SerializeJson is part of the SDK
g.Fgen(w, "serializeJson(")
g.genNewline(w)
g.Indented(func() {
g.genIndent(w)
g.genJSON(w, expr.Args[0])
})
g.Fgen(w, ")")
case "sha1":
// Assuming the existence of the following helper method located earlier in the preamble
g.Fgenf(w, "computeSHA1(%v)", expr.Args[0])
case "stack":
g.Fgen(w, "Deployment.getInstance().getStackName()")
case "project":
g.Fgen(w, "Deployment.getInstance().getProjectName()")
default:
g.genNYI(w, "call %v", expr.Name)
}
}
func (g *generator) genJSON(w io.Writer, expr model.Expression) {
switch expr := expr.(type) {
case *model.ObjectConsExpression:
g.Fgen(w, "jsonObject(")
g.genNewline(w)
g.Indented(func() {
for index, item := range expr.Items {
g.genIndent(w)
g.Fgenf(w, "jsonProperty(%s, ", item.Key)
g.genJSON(w, item.Value)
g.Fgen(w, ")")
if index < len(expr.Items)-1 {
// elements
g.Fgen(w, ",")
g.genNewline(w)
}
}
})
g.genNewline(w)
g.Fgenf(w, "%s)", g.Indent)
case *model.TupleConsExpression:
if len(expr.Expressions) == 1 {
g.Fgen(w, "jsonArray(")
g.genJSON(w, expr.Expressions[0])
g.Fgen(w, ")")
return
}
g.Fgen(w, "jsonArray(")
g.genNewline(w)
g.Indented(func() {
for index, value := range expr.Expressions {
g.genIndent(w)
if index == len(expr.Expressions)-1 {
// last element: no trailing comma
g.genJSON(w, value)
g.genNewline(w)
} else {
g.genJSON(w, value)
g.Fgen(w, ", ")
g.genNewline(w)
}
}
})
g.Fgenf(w, "%s)", g.Indent)
default:
g.Fgenf(w, "%.v", expr)
}
}
func (g *generator) GenIndexExpression(w io.Writer, expr *model.IndexExpression) {
g.Fgenf(w, "%v[%v]", expr.Collection, expr.Key)
}
func (g *generator) escapeString(v string, verbatim, expressions bool) string {
builder := strings.Builder{}
for _, c := range v {
if !verbatim {
if c == '"' || c == '\\' {
builder.WriteRune('\\')
}
}
if expressions && (c == '{' || c == '}') {
builder.WriteRune(c)
}
builder.WriteRune(c)
}
return builder.String()
}
func (g *generator) genStringLiteral(w io.Writer, v string) {
newlines := strings.Contains(v, "\n")
if !newlines {
// This string does not contain newlines so we'll generate a regular string literal. Quotes and backslashes
// will be escaped in conformance with
// https://docs.microsoft.com/en-us/dotnet/csharp/language-reference/language-specification/lexical-structure
g.Fgen(w, "\"")
g.Fgen(w, g.escapeString(v, false, false))
g.Fgen(w, "\"")
} else {
// This string does contain newlines, so we'll generate a verbatim string literal. Quotes will be escaped
// in conformance with
// https://docs.microsoft.com/en-us/dotnet/csharp/language-reference/language-specification/lexical-structure
g.Fgen(w, "@\"")
g.Fgen(w, g.escapeString(v, true, false))
g.Fgen(w, "\"")
}
}
func (g *generator) GenLiteralValueExpression(w io.Writer, expr *model.LiteralValueExpression) {
typ := expr.Type()
if cns, ok := typ.(*model.ConstType); ok {
typ = cns.Type
}
switch typ {
case model.BoolType:
g.Fgenf(w, "%v", expr.Value.True())
case model.NoneType:
g.Fgen(w, "null")
case model.NumberType:
bf := expr.Value.AsBigFloat()
if i, acc := bf.Int64(); acc == big.Exact {
g.Fgenf(w, "%d", i)
} else {
f, _ := bf.Float64()
g.Fgenf(w, "%g", f)
}
case model.StringType:
g.genStringLiteral(w, expr.Value.AsString())
default:
contract.Failf("unexpected literal type in GenLiteralValueExpression: %v (%v)", expr.Type(),
expr.SyntaxNode().Range())
}
}
func (g *generator) GenObjectConsExpression(w io.Writer, expr *model.ObjectConsExpression) {
g.genObjectConsExpression(w, expr, g.currentResourcePropertyType)
}
func (g *generator) argumentTypeName(expr model.Expression, destType model.Type) string {
suffix := "Args"
return g.argumentTypeNameWithSuffix(expr, destType, suffix)
}
func (g *generator) toSchemaType(destType model.Type) (schema.Type, bool) {
schemaType, ok := pcl.GetSchemaForType(destType)
if !ok {
return nil, false
}
return codegen.UnwrapType(schemaType), true
}
func (g *generator) argumentTypeNameWithSuffix(expr model.Expression, destType model.Type, suffix string) string {
schemaType, ok := g.toSchemaType(destType)
if !ok {
// TODO: why is this always returned?
return ""
}
objType, ok := schemaType.(*schema.ObjectType)
if !ok {
return ""
}
token := objType.Token
tokenRange := expr.SyntaxNode().Range()
_, _, member, _ := pcl.DecomposeToken(token, tokenRange)
member = member + suffix
return names.Title(member)
}
func (g *generator) genObjectConsExpression(w io.Writer, expr *model.ObjectConsExpression, destType schema.Type) {
if len(expr.Items) == 0 {
return
}
g.genObjectConsExpressionWithTypeName(w, expr, destType)
}
// Returns the name of the type
func typeName(schemaType schema.Type) string {
switch schemaType.(type) {
case *schema.ObjectType:
objectType := schemaType.(*schema.ObjectType)
fullyQualifiedTypeName := objectType.Token
nameParts := strings.Split(fullyQualifiedTypeName, ":")
return names.Title(nameParts[len(nameParts)-1])
default:
fullyQualifiedTypeName := schemaType.String()
nameParts := strings.Split(fullyQualifiedTypeName, ":")
return names.Title(nameParts[len(nameParts)-1])
}
}
// Checks whether the type is an object type
func isObjectType(schemaType schema.Type) bool {
switch schemaType.(type) {
case *schema.ObjectType:
return true
default:
return false
}
}
// Changes currentResourcePropertyType during the execution scope of the exec function
func (g *generator) typedObjectExprScope(innerType schema.Type, exec func()) {
reservedType := g.currentResourcePropertyType
g.currentResourcePropertyType = innerType
exec()
g.currentResourcePropertyType = reservedType
}
// Reads the value of an object expression by its key.
// For example, if you had an object expression { "name": "john" },
// then readStringAttribute("name", expr) would return (true, "john")
func readStringAttribute(key string, expr *model.ObjectConsExpression) (bool, string) {
for _, item := range expr.Items {
if key == item.Key.(*model.LiteralValueExpression).Value.AsString() {
switch item.Value.(type) {
case *model.LiteralValueExpression:
return true, item.Value.(*model.LiteralValueExpression).Value.AsString()
case *model.TemplateExpression:
template := item.Value.(*model.TemplateExpression)
if len(template.Parts) == 1 {
firstPart := template.Parts[0]
switch firstPart.(type) {
case *model.LiteralValueExpression:
return true, firstPart.(*model.LiteralValueExpression).Value.AsString()
}
}
}
}
}
return false, ""
}
func pickTypeFromUnion(union *schema.UnionType, expr *model.ObjectConsExpression) schema.Type {
foundDiscriminator, discriminator := readStringAttribute(union.Discriminator, expr)
if foundDiscriminator {
for _, unionType := range union.ElementTypes {
if strings.Contains(typeName(unionType), discriminator) {
return unionType
}
}
}
// we did what we can, return the default
return union.ElementTypes[0]
}
func (g *generator) genObjectConsExpressionWithTypeName(
w io.Writer, expr *model.ObjectConsExpression, destType schema.Type) {
if len(expr.Items) == 0 {
return
}
destTypeName := typeName(destType)
switch destType.(type) {
case *schema.ObjectType:
objectProperties := make(map[string]schema.Type)
for _, property := range destType.(*schema.ObjectType).Properties {
objectProperties[property.Name] = codegen.UnwrapType(property.Type)
}
if !strings.HasSuffix(destTypeName, "Args") {
// nested object builders require the "Args" suffix
// except for function arg types because
// they already have that suffix
destTypeName = destTypeName + "Args"
}
g.Fgenf(w, "%s.builder()", destTypeName)
g.genNewline(w)
g.Indented(func() {
for _, item := range expr.Items {
lit := item.Key.(*model.LiteralValueExpression)
key := names.MakeValidIdentifier(names.LowerCamelCase(lit.Value.AsString()))
attributeType := objectProperties[lit.Value.AsString()]
g.genIndent(w)
g.typedObjectExprScope(attributeType, func() {
g.Fgenf(w, ".%s(%.v)", key, g.lowerExpression(item.Value, item.Value.Type()))
})
g.genNewline(w)
}
g.genIndent(w)
g.Fgenf(w, ".build()")
})
case *schema.ArrayType:
// recurse into inner type
innerType := destType.(*schema.ArrayType).ElementType
g.genObjectConsExpressionWithTypeName(w, expr, innerType)
case *schema.InputType:
// recurse into inner type
innerType := destType.(*schema.InputType).ElementType
g.genObjectConsExpressionWithTypeName(w, expr, innerType)
case *schema.UnionType:
union := destType.(*schema.UnionType)
innerType := pickTypeFromUnion(union, expr)
g.genObjectConsExpressionWithTypeName(w, expr, innerType)
default:
// generate map, usually for tags of type Map<String, String>
if len(expr.Items) == 1 {
firstItem := expr.Items[0]
// a map of one entry, generate a one-liner:
g.Fgenf(w, "Map.of(%.v, %.v)", firstItem.Key, firstItem.Value)
} else {
g.Fgen(w, "Map.ofEntries(\n")
g.Indented(func() {
for index, item := range expr.Items {
if index == len(expr.Items)-1 {
// Last item, no trailing comma
g.Fgenf(w, "%sMap.entry(%.v, %.v)\n", g.Indent, item.Key, item.Value)
} else {
g.Fgenf(w, "%sMap.entry(%.v, %.v),\n", g.Indent, item.Key, item.Value)
}
}
})
g.Fgenf(w, "%s)", g.Indent)
}
}
}
func (g *generator) genRelativeTraversal(w io.Writer,
traversal hcl.Traversal, parts []model.Traversable, objType *schema.ObjectType) {
for i, part := range traversal {
var key cty.Value
switch part := part.(type) {
case hcl.TraverseAttr:
key = cty.StringVal(part.Name)
case hcl.TraverseIndex:
key = part.Key
default:
contract.Failf("unexpected traversal part of type %T (%v)", part, part.SourceRange())
}
// TODO: what do we do with optionals in Java
if model.IsOptionalType(model.GetTraversableType(parts[i])) {
//g.Fgen(w, "?")
}
switch key.Type() {
case cty.String:
g.Fgenf(w, ".%s()", key.AsString())
case cty.Number:
idx, _ := key.AsBigFloat().Int64()
g.Fgenf(w, "[%d]", idx)
default:
contract.Failf("unexpected traversal key of type %T (%v)", key, key.AsString())
}
}
}
func (g *generator) GenRelativeTraversalExpression(w io.Writer, expr *model.RelativeTraversalExpression) {
g.Fgenf(w, "%.20v", expr.Source)
g.genRelativeTraversal(w, expr.Traversal, expr.Parts, nil)
}
func (g *generator) GenScopeTraversalExpression(w io.Writer, expr *model.ScopeTraversalExpression) {
rootName := names.MakeValidIdentifier(expr.RootName)
g.Fgen(w, rootName)
invokedFunctionSchema, isFunctionInvoke := g.functionInvokes[rootName]
if isFunctionInvoke {
lambdaArg := names.LowerCamelCase(typeName(invokedFunctionSchema.Outputs))
// Assume invokes are returning Output<T> instead of CompletableFuture<T>
g.Fgenf(w, ".applyValue(%s -> %s", lambdaArg, lambdaArg)
}
var objType *schema.ObjectType
if resource, ok := expr.Parts[0].(*pcl.Resource); ok {
if schemaType, ok := pcl.GetSchemaForType(resource.InputType); ok {
objType, _ = schemaType.(*schema.ObjectType)
}
}
g.genRelativeTraversal(w, expr.Traversal.SimpleSplit().Rel, expr.Parts, objType)
if isFunctionInvoke {
g.Fgenf(w, ")")
}
}
func (g *generator) GenSplatExpression(w io.Writer, expr *model.SplatExpression) {
g.Fgenf(w, "%.20v.stream().map(element -> element%.v).collect(toList())", expr.Source, expr.Each)
}
func (g *generator) GenTemplateJoinExpression(w io.Writer, expr *model.TemplateJoinExpression) {
g.genNYI(w, "TemplateJoinExpression")
}
// Generates an array of elements where each element is of type Union<Object1, Object2, ..., ObjectN>
func (g *generator) genArrayOfUnion(w io.Writer, union *schema.UnionType, exprs []*model.ObjectConsExpression) {
if len(exprs) > 0 {
if len(exprs) == 1 {
// simple case, just write the first element
objectType := pickTypeFromUnion(union, exprs[0])
g.genObjectConsExpression(w, exprs[0], objectType)
return
}
// Write multiple list elements
g.Fgenf(w, "%s\n", g.Indent)
g.Indented(func() {
for index, expr := range exprs {
objectType := pickTypeFromUnion(union, expr)
if index == 0 {
// first expression, no need for a new line
g.genIndent(w)
g.genObjectConsExpression(w, expr, objectType)
g.Fgen(w, ",")
} else if index == len(exprs)-1 {
// last element, no trailing comma
g.genNewline(w)
g.genIndent(w)
g.genObjectConsExpression(w, expr, objectType)
} else {
// elements in between: new line and trailing comma
g.genNewline(w)
g.genIndent(w)
g.genObjectConsExpression(w, expr, objectType)
g.Fgen(w, ",")
}
}
})
}
}
// Returns whether the Union type has elements only of type Object
func unionOfObjectTypes(union *schema.UnionType) bool {
for _, unionType := range union.ElementTypes {
if !isObjectType(unionType) {
return false
}
}
return true
}
// GenTupleConsExpression generates a list of expressions
func (g *generator) GenTupleConsExpression(w io.Writer, expr *model.TupleConsExpression) {
// Make special case for Array<Union<ObjectType1, ObjectType2, ..., ObjectTypeN>>
switch g.currentResourcePropertyType.(type) {
case *schema.ArrayType:
arrayType := g.currentResourcePropertyType.(*schema.ArrayType)
elementType := arrayType.ElementType
switch elementType.(type) {
case *schema.UnionType:
union := elementType.(*schema.UnionType)
if unionOfObjectTypes(union) {
var objectExprs []*model.ObjectConsExpression
for _, item := range expr.Expressions {
objectExprs = append(objectExprs, item.(*model.ObjectConsExpression))
}
g.genArrayOfUnion(w, union, objectExprs)
return
}
}
}
if len(expr.Expressions) > 0 {
if len(expr.Expressions) == 1 {
// simple case, just write the first element
g.Fgenf(w, "%.v", expr.Expressions[0])
return
}
// Write multiple list elements
g.Fgenf(w, "%s\n", g.Indent)
g.Indented(func() {
for index, value := range expr.Expressions {
if index == 0 {
// first expression, no need for a new line
g.Fgenf(w, "%s%.v,", g.Indent, value)
} else if index == len(expr.Expressions)-1 {
// last element, no trailing comma
g.Fgenf(w, "\n%s%.v", g.Indent, value)
} else {
// elements in between: new line and trailing comma
g.Fgenf(w, "\n%s%.v,", g.Indent, value)
}
}
})
}
}
func (g *generator) GenUnaryOpExpression(w io.Writer, expr *model.UnaryOpExpression) {
g.genNYI(w, "GenUnaryOpExpression") // TODO
}