blob: 6403612d7c9290bff85de343af62a64359e6ecf2 [file] [log] [blame]
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001// Copyright 2021 Google LLC
2//
3// Licensed under the Apache License, Version 2.0 (the "License");
4// you may not use this file except in compliance with the License.
5// You may obtain a copy of the License at
6//
7// http://www.apache.org/licenses/LICENSE-2.0
8//
9// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS,
11// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12// See the License for the specific language governing permissions and
13// limitations under the License.
14
15// Convert makefile containing device configuration to Starlark file
16// The conversion can handle the following constructs in a makefile:
17// * comments
18// * simple variable assignments
19// * $(call init-product,<file>)
20// * $(call inherit-product-if-exists
21// * if directives
22// All other constructs are carried over to the output starlark file as comments.
23//
24package mk2rbc
25
26import (
27 "bytes"
28 "fmt"
29 "io"
Sasha Smundak6609ba72021-07-22 18:32:56 -070030 "io/fs"
Sasha Smundakb051c4e2020-11-05 20:45:07 -080031 "io/ioutil"
32 "os"
33 "path/filepath"
34 "regexp"
35 "strconv"
36 "strings"
37 "text/scanner"
38
39 mkparser "android/soong/androidmk/parser"
40)
41
42const (
43 baseUri = "//build/make/core:product_config.rbc"
44 // The name of the struct exported by the product_config.rbc
45 // that contains the functions and variables available to
46 // product configuration Starlark files.
47 baseName = "rblf"
48
Sasha Smundak65b547e2021-09-17 15:35:41 -070049 soongNsPrefix = "SOONG_CONFIG_"
50
Sasha Smundakb051c4e2020-11-05 20:45:07 -080051 // And here are the functions and variables:
52 cfnGetCfg = baseName + ".cfg"
53 cfnMain = baseName + ".product_configuration"
54 cfnPrintVars = baseName + ".printvars"
55 cfnWarning = baseName + ".warning"
56 cfnLocalAppend = baseName + ".local_append"
57 cfnLocalSetDefault = baseName + ".local_set_default"
58 cfnInherit = baseName + ".inherit"
59 cfnSetListDefault = baseName + ".setdefault"
60)
61
62const (
63 // Phony makefile functions, they are eventually rewritten
64 // according to knownFunctions map
Sasha Smundak65b547e2021-09-17 15:35:41 -070065 fileExistsPhony = "$file_exists"
66 // The following two macros are obsolete, and will we deleted once
67 // there are deleted from the makefiles:
68 soongConfigNamespaceOld = "add_soong_config_namespace"
69 soongConfigVarSetOld = "add_soong_config_var_value"
70 soongConfigAppend = "soong_config_append"
71 soongConfigAssign = "soong_config_set"
72 wildcardExistsPhony = "$wildcard_exists"
Sasha Smundakb051c4e2020-11-05 20:45:07 -080073)
74
75const (
76 callLoadAlways = "inherit-product"
77 callLoadIf = "inherit-product-if-exists"
78)
79
80var knownFunctions = map[string]struct {
81 // The name of the runtime function this function call in makefiles maps to.
82 // If it starts with !, then this makefile function call is rewritten to
83 // something else.
84 runtimeName string
85 returnType starlarkType
Sasha Smundak3deb9682021-07-26 18:42:25 -070086 hiddenArg hiddenArgType
Sasha Smundakb051c4e2020-11-05 20:45:07 -080087}{
Sasha Smundak3deb9682021-07-26 18:42:25 -070088 "abspath": {baseName + ".abspath", starlarkTypeString, hiddenArgNone},
89 fileExistsPhony: {baseName + ".file_exists", starlarkTypeBool, hiddenArgNone},
90 wildcardExistsPhony: {baseName + ".file_wildcard_exists", starlarkTypeBool, hiddenArgNone},
Sasha Smundak65b547e2021-09-17 15:35:41 -070091 soongConfigNamespaceOld: {baseName + ".soong_config_namespace", starlarkTypeVoid, hiddenArgGlobal},
92 soongConfigVarSetOld: {baseName + ".soong_config_set", starlarkTypeVoid, hiddenArgGlobal},
93 soongConfigAssign: {baseName + ".soong_config_set", starlarkTypeVoid, hiddenArgGlobal},
94 soongConfigAppend: {baseName + ".soong_config_append", starlarkTypeVoid, hiddenArgGlobal},
Sasha Smundak3deb9682021-07-26 18:42:25 -070095 "add-to-product-copy-files-if-exists": {baseName + ".copy_if_exists", starlarkTypeList, hiddenArgNone},
96 "addprefix": {baseName + ".addprefix", starlarkTypeList, hiddenArgNone},
97 "addsuffix": {baseName + ".addsuffix", starlarkTypeList, hiddenArgNone},
98 "copy-files": {baseName + ".copy_files", starlarkTypeList, hiddenArgNone},
99 "dir": {baseName + ".dir", starlarkTypeList, hiddenArgNone},
100 "enforce-product-packages-exist": {baseName + ".enforce_product_packages_exist", starlarkTypeVoid, hiddenArgNone},
101 "error": {baseName + ".mkerror", starlarkTypeVoid, hiddenArgNone},
102 "findstring": {"!findstring", starlarkTypeInt, hiddenArgNone},
103 "find-copy-subdir-files": {baseName + ".find_and_copy", starlarkTypeList, hiddenArgNone},
104 "find-word-in-list": {"!find-word-in-list", starlarkTypeUnknown, hiddenArgNone}, // internal macro
105 "filter": {baseName + ".filter", starlarkTypeList, hiddenArgNone},
106 "filter-out": {baseName + ".filter_out", starlarkTypeList, hiddenArgNone},
107 "firstword": {"!firstword", starlarkTypeString, hiddenArgNone},
108 "get-vendor-board-platforms": {"!get-vendor-board-platforms", starlarkTypeList, hiddenArgNone}, // internal macro, used by is-board-platform, etc.
109 "info": {baseName + ".mkinfo", starlarkTypeVoid, hiddenArgNone},
110 "is-android-codename": {"!is-android-codename", starlarkTypeBool, hiddenArgNone}, // unused by product config
111 "is-android-codename-in-list": {"!is-android-codename-in-list", starlarkTypeBool, hiddenArgNone}, // unused by product config
112 "is-board-platform": {"!is-board-platform", starlarkTypeBool, hiddenArgNone},
113 "is-board-platform-in-list": {"!is-board-platform-in-list", starlarkTypeBool, hiddenArgNone},
114 "is-chipset-in-board-platform": {"!is-chipset-in-board-platform", starlarkTypeUnknown, hiddenArgNone}, // unused by product config
115 "is-chipset-prefix-in-board-platform": {"!is-chipset-prefix-in-board-platform", starlarkTypeBool, hiddenArgNone}, // unused by product config
116 "is-not-board-platform": {"!is-not-board-platform", starlarkTypeBool, hiddenArgNone}, // defined but never used
117 "is-platform-sdk-version-at-least": {"!is-platform-sdk-version-at-least", starlarkTypeBool, hiddenArgNone}, // unused by product config
118 "is-product-in-list": {"!is-product-in-list", starlarkTypeBool, hiddenArgNone},
119 "is-vendor-board-platform": {"!is-vendor-board-platform", starlarkTypeBool, hiddenArgNone},
120 callLoadAlways: {"!inherit-product", starlarkTypeVoid, hiddenArgNone},
121 callLoadIf: {"!inherit-product-if-exists", starlarkTypeVoid, hiddenArgNone},
122 "lastword": {"!lastword", starlarkTypeString, hiddenArgNone},
123 "match-prefix": {"!match-prefix", starlarkTypeUnknown, hiddenArgNone}, // internal macro
124 "match-word": {"!match-word", starlarkTypeUnknown, hiddenArgNone}, // internal macro
125 "match-word-in-list": {"!match-word-in-list", starlarkTypeUnknown, hiddenArgNone}, // internal macro
126 "notdir": {baseName + ".notdir", starlarkTypeString, hiddenArgNone},
127 "my-dir": {"!my-dir", starlarkTypeString, hiddenArgNone},
128 "patsubst": {baseName + ".mkpatsubst", starlarkTypeString, hiddenArgNone},
Sasha Smundak04453082021-08-17 18:14:41 -0700129 "product-copy-files-by-pattern": {baseName + ".product_copy_files_by_pattern", starlarkTypeList, hiddenArgNone},
Sasha Smundak3deb9682021-07-26 18:42:25 -0700130 "require-artifacts-in-path": {baseName + ".require_artifacts_in_path", starlarkTypeVoid, hiddenArgNone},
131 "require-artifacts-in-path-relaxed": {baseName + ".require_artifacts_in_path_relaxed", starlarkTypeVoid, hiddenArgNone},
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800132 // TODO(asmundak): remove it once all calls are removed from configuration makefiles. see b/183161002
Sasha Smundak3deb9682021-07-26 18:42:25 -0700133 "shell": {baseName + ".shell", starlarkTypeString, hiddenArgNone},
134 "strip": {baseName + ".mkstrip", starlarkTypeString, hiddenArgNone},
135 "tb-modules": {"!tb-modules", starlarkTypeUnknown, hiddenArgNone}, // defined in hardware/amlogic/tb_modules/tb_detect.mk, unused
136 "subst": {baseName + ".mksubst", starlarkTypeString, hiddenArgNone},
137 "warning": {baseName + ".mkwarning", starlarkTypeVoid, hiddenArgNone},
138 "word": {baseName + "!word", starlarkTypeString, hiddenArgNone},
139 "wildcard": {baseName + ".expand_wildcard", starlarkTypeList, hiddenArgNone},
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800140}
141
142var builtinFuncRex = regexp.MustCompile(
143 "^(addprefix|addsuffix|abspath|and|basename|call|dir|error|eval" +
144 "|flavor|foreach|file|filter|filter-out|findstring|firstword|guile" +
145 "|if|info|join|lastword|notdir|or|origin|patsubst|realpath" +
146 "|shell|sort|strip|subst|suffix|value|warning|word|wordlist|words" +
147 "|wildcard)")
148
149// Conversion request parameters
150type Request struct {
151 MkFile string // file to convert
152 Reader io.Reader // if set, read input from this stream instead
153 RootDir string // root directory path used to resolve included files
154 OutputSuffix string // generated Starlark files suffix
155 OutputDir string // if set, root of the output hierarchy
156 ErrorLogger ErrorMonitorCB
157 TracedVariables []string // trace assignment to these variables
158 TraceCalls bool
159 WarnPartialSuccess bool
Sasha Smundak6609ba72021-07-22 18:32:56 -0700160 SourceFS fs.FS
161 MakefileFinder MakefileFinder
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800162}
163
164// An error sink allowing to gather error statistics.
165// NewError is called on every error encountered during processing.
166type ErrorMonitorCB interface {
167 NewError(s string, node mkparser.Node, args ...interface{})
168}
169
170// Derives module name for a given file. It is base name
171// (file name without suffix), with some characters replaced to make it a Starlark identifier
172func moduleNameForFile(mkFile string) string {
173 base := strings.TrimSuffix(filepath.Base(mkFile), filepath.Ext(mkFile))
174 // TODO(asmundak): what else can be in the product file names?
Sasha Smundak6609ba72021-07-22 18:32:56 -0700175 return strings.NewReplacer("-", "_", ".", "_").Replace(base)
176
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800177}
178
179func cloneMakeString(mkString *mkparser.MakeString) *mkparser.MakeString {
180 r := &mkparser.MakeString{StringPos: mkString.StringPos}
181 r.Strings = append(r.Strings, mkString.Strings...)
182 r.Variables = append(r.Variables, mkString.Variables...)
183 return r
184}
185
186func isMakeControlFunc(s string) bool {
187 return s == "error" || s == "warning" || s == "info"
188}
189
190// Starlark output generation context
191type generationContext struct {
192 buf strings.Builder
193 starScript *StarlarkScript
194 indentLevel int
195 inAssignment bool
196 tracedCount int
197}
198
199func NewGenerateContext(ss *StarlarkScript) *generationContext {
200 return &generationContext{starScript: ss}
201}
202
203// emit returns generated script
204func (gctx *generationContext) emit() string {
205 ss := gctx.starScript
206
207 // The emitted code has the following layout:
208 // <initial comments>
209 // preamble, i.e.,
210 // load statement for the runtime support
211 // load statement for each unique submodule pulled in by this one
212 // def init(g, handle):
213 // cfg = rblf.cfg(handle)
214 // <statements>
215 // <warning if conversion was not clean>
216
217 iNode := len(ss.nodes)
218 for i, node := range ss.nodes {
219 if _, ok := node.(*commentNode); !ok {
220 iNode = i
221 break
222 }
223 node.emit(gctx)
224 }
225
226 gctx.emitPreamble()
227
228 gctx.newLine()
229 // The arguments passed to the init function are the global dictionary
230 // ('g') and the product configuration dictionary ('cfg')
231 gctx.write("def init(g, handle):")
232 gctx.indentLevel++
233 if gctx.starScript.traceCalls {
234 gctx.newLine()
235 gctx.writef(`print(">%s")`, gctx.starScript.mkFile)
236 }
237 gctx.newLine()
238 gctx.writef("cfg = %s(handle)", cfnGetCfg)
239 for _, node := range ss.nodes[iNode:] {
240 node.emit(gctx)
241 }
242
243 if ss.hasErrors && ss.warnPartialSuccess {
244 gctx.newLine()
245 gctx.writef("%s(%q, %q)", cfnWarning, filepath.Base(ss.mkFile), "partially successful conversion")
246 }
247 if gctx.starScript.traceCalls {
248 gctx.newLine()
249 gctx.writef(`print("<%s")`, gctx.starScript.mkFile)
250 }
251 gctx.indentLevel--
252 gctx.write("\n")
253 return gctx.buf.String()
254}
255
256func (gctx *generationContext) emitPreamble() {
257 gctx.newLine()
258 gctx.writef("load(%q, %q)", baseUri, baseName)
259 // Emit exactly one load statement for each URI.
260 loadedSubConfigs := make(map[string]string)
261 for _, sc := range gctx.starScript.inherited {
262 uri := sc.path
263 if m, ok := loadedSubConfigs[uri]; ok {
264 // No need to emit load statement, but fix module name.
265 sc.moduleLocalName = m
266 continue
267 }
Sasha Smundak6609ba72021-07-22 18:32:56 -0700268 if sc.optional {
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800269 uri += "|init"
270 }
271 gctx.newLine()
272 gctx.writef("load(%q, %s = \"init\")", uri, sc.entryName())
273 loadedSubConfigs[uri] = sc.moduleLocalName
274 }
275 gctx.write("\n")
276}
277
278func (gctx *generationContext) emitPass() {
279 gctx.newLine()
280 gctx.write("pass")
281}
282
283func (gctx *generationContext) write(ss ...string) {
284 for _, s := range ss {
285 gctx.buf.WriteString(s)
286 }
287}
288
289func (gctx *generationContext) writef(format string, args ...interface{}) {
290 gctx.write(fmt.Sprintf(format, args...))
291}
292
293func (gctx *generationContext) newLine() {
294 if gctx.buf.Len() == 0 {
295 return
296 }
297 gctx.write("\n")
298 gctx.writef("%*s", 2*gctx.indentLevel, "")
299}
300
301type knownVariable struct {
302 name string
303 class varClass
304 valueType starlarkType
305}
306
307type knownVariables map[string]knownVariable
308
309func (pcv knownVariables) NewVariable(name string, varClass varClass, valueType starlarkType) {
310 v, exists := pcv[name]
311 if !exists {
312 pcv[name] = knownVariable{name, varClass, valueType}
313 return
314 }
315 // Conflict resolution:
316 // * config class trumps everything
317 // * any type trumps unknown type
318 match := varClass == v.class
319 if !match {
320 if varClass == VarClassConfig {
321 v.class = VarClassConfig
322 match = true
323 } else if v.class == VarClassConfig {
324 match = true
325 }
326 }
327 if valueType != v.valueType {
328 if valueType != starlarkTypeUnknown {
329 if v.valueType == starlarkTypeUnknown {
330 v.valueType = valueType
331 } else {
332 match = false
333 }
334 }
335 }
336 if !match {
337 fmt.Fprintf(os.Stderr, "cannot redefine %s as %v/%v (already defined as %v/%v)\n",
338 name, varClass, valueType, v.class, v.valueType)
339 }
340}
341
342// All known product variables.
343var KnownVariables = make(knownVariables)
344
345func init() {
346 for _, kv := range []string{
347 // Kernel-related variables that we know are lists.
348 "BOARD_VENDOR_KERNEL_MODULES",
349 "BOARD_VENDOR_RAMDISK_KERNEL_MODULES",
350 "BOARD_VENDOR_RAMDISK_KERNEL_MODULES_LOAD",
351 "BOARD_RECOVERY_KERNEL_MODULES",
352 // Other variables we knwo are lists
353 "ART_APEX_JARS",
354 } {
355 KnownVariables.NewVariable(kv, VarClassSoong, starlarkTypeList)
356 }
357}
358
359type nodeReceiver interface {
360 newNode(node starlarkNode)
361}
362
363// Information about the generated Starlark script.
364type StarlarkScript struct {
365 mkFile string
366 moduleName string
367 mkPos scanner.Position
368 nodes []starlarkNode
Sasha Smundak6609ba72021-07-22 18:32:56 -0700369 inherited []*moduleInfo
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800370 hasErrors bool
371 topDir string
372 traceCalls bool // print enter/exit each init function
373 warnPartialSuccess bool
Sasha Smundak6609ba72021-07-22 18:32:56 -0700374 sourceFS fs.FS
375 makefileFinder MakefileFinder
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800376}
377
378func (ss *StarlarkScript) newNode(node starlarkNode) {
379 ss.nodes = append(ss.nodes, node)
380}
381
382// varAssignmentScope points to the last assignment for each variable
383// in the current block. It is used during the parsing to chain
384// the assignments to a variable together.
385type varAssignmentScope struct {
386 outer *varAssignmentScope
387 vars map[string]*assignmentNode
388}
389
390// parseContext holds the script we are generating and all the ephemeral data
391// needed during the parsing.
392type parseContext struct {
393 script *StarlarkScript
394 nodes []mkparser.Node // Makefile as parsed by mkparser
395 currentNodeIndex int // Node in it we are processing
396 ifNestLevel int
397 moduleNameCount map[string]int // count of imported modules with given basename
398 fatalError error
399 builtinMakeVars map[string]starlarkExpr
400 outputSuffix string
401 errorLogger ErrorMonitorCB
402 tracedVariables map[string]bool // variables to be traced in the generated script
403 variables map[string]variable
404 varAssignments *varAssignmentScope
405 receiver nodeReceiver // receptacle for the generated starlarkNode's
406 receiverStack []nodeReceiver
407 outputDir string
Sasha Smundak6609ba72021-07-22 18:32:56 -0700408 dependentModules map[string]*moduleInfo
Sasha Smundak3deb9682021-07-26 18:42:25 -0700409 soongNamespaces map[string]map[string]bool
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800410}
411
412func newParseContext(ss *StarlarkScript, nodes []mkparser.Node) *parseContext {
Sasha Smundak6609ba72021-07-22 18:32:56 -0700413 topdir, _ := filepath.Split(filepath.Join(ss.topDir, "foo"))
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800414 predefined := []struct{ name, value string }{
415 {"SRC_TARGET_DIR", filepath.Join("build", "make", "target")},
416 {"LOCAL_PATH", filepath.Dir(ss.mkFile)},
Sasha Smundak6609ba72021-07-22 18:32:56 -0700417 {"TOPDIR", topdir},
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800418 // TODO(asmundak): maybe read it from build/make/core/envsetup.mk?
419 {"TARGET_COPY_OUT_SYSTEM", "system"},
420 {"TARGET_COPY_OUT_SYSTEM_OTHER", "system_other"},
421 {"TARGET_COPY_OUT_DATA", "data"},
422 {"TARGET_COPY_OUT_ASAN", filepath.Join("data", "asan")},
423 {"TARGET_COPY_OUT_OEM", "oem"},
424 {"TARGET_COPY_OUT_RAMDISK", "ramdisk"},
425 {"TARGET_COPY_OUT_DEBUG_RAMDISK", "debug_ramdisk"},
426 {"TARGET_COPY_OUT_VENDOR_DEBUG_RAMDISK", "vendor_debug_ramdisk"},
427 {"TARGET_COPY_OUT_TEST_HARNESS_RAMDISK", "test_harness_ramdisk"},
428 {"TARGET_COPY_OUT_ROOT", "root"},
429 {"TARGET_COPY_OUT_RECOVERY", "recovery"},
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800430 {"TARGET_COPY_OUT_VENDOR_RAMDISK", "vendor_ramdisk"},
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800431 // TODO(asmundak): to process internal config files, we need the following variables:
432 // BOARD_CONFIG_VENDOR_PATH
433 // TARGET_VENDOR
434 // target_base_product
435 //
436
437 // the following utility variables are set in build/make/common/core.mk:
438 {"empty", ""},
439 {"space", " "},
440 {"comma", ","},
441 {"newline", "\n"},
442 {"pound", "#"},
443 {"backslash", "\\"},
444 }
445 ctx := &parseContext{
446 script: ss,
447 nodes: nodes,
448 currentNodeIndex: 0,
449 ifNestLevel: 0,
450 moduleNameCount: make(map[string]int),
451 builtinMakeVars: map[string]starlarkExpr{},
452 variables: make(map[string]variable),
Sasha Smundak6609ba72021-07-22 18:32:56 -0700453 dependentModules: make(map[string]*moduleInfo),
Sasha Smundak3deb9682021-07-26 18:42:25 -0700454 soongNamespaces: make(map[string]map[string]bool),
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800455 }
456 ctx.pushVarAssignments()
457 for _, item := range predefined {
458 ctx.variables[item.name] = &predefinedVariable{
459 baseVariable: baseVariable{nam: item.name, typ: starlarkTypeString},
460 value: &stringLiteralExpr{item.value},
461 }
462 }
463
464 return ctx
465}
466
467func (ctx *parseContext) lastAssignment(name string) *assignmentNode {
468 for va := ctx.varAssignments; va != nil; va = va.outer {
469 if v, ok := va.vars[name]; ok {
470 return v
471 }
472 }
473 return nil
474}
475
476func (ctx *parseContext) setLastAssignment(name string, asgn *assignmentNode) {
477 ctx.varAssignments.vars[name] = asgn
478}
479
480func (ctx *parseContext) pushVarAssignments() {
481 va := &varAssignmentScope{
482 outer: ctx.varAssignments,
483 vars: make(map[string]*assignmentNode),
484 }
485 ctx.varAssignments = va
486}
487
488func (ctx *parseContext) popVarAssignments() {
489 ctx.varAssignments = ctx.varAssignments.outer
490}
491
492func (ctx *parseContext) pushReceiver(rcv nodeReceiver) {
493 ctx.receiverStack = append(ctx.receiverStack, ctx.receiver)
494 ctx.receiver = rcv
495}
496
497func (ctx *parseContext) popReceiver() {
498 last := len(ctx.receiverStack) - 1
499 if last < 0 {
500 panic(fmt.Errorf("popReceiver: receiver stack empty"))
501 }
502 ctx.receiver = ctx.receiverStack[last]
503 ctx.receiverStack = ctx.receiverStack[0:last]
504}
505
506func (ctx *parseContext) hasNodes() bool {
507 return ctx.currentNodeIndex < len(ctx.nodes)
508}
509
510func (ctx *parseContext) getNode() mkparser.Node {
511 if !ctx.hasNodes() {
512 return nil
513 }
514 node := ctx.nodes[ctx.currentNodeIndex]
515 ctx.currentNodeIndex++
516 return node
517}
518
519func (ctx *parseContext) backNode() {
520 if ctx.currentNodeIndex <= 0 {
521 panic("Cannot back off")
522 }
523 ctx.currentNodeIndex--
524}
525
526func (ctx *parseContext) handleAssignment(a *mkparser.Assignment) {
527 // Handle only simple variables
528 if !a.Name.Const() {
529 ctx.errorf(a, "Only simple variables are handled")
530 return
531 }
532 name := a.Name.Strings[0]
Sasha Smundak3deb9682021-07-26 18:42:25 -0700533 // Soong confuguration
534 if strings.HasPrefix(name, soongNsPrefix) {
535 ctx.handleSoongNsAssignment(strings.TrimPrefix(name, soongNsPrefix), a)
536 return
537 }
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800538 lhs := ctx.addVariable(name)
539 if lhs == nil {
540 ctx.errorf(a, "unknown variable %s", name)
541 return
542 }
543 _, isTraced := ctx.tracedVariables[name]
544 asgn := &assignmentNode{lhs: lhs, mkValue: a.Value, isTraced: isTraced}
545 if lhs.valueType() == starlarkTypeUnknown {
546 // Try to divine variable type from the RHS
547 asgn.value = ctx.parseMakeString(a, a.Value)
548 if xBad, ok := asgn.value.(*badExpr); ok {
549 ctx.wrapBadExpr(xBad)
550 return
551 }
552 inferred_type := asgn.value.typ()
553 if inferred_type != starlarkTypeUnknown {
Sasha Smundak9d011ab2021-07-09 16:00:57 -0700554 lhs.setValueType(inferred_type)
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800555 }
556 }
557 if lhs.valueType() == starlarkTypeList {
558 xConcat := ctx.buildConcatExpr(a)
559 if xConcat == nil {
560 return
561 }
562 switch len(xConcat.items) {
563 case 0:
564 asgn.value = &listExpr{}
565 case 1:
566 asgn.value = xConcat.items[0]
567 default:
568 asgn.value = xConcat
569 }
570 } else {
571 asgn.value = ctx.parseMakeString(a, a.Value)
572 if xBad, ok := asgn.value.(*badExpr); ok {
573 ctx.wrapBadExpr(xBad)
574 return
575 }
576 }
577
578 // TODO(asmundak): move evaluation to a separate pass
579 asgn.value, _ = asgn.value.eval(ctx.builtinMakeVars)
580
581 asgn.previous = ctx.lastAssignment(name)
582 ctx.setLastAssignment(name, asgn)
583 switch a.Type {
584 case "=", ":=":
585 asgn.flavor = asgnSet
586 case "+=":
587 if asgn.previous == nil && !asgn.lhs.isPreset() {
588 asgn.flavor = asgnMaybeAppend
589 } else {
590 asgn.flavor = asgnAppend
591 }
592 case "?=":
593 asgn.flavor = asgnMaybeSet
594 default:
595 panic(fmt.Errorf("unexpected assignment type %s", a.Type))
596 }
597
598 ctx.receiver.newNode(asgn)
599}
600
Sasha Smundak3deb9682021-07-26 18:42:25 -0700601func (ctx *parseContext) handleSoongNsAssignment(name string, asgn *mkparser.Assignment) {
602 val := ctx.parseMakeString(asgn, asgn.Value)
603 if xBad, ok := val.(*badExpr); ok {
604 ctx.wrapBadExpr(xBad)
605 return
606 }
607 val, _ = val.eval(ctx.builtinMakeVars)
608
609 // Unfortunately, Soong namespaces can be set up by directly setting corresponding Make
610 // variables instead of via add_soong_config_namespace + add_soong_config_var_value.
611 // Try to divine the call from the assignment as follows:
612 if name == "NAMESPACES" {
613 // Upon seeng
614 // SOONG_CONFIG_NAMESPACES += foo
615 // remember that there is a namespace `foo` and act as we saw
616 // $(call add_soong_config_namespace,foo)
617 s, ok := maybeString(val)
618 if !ok {
619 ctx.errorf(asgn, "cannot handle variables in SOONG_CONFIG_NAMESPACES assignment, please use add_soong_config_namespace instead")
620 return
621 }
622 for _, ns := range strings.Fields(s) {
623 ctx.addSoongNamespace(ns)
624 ctx.receiver.newNode(&exprNode{&callExpr{
Sasha Smundak65b547e2021-09-17 15:35:41 -0700625 name: soongConfigNamespaceOld,
Sasha Smundak3deb9682021-07-26 18:42:25 -0700626 args: []starlarkExpr{&stringLiteralExpr{ns}},
627 returnType: starlarkTypeVoid,
628 }})
629 }
630 } else {
631 // Upon seeing
632 // SOONG_CONFIG_x_y = v
633 // find a namespace called `x` and act as if we encountered
634 // $(call add_config_var_value(x,y,v)
635 // or check that `x_y` is a namespace, and then add the RHS of this assignment as variables in
636 // it.
637 // Emit an error in the ambiguous situation (namespaces `foo_bar` with a variable `baz`
638 // and `foo` with a variable `bar_baz`.
639 namespaceName := ""
640 if ctx.hasSoongNamespace(name) {
641 namespaceName = name
642 }
643 var varName string
644 for pos, ch := range name {
645 if !(ch == '_' && ctx.hasSoongNamespace(name[0:pos])) {
646 continue
647 }
648 if namespaceName != "" {
649 ctx.errorf(asgn, "ambiguous soong namespace (may be either `%s` or `%s`)", namespaceName, name[0:pos])
650 return
651 }
652 namespaceName = name[0:pos]
653 varName = name[pos+1:]
654 }
655 if namespaceName == "" {
656 ctx.errorf(asgn, "cannot figure out Soong namespace, please use add_soong_config_var_value macro instead")
657 return
658 }
659 if varName == "" {
660 // Remember variables in this namespace
661 s, ok := maybeString(val)
662 if !ok {
663 ctx.errorf(asgn, "cannot handle variables in SOONG_CONFIG_ assignment, please use add_soong_config_var_value instead")
664 return
665 }
666 ctx.updateSoongNamespace(asgn.Type != "+=", namespaceName, strings.Fields(s))
667 return
668 }
669
670 // Finally, handle assignment to a namespace variable
671 if !ctx.hasNamespaceVar(namespaceName, varName) {
672 ctx.errorf(asgn, "no %s variable in %s namespace, please use add_soong_config_var_value instead", varName, namespaceName)
673 return
674 }
Sasha Smundak65b547e2021-09-17 15:35:41 -0700675 fname := soongConfigVarSetOld
676 if asgn.Type == "+=" {
677 fname = soongConfigAppend
678 }
Sasha Smundak3deb9682021-07-26 18:42:25 -0700679 ctx.receiver.newNode(&exprNode{&callExpr{
Sasha Smundak65b547e2021-09-17 15:35:41 -0700680 name: fname,
Sasha Smundak3deb9682021-07-26 18:42:25 -0700681 args: []starlarkExpr{&stringLiteralExpr{namespaceName}, &stringLiteralExpr{varName}, val},
682 returnType: starlarkTypeVoid,
683 }})
684 }
685}
686
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800687func (ctx *parseContext) buildConcatExpr(a *mkparser.Assignment) *concatExpr {
688 xConcat := &concatExpr{}
689 var xItemList *listExpr
690 addToItemList := func(x ...starlarkExpr) {
691 if xItemList == nil {
692 xItemList = &listExpr{[]starlarkExpr{}}
693 }
694 xItemList.items = append(xItemList.items, x...)
695 }
696 finishItemList := func() {
697 if xItemList != nil {
698 xConcat.items = append(xConcat.items, xItemList)
699 xItemList = nil
700 }
701 }
702
703 items := a.Value.Words()
704 for _, item := range items {
705 // A function call in RHS is supposed to return a list, all other item
706 // expressions return individual elements.
707 switch x := ctx.parseMakeString(a, item).(type) {
708 case *badExpr:
709 ctx.wrapBadExpr(x)
710 return nil
711 case *stringLiteralExpr:
712 addToItemList(maybeConvertToStringList(x).(*listExpr).items...)
713 default:
714 switch x.typ() {
715 case starlarkTypeList:
716 finishItemList()
717 xConcat.items = append(xConcat.items, x)
718 case starlarkTypeString:
719 finishItemList()
720 xConcat.items = append(xConcat.items, &callExpr{
721 object: x,
722 name: "split",
723 args: nil,
724 returnType: starlarkTypeList,
725 })
726 default:
727 addToItemList(x)
728 }
729 }
730 }
731 if xItemList != nil {
732 xConcat.items = append(xConcat.items, xItemList)
733 }
734 return xConcat
735}
736
Sasha Smundak6609ba72021-07-22 18:32:56 -0700737func (ctx *parseContext) newDependentModule(path string, optional bool) *moduleInfo {
738 modulePath := ctx.loadedModulePath(path)
739 if mi, ok := ctx.dependentModules[modulePath]; ok {
Sasha Smundak868c5e32021-09-23 16:20:58 -0700740 mi.optional = mi.optional && optional
Sasha Smundak6609ba72021-07-22 18:32:56 -0700741 return mi
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800742 }
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800743 moduleName := moduleNameForFile(path)
744 moduleLocalName := "_" + moduleName
745 n, found := ctx.moduleNameCount[moduleName]
746 if found {
747 moduleLocalName += fmt.Sprintf("%d", n)
748 }
749 ctx.moduleNameCount[moduleName] = n + 1
Sasha Smundak6609ba72021-07-22 18:32:56 -0700750 mi := &moduleInfo{
751 path: modulePath,
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800752 originalPath: path,
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800753 moduleLocalName: moduleLocalName,
Sasha Smundak6609ba72021-07-22 18:32:56 -0700754 optional: optional,
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800755 }
Sasha Smundak6609ba72021-07-22 18:32:56 -0700756 ctx.dependentModules[modulePath] = mi
757 ctx.script.inherited = append(ctx.script.inherited, mi)
758 return mi
759}
760
761func (ctx *parseContext) handleSubConfig(
762 v mkparser.Node, pathExpr starlarkExpr, loadAlways bool, processModule func(inheritedModule)) {
763 pathExpr, _ = pathExpr.eval(ctx.builtinMakeVars)
764
765 // In a simple case, the name of a module to inherit/include is known statically.
766 if path, ok := maybeString(pathExpr); ok {
Sasha Smundak868c5e32021-09-23 16:20:58 -0700767 // Note that even if this directive loads a module unconditionally, a module may be
768 // absent without causing any harm if this directive is inside an if/else block.
769 moduleShouldExist := loadAlways && ctx.ifNestLevel == 0
Sasha Smundak6609ba72021-07-22 18:32:56 -0700770 if strings.Contains(path, "*") {
771 if paths, err := fs.Glob(ctx.script.sourceFS, path); err == nil {
772 for _, p := range paths {
Sasha Smundak868c5e32021-09-23 16:20:58 -0700773 mi := ctx.newDependentModule(p, !moduleShouldExist)
774 processModule(inheritedStaticModule{mi, loadAlways})
Sasha Smundak6609ba72021-07-22 18:32:56 -0700775 }
776 } else {
777 ctx.errorf(v, "cannot glob wildcard argument")
778 }
779 } else {
Sasha Smundak868c5e32021-09-23 16:20:58 -0700780 mi := ctx.newDependentModule(path, !moduleShouldExist)
781 processModule(inheritedStaticModule{mi, loadAlways})
Sasha Smundak6609ba72021-07-22 18:32:56 -0700782 }
783 return
784 }
785
786 // If module path references variables (e.g., $(v1)/foo/$(v2)/device-config.mk), find all the paths in the
787 // source tree that may be a match and the corresponding variable values. For instance, if the source tree
788 // contains vendor1/foo/abc/dev.mk and vendor2/foo/def/dev.mk, the first one will be inherited when
789 // (v1, v2) == ('vendor1', 'abc'), and the second one when (v1, v2) == ('vendor2', 'def').
790 // We then emit the code that loads all of them, e.g.:
791 // load("//vendor1/foo/abc:dev.rbc", _dev1_init="init")
792 // load("//vendor2/foo/def/dev.rbc", _dev2_init="init")
793 // And then inherit it as follows:
794 // _e = {
795 // "vendor1/foo/abc/dev.mk": ("vendor1/foo/abc/dev", _dev1_init),
796 // "vendor2/foo/def/dev.mk": ("vendor2/foo/def/dev", _dev_init2) }.get("%s/foo/%s/dev.mk" % (v1, v2))
797 // if _e:
798 // rblf.inherit(handle, _e[0], _e[1])
799 //
800 var matchingPaths []string
801 varPath, ok := pathExpr.(*interpolateExpr)
802 if !ok {
803 ctx.errorf(v, "inherit-product/include argument is too complex")
804 return
805 }
806
807 pathPattern := []string{varPath.chunks[0]}
808 for _, chunk := range varPath.chunks[1:] {
809 if chunk != "" {
810 pathPattern = append(pathPattern, chunk)
811 }
812 }
813 if pathPattern[0] != "" {
814 matchingPaths = ctx.findMatchingPaths(pathPattern)
815 } else {
816 // Heuristics -- if pattern starts from top, restrict it to the directories where
Sasha Smundak90be8c52021-08-03 11:06:10 -0700817 // we know inherit-product uses dynamically calculated path. Restrict it even further
818 // for certain path which would yield too many useless matches
819 if len(varPath.chunks) == 2 && varPath.chunks[1] == "/BoardConfigVendor.mk" {
820 pathPattern[0] = "vendor/google_devices"
821 matchingPaths = ctx.findMatchingPaths(pathPattern)
822 } else {
823 for _, t := range []string{"vendor/qcom", "vendor/google_devices"} {
824 pathPattern[0] = t
825 matchingPaths = append(matchingPaths, ctx.findMatchingPaths(pathPattern)...)
826 }
Sasha Smundak6609ba72021-07-22 18:32:56 -0700827 }
828 }
829 // Safeguard against $(call inherit-product,$(PRODUCT_PATH))
Sasha Smundak90be8c52021-08-03 11:06:10 -0700830 const maxMatchingFiles = 150
Sasha Smundak6609ba72021-07-22 18:32:56 -0700831 if len(matchingPaths) > maxMatchingFiles {
832 ctx.errorf(v, "there are >%d files matching the pattern, please rewrite it", maxMatchingFiles)
833 return
834 }
835 res := inheritedDynamicModule{*varPath, []*moduleInfo{}, loadAlways}
836 for _, p := range matchingPaths {
837 // A product configuration files discovered dynamically may attempt to inherit
838 // from another one which does not exist in this source tree. Prevent load errors
839 // by always loading the dynamic files as optional.
840 res.candidateModules = append(res.candidateModules, ctx.newDependentModule(p, true))
841 }
842 processModule(res)
843}
844
845func (ctx *parseContext) findMatchingPaths(pattern []string) []string {
846 files := ctx.script.makefileFinder.Find(ctx.script.topDir)
847 if len(pattern) == 0 {
848 return files
849 }
850
851 // Create regular expression from the pattern
852 s_regexp := "^" + regexp.QuoteMeta(pattern[0])
853 for _, s := range pattern[1:] {
854 s_regexp += ".*" + regexp.QuoteMeta(s)
855 }
856 s_regexp += "$"
857 rex := regexp.MustCompile(s_regexp)
858
859 // Now match
860 var res []string
861 for _, p := range files {
862 if rex.MatchString(p) {
863 res = append(res, p)
864 }
865 }
866 return res
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800867}
868
869func (ctx *parseContext) handleInheritModule(v mkparser.Node, pathExpr starlarkExpr, loadAlways bool) {
Sasha Smundak6609ba72021-07-22 18:32:56 -0700870 ctx.handleSubConfig(v, pathExpr, loadAlways, func(im inheritedModule) {
Sasha Smundak868c5e32021-09-23 16:20:58 -0700871 ctx.receiver.newNode(&inheritNode{im, loadAlways})
Sasha Smundak6609ba72021-07-22 18:32:56 -0700872 })
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800873}
874
875func (ctx *parseContext) handleInclude(v mkparser.Node, pathExpr starlarkExpr, loadAlways bool) {
Sasha Smundak6609ba72021-07-22 18:32:56 -0700876 ctx.handleSubConfig(v, pathExpr, loadAlways, func(im inheritedModule) {
Sasha Smundak868c5e32021-09-23 16:20:58 -0700877 ctx.receiver.newNode(&includeNode{im, loadAlways})
Sasha Smundak6609ba72021-07-22 18:32:56 -0700878 })
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800879}
880
881func (ctx *parseContext) handleVariable(v *mkparser.Variable) {
882 // Handle:
883 // $(call inherit-product,...)
884 // $(call inherit-product-if-exists,...)
885 // $(info xxx)
886 // $(warning xxx)
887 // $(error xxx)
888 expr := ctx.parseReference(v, v.Name)
889 switch x := expr.(type) {
890 case *callExpr:
891 if x.name == callLoadAlways || x.name == callLoadIf {
892 ctx.handleInheritModule(v, x.args[0], x.name == callLoadAlways)
893 } else if isMakeControlFunc(x.name) {
894 // File name is the first argument
895 args := []starlarkExpr{
896 &stringLiteralExpr{ctx.script.mkFile},
897 x.args[0],
898 }
899 ctx.receiver.newNode(&exprNode{
900 &callExpr{name: x.name, args: args, returnType: starlarkTypeUnknown},
901 })
902 } else {
903 ctx.receiver.newNode(&exprNode{expr})
904 }
905 case *badExpr:
906 ctx.wrapBadExpr(x)
907 return
908 default:
909 ctx.errorf(v, "cannot handle %s", v.Dump())
910 return
911 }
912}
913
914func (ctx *parseContext) handleDefine(directive *mkparser.Directive) {
Sasha Smundakf3e072a2021-07-14 12:50:28 -0700915 macro_name := strings.Fields(directive.Args.Strings[0])[0]
916 // Ignore the macros that we handle
917 if _, ok := knownFunctions[macro_name]; !ok {
918 ctx.errorf(directive, "define is not supported: %s", macro_name)
919 }
Sasha Smundakb051c4e2020-11-05 20:45:07 -0800920}
921
922func (ctx *parseContext) handleIfBlock(ifDirective *mkparser.Directive) {
923 ssSwitch := &switchNode{}
924 ctx.pushReceiver(ssSwitch)
925 for ctx.processBranch(ifDirective); ctx.hasNodes() && ctx.fatalError == nil; {
926 node := ctx.getNode()
927 switch x := node.(type) {
928 case *mkparser.Directive:
929 switch x.Name {
930 case "else", "elifdef", "elifndef", "elifeq", "elifneq":
931 ctx.processBranch(x)
932 case "endif":
933 ctx.popReceiver()
934 ctx.receiver.newNode(ssSwitch)
935 return
936 default:
937 ctx.errorf(node, "unexpected directive %s", x.Name)
938 }
939 default:
940 ctx.errorf(ifDirective, "unexpected statement")
941 }
942 }
943 if ctx.fatalError == nil {
944 ctx.fatalError = fmt.Errorf("no matching endif for %s", ifDirective.Dump())
945 }
946 ctx.popReceiver()
947}
948
949// processBranch processes a single branch (if/elseif/else) until the next directive
950// on the same level.
951func (ctx *parseContext) processBranch(check *mkparser.Directive) {
952 block := switchCase{gate: ctx.parseCondition(check)}
953 defer func() {
954 ctx.popVarAssignments()
955 ctx.ifNestLevel--
956
957 }()
958 ctx.pushVarAssignments()
959 ctx.ifNestLevel++
960
961 ctx.pushReceiver(&block)
962 for ctx.hasNodes() {
963 node := ctx.getNode()
964 if ctx.handleSimpleStatement(node) {
965 continue
966 }
967 switch d := node.(type) {
968 case *mkparser.Directive:
969 switch d.Name {
970 case "else", "elifdef", "elifndef", "elifeq", "elifneq", "endif":
971 ctx.popReceiver()
972 ctx.receiver.newNode(&block)
973 ctx.backNode()
974 return
975 case "ifdef", "ifndef", "ifeq", "ifneq":
976 ctx.handleIfBlock(d)
977 default:
978 ctx.errorf(d, "unexpected directive %s", d.Name)
979 }
980 default:
981 ctx.errorf(node, "unexpected statement")
982 }
983 }
984 ctx.fatalError = fmt.Errorf("no matching endif for %s", check.Dump())
985 ctx.popReceiver()
986}
987
988func (ctx *parseContext) newIfDefinedNode(check *mkparser.Directive) (starlarkExpr, bool) {
989 if !check.Args.Const() {
990 return ctx.newBadExpr(check, "ifdef variable ref too complex: %s", check.Args.Dump()), false
991 }
992 v := ctx.addVariable(check.Args.Strings[0])
993 return &variableDefinedExpr{v}, true
994}
995
996func (ctx *parseContext) parseCondition(check *mkparser.Directive) starlarkNode {
997 switch check.Name {
998 case "ifdef", "ifndef", "elifdef", "elifndef":
999 v, ok := ctx.newIfDefinedNode(check)
1000 if ok && strings.HasSuffix(check.Name, "ndef") {
1001 v = &notExpr{v}
1002 }
1003 return &ifNode{
1004 isElif: strings.HasPrefix(check.Name, "elif"),
1005 expr: v,
1006 }
1007 case "ifeq", "ifneq", "elifeq", "elifneq":
1008 return &ifNode{
1009 isElif: strings.HasPrefix(check.Name, "elif"),
1010 expr: ctx.parseCompare(check),
1011 }
1012 case "else":
1013 return &elseNode{}
1014 default:
1015 panic(fmt.Errorf("%s: unknown directive: %s", ctx.script.mkFile, check.Dump()))
1016 }
1017}
1018
1019func (ctx *parseContext) newBadExpr(node mkparser.Node, text string, args ...interface{}) starlarkExpr {
1020 message := fmt.Sprintf(text, args...)
1021 if ctx.errorLogger != nil {
1022 ctx.errorLogger.NewError(text, node, args)
1023 }
1024 ctx.script.hasErrors = true
1025 return &badExpr{node, message}
1026}
1027
1028func (ctx *parseContext) parseCompare(cond *mkparser.Directive) starlarkExpr {
1029 // Strip outer parentheses
1030 mkArg := cloneMakeString(cond.Args)
1031 mkArg.Strings[0] = strings.TrimLeft(mkArg.Strings[0], "( ")
1032 n := len(mkArg.Strings)
1033 mkArg.Strings[n-1] = strings.TrimRight(mkArg.Strings[n-1], ") ")
1034 args := mkArg.Split(",")
1035 // TODO(asmundak): handle the case where the arguments are in quotes and space-separated
1036 if len(args) != 2 {
1037 return ctx.newBadExpr(cond, "ifeq/ifneq len(args) != 2 %s", cond.Dump())
1038 }
1039 args[0].TrimRightSpaces()
1040 args[1].TrimLeftSpaces()
1041
1042 isEq := !strings.HasSuffix(cond.Name, "neq")
1043 switch xLeft := ctx.parseMakeString(cond, args[0]).(type) {
1044 case *stringLiteralExpr, *variableRefExpr:
1045 switch xRight := ctx.parseMakeString(cond, args[1]).(type) {
1046 case *stringLiteralExpr, *variableRefExpr:
1047 return &eqExpr{left: xLeft, right: xRight, isEq: isEq}
1048 case *badExpr:
1049 return xRight
1050 default:
1051 expr, ok := ctx.parseCheckFunctionCallResult(cond, xLeft, args[1])
1052 if ok {
1053 return expr
1054 }
1055 return ctx.newBadExpr(cond, "right operand is too complex: %s", args[1].Dump())
1056 }
1057 case *badExpr:
1058 return xLeft
1059 default:
1060 switch xRight := ctx.parseMakeString(cond, args[1]).(type) {
1061 case *stringLiteralExpr, *variableRefExpr:
1062 expr, ok := ctx.parseCheckFunctionCallResult(cond, xRight, args[0])
1063 if ok {
1064 return expr
1065 }
1066 return ctx.newBadExpr(cond, "left operand is too complex: %s", args[0].Dump())
1067 case *badExpr:
1068 return xRight
1069 default:
1070 return ctx.newBadExpr(cond, "operands are too complex: (%s,%s)", args[0].Dump(), args[1].Dump())
1071 }
1072 }
1073}
1074
1075func (ctx *parseContext) parseCheckFunctionCallResult(directive *mkparser.Directive, xValue starlarkExpr,
1076 varArg *mkparser.MakeString) (starlarkExpr, bool) {
1077 mkSingleVar, ok := varArg.SingleVariable()
1078 if !ok {
1079 return nil, false
1080 }
1081 expr := ctx.parseReference(directive, mkSingleVar)
1082 negate := strings.HasSuffix(directive.Name, "neq")
1083 checkIsSomethingFunction := func(xCall *callExpr) starlarkExpr {
1084 s, ok := maybeString(xValue)
1085 if !ok || s != "true" {
1086 return ctx.newBadExpr(directive,
1087 fmt.Sprintf("the result of %s can be compared only to 'true'", xCall.name))
1088 }
1089 if len(xCall.args) < 1 {
1090 return ctx.newBadExpr(directive, "%s requires an argument", xCall.name)
1091 }
1092 return nil
1093 }
1094 switch x := expr.(type) {
1095 case *callExpr:
1096 switch x.name {
1097 case "filter":
1098 return ctx.parseCompareFilterFuncResult(directive, x, xValue, !negate), true
1099 case "filter-out":
1100 return ctx.parseCompareFilterFuncResult(directive, x, xValue, negate), true
1101 case "wildcard":
1102 return ctx.parseCompareWildcardFuncResult(directive, x, xValue, negate), true
1103 case "findstring":
1104 return ctx.parseCheckFindstringFuncResult(directive, x, xValue, negate), true
1105 case "strip":
1106 return ctx.parseCompareStripFuncResult(directive, x, xValue, negate), true
1107 case "is-board-platform":
1108 if xBad := checkIsSomethingFunction(x); xBad != nil {
1109 return xBad, true
1110 }
1111 return &eqExpr{
1112 left: &variableRefExpr{ctx.addVariable("TARGET_BOARD_PLATFORM"), false},
1113 right: x.args[0],
1114 isEq: !negate,
1115 }, true
1116 case "is-board-platform-in-list":
1117 if xBad := checkIsSomethingFunction(x); xBad != nil {
1118 return xBad, true
1119 }
1120 return &inExpr{
1121 expr: &variableRefExpr{ctx.addVariable("TARGET_BOARD_PLATFORM"), false},
1122 list: maybeConvertToStringList(x.args[0]),
1123 isNot: negate,
1124 }, true
1125 case "is-product-in-list":
1126 if xBad := checkIsSomethingFunction(x); xBad != nil {
1127 return xBad, true
1128 }
1129 return &inExpr{
1130 expr: &variableRefExpr{ctx.addVariable("TARGET_PRODUCT"), true},
1131 list: maybeConvertToStringList(x.args[0]),
1132 isNot: negate,
1133 }, true
1134 case "is-vendor-board-platform":
1135 if xBad := checkIsSomethingFunction(x); xBad != nil {
1136 return xBad, true
1137 }
1138 s, ok := maybeString(x.args[0])
1139 if !ok {
1140 return ctx.newBadExpr(directive, "cannot handle non-constant argument to is-vendor-board-platform"), true
1141 }
1142 return &inExpr{
1143 expr: &variableRefExpr{ctx.addVariable("TARGET_BOARD_PLATFORM"), false},
1144 list: &variableRefExpr{ctx.addVariable(s + "_BOARD_PLATFORMS"), true},
1145 isNot: negate,
1146 }, true
1147 default:
1148 return ctx.newBadExpr(directive, "Unknown function in ifeq: %s", x.name), true
1149 }
1150 case *badExpr:
1151 return x, true
1152 default:
1153 return nil, false
1154 }
1155}
1156
1157func (ctx *parseContext) parseCompareFilterFuncResult(cond *mkparser.Directive,
1158 filterFuncCall *callExpr, xValue starlarkExpr, negate bool) starlarkExpr {
1159 // We handle:
Sasha Smundak0554d762021-07-08 18:26:12 -07001160 // * ifeq/ifneq (,$(filter v1 v2 ..., EXPR) becomes if EXPR not in/in ["v1", "v2", ...]
1161 // * ifeq/ifneq (,$(filter EXPR, v1 v2 ...) becomes if EXPR not in/in ["v1", "v2", ...]
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001162 // * ifeq/ifneq ($(VAR),$(filter $(VAR), v1 v2 ...) becomes if VAR in/not in ["v1", "v2"]
1163 // TODO(Asmundak): check the last case works for filter-out, too.
1164 xPattern := filterFuncCall.args[0]
1165 xText := filterFuncCall.args[1]
1166 var xInList *stringLiteralExpr
Sasha Smundak0554d762021-07-08 18:26:12 -07001167 var expr starlarkExpr
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001168 var ok bool
1169 switch x := xValue.(type) {
1170 case *stringLiteralExpr:
1171 if x.literal != "" {
1172 return ctx.newBadExpr(cond, "filter comparison to non-empty value: %s", xValue)
1173 }
1174 // Either pattern or text should be const, and the
1175 // non-const one should be varRefExpr
Sasha Smundak5f463be2021-09-15 18:43:36 -07001176 if xInList, ok = xPattern.(*stringLiteralExpr); ok && !strings.ContainsRune(xInList.literal, '%') && xText.typ() == starlarkTypeList {
Sasha Smundak0554d762021-07-08 18:26:12 -07001177 expr = xText
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001178 } else if xInList, ok = xText.(*stringLiteralExpr); ok {
Sasha Smundak0554d762021-07-08 18:26:12 -07001179 expr = xPattern
1180 } else {
Sasha Smundak5f463be2021-09-15 18:43:36 -07001181 expr = &callExpr{
Sasha Smundak0554d762021-07-08 18:26:12 -07001182 object: nil,
1183 name: filterFuncCall.name,
1184 args: filterFuncCall.args,
1185 returnType: starlarkTypeBool,
1186 }
Sasha Smundak5f463be2021-09-15 18:43:36 -07001187 if negate {
1188 expr = &notExpr{expr: expr}
1189 }
1190 return expr
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001191 }
1192 case *variableRefExpr:
1193 if v, ok := xPattern.(*variableRefExpr); ok {
1194 if xInList, ok = xText.(*stringLiteralExpr); ok && v.ref.name() == x.ref.name() {
1195 // ifeq/ifneq ($(VAR),$(filter $(VAR), v1 v2 ...), flip negate,
1196 // it's the opposite to what is done when comparing to empty.
Sasha Smundak0554d762021-07-08 18:26:12 -07001197 expr = xPattern
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001198 negate = !negate
1199 }
1200 }
1201 }
Sasha Smundak0554d762021-07-08 18:26:12 -07001202 if expr != nil && xInList != nil {
1203 slExpr := newStringListExpr(strings.Fields(xInList.literal))
1204 // Generate simpler code for the common cases:
1205 if expr.typ() == starlarkTypeList {
1206 if len(slExpr.items) == 1 {
1207 // Checking that a string belongs to list
1208 return &inExpr{isNot: negate, list: expr, expr: slExpr.items[0]}
1209 } else {
1210 // TODO(asmundak):
1211 panic("TBD")
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001212 }
Sasha Smundak0554d762021-07-08 18:26:12 -07001213 } else if len(slExpr.items) == 1 {
1214 return &eqExpr{left: expr, right: slExpr.items[0], isEq: !negate}
1215 } else {
1216 return &inExpr{isNot: negate, list: newStringListExpr(strings.Fields(xInList.literal)), expr: expr}
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001217 }
1218 }
1219 return ctx.newBadExpr(cond, "filter arguments are too complex: %s", cond.Dump())
1220}
1221
1222func (ctx *parseContext) parseCompareWildcardFuncResult(directive *mkparser.Directive,
1223 xCall *callExpr, xValue starlarkExpr, negate bool) starlarkExpr {
Sasha Smundak0554d762021-07-08 18:26:12 -07001224 if !isEmptyString(xValue) {
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001225 return ctx.newBadExpr(directive, "wildcard result can be compared only to empty: %s", xValue)
1226 }
1227 callFunc := wildcardExistsPhony
1228 if s, ok := xCall.args[0].(*stringLiteralExpr); ok && !strings.ContainsAny(s.literal, "*?{[") {
1229 callFunc = fileExistsPhony
1230 }
1231 var cc starlarkExpr = &callExpr{name: callFunc, args: xCall.args, returnType: starlarkTypeBool}
1232 if !negate {
1233 cc = &notExpr{cc}
1234 }
1235 return cc
1236}
1237
1238func (ctx *parseContext) parseCheckFindstringFuncResult(directive *mkparser.Directive,
1239 xCall *callExpr, xValue starlarkExpr, negate bool) starlarkExpr {
Sasha Smundak0554d762021-07-08 18:26:12 -07001240 if isEmptyString(xValue) {
1241 return &eqExpr{
1242 left: &callExpr{
1243 object: xCall.args[1],
1244 name: "find",
1245 args: []starlarkExpr{xCall.args[0]},
1246 returnType: starlarkTypeInt,
1247 },
1248 right: &intLiteralExpr{-1},
1249 isEq: !negate,
1250 }
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001251 }
Sasha Smundak0554d762021-07-08 18:26:12 -07001252 return ctx.newBadExpr(directive, "findstring result can be compared only to empty: %s", xValue)
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001253}
1254
1255func (ctx *parseContext) parseCompareStripFuncResult(directive *mkparser.Directive,
1256 xCall *callExpr, xValue starlarkExpr, negate bool) starlarkExpr {
1257 if _, ok := xValue.(*stringLiteralExpr); !ok {
1258 return ctx.newBadExpr(directive, "strip result can be compared only to string: %s", xValue)
1259 }
1260 return &eqExpr{
1261 left: &callExpr{
1262 name: "strip",
1263 args: xCall.args,
1264 returnType: starlarkTypeString,
1265 },
1266 right: xValue, isEq: !negate}
1267}
1268
1269// parses $(...), returning an expression
1270func (ctx *parseContext) parseReference(node mkparser.Node, ref *mkparser.MakeString) starlarkExpr {
1271 ref.TrimLeftSpaces()
1272 ref.TrimRightSpaces()
1273 refDump := ref.Dump()
1274
1275 // Handle only the case where the first (or only) word is constant
1276 words := ref.SplitN(" ", 2)
1277 if !words[0].Const() {
1278 return ctx.newBadExpr(node, "reference is too complex: %s", refDump)
1279 }
1280
1281 // If it is a single word, it can be a simple variable
1282 // reference or a function call
1283 if len(words) == 1 {
1284 if isMakeControlFunc(refDump) || refDump == "shell" {
1285 return &callExpr{
1286 name: refDump,
1287 args: []starlarkExpr{&stringLiteralExpr{""}},
1288 returnType: starlarkTypeUnknown,
1289 }
1290 }
Sasha Smundak65b547e2021-09-17 15:35:41 -07001291 if strings.HasPrefix(refDump, soongNsPrefix) {
1292 // TODO (asmundak): if we find many, maybe handle them.
1293 return ctx.newBadExpr(node, "SOONG_CONFIG_ variables cannot be referenced: %s", refDump)
1294 }
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001295 if v := ctx.addVariable(refDump); v != nil {
1296 return &variableRefExpr{v, ctx.lastAssignment(v.name()) != nil}
1297 }
1298 return ctx.newBadExpr(node, "unknown variable %s", refDump)
1299 }
1300
1301 expr := &callExpr{name: words[0].Dump(), returnType: starlarkTypeUnknown}
1302 args := words[1]
1303 args.TrimLeftSpaces()
1304 // Make control functions and shell need special treatment as everything
1305 // after the name is a single text argument
1306 if isMakeControlFunc(expr.name) || expr.name == "shell" {
1307 x := ctx.parseMakeString(node, args)
1308 if xBad, ok := x.(*badExpr); ok {
1309 return xBad
1310 }
1311 expr.args = []starlarkExpr{x}
1312 return expr
1313 }
1314 if expr.name == "call" {
1315 words = args.SplitN(",", 2)
1316 if words[0].Empty() || !words[0].Const() {
Sasha Smundakf2c9f8b2021-07-27 10:44:48 -07001317 return ctx.newBadExpr(node, "cannot handle %s", refDump)
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001318 }
1319 expr.name = words[0].Dump()
1320 if len(words) < 2 {
Sasha Smundak6609ba72021-07-22 18:32:56 -07001321 args = &mkparser.MakeString{}
1322 } else {
1323 args = words[1]
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001324 }
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001325 }
1326 if kf, found := knownFunctions[expr.name]; found {
1327 expr.returnType = kf.returnType
1328 } else {
1329 return ctx.newBadExpr(node, "cannot handle invoking %s", expr.name)
1330 }
1331 switch expr.name {
1332 case "word":
1333 return ctx.parseWordFunc(node, args)
Sasha Smundak16e07732021-07-23 11:38:23 -07001334 case "firstword", "lastword":
1335 return ctx.parseFirstOrLastwordFunc(node, expr.name, args)
Sasha Smundak6609ba72021-07-22 18:32:56 -07001336 case "my-dir":
1337 return &variableRefExpr{ctx.addVariable("LOCAL_PATH"), true}
Sasha Smundak94b41c72021-07-12 18:30:42 -07001338 case "subst", "patsubst":
1339 return ctx.parseSubstFunc(node, expr.name, args)
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001340 default:
1341 for _, arg := range args.Split(",") {
1342 arg.TrimLeftSpaces()
1343 arg.TrimRightSpaces()
1344 x := ctx.parseMakeString(node, arg)
1345 if xBad, ok := x.(*badExpr); ok {
1346 return xBad
1347 }
1348 expr.args = append(expr.args, x)
1349 }
1350 }
1351 return expr
1352}
1353
Sasha Smundak94b41c72021-07-12 18:30:42 -07001354func (ctx *parseContext) parseSubstFunc(node mkparser.Node, fname string, args *mkparser.MakeString) starlarkExpr {
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001355 words := args.Split(",")
1356 if len(words) != 3 {
Sasha Smundak94b41c72021-07-12 18:30:42 -07001357 return ctx.newBadExpr(node, "%s function should have 3 arguments", fname)
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001358 }
1359 if !words[0].Const() || !words[1].Const() {
Sasha Smundak94b41c72021-07-12 18:30:42 -07001360 return ctx.newBadExpr(node, "%s function's from and to arguments should be constant", fname)
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001361 }
1362 from := words[0].Strings[0]
1363 to := words[1].Strings[0]
1364 words[2].TrimLeftSpaces()
1365 words[2].TrimRightSpaces()
1366 obj := ctx.parseMakeString(node, words[2])
Sasha Smundak9d011ab2021-07-09 16:00:57 -07001367 typ := obj.typ()
Sasha Smundak94b41c72021-07-12 18:30:42 -07001368 if typ == starlarkTypeString && fname == "subst" {
1369 // Optimization: if it's $(subst from, to, string), emit string.replace(from, to)
Sasha Smundak9d011ab2021-07-09 16:00:57 -07001370 return &callExpr{
1371 object: obj,
1372 name: "replace",
1373 args: []starlarkExpr{&stringLiteralExpr{from}, &stringLiteralExpr{to}},
1374 returnType: typ,
1375 }
1376 }
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001377 return &callExpr{
Sasha Smundak94b41c72021-07-12 18:30:42 -07001378 name: fname,
Sasha Smundak9d011ab2021-07-09 16:00:57 -07001379 args: []starlarkExpr{&stringLiteralExpr{from}, &stringLiteralExpr{to}, obj},
1380 returnType: obj.typ(),
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001381 }
1382}
1383
1384func (ctx *parseContext) parseWordFunc(node mkparser.Node, args *mkparser.MakeString) starlarkExpr {
1385 words := args.Split(",")
1386 if len(words) != 2 {
1387 return ctx.newBadExpr(node, "word function should have 2 arguments")
1388 }
1389 var index uint64 = 0
1390 if words[0].Const() {
1391 index, _ = strconv.ParseUint(strings.TrimSpace(words[0].Strings[0]), 10, 64)
1392 }
1393 if index < 1 {
1394 return ctx.newBadExpr(node, "word index should be constant positive integer")
1395 }
1396 words[1].TrimLeftSpaces()
1397 words[1].TrimRightSpaces()
1398 array := ctx.parseMakeString(node, words[1])
1399 if xBad, ok := array.(*badExpr); ok {
1400 return xBad
1401 }
1402 if array.typ() != starlarkTypeList {
1403 array = &callExpr{object: array, name: "split", returnType: starlarkTypeList}
1404 }
1405 return indexExpr{array, &intLiteralExpr{int(index - 1)}}
1406}
1407
Sasha Smundak16e07732021-07-23 11:38:23 -07001408func (ctx *parseContext) parseFirstOrLastwordFunc(node mkparser.Node, name string, args *mkparser.MakeString) starlarkExpr {
1409 arg := ctx.parseMakeString(node, args)
1410 if bad, ok := arg.(*badExpr); ok {
1411 return bad
1412 }
1413 index := &intLiteralExpr{0}
1414 if name == "lastword" {
1415 if v, ok := arg.(*variableRefExpr); ok && v.ref.name() == "MAKEFILE_LIST" {
1416 return &stringLiteralExpr{ctx.script.mkFile}
1417 }
1418 index.literal = -1
1419 }
1420 if arg.typ() == starlarkTypeList {
1421 return &indexExpr{arg, index}
1422 }
1423 return &indexExpr{&callExpr{object: arg, name: "split", returnType: starlarkTypeList}, index}
1424}
1425
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001426func (ctx *parseContext) parseMakeString(node mkparser.Node, mk *mkparser.MakeString) starlarkExpr {
1427 if mk.Const() {
1428 return &stringLiteralExpr{mk.Dump()}
1429 }
1430 if mkRef, ok := mk.SingleVariable(); ok {
1431 return ctx.parseReference(node, mkRef)
1432 }
1433 // If we reached here, it's neither string literal nor a simple variable,
1434 // we need a full-blown interpolation node that will generate
1435 // "a%b%c" % (X, Y) for a$(X)b$(Y)c
1436 xInterp := &interpolateExpr{args: make([]starlarkExpr, len(mk.Variables))}
1437 for i, ref := range mk.Variables {
1438 arg := ctx.parseReference(node, ref.Name)
1439 if x, ok := arg.(*badExpr); ok {
1440 return x
1441 }
1442 xInterp.args[i] = arg
1443 }
1444 xInterp.chunks = append(xInterp.chunks, mk.Strings...)
1445 return xInterp
1446}
1447
1448// Handles the statements whose treatment is the same in all contexts: comment,
1449// assignment, variable (which is a macro call in reality) and all constructs that
1450// do not handle in any context ('define directive and any unrecognized stuff).
1451// Return true if we handled it.
1452func (ctx *parseContext) handleSimpleStatement(node mkparser.Node) bool {
1453 handled := true
1454 switch x := node.(type) {
1455 case *mkparser.Comment:
1456 ctx.insertComment("#" + x.Comment)
1457 case *mkparser.Assignment:
1458 ctx.handleAssignment(x)
1459 case *mkparser.Variable:
1460 ctx.handleVariable(x)
1461 case *mkparser.Directive:
1462 switch x.Name {
1463 case "define":
1464 ctx.handleDefine(x)
1465 case "include", "-include":
1466 ctx.handleInclude(node, ctx.parseMakeString(node, x.Args), x.Name[0] != '-')
1467 default:
1468 handled = false
1469 }
1470 default:
1471 ctx.errorf(x, "unsupported line %s", x.Dump())
1472 }
1473 return handled
1474}
1475
1476func (ctx *parseContext) insertComment(s string) {
1477 ctx.receiver.newNode(&commentNode{strings.TrimSpace(s)})
1478}
1479
1480func (ctx *parseContext) carryAsComment(failedNode mkparser.Node) {
1481 for _, line := range strings.Split(failedNode.Dump(), "\n") {
1482 ctx.insertComment("# " + line)
1483 }
1484}
1485
1486// records that the given node failed to be converted and includes an explanatory message
1487func (ctx *parseContext) errorf(failedNode mkparser.Node, message string, args ...interface{}) {
1488 if ctx.errorLogger != nil {
1489 ctx.errorLogger.NewError(message, failedNode, args...)
1490 }
1491 message = fmt.Sprintf(message, args...)
1492 ctx.insertComment(fmt.Sprintf("# MK2RBC TRANSLATION ERROR: %s", message))
1493 ctx.carryAsComment(failedNode)
1494 ctx.script.hasErrors = true
1495}
1496
1497func (ctx *parseContext) wrapBadExpr(xBad *badExpr) {
1498 ctx.insertComment(fmt.Sprintf("# MK2RBC TRANSLATION ERROR: %s", xBad.message))
1499 ctx.carryAsComment(xBad.node)
1500}
1501
1502func (ctx *parseContext) loadedModulePath(path string) string {
1503 // During the transition to Roboleaf some of the product configuration files
1504 // will be converted and checked in while the others will be generated on the fly
1505 // and run. The runner (rbcrun application) accommodates this by allowing three
1506 // different ways to specify the loaded file location:
1507 // 1) load(":<file>",...) loads <file> from the same directory
1508 // 2) load("//path/relative/to/source/root:<file>", ...) loads <file> source tree
1509 // 3) load("/absolute/path/to/<file> absolute path
1510 // If the file being generated and the file it wants to load are in the same directory,
1511 // generate option 1.
1512 // Otherwise, if output directory is not specified, generate 2)
1513 // Finally, if output directory has been specified and the file being generated and
1514 // the file it wants to load from are in the different directories, generate 2) or 3):
1515 // * if the file being loaded exists in the source tree, generate 2)
1516 // * otherwise, generate 3)
1517 // Finally, figure out the loaded module path and name and create a node for it
1518 loadedModuleDir := filepath.Dir(path)
1519 base := filepath.Base(path)
1520 loadedModuleName := strings.TrimSuffix(base, filepath.Ext(base)) + ctx.outputSuffix
1521 if loadedModuleDir == filepath.Dir(ctx.script.mkFile) {
1522 return ":" + loadedModuleName
1523 }
1524 if ctx.outputDir == "" {
1525 return fmt.Sprintf("//%s:%s", loadedModuleDir, loadedModuleName)
1526 }
1527 if _, err := os.Stat(filepath.Join(loadedModuleDir, loadedModuleName)); err == nil {
1528 return fmt.Sprintf("//%s:%s", loadedModuleDir, loadedModuleName)
1529 }
1530 return filepath.Join(ctx.outputDir, loadedModuleDir, loadedModuleName)
1531}
1532
Sasha Smundak3deb9682021-07-26 18:42:25 -07001533func (ctx *parseContext) addSoongNamespace(ns string) {
1534 if _, ok := ctx.soongNamespaces[ns]; ok {
1535 return
1536 }
1537 ctx.soongNamespaces[ns] = make(map[string]bool)
1538}
1539
1540func (ctx *parseContext) hasSoongNamespace(name string) bool {
1541 _, ok := ctx.soongNamespaces[name]
1542 return ok
1543}
1544
1545func (ctx *parseContext) updateSoongNamespace(replace bool, namespaceName string, varNames []string) {
1546 ctx.addSoongNamespace(namespaceName)
1547 vars := ctx.soongNamespaces[namespaceName]
1548 if replace {
1549 vars = make(map[string]bool)
1550 ctx.soongNamespaces[namespaceName] = vars
1551 }
1552 for _, v := range varNames {
1553 vars[v] = true
1554 }
1555}
1556
1557func (ctx *parseContext) hasNamespaceVar(namespaceName string, varName string) bool {
1558 vars, ok := ctx.soongNamespaces[namespaceName]
1559 if ok {
1560 _, ok = vars[varName]
1561 }
1562 return ok
1563}
1564
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001565func (ss *StarlarkScript) String() string {
1566 return NewGenerateContext(ss).emit()
1567}
1568
1569func (ss *StarlarkScript) SubConfigFiles() []string {
Sasha Smundak6609ba72021-07-22 18:32:56 -07001570
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001571 var subs []string
1572 for _, src := range ss.inherited {
1573 subs = append(subs, src.originalPath)
1574 }
1575 return subs
1576}
1577
1578func (ss *StarlarkScript) HasErrors() bool {
1579 return ss.hasErrors
1580}
1581
1582// Convert reads and parses a makefile. If successful, parsed tree
1583// is returned and then can be passed to String() to get the generated
1584// Starlark file.
1585func Convert(req Request) (*StarlarkScript, error) {
1586 reader := req.Reader
1587 if reader == nil {
1588 mkContents, err := ioutil.ReadFile(req.MkFile)
1589 if err != nil {
1590 return nil, err
1591 }
1592 reader = bytes.NewBuffer(mkContents)
1593 }
1594 parser := mkparser.NewParser(req.MkFile, reader)
1595 nodes, errs := parser.Parse()
1596 if len(errs) > 0 {
1597 for _, e := range errs {
1598 fmt.Fprintln(os.Stderr, "ERROR:", e)
1599 }
1600 return nil, fmt.Errorf("bad makefile %s", req.MkFile)
1601 }
1602 starScript := &StarlarkScript{
1603 moduleName: moduleNameForFile(req.MkFile),
1604 mkFile: req.MkFile,
1605 topDir: req.RootDir,
1606 traceCalls: req.TraceCalls,
1607 warnPartialSuccess: req.WarnPartialSuccess,
Sasha Smundak6609ba72021-07-22 18:32:56 -07001608 sourceFS: req.SourceFS,
1609 makefileFinder: req.MakefileFinder,
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001610 }
1611 ctx := newParseContext(starScript, nodes)
1612 ctx.outputSuffix = req.OutputSuffix
1613 ctx.outputDir = req.OutputDir
1614 ctx.errorLogger = req.ErrorLogger
1615 if len(req.TracedVariables) > 0 {
1616 ctx.tracedVariables = make(map[string]bool)
1617 for _, v := range req.TracedVariables {
1618 ctx.tracedVariables[v] = true
1619 }
1620 }
1621 ctx.pushReceiver(starScript)
1622 for ctx.hasNodes() && ctx.fatalError == nil {
1623 node := ctx.getNode()
1624 if ctx.handleSimpleStatement(node) {
1625 continue
1626 }
1627 switch x := node.(type) {
1628 case *mkparser.Directive:
1629 switch x.Name {
1630 case "ifeq", "ifneq", "ifdef", "ifndef":
1631 ctx.handleIfBlock(x)
1632 default:
1633 ctx.errorf(x, "unexpected directive %s", x.Name)
1634 }
1635 default:
1636 ctx.errorf(x, "unsupported line")
1637 }
1638 }
1639 if ctx.fatalError != nil {
1640 return nil, ctx.fatalError
1641 }
1642 return starScript, nil
1643}
1644
Sasha Smundakd7d07ad2021-09-10 15:42:34 -07001645func Launcher(mainModuleUri, versionDefaultsUri, mainModuleName string) string {
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001646 var buf bytes.Buffer
1647 fmt.Fprintf(&buf, "load(%q, %q)\n", baseUri, baseName)
Sasha Smundakd7d07ad2021-09-10 15:42:34 -07001648 fmt.Fprintf(&buf, "load(%q, \"version_defaults\")\n", versionDefaultsUri)
1649 fmt.Fprintf(&buf, "load(%q, \"init\")\n", mainModuleUri)
1650 fmt.Fprintf(&buf, "%s(%s(%q, init, version_defaults))\n", cfnPrintVars, cfnMain, mainModuleName)
Sasha Smundakb051c4e2020-11-05 20:45:07 -08001651 return buf.String()
1652}
1653
1654func MakePath2ModuleName(mkPath string) string {
1655 return strings.TrimSuffix(mkPath, filepath.Ext(mkPath))
1656}