This repository was archived by the owner on Jun 24, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathtransform.rb
More file actions
740 lines (661 loc) · 18.7 KB
/
transform.rb
File metadata and controls
740 lines (661 loc) · 18.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
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
# Copyright (C) 2011 Apple Inc. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
# BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
# THE POSSIBILITY OF SUCH DAMAGE.
require "config"
require "ast"
#
# node.resolveSettings(settings)
#
# Construct a new AST that does not have any IfThenElse nodes by
# substituting concrete boolean values for each Setting.
#
class Node
def resolveSettings(settings)
mapChildren {
| child |
child.resolveSettings(settings)
}
end
end
class True
def resolveSettings(settings)
self
end
end
class False
def resolveSettings(settings)
self
end
end
class Setting
def resolveSettings(settings)
settings[@name].asNode
end
end
class And
def resolveSettings(settings)
(@left.resolveSettings(settings).value and @right.resolveSettings(settings).value).asNode
end
end
class Or
def resolveSettings(settings)
(@left.resolveSettings(settings).value or @right.resolveSettings(settings).value).asNode
end
end
class Not
def resolveSettings(settings)
(not @child.resolveSettings(settings).value).asNode
end
end
class IfThenElse
def resolveSettings(settings)
if @predicate.resolveSettings(settings).value
@thenCase.resolveSettings(settings)
else
@elseCase.resolveSettings(settings)
end
end
end
class Sequence
def resolveSettings(settings)
newList = []
@list.each {
| item |
item = item.resolveSettings(settings)
if item.is_a? Sequence
newList += item.list
else
newList << item
end
}
Sequence.new(codeOrigin, newList)
end
end
#
# node.demacroify(macros)
# node.substitute(mapping)
#
# demacroify() constructs a new AST that does not have any Macro
# nodes, while substitute() replaces Variable nodes with the given
# nodes in the mapping.
#
class Node
def demacroify(macros)
mapChildren {
| child |
child.demacroify(macros)
}
end
def freshVariables(mapping)
mapChildren {
| child |
child.freshVariables(mapping)
}
end
def substitute(mapping)
mapChildren {
| child |
child.substitute(mapping)
}
end
def substituteLabels(mapping)
mapChildren {
| child |
child.substituteLabels(mapping)
}
end
end
$uniqueMacroVarID = 0
class Macro
def freshVariables(mapping = {})
myMapping = mapping.dup
newVars = []
variables.each do |var|
$uniqueMacroVarID += 1
newVar = Variable.forName(var.codeOrigin, "_var#{$uniqueMacroVarID}", var.originalName)
newVars << newVar
myMapping[var] = newVar
end
Macro.new(codeOrigin, name, newVars, body.freshVariables(myMapping))
end
def substitute(mapping)
myMapping = {}
mapping.each_pair {
| key, value |
unless @variables.include? key
myMapping[key] = value
end
}
mapChildren {
| child |
child.substitute(myMapping)
}
end
end
class MacroCall
def freshVariables(mapping)
newName = Variable.forName(codeOrigin, name, originalName)
if mapping[newName]
newName = mapping[newName]
end
newOperands = operands.map { |operand| operand.freshVariables(mapping) }
MacroCall.new(codeOrigin, newName.name, newOperands, annotation, originalName)
end
end
$concatenation = /%([a-zA-Z0-9_]+)%/
class Variable
def freshVariables(mapping)
if @name =~ $concatenation
name = @name.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
"%#{mapping[var].name}%"
else
match
end
}
Variable.forName(codeOrigin, name)
elsif mapping[self]
mapping[self]
else
self
end
end
def substitute(mapping)
if @name =~ $concatenation
name = @name.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
mapping[var].name
else
match
end
}
Variable.forName(codeOrigin, name)
elsif mapping[self]
mapping[self]
else
self
end
end
end
class StructOffset
def freshVariables(mapping)
if dump =~ $concatenation
names = dump.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
"%#{mapping[var].name}%"
else
match
end
}.split('::')
StructOffset.forField(codeOrigin, names[0..-2].join('::'), names[-1])
else
self
end
end
def substitute(mapping)
if dump =~ $concatenation
names = dump.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
mapping[var].name
else
match
end
}.split('::')
StructOffset.forField(codeOrigin, names[0..-2].join('::'), names[-1])
else
self
end
end
end
class Label
def freshVariables(mapping)
if @name =~ $concatenation
name = @name.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
"%#{mapping[var].name}%"
else
match
end
}
result = Label.forName(codeOrigin, name, @definedInFile)
result.setGlobal() if global?
result.clearExtern unless extern?
result
else
self
end
end
def substitute(mapping)
if @name =~ $concatenation
name = @name.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
mapping[var].name
else
match
end
}
result = Label.forName(codeOrigin, name, @definedInFile)
result.setGlobal() if global?
result.clearExtern unless extern?
result
else
self
end
end
end
class ConstExpr
def freshVariables(mapping)
if @value =~ $concatenation
value = @value.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
"%#{mapping[var].name}%"
else
match
end
}
ConstExpr.forName(codeOrigin, value)
else
self
end
end
def substitute(mapping)
if @value =~ $concatenation
value = @value.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
mapping[var].name
else
match
end
}
ConstExpr.forName(codeOrigin, value)
else
self
end
end
end
class Sizeof
def freshVariables(mapping)
if struct =~ $concatenation
value = struct.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
"%#{mapping[var].name}%"
else
match
end
}
Sizeof.forName(codeOrigin, value)
else
self
end
end
def substitute(mapping)
if struct =~ $concatenation
value = struct.gsub($concatenation) { |match|
var = Variable.forName(codeOrigin, match[1...-1])
if mapping[var]
mapping[var].name
else
match
end
}
Sizeof.forName(codeOrigin, value)
else
self
end
end
end
class LocalLabel
def substituteLabels(mapping)
if mapping[self]
mapping[self]
else
self
end
end
end
class MacroError < StandardError
end
class Sequence
def substitute(constants)
newList = []
myConstants = constants.dup
@list.each {
| item |
if item.is_a? ConstDecl
myConstants[item.variable] = item.value.substitute(myConstants)
else
newList << item.substitute(myConstants)
end
}
Sequence.new(codeOrigin, newList)
end
def renameLabels(comment)
mapping = {}
@list.each {
| item |
if item.is_a? LocalLabel
mapping[item] = LocalLabel.unique(if comment then comment + "_" else "" end + item.cleanName)
end
}
substituteLabels(mapping)
end
@@demacroifyStack = []
def macroError(msg)
backtrace = @@demacroifyStack.reverse.map { |macroCall|
"#{macroCall.codeOrigin} in call to #{macroCall.originalName}"
}
raise MacroError, msg, backtrace
end
def demacroify(macros)
myMacros = macros.dup
# We do an initial pass looking for all macros in order to allow forward references
@list.each {
| item |
if item.is_a? Macro
myMacros[item.name] = item.freshVariables
end
}
newList = []
@list.each {
| item |
if item.is_a? Macro
# Ignore. We already looked for macros above and they should not be part of the final output
elsif item.is_a? MacroCall
@@demacroifyStack << item
mapping = {}
myMyMacros = myMacros.dup
macro = myMacros[item.name]
macroError "Could not find macro #{item.originalName}" unless macro
macroError "Argument count mismatch for call to #{item.originalName} (expected #{macro.variables.size} but got #{item.operands.size} arguments for macro #{item.originalName} defined at #{macro.codeOrigin})" unless item.operands.size == macro.variables.size
item.operands.size.times {
| idx |
if item.operands[idx].is_a? Variable and myMacros[item.operands[idx].name]
myMyMacros[macro.variables[idx].name] = myMacros[item.operands[idx].name]
mapping[macro.variables[idx]] = nil
elsif item.operands[idx].is_a? Macro
myMyMacros[macro.variables[idx].name] = item.operands[idx].freshVariables
mapping[macro.variables[idx]] = nil
else
myMyMacros[macro.variables[idx]] = nil
mapping[macro.variables[idx]] = item.operands[idx]
end
}
if item.annotation
newList << Instruction.new(item.codeOrigin, "localAnnotation", [], item.annotation)
end
newList += macro.body.substitute(mapping).demacroify(myMyMacros).renameLabels(item.originalName).list
@@demacroifyStack.pop
else
newList << item.demacroify(myMacros)
end
}
Sequence.new(codeOrigin, newList).substitute({})
end
end
#
# node.resolveOffsets(offsets, sizes)
#
# Construct a new AST that has offset values instead of symbolic
# offsets.
#
class Node
def resolveOffsets(constantsMap)
mapChildren {
| child |
child.resolveOffsets(constantsMap)
}
end
end
class StructOffset
def resolveOffsets(constantsMap)
if constantsMap[self]
Immediate.new(codeOrigin, constantsMap[self])
else
puts "Could not find #{self.inspect} in #{constantsMap.keys.inspect}"
puts "sizes = #{constantsMap.inspect}"
raise
end
end
end
class Sizeof
def resolveOffsets(constantsMap)
if constantsMap[self]
Immediate.new(codeOrigin, constantsMap[self])
else
puts "Could not find #{self.inspect} in #{constantsMap.keys.inspect}"
puts "sizes = #{constantsMap.inspect}"
raise
end
end
end
class ConstExpr
def resolveOffsets(constantsMap)
if constantsMap[self]
Immediate.new(codeOrigin, constantsMap[self])
else
puts "Could not find #{self.inspect} in #{constantsMap.keys.inspect}"
puts "sizes = #{constantsMap.inspect}"
raise
end
end
end
#
# node.fold
#
# Resolve constant references and compute arithmetic expressions.
#
class Node
def fold
mapChildren {
| child |
child.fold
}
end
end
class AddImmediates
def fold
@left = @left.fold
@right = @right.fold
return right.plusOffset(@left.value) if @left.is_a? Immediate and @right.is_a? LabelReference
return left.plusOffset(@right.value) if @left.is_a? LabelReference and @right.is_a? Immediate
return self unless @left.is_a? Immediate
return self unless @right.is_a? Immediate
Immediate.new(codeOrigin, @left.value + @right.value)
end
end
class SubImmediates
def fold
@left = @left.fold
@right = @right.fold
return left.plusOffset(-@right.value) if @left.is_a? LabelReference and @right.is_a? Immediate
return self unless @left.is_a? Immediate
return self unless @right.is_a? Immediate
Immediate.new(codeOrigin, @left.value - @right.value)
end
end
class MulImmediates
def fold
@left = @left.fold
@right = @right.fold
return self unless @left.is_a? Immediate
return self unless @right.is_a? Immediate
Immediate.new(codeOrigin, @left.value * @right.value)
end
end
class NegImmediate
def fold
@child = @child.fold
return self unless @child.is_a? Immediate
Immediate.new(codeOrigin, -@child.value)
end
end
class OrImmediates
def fold
@left = @left.fold
@right = @right.fold
return self unless @left.is_a? Immediate
return self unless @right.is_a? Immediate
Immediate.new(codeOrigin, @left.value | @right.value)
end
end
class AndImmediates
def fold
@left = @left.fold
@right = @right.fold
return self unless @left.is_a? Immediate
return self unless @right.is_a? Immediate
Immediate.new(codeOrigin, @left.value & @right.value)
end
end
class XorImmediates
def fold
@left = @left.fold
@right = @right.fold
return self unless @left.is_a? Immediate
return self unless @right.is_a? Immediate
Immediate.new(codeOrigin, @left.value ^ @right.value)
end
end
class BitnotImmediate
def fold
@child = @child.fold
return self unless @child.is_a? Immediate
Immediate.new(codeOrigin, ~@child.value)
end
end
#
# node.resolveAfterSettings(offsets, sizes)
#
# Compile assembly against a set of offsets.
#
class Node
def resolve(constantsMap)
demacroify({}).resolveOffsets(constantsMap).fold
end
end
#
# node.validate
#
# Checks that the node is ready for backend compilation.
#
class Node
def validate
raise "Unresolved '#{dump}' at #{codeOriginString}"
end
def validateChildren
children.each {
| node |
node.validate
}
end
end
class Sequence
def validate
validateChildren
# Further verify that this list contains only instructions, labels, and skips.
@list.each {
| node |
unless node.is_a? Instruction or
node.is_a? Label or
node.is_a? LocalLabel or
node.is_a? Skip
raise "Unexpected #{node.inspect} at #{node.codeOrigin}"
end
}
end
end
class Immediate
def validate
end
end
class StringLiteral
def validate
end
end
class RegisterID
def validate
end
end
class FPRegisterID
def validate
end
end
class Address
def validate
validateChildren
end
end
class BaseIndex
def validate
validateChildren
end
end
class AbsoluteAddress
def validate
validateChildren
end
end
class Instruction
def validate
validateChildren
end
end
class SubImmediates
def validate
raise "Invalid operand #{left.dump} to immediate subtraction" unless left.immediateOperand?
raise "Invalid operand #{right.dump} to immediate subtraction" unless right.immediateOperand?
end
end
class Error
def validate
end
end
class Label
def validate
raise "Unresolved substitution in Label #{name} at #{codeOrigin}" if name =~ /%/
end
end
class LocalLabel
def validate
end
end
class LabelReference
def validate
end
end
class LocalLabelReference
def validate
end
end
class Skip
def validate
end
end