forked from daeken/Shaderforth
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcompiler.py
More file actions
1110 lines (987 loc) · 27.6 KB
/
compiler.py
File metadata and controls
1110 lines (987 loc) · 27.6 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
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
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import re, sys
from cStringIO import StringIO
def regex(pattern, flags=0):
def sub(text):
match = pattern.match(text)
if match == None:
return False
return match.groups()
pattern = re.compile(pattern, flags)
return sub
ffloat = regex(r'(-?[0-9]+\.[0-9]*)')
efloat = regex(r'(-?\.[0-9]+)')
bint = regex(r'(-?[0-9]+)')
satis = lambda inp, *funcs: any(func(inp) for func in funcs)
def parse(code):
def sub(elem):
if satis(elem, ffloat, efloat):
return float(elem)
elif bint(elem):
return int(elem)
else:
return unicode(elem)
code = re.sub(r'/\*.*?\*/', '', code, flags=re.S)
code = map(sub, (elem for elem in code.replace('\n', ' ').replace('\t', ' ').split(' ') if elem != ''))
return code
class Type(object):
def __init__(self, name):
self.name = name
self.attributes = []
self.array_count = None
def attribute(self, name):
self.attributes.append(name)
def array(self, count):
self.array_count = count
def __repr__(self):
return ' '.join(self.attributes) + (' ' if self.attributes else '') + self.name + ('' if self.array_count is None else '[%i]' % self.array_count)
def rename(self):
return ' '.join(self.attributes) + (' ' if self.attributes else '') + Compiler.instance.rename(self.name) + ('' if self.array_count is None else '[%i]' % self.array_count)
class Stack(object):
def __init__(self):
self.list = []
def push(self, elem):
self.list.append(elem)
return self
def pop(self):
if len(self.list) == 0:
self.list.append(Compiler.instance.argument())
return self.list.pop()
def top(self):
if len(self.list) == 0:
self.list.append(Compiler.instance.argument())
return self.list[-1]
def retrieve(self, offset, remove=False):
offset = len(self.list)-offset-1
elem = self.list[offset]
if remove:
self.list = self.list[:offset] + self.list[offset+1:]
return elem
def __len__(self):
return len(self.list)
def __repr__(self):
return 'Stack(%r)' % self.list
class Code(object):
def __init__(self, elems):
self.elems = elems
self.i = 0
def peek(self):
if self.i >= len(self.elems):
return None
return self.elems[self.i]
def consume(self):
if self.i >= len(self.elems):
raise Exception('Out of range')
self.i += 1
return self.elems[self.i - 1]
def insert(self, atoms):
self.elems = self.elems[:self.i] + list(atoms) + self.elems[self.i:]
return self
def __repr__(self):
return 'Code(parsed=%r, rest=%r)' % (self.elems[:self.i], self.elems[self.i:])
def word(symbol, consumes=0):
def dec(fn):
bwords[symbol] = consumes, fn
return fn
return dec
bwords = {
'+' : (2, None),
'-' : (2, None),
'*' : (2, None),
'/' : (2, None),
'<' : (2, None),
'>' : (2, None),
'<=' : (2, None),
'>=' : (2, None),
'==' : (2, None),
'!=' : (2, None),
}
flatops = {
'+' : lambda a, b: a + b,
'-' : lambda a, b: a - b,
'*' : lambda a, b: a * b,
'/' : lambda a, b: a / b,
}
glfuncs = dict(
dot=2,
vec4=4,
sin=1,
abs=1,
atan=1,
atan2=2,
cos=1,
pow=2,
sqrt=1,
mod=2,
tan=1,
min=2,
max=2,
length=1,
normalize=1,
cross=2,
mix=3,
mat2=4,
mat3=9,
mat4=16,
reflect=2,
refract=3,
int=1,
clamp=3,
smoothstep=3,
ceil=1,
floor=1,
)
gltypes = dict(
dot='float',
vec2='vec2',
vec3='vec3',
vec4='vec4',
length='float',
mat2='mat2',
mat3='mat3',
mat4='mat4',
float='float',
int='int',
)
btypes = 'void int float bool vec2 vec3 vec4 mat2 mat3 mat4 ivec2 ivec3 ivec4 bvec2 bvec3 bvec4'.split(' ')
for name, consumes in glfuncs.items():
bwords[name] = (consumes, None)
class Compiler(object):
def __init__(self, code, shadertoy=False, minimize=False):
self.code = file('utility.glf', 'r').read().decode('utf-8') + code
self.tempi = 0
self.shadertoy = shadertoy
self.minimize = minimize
Compiler.instance = self
self.globals = dict(
gl_FragCoord=Type('vec4'),
gl_FragColor=Type('vec4'),
)
self.renamed = {}
self.rename_i = 0
self.words, self.wordtypes, self.macros, self.structs = self.parsewords(self.code)
self.deps = {}
for name, atoms in self.words.items():
self.words[name] = self.compile(name, atoms)
self.deps[name] = deps = []
for atom in atoms:
if not isinstance(atom, unicode):
continue
if atom[0] in '&\\/':
atom = atom[1:]
if atom in self.words and atom not in deps:
deps.append(atom)
required = ['main']
checked = []
while len(checked) < len(required):
for dep in required:
if dep in checked:
continue
for elem in self.deps[dep]:
if elem not in required:
required.append(elem)
checked.append(dep)
dead = [name for name in self.words if name not in required]
for name in dead:
del self.words[name]
old = sys.stdout
sys.stdout = StringIO()
self.output()
code = sys.stdout.getvalue()
sys.stdout = old
if minimize:
self.code = self.minshader(code)
else:
self.code = code.rstrip('\n')
def minshader(self, code):
code = re.sub(r'//.*$', '', code)
code = code.replace('\n', ' ').replace('\t', ' ')
code = re.sub(r' +', ' ', code)
code = re.sub(r'/\*.*?\*/', '', code)
code = re.sub(r' +', ' ', code)
code = re.sub(r'\.0+([^0-9])', r'.\1', code)
code = re.sub(r'0+([1-9]+\.[^a-z_])', r'\1', code, re.I)
code = re.sub(r'0+([1-9]*\.[0-9])', r'\1', code)
code = re.sub(r'\s*(;|{|}|\(|\)|=|\+|-|\*|\/|\[|\]|,|\.|%|!|~|\?|:|<|>)\s*', r'\1', code)
return code.strip()
def output(self):
indentlevel = [1]
operators = '+ - / * < > <= >= == != && ||'.split(' ')
precedence = {
'+' : 2,
'-' : 2,
'*' : 3,
'/' : 3,
'==' : 4,
'!=' : 4,
'<' : 4,
'>' : 4,
'<=' : 4,
'>=' : 4,
'||' : 4,
'&&' : 4,
'.' : 10,
'?:' : 10,
'[]' : 10,
}
def paren(atom, op=None):
if not isinstance(atom, tuple):
if atom is True:
return 'true'
elif atom is False:
return 'false'
return unicode(atom)
return '(%s)' % structure(atom)
"""
wrap = True#False # XXX: Detect subtraction/division side-by-side precedence
if atom[0] in operators:
wrap = precedence[atom[0]] < precedence[op]
elif atom[0] == '?:':
wrap = True
if wrap:
return '(%s)' % structure(atom)
else:
return structure(atom)
"""
def structure(atom):
if not isinstance(atom, tuple):
if atom is True:
return 'true'
elif atom is False:
return 'false'
return unicode(atom)
if atom[0] in operators:
if len(atom) == 2:
return '%s %s' % (atom[0], paren(atom[1], atom[0]))
else:
return '%s %s %s' % (paren(atom[1], atom[0]), atom[0], paren(atom[2], atom[0]))
elif atom[0] == '=':
if atom[2] is None:
return '%s' % structure(atom[1])
else:
return '%s = %s' % (structure(atom[1]), structure(atom[2]))
elif atom[0][0] == '.':
swizzle = atom[0]
if atom[2]:
swizzle = '.' + self.rename(atom[0][1:])
return '%s%s' % (paren(atom[1], '.'), swizzle)
elif atom[0] == 'var':
if atom[1].startswith('gl_') or atom[1] in self.globals or atom[1] in defd:
return self.rename(atom[1])
else:
defd.append(atom[1])
return '%s %s' % (locals[atom[1]].rename(), self.rename(atom[1]))
elif atom[0] == 'arg':
return self.rename(atom[1])
elif atom[0] == 'return':
return 'return %s' % structure(atom[1])
elif atom[0] == 'for':
_, name, start, top = atom
defd.append(name)
name = self.rename(name)
indentlevel[0] += 1
return 'for(int %s = %s; %s < %s; ++%s) {' % (name, structure(start), name, structure(top), name), True
elif atom[0] == 'if':
indentlevel[0] += 1
return 'if(%s) {' % structure(atom[1]), True
elif atom[0] == 'else':
return '} else {', True
elif atom[0] == 'elif':
return '} else if(%s) {' % structure(atom[1]), True
elif atom[0] == 'endblock':
indentlevel[0] -= 1
return '}', True
elif atom[0] == 'break':
return 'break'
elif atom[0] == 'continue':
return 'continue'
elif atom[0] == '?:':
c, a, b = atom[1:]
return '%s ? %s : %s' % (paren(c, '?:'), paren(a, '?:'), paren(b, '?:'))
elif atom[0] == '[]':
return '%s[%s]' % (paren(atom[1], '[]'), structure(atom[2]))
else:
return '%s(%s)' % (self.rename(atom[0]), ', '.join(map(structure, atom[1:])))
if self.shadertoy:
print '/* Compiled with Shaderforth: https://github.com/daeken/Shaderforth'
print self.code.rstrip('\n')
print '*/'
print
for name, elems in self.structs.items():
print 'struct %s {' % self.rename(name)
for name, type in elems:
print '\t%s %s;' % (type.rename(), self.rename(name))
print '};'
for name, type in self.globals.items():
if name.startswith('gl_') or (self.shadertoy and 'uniform' in type.attributes):
continue
print type.rename(), self.rename(name) + ';'
for name in self.words:
if name != 'main':
print '%s %s(%s);' % (self.rename(self.wordtypes[name][1]), self.rename(name), ', '.join(self.rename(type) for type in self.wordtypes[name][0]))
for name, (locals, effects, localorder) in self.words.items():
defd = self.wordtypes[name][2]
print '%s %s(%s) {' % (self.rename(self.wordtypes[name][1]), self.rename(name) if name != 'main' else name, ', '.join('%s %s' % (self.rename(type), self.rename(self.wordtypes[name][2][i])) for i, type in enumerate(self.wordtypes[name][0])))
for effect in effects:
prev = indentlevel[0]
line = structure(effect)
sup = False
if isinstance(line, tuple):
line, sup = line
if sup:
if prev <= indentlevel[0]:
off = 1
else:
off = 0
print '\t' * (indentlevel[0] - off) + line
else:
print '\t' * indentlevel[0] + line + ';'
print '}'
def rename(self, name):
if name in glfuncs or name in btypes or name.startswith('gl_'):
if name == 'atan2':
return 'atan'
return name
elif name in self.globals and ('uniform' in self.globals[name].attributes or 'varying' in self.globals[name].attributes):
return name
elif name in self.renamed:
return self.renamed[name]
elif not self.minimize:
self.renamed[name] = name = name.replace('-', '_').replace('>', '_').replace('<', '_')
return name
else:
first = '_abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
rest = first + '0123456789'
ti = self.rename_i
sname = first[ti % len(first)]
ti /= len(first)
while ti > 0:
sname += rest[ti % len(rest)]
ti /= len(rest)
self.renamed[name] = sname
self.rename_i += 1
return sname
def parsewords(self, code):
def sanitize(name, macro):
spec = macrospec[name]
stored = [elem[1:] for elem in spec if elem.startswith('$')]
spec = [elem[1:] if elem.startswith('$') else elem for elem in spec]
preamble = []
for i, elem in enumerate(spec):
if i != len(spec) - 1:
preamble.append(len(spec) - i - 1)
preamble.append('take')
if elem in stored:
preamble.append('=macro_' + name + '_' + elem)
else:
preamble.append('=>macro_' + name + '_' + elem)
for i, elem in enumerate(macro):
if elem in spec:
macro[i] = 'macro_' + name + '_' + elem
elif isinstance(elem, unicode) and len(elem) > 1 and elem[0] == '*' and elem[1:] in spec:
macro[i] = '*macro_' + name + '_' + elem[1:]
macros[name] = preamble + macro
parsed = Code(parse(code))
parseloc = 0
words, macros = {'main': []}, {}
macrospec = {}
wordtypes = {'main' : ((), 'void', [])}
globals = []
structs = {}
modstack = []
cur = words['main']
in_macro = None
preamble = []
comment_depth = 0
while parsed.peek() is not None:
token = parsed.consume()
if token == '(':
comment_depth += 1
cur.append(token)
continue
if comment_depth > 0:
if token == ')':
comment_depth -= 1
cur.append(token)
continue
if token == ':':
modstack.append(cur)
name = parsed.consume()
cur = words[name] = []
argstart = parsed.consume()
if argstart == '()':
wordtypes[name] = (), 'void', []
else:
assert argstart == '('
args = []
argnames = []
ret = 'void'
while parsed.peek() != ')':
token = parsed.consume()
if token == '->':
ret = parsed.consume()
else:
token = token.split(':', 1)
if len(token) == 1:
args.append(token[0])
argnames.append(None)
else:
args.append(token[1])
argnames.append(token[0])
parsed.consume()
assert len([_ for _ in argnames if _ != None]) == 0 or None not in argnames
if None in argnames:
argnames = ['arg_%i' % i for i in xrange(argnames)]
wordtypes[name] = tuple(args), ret, argnames
elif token == ':m':
modstack.append(cur)
name = parsed.consume()
cur = macros[name] = []
macrospec[name] = []
in_macro = name
if parsed.peek() == '(':
parsed.consume()
while parsed.peek() != ')':
macrospec[name].append(parsed.consume().split(':')[0])
parsed.consume()
elif token == ':globals':
modstack.append(cur)
cur = globals
elif token == ':struct':
modstack.append(cur)
name = parsed.consume()
cur = structs[name] = []
elif token == ';':
if in_macro:
sanitize(in_macro, cur)
in_macro = None
cur = modstack.pop()
else:
cur.append(token)
for name, tokens in words.items():
while True:
rewrite = False
for i, token in enumerate(tokens):
if token in macros:
tokens = tokens[:i] + macros[token] + tokens[i+1:]
rewrite = True
break
if not rewrite:
break
words[name] = tokens
locals, effects, localorder = self.compile('__globals', globals, pre=True)
self.globals.update(locals)
def subword(name):
return lambda self: self.rstack.push(tuple([name] + self.rstack.pop()))
sdefs = {}
for name, atoms in structs.items():
locals, effects, localorder = self.compile('__' + name, atoms, pre=True)
sdefs[name] = [(ename, locals[ename]) for ename in localorder]
word(name)(subword(name))
gltypes[name] = name
return words, wordtypes, macros, sdefs
def compile(self, name, atoms, pre=False):
self.atoms = Code(atoms)
self.rstack = Stack()
self.sstack = Stack()
self.locals = {}
self.localorder = []
self.macrolocals = {}
self.effects = []
if not pre:
self.argcount = len(self.wordtypes[name][0])+1
argtypes = self.wordtypes[name][0]
self.argnames = self.wordtypes[name][2]
self.argtypes = dict((self.argnames[i], type) for i, type in enumerate(argtypes))
for name, type in self.argtypes.items():
self.locals[name] = Type(type)
while self.atoms.peek() != None:
token = self.atoms.consume()
if not isinstance(token, unicode) and not isinstance(token, str):
self.rstack.push(token)
elif token in bwords:
consumes, fn = bwords[token]
if fn != None:
fn(self, *[self.atoms.consume() for i in xrange(consumes)][::-1])
elif token in flatops:
operands = [self.rstack.pop() for i in xrange(consumes)][::-1]
if False not in [isinstance(operand, float) for operand in operands] or \
False not in [isinstance(operand, int) for operand in operands]:
self.rstack.push(flatops[token](*operands))
else:
self.rstack.push(tuple([token] + operands))
else:
self.rstack.push(tuple([token] + [self.rstack.pop() for i in xrange(consumes)][::-1]))
elif len(token) > 1 and token[0] == '@':
self.rstack.push(Type(token[1:]))
elif len(token) > 1 and token[0] == '&':
self.rstack.push(token[1:])
elif len(token) > 1 and token[0] == '*':
self.rstack.push(self.macrolocals[token[1:]])
self.call()
elif len(token) > 2 and token[:2] == '=>':
self.macroassign(token[2:])
elif len(token) > 1 and token[0] == '=':
self.assign(token[1:])
elif token == '=':
var = self.rstack.pop()
value = self.rstack.pop()
self.effects.append(('=', var, value))
elif len(token) > 1 and token[0] == '.':
elem = self.rstack.pop()
is_struct = self.infertype(elem) in self.structs
for swizzle in token[1:].split('.'):
self.rstack.push(('.' + swizzle, elem, is_struct))
elif len(token) > 1 and token[0] == '/':
if token == '/{':
self.map(self.block())
else:
self.map(token[1:])
elif len(token) > 1 and token[0] == '\\':
if token == '\\{':
self.reduce(self.block())
else:
self.reduce(token[1:])
elif token in self.globals or token in self.locals:
self.rstack.push(('var', token))
elif token in self.words:
elem = tuple([token] + [self.rstack.pop() for i in xrange(len(self.wordtypes[token][0]))][::-1])
if self.wordtypes[token][1] == 'void':
self.effects.append(elem)
else:
self.rstack.push(elem)
elif token in self.macrolocals:
self.rstack.push(self.macrolocals[token])
elif token == '[':
self.sstack.push(self.rstack)
self.rstack = Stack()
elif token == ']':
temp = self.rstack.list
self.rstack = self.sstack.pop()
self.rstack.push(temp)
elif token == ']v':
temp = self.rstack.list
self.rstack = self.sstack.pop()
self.rstack.push(temp)
self.avec()
elif token == ']m':
temp = self.rstack.list
self.rstack = self.sstack.pop()
self.rstack.push(temp)
self.amat()
elif token == '{':
self.rstack.push(self.block())
elif token == 'true':
self.rstack.push(True)
elif token == 'false':
self.rstack.push(False)
else:
print 'foo', token, self.rstack
print 'unknown token', token
raise Exception('Unknown token')
assert len(self.rstack) <= 1
if len(self.rstack) == 1:
self.effects.append(('return', self.rstack.pop()))
return self.locals, self.effects, self.localorder
def block(self):
depth = 1
cdepth = 0
atoms = []
while True:
token = self.atoms.consume()
atoms.append(token)
if token == '(':
cdepth += 1
elif token == ')':
cdepth -= 1
elif cdepth == 0 and token in ('{', '\\{', '/{'):
depth += 1
elif cdepth == 0 and token == '}':
depth -= 1
if depth == 0:
break
atoms = atoms[:-1]
if atoms[0] == '(':
spec = []
stored = []
for atom in atoms[1:]:
if atom == ')':
break
if atom.startswith('$'):
stored.append(atom[1:])
atom = atom[1:]
spec.append(atom)
atoms = atoms[2+len(spec):]
name = self.tempname()
preamble = []
for i, elem in enumerate(spec):
if i != len(spec) - 1:
preamble.append(len(spec) - i - 1)
preamble.append('take')
if elem in stored:
preamble.append('=macro_' + name + '_' + elem)
else:
preamble.append('=>macro_' + name + '_' + elem)
for i, elem in enumerate(atoms):
if elem in spec:
atoms[i] = 'macro_' + name + '_' + elem
elif isinstance(elem, unicode) and len(elem) > 1 and elem[0] == '*' and elem[1:] in spec:
atoms[i] = '*macro_' + name + '_' + elem[1:]
atoms = preamble + atoms
return atoms
def tempname(self):
self.tempi += 1
return 'temp_%i' % self.tempi
def eatcomment(self):
depth = 1
while self.atoms.peek() != None:
token = self.atoms.consume()
if token == ')':
depth -= 1
if depth == 0:
return
elif token == '(':
depth += 1
def argument(self):
assert self.argcount > 0
self.argcount -= 1
return ('arg', self.argnames[self.argcount-1])
def assign(self, name):
if isinstance(self.rstack.top(), Type):
type = self.rstack.pop()
self.locals[name] = type
if name not in self.localorder:
self.localorder.append(name)
self.effects.append(('=', ('var', name), None))
else:
elem = self.rstack.pop()
if name not in self.locals and name not in self.globals:
self.locals[name] = Type(self.infertype(elem))
self.localorder.append(name)
self.effects.append(('=', ('var', name), elem))
def map(self, name):
tlist = self.rstack.pop()
atoms = self.blockify(name)
tatoms = []
tatoms.append(u'[')
for i, val in enumerate(tlist):
tname = self.tempname()
self.macrolocals[tname] = val
tatoms.append(tname)
tatoms += atoms
tatoms.append(u']')
self.atoms.insert(tatoms)
def reduce(self, name):
elems = self.rstack.pop()
atoms = self.blockify(name)
tatoms = []
for i, val in enumerate(elems):
tname = self.tempname()
self.macrolocals[tname] = val
tatoms.append(tname)
if i != 0:
tatoms += atoms
self.atoms.insert(tatoms)
def macroassign(self, name):
self.macrolocals[name] = self.rstack.pop()
def infertype(self, expr):
if isinstance(expr, tuple):
if expr[0] == 'var':
name = expr[1]
if name in self.globals:
return self.globals[name].name
elif name in self.locals:
return self.locals[name].name
else:
assert False
elif expr[0] == 'arg':
return self.argtypes[expr[1]]
elif expr[0][0] == '.':
subtype = self.infertype(expr[1])
if subtype in self.structs:
return str(dict(self.structs[subtype])[expr[0][1:]])
elif len(expr[0]) == 2:
return 'float'
else:
return 'vec%i' % (len(expr[0])-1)
elif expr[0].startswith('vec'):
return expr[0]
elif expr[0] in gltypes:
return gltypes[expr[0]]
elif expr[0] in self.words:
return self.wordtypes[expr[0]][1]
elif expr[0] == '[]':
return self.infertype(expr[1])
else:
types = map(self.infertype, expr[1:])
mat = vec = other = None
for type in types:
if 'mat' in type:
mat = type
elif 'vec' in type:
vec = type
else:
other = type
return vec or mat or other
elif isinstance(expr, bool):
return 'bool'
elif isinstance(expr, int):
return 'int'
else:
return 'float'
assert False
@word('dup')
def dup(self):
top = self.rstack.pop()
if not isinstance(top, tuple):
inline = True
elif top[0] == 'var' or top[0] == 'arg':
inline = True
elif top[0][0] == '.' and top[1][0] == 'var':
inline = True
else:
inline = False
if inline:
self.rstack.push(top)
self.rstack.push(top)
else:
temp = 'var_%i' % len(self.locals)
self.locals[temp] = Type(self.infertype(top))
temp = ('var', temp)
self.effects.append(('=', temp, top))
self.rstack.push(temp)
self.rstack.push(temp)
@word('swap')
def swap(self):
a, b = self.rstack.pop(), self.rstack.pop()
self.rstack.push(a)
self.rstack.push(b)
@word('uniform')
def uniform(self):
self.rstack.top().attribute('uniform')
@word('(')
def nullparen_open(self):
self.eatcomment()
@word('flatten')
def flatten(self):
for elem in self.rstack.pop():
self.rstack.push(elem)
@word('avec')
def avec(self):
tlist = self.rstack.pop()
types = map(self.infertype, tlist)
length = 0
for type in types:
if type.startswith('vec'):
length += int(type[3:])
elif type == 'float':
length += 1
else:
assert False
self.rstack.push(tuple(['vec%i' % length] + tlist))
@word('amat')
def amat(self):
tlist = self.rstack.pop()
if len(tlist) == 4:
size = 2
elif len(tlist) == 9:
size = 3
elif len(tlist) == 16:
size = 4
else:
assert False
self.rstack.push(tuple(['mat%i' % size] + tlist))
@word('=[')
def arrayass(self):
names = []
while True:
token = self.atoms.consume()
if token == ']':
break
names.append(token)
arr = self.rstack.pop()
for i, name in enumerate(names):
self.rstack.push(arr[i])
self.assign(name)
@word('=>[')
def arraymass(self):
names = []
while True:
token = self.atoms.consume()
if token == ']':
break
names.append(token)
arr = self.rstack.pop()
for i, name in enumerate(names):
self.rstack.push(arr[i])
self.macroassign(name)
@word('call')
def call(self):
name = self.rstack.pop()
atoms = self.blockify(name)
self.atoms.insert(atoms)
def blockify(self, atom):
if isinstance(atom, list):
return atom
if atom in self.macros:
return self.macros[atom]
elif atom in self.words or atom in bwords:
return [atom]
else:
print atom
assert False
@word('times')
def times(self):
count = self.rstack.pop()
block = self.blockify(self.rstack.pop())
var = self.tempname()
self.effects.append(('for', var, 0, count))
self.rstack.push('__term__')
self.rstack.push(('var', var))
self.atoms.insert(list(block) + ['__endblock'])
self.locals[var] = Type('int')
@word('mtimes')
def mtimes(self):
count = self.rstack.pop()
block = self.blockify(self.rstack.pop())
for i in xrange(count):
self.atoms.insert([i] + list(block))
@word('when')
def when(self):
cond = self.rstack.pop()
block = self.blockify(self.rstack.pop())
self.effects.append(('if', cond))
self.rstack.push('__term__')
self.atoms.insert(list(block) + ['__endblock'])
@word('if')
def if_(self):
cond = self.rstack.pop()
else_ = self.blockify(self.rstack.pop())
if_ = self.blockify(self.rstack.pop())
self.effects.append(('if', cond))
self.rstack.push(else_)
self.rstack.push('__term__')
self.atoms.insert(list(if_) + ['__else'])
@word('__else')
def else_(self):
self.effects.append(('else', ))
while self.rstack.pop() != '__term__':
pass
else_ = self.rstack.pop()
self.rstack.push('__term__')
self.atoms.insert(list(else_) + ['__endblock'])
@word('__endblock')
def endblock(self):
self.effects.append(('endblock', ))
while self.rstack.pop() != '__term__':
pass
@word('break')
def break_(self):
self.effects.append(('break', ))
@word('continue')
def continue_(self):
self.effects.append(('continue', ))
@word(',')
def nullcomma(self):
pass
@word('select')
def select(self):
cond = self.rstack.pop()
b = self.rstack.pop()
a = self.rstack.pop()
self.rstack.push(('?:', cond, a, b))
@word('return')
def return_(self):
self.effects.append(('return', self.rstack.pop()))
@word('cond')
def cond(self):
arr = self.rstack.pop()