-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathcode_generation.py
More file actions
executable file
·1819 lines (1541 loc) · 76.6 KB
/
code_generation.py
File metadata and controls
executable file
·1819 lines (1541 loc) · 76.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 os
import numpy as np
import islpy as isl
from sympy import simplify
from sympy.abc import i
def unique_list_in_order(l1):
l2 = []
for l in l1:
if l not in l2:
l2.append(l)
return l2
#### TODO
# remove module initialization
# do cyclic buffer
CYCLIC_BUFFER = False
class Node:
def __init__(self, value, string, l, kind, depth, it=None, lb=None, ub=None, is_innermost=None, is_reduction=None):
self.value = value
self.string = string
self.l = l
self.kind = kind
self.depth = depth
self.l += [self]
self.children = []
self.aready_seen = False
self.it = it
self.lb = lb
self.ub = ub
self.is_innermost = is_innermost
self.is_reduction = is_reduction
def add_child(self, child):
self.children.append(child)
def __str__(self):
# return f"{self.value} -> {self.children}"
str_ = f"Node: {self.value}"
str_ += "-> Child ["
if self.children:
# str_ += " -> "
for child in self.children:
str_ += f"{child} "
str_ += "]"
return str_
class AST:
def __init__(self, schedule, UB, LB, statements, iterators, output, headers, arguments, name_function, pragmas, pragmas_top, analysis, array_need_more_than_one_copy, sched_need_different_copy_par_array, condition_copy_array_between_statement, array_need_complete_copy_inside_task, array_need_partial_copy_inside_task, array_dont_need_copy_per_schedule):
self.schedule = schedule
self.iterator_cyclic = {}
self.output_array = {}
self.should_reduce = {}
self.UB = UB
self.LB = LB
self.array_need_more_than_one_copy = array_need_more_than_one_copy
self.sched_need_different_copy_par_array = sched_need_different_copy_par_array
self.condition_copy_array_between_statement = condition_copy_array_between_statement
self.array_need_complete_copy_inside_task = array_need_complete_copy_inside_task
self.array_need_partial_copy_inside_task = array_need_partial_copy_inside_task
self.array_dont_need_copy_per_schedule = array_dont_need_copy_per_schedule
self.statements = statements
self.iterators = iterators
self.output = output
self.headers = headers
self.limit_IL = 4
self.transfer_totally = {}
self.condition_fifo = {}
self.arguments = arguments
self.analysis = analysis
self.UB_ = self.analysis.UB_
self.LB_ = self.analysis.LB_
for k in range(len(self.schedule)):
self.transfer_totally[k] = {}
self.condition_fifo[k] = {}
stat = self.statements[k]
out, inp = self.extract_array_and_constant(stat)
for in_ in inp + [out]:
self.condition_fifo[k][in_] = ""
try:
self.compute_condition_fifo()
except:
pass
for i, it in enumerate(self.schedule):
self.iterator_cyclic[i] = {}
self.output_array[i] = ""
self.should_reduce[i] = False
self.name_function = name_function
self.pragmas = pragmas
self.pragmas_top = pragmas_top
self.tab = " "
self.data_type = "float" # FIXME
self.list_nodes = []
self.array_need_reuse = {}
self.level_read = {}
self.array_information = {}
self.compute_arrays_information()
self.compute_not_copy()
self.tree = Node("Root", "", self.list_nodes, "Root", 0)
self.compute()
# self.print_ast()
self.order = []
self.write_order(self.tree)
self.order_per_loop_body = []
self.write_order_per_loop_body(self.tree)
def extract_size_array(self, arg):
if "[" in arg:
index = arg.index("[")
arg = arg[index:]
arg = arg.replace("][", "*")
arg = arg.replace("[", "")
arg = arg.replace("]", "")
return eval(arg)
return 1
def extract_size_array_dim(self, arg):
if "[" in arg:
index = arg.index("[")
arg = arg[index:]
arg = arg.replace("][", "*")
arg = arg.replace("[", "")
arg = arg.replace("]", "")
return arg.split("*")
def compute_arrays_information(self):
all_arrays = []
for stat in self.statements:
if "=" in stat:
out, inp = stat.split("=")
out = out.strip().split("[")[0]
inp = self.multi_split(inp.strip().replace(";", "").replace(" ", ""), ["+", "-", "*", "/"], True)
all_arrays += [out]
all_arrays += inp
all_arrays = unique_list_in_order(all_arrays)
for arr in all_arrays:
self.array_information[arr] = {"size": 0, "type": "", "W": [], "size_burst": 0, "size_vector": 0, "statements": [], "dim": 0, "loop_to_dim": {}, "part_per_dim": [], "size_per_dim": [], "iterators":{}, "polyhedron":{}, "intersection":{}, "polyhedron_size": {}, "access":{}}
for i, stat in enumerate(self.statements):
out, inp = stat.split("=")
out = out.strip().split("[")[0]
if f"{arr}[" in stat:
self.array_information[arr]["statements"].append(i)
if f"{arr}" in out:
self.array_information[arr]["W"].append(i)
for arr in all_arrays:
for id_stat in range(len(self.statements)):
self.array_information[arr]["iterators"][id_stat] = []
self.array_information[arr]["polyhedron"][id_stat] = []
self.array_information[arr]["polyhedron_size"][id_stat] = []
self.array_information[arr]["access"][id_stat] = []
self.array_information[arr]["intersection"][id_stat] = []
for arr in all_arrays:
for id_stat in range(len(self.statements)):
stat = self.statements[id_stat]
out, inp = self.extract_array_and_constant(stat, False)
all_ = [out] + inp
for id_, al_ in enumerate(all_):
if al_.split("[")[0] == arr:
for k in range(0, 10):
al_ = al_.replace(f"{k}", "")
# al_ = al_.replace("[]", "").
if "[" in al_:
it = al_[al_.index("[") + 1:-1].split("][")
self.array_information[arr]["iterators"][id_stat].append(it)
if ("+=" in stat or "-=" in stat or "*=" in stat or "/=" in stat) and id_ == 0: # output
self.array_information[arr]["iterators"][id_stat].append(it)
for arr in all_arrays:
for arg in self.arguments:
if arr in arg:
self.array_information[arr]["type"] = arg.split(" ")[0].strip()
self.array_information[arr]["size"] = self.extract_size_array(arg)
self.array_information[arr]["size_per_dim"] = self.extract_size_array_dim(arg)
self.array_information[arr]["dim"] = arg.count("[")
self.array_information[arr]["part_per_dim"] = [1 for k in range(self.array_information[arr]["dim"])]
break
for arr in all_arrays:
for stat in self.array_information[arr]["statements"]:
it_per_dim = []
ss = self.multi_split(self.statements[stat].replace(";", "").replace(" ", ""), ["+", "-", "*", "/", "="])
ss = unique_list_in_order(ss)
for s in ss:
tmp = ["" for k in range(self.array_information[arr]["dim"])]
if f"{arr}[" in s:
index = s.index(f"[")
s = s[index:]
s = s.replace("][", "*")
s = s.replace("[", "")
s = s.replace("]", "")
tmp = s.split("*")
it_per_dim.append(tmp)
loop_to_it = {}
for i in range(1, len(self.schedule[stat]), 2):
loop = int(self.schedule[stat][i])
it = self.iterators[loop]
loop_to_it[loop] = it
it_to_loop = {v: k for k, v in loop_to_it.items()}
for i, it in enumerate(it_per_dim):
for j, it_ in enumerate(it):
if it_ in loop_to_it:
it_per_dim[i][j] = it_to_loop[it_]
for pos in range(len(it_per_dim)):
for dim in range(len(it_per_dim[pos])):
self.array_information[arr]["loop_to_dim"][it_per_dim[pos][dim]] = dim
for pos in range(len(it_per_dim)):
for dim in range(len(it_per_dim[pos])):
loop = it_per_dim[pos][dim]
if type(loop) == str:
continue
pragma_loop = self.pragmas[loop]
if pragma_loop != [""]:
if ";" in pragma_loop:
pragma_loop = pragma_loop.split(";")
for p in pragma_loop:
if "unroll" in p.lower():
factor = p.split("=")[-1].strip().replace(" ", "")
self.array_information[arr]["part_per_dim"][dim] = max(self.array_information[arr]["part_per_dim"][dim], int(factor))
for arr in all_arrays:
for id_stat in range(len(self.statements)):
for i, it in enumerate(self.array_information[arr]["iterators"][id_stat]):
try:
var1 = []
var2 = []
cond_arr1 = []
cond_arr2 = []
for j, it_ in enumerate(it):
if it_ != "":
cond_arr1.append(f"0 <= {it_} < {self.array_information[arr]['size_per_dim'][j]}")
var1.append(f"{it_}")
cond_arr2 += self.analysis.dic[id_stat]["constraint"]
for conf in self.analysis.dic[id_stat]["constraint"]:
conf = conf.replace(" ", "").replace("+", "@").replace("-", "@").replace("0", "@").replace("1", "@").replace("2", "@").replace("3", "@").replace("4", "@").replace("5", "@").replace("6", "@").replace("7", "@").replace("8", "@").replace("9", "@").replace("=", "@").replace("<", "@").replace(">", "@")
conf = conf.split("@")
while "" in conf:
conf.remove("")
var2 += conf
var1 = unique_list_in_order(var1)
var2 = unique_list_in_order(var2)
var = var1 + var2
while "" in var:
var.remove("")
var = unique_list_in_order(var)
cond1 = " and ".join(cond_arr1)
cond2 = " and ".join(cond_arr2)
# sort var
var1 = sorted(var1)
var2 = sorted(var2)
var = sorted(var)
str_1 = f"[{', '.join(var)}] -> {{ [{', '.join(var)}] :{cond1} }}"
str_2 = f"[{', '.join(var)}] -> {{ [{', '.join(var)}] :{cond2} }}"
poly1 = isl.Set(str_1)
poly2 = isl.Set(str_2) #domain
poly = {} #poly1.intersect(poly2)
self.array_information[arr]["polyhedron"][id_stat].append(poly)
self.array_information[arr]["access"][id_stat].append(f"{arr}[{']['.join(it)}]")
# self.array_information[arr]["polyhedron_size"][id_stat].append(int(poly.count_val().to_str()))
self.array_information[arr]["polyhedron_size"][id_stat].append(0)
except:
pass
for arr in all_arrays:
for id_stat in range(len(self.statements)):
self.array_information[arr]["intersection"][id_stat] = {}
for k1, elmt1 in enumerate(self.array_information[arr]["polyhedron"][id_stat]):
self.array_information[arr]["intersection"][id_stat][k1] = {}
for k2, elmt2 in enumerate(self.array_information[arr]["polyhedron"][id_stat]):
if k2!=k1:
self.array_information[arr]["intersection"][id_stat][k1][k2] = 0
for arr in all_arrays:
for id_stat in range(len(self.statements)):
for k1, elmt1 in enumerate(self.array_information[arr]["polyhedron"][id_stat]):
for k2, elmt2 in enumerate(self.array_information[arr]["polyhedron"][id_stat]):
if k2!=k1:
intersection = {} #int(elmt1.intersect(elmt2).count_val().to_str())
self.array_information[arr]["intersection"][id_stat][k1][k2] = intersection
def write_order_per_loop_body(self, tree):
self.analyze_reuse()
for k,subtree in enumerate(tree.children):
out = []
# add in comment the schedule
out.append(f" // Schedule: {self.schedule[k]}")
for reuse in self.array_need_reuse[k]:
# out.append(f" {self.data_type} {reuse};")
# FIXME do it clearly
for arg in self.arguments:
if f"{reuse}[" in arg:
out.append(f" {arg};")
if self.from_off_chip[k][reuse] and k >= 1:
# out.append(f" // weshhhh")
loops = list(self.array_information[reuse]["loop_to_dim"].keys())
for j in range(1, len(self.schedule[k]), 2):
loop = int(self.schedule[k][j])
if loop in loops:
it = self.iterators[loop]
lb = self.LB_[loop]
ub = self.UB_[loop]
tab = self.create_tab((j-1)//2)
out.append(tab + self.create_loop(it, f"{lb}", f"{ub}+1", self.schedule[k][j]))
tab = self.create_tab(len(self.schedule[k])//2 )
# exit(0)
if reuse not in self.transfer_totally[k]:
out.append("// read 9\n")
out.append(f"{tab}{reuse}{self.reuse_it[k][reuse]} = {self.nameR[k][reuse]}.read();")
for j in range(1, len(self.schedule[k]), 2):
loop = int(self.schedule[k][j])
if loop in loops:
tab = self.create_tab((j-1)//2)
out.append(f"{tab}}}")
####
self.transfer_totally[k] = self.compute_transfer_totally(k)
for arr in list(self.transfer_totally[k].keys()):
out.append(f"// beginnn {arr}")
dim = []
for tmp in self.analysis.dic[k]["read"] + self.analysis.dic[k]["write"]:
if arr in tmp:
its = self.extract_iterator(tmp)
for kk, it in enumerate(its):
# exit(0)
try:
a = self.analysis.dic[k]["TC"][it]
except:
it = it.replace("+", "")
it = it.replace("-", "")
it = it.replace("*", "")
it = it.replace("/", "")
it = it.replace("0", "")
it = it.replace("1", "")
it = it.replace("2", "")
it = it.replace("3", "")
it = it.replace("4", "")
it = it.replace("5", "")
it = it.replace("6", "")
it = it.replace("7", "")
it = it.replace("8", "")
it = it.replace("9", "")
dim += [self.analysis.dic[k]["TC"][it]]
break
dim = list(map(str, dim))
out.append(f" {self.data_type} {arr}[{']['.join(dim)}];")
nb = 0
for tmp in self.analysis.dic[k]["read"] + self.analysis.dic[k]["write"]:
if arr in tmp:
lit = []
its = self.extract_iterator(tmp)
for kk, it in enumerate(its):
try:
a = self.analysis.dic[k]["TC"][it]
except:
it = it.replace("+", "")
it = it.replace("-", "")
it = it.replace("*", "")
it = it.replace("/", "")
it = it.replace("0", "")
it = it.replace("1", "")
it = it.replace("2", "")
it = it.replace("3", "")
it = it.replace("4", "")
it = it.replace("5", "")
it = it.replace("6", "")
it = it.replace("7", "")
it = it.replace("8", "")
it = it.replace("9", "")
# exit(0)
lb = self.analysis.dic[k]["LB_"][it]
ub = self.analysis.dic[k]["UB_"][it]
tab = self.create_tab(kk+1)
out.append(f"{tab}{self.create_loop(it, f'{lb}', f'{ub}+1')}")
lit += [it]
nb += 1
tab = self.create_tab(len(its)+1)
out.append("// read 11\n")
out.append(f"{tab}{tmp} = {self.nameR[k][arr]}.read();")
for l in range(nb):
tab = self.create_tab(len(its)-l)
out.append(f"{tab}}}")
break
####
self.write_order2(subtree, out, k, 0)
for arr in list(self.transfer_totally[k].keys()):
# out.append(f"// end {arr}")
nb = 0
for tmp in self.analysis.dic[k]["read"] + self.analysis.dic[k]["write"]:
if arr in tmp:
its = self.extract_iterator(tmp)
for kk, it in enumerate(its):
# exit(0)
try:
a = self.analysis.dic[k]["TC"][it]
except:
it = it.replace("+", "")
it = it.replace("-", "")
it = it.replace("*", "")
it = it.replace("/", "")
it = it.replace("0", "")
it = it.replace("1", "")
it = it.replace("2", "")
it = it.replace("3", "")
it = it.replace("4", "")
it = it.replace("5", "")
it = it.replace("6", "")
it = it.replace("7", "")
it = it.replace("8", "")
it = it.replace("9", "")
lb = self.analysis.dic[k]["LB_"][it]
ub = self.analysis.dic[k]["UB_"][it]
tab = self.create_tab(kk+1)
out.append(f"{tab}{self.create_loop(it, f'{lb}', f'{ub}+1')}")
nb += 1
tab = self.create_tab(len(its)+1)
out.append("// write 6")
if arr in list(self.nameW[k].keys()):
# out.append(f"{tab}{self.nameW[k][arr]}.write({arr});")
out.append(f"{tab}{self.nameW[k][arr]}.write({tmp});")
for l in range(nb):
tab = self.create_tab(len(its)-l)
out.append(f"{tab}}}")
break
# FIXME the reuse can be done not totally outermost
for reuse in self.array_need_reuse[k]:
if reuse not in self.nameW[k]:
continue
loops = list(self.array_information[reuse]["loop_to_dim"].keys())
iterator_array = []
for tmp in self.analysis.dic[k]["read"] + self.analysis.dic[k]["write"]:
if reuse in tmp:
its = self.extract_iterator(tmp)
for kk, it in enumerate(its):
iterator_array.append(it)
break
nb = 0
last_it_loop = ""
all_loops = []
for j in range(1, len(self.schedule[k]), 2):
loop = int(self.schedule[k][j])
if self.iterators[loop] in iterator_array:
all_loops.append(loop)
for g, loop in enumerate(all_loops):
it = self.iterators[loop]
last_it_loop = it
lb = self.LB_[loop]
ub = self.UB_[loop]
tab = self.create_tab((g-1)//2)
out.append(tab + self.create_loop(it, f"{lb}", f"{ub}+1"))
nb += 1
tab = self.create_tab(len(self.schedule[k])//2 )
out.append("// write 4\n")
out.append(f"{tab}{self.nameW[k][reuse]}.write({reuse}{self.reuse_it[k][reuse]});")
if self.lastWrite[reuse] == k and f"{tab}fifo_{reuse}_to_off_chip.write({reuse}{self.reuse_it[k][reuse]});" not in out:
out.append(f"{tab}fifo_{reuse}_to_off_chip.write({reuse}{self.reuse_it[k][reuse]});")
for j in range(nb):
tab = self.create_tab(1-j)
out.append(f"{tab}}}")
self.order_per_loop_body.append(out)
def compute(self):
for i, stat in enumerate(self.schedule):
str_statement = self.statements[i]
for j in range(1, len(stat), 2):
loop = int(self.schedule[i][j])
it = self.iterators[loop]
lb = self.LB_[loop]
ub = self.UB_[loop]
if loop not in [x.value for x in self.list_nodes]:
loop_str = self.create_tab((j-1)//2+1) + self.create_loop(it, f"{lb}", f"{ub}+1", self.schedule[i][j])
if j == 1:
if loop not in [x.value for x in self.list_nodes]:
is_innermost = False
if j == len(stat)-2:
is_innermost = True
# is_reduction = self.analysis.is_reduction(loop)
is_reduction = False
node = Node(loop, loop_str, self.list_nodes, "Loop", (j-1)//2+1, it, lb, ub, is_innermost, is_reduction)
self.tree.add_child(node)
else:
if loop not in [x.value for x in self.list_nodes]:
is_innermost = False
if j == len(stat)-2:
is_innermost = True
is_reduction = False
node = Node(loop, loop_str, self.list_nodes, "Loop", (j-1)//2+1, it, lb, ub, is_innermost, is_reduction)
parent = int(self.schedule[i][j-2])
parent_node = [x for x in self.list_nodes if x.value == parent][0]
parent_node.add_child(node)
if ";" not in str_statement:
str_statement += ";"
str_statement = self.create_tab((len(stat)-1)//2+1) + str_statement
node_statement = Node(f"S{i}", str_statement, self.list_nodes, "Statement", (len(stat)-1)//2+1)
if len(stat) > 1:
parent_node = [x for x in self.list_nodes if x.value == int(self.schedule[i][-2])][0]
parent_node.add_child(node_statement)
else:
self.tree.add_child(node_statement)
def create_loop(self, it, lb, ub, id_=None, inc=None):
str_ = ""
try:
ub = eval(ub)
except:
try:
ub = simplify(ub)
except:
pass
try:
lb = eval(lb)
except:
try:
lb = simplify(lb)
except:
pass
try:
ub = int(ub)
except:
pass
try:
lb = int(lb)
except:
pass
if id_ != None:
if self.pragmas_top:
for p in self.pragmas[id_].split(";"):
if p != "":
str_ += f"#pragma ACCEL {p}\n"
try:
if int(lb) < 0: # FIXME
lb = 0
except:
lb = 0
if inc is not None:
str_ += f"for ( {it} = {lb}; {it} < {ub}; {it}+={inc}) {{\n"
else:
str_ += f"for ( {it} = {lb}; {it} < {ub}; {it}++) {{\n"
if id_ != None:
if not self.pragmas_top:
if ";" in self.pragmas[id_]:
for p in self.pragmas[id_].split(";"):
if p != "":
str_ += f"#pragma HLS {p}\n"
# remove the last \n
str_ = str_[:-1]
return str_
def create_tab(self, nb):
nb = max(0,nb)
return self.tab * nb
def print_ast(self):
print(self.tree)
def write_order(self, tree):
tree.aready_seen = True
if tree.kind == "Statement":
if tree.string.split("=")[-1].replace(" ", "") == ";":
tree.string = tree.string.replace(";", "")
tree.string = tree.string + "0;"
self.order.append(tree.string)
elif tree.kind == "Loop":
self.order.append(tree.string)
for child in tree.children:
if not child.aready_seen:
self.write_order(child)
tab = self.create_tab(tree.depth)
self.order.append(f"{tab}}}")
else: # Root
for child in tree.children:
self.write_order(child)
def reinit(self):
for node in self.list_nodes:
node.aready_seen = False
def replace_increment(self, loop, burst_dataflow):
loop = loop.replace("++", f"+={burst_dataflow}")
return loop
def write_order2(self, tree, out, id_stat, depth):
self.reinit()
tree.aready_seen = True
if tree.kind == "Statement":
str_ = self.transform_statement(tree.string, id_stat, depth)
out.append(str_)
elif tree.kind == "Loop":
out.append(tree.string)
if depth == (len(self.schedule[id_stat])-1)//2-1:
out.append("#pragma HLS pipeline II=1")
for key in list(self.level_read[id_stat].keys()):
if self.level_read[id_stat][key] == depth:
tab = self.create_tab(tree.depth+1)
if key in self.array_need_reuse[id_stat]:
if (not self.from_off_chip[id_stat][key] or id_stat == 0):
# out.append(f"{tab}if({self.condition[id_stat][key]}){{\n{tab} {key}{self.reuse_it[id_stat][key]} = {self.nameR[id_stat][key]}.read();\n{tab}}}") # II=1 with 21.1
pass
else:
if key in self.nameR[id_stat]:
out.append("// read 1\n")
if key in list(self.transfer_totally[id_stat].keys()):
continue
out.append(f"{tab}{self.data_type} {key} = {self.nameR[id_stat][key]}.read();")
else:
out.append(f"{tab}{self.data_type} {key};")
for child in tree.children:
if not child.aready_seen:
self.write_order2(child, out, id_stat, depth+1)
for key in list(self.level_read[id_stat].keys()):
if self.level_read[id_stat][key] == depth:
tab = self.create_tab(tree.depth+1)
if key in self.array_need_reuse[id_stat]:
# out.append(f"{tab}if({self.condition[id_stat][key]}){{\n{tab} {key}{self.reuse_it[id_stat][key]} = {self.nameR[id_stat][key]}.read();\n{tab}}}")
pass
else:
# out.append(f"{tab}{self.data_type} {key} = {self.nameR[id_stat][key]}.read();")
if key in self.nameW[id_stat]:
tab = self.create_tab(tree.depth+1)
if key not in self.transfer_totally[id_stat]:
out.append(f"// write 1 {id_stat} {key} ")
if key in list(self.array_dont_need_copy_per_schedule.keys()) and id_stat in self.array_dont_need_copy_per_schedule[key]:
continue
out.append(f"{tab}{self.nameW[id_stat][key]}.write({key});")
if self.lastWrite[key] == id_stat and f"{tab}fifo_{key}_to_off_chip.write({key});" not in out:
out.append(f"{tab}fifo_{key}_to_off_chip.write({key});")
tab = self.create_tab(tree.depth)
out.append(f"{tab}}}")
else: # Root
for child in tree.children:
self.write_order2(child, out, id_stat, depth+1)
def find_divisor(self, n, limit):
for i in range(max(1, limit), n):
if n % i == 0:
return i
return n
def transform_statement(self, statement, id_stat, depth):
# out.append(f"{tab}if({self.condition[id_stat][key]}){{\n{tab} {key}{self.reuse_it[id_stat][key]} = {self.nameR[id_stat][key]}.read();\n{tab}}}") # II=1 with 21.1
tab = self.create_tab(depth+1)
tabp1 = self.create_tab(depth+2)
str_ = ""
need_reuse = False
out, inp = self.extract_array_and_constant(statement)
op = self.extract_operation(statement)
for k, inn in enumerate(inp + [out]):
if inn in self.array_need_reuse[id_stat]:
need_reuse = True
break
out, inp = self.extract_array_and_constant(statement, False)
for k1, inn1 in enumerate([out] + inp):
for k2, inn2 in enumerate([out] + inp):
if k2 > k1:
if inn1.split("[")[0] == inn2.split("[")[0]:
if inn1 != inn2:
need_reuse = True
break
out, inp = self.extract_array_and_constant(statement)
if not need_reuse:
str_ = f"{tab}"
if out in self.array_need_reuse[id_stat]:
str_ += f"{out}{self.reuse_it[id_stat][out]} = "
else:
remove_one_op = False
if out in list(self.transfer_totally[id_stat].keys()) and self.transfer_totally[id_stat][out]:
it_arr = self.array_information[out]["iterators"][id_stat][0]
out = f"{out}[{']['.join(it_arr)}]"
if "+=" in statement:
str_ += f"{out} += "
remove_one_op = True
elif "-=" in statement:
str_ += f"{out} -= "
remove_one_op = True
elif "*=" in statement:
str_ += f"{out} *= "
remove_one_op = True
elif "/=" in statement:
str_ += f"{out} /= "
remove_one_op = True
else:
str_ += f"{out} = "
if remove_one_op:
op = op[1:]
for k, inn in enumerate(inp):
if inn in list(self.transfer_totally[id_stat].keys()) and self.transfer_totally[id_stat][inn]:
id_ = k
if remove_one_op:
id_ += 1
it_arr = self.array_information[inn]["iterators"][id_stat][id_]
inn = f"{inn}[{']['.join(it_arr)}]"
if inn in self.array_need_reuse[id_stat]:
str_ += f"{inn}{self.reuse_it[id_stat][inn]}"
else:
str_ += f"{inn}"
if k < len(op):
str_ += " "
str_ += op[k]
str_ += " "
str_ += ";"
else:
conditions = []
initialization = []
already_seen = []
str_stat = ""
if out in self.array_need_reuse[id_stat]:
str_stat += f"{out}{self.reuse_it[id_stat][out]} = "
cc = self.condition[id_stat][out]
if cc not in conditions:
conditions.append(cc)
if out not in already_seen:
if out in self.nameR[id_stat]:
if out not in self.transfer_totally[id_stat]:
initialization.append("// read 7\n")
initialization.append(f"{tabp1}{out}{self.reuse_it[id_stat][out]} = {self.nameR[id_stat][out]}.read();\n")
already_seen.append(out)
else:
str_stat += f"{out} = "
for k, inn in enumerate(inp):
if inn in self.array_need_reuse[id_stat]:
str_stat += f"{inn}{self.reuse_it[id_stat][inn]}"
cc = self.condition[id_stat][inn]
if cc not in conditions:
conditions.append(cc)
if inn not in already_seen:
if inn in self.nameR[id_stat]:
if inn not in self.transfer_totally[id_stat]:
initialization.append("// read 8\n")
initialization.append(f"{tabp1}{inn}{self.reuse_it[id_stat][inn]} = {self.nameR[id_stat][inn]}.read();\n")
already_seen.append(inn)
else:
str_stat += inn
if k < len(op):
str_stat += " "
str_stat += op[k]
str_stat += " "
str_stat += ";"
conds = " && ".join(conditions)
str_stat_init = "".join(initialization) + tabp1 + str_stat
str_ += f"{tab}if({conds}){{\n{str_stat_init}\n{tab}}}\n"
str_ += f"{tab}else{{\n{tab} {str_stat}\n{tab}}}\n"
return str_
def compute_transfer_totally(self, id_stat):
transfer = {}
out, inp = self.extract_array_and_constant(self.statements[id_stat], False)
for k1, inn1 in enumerate([out] + inp):
for k2, inn2 in enumerate([out] + inp):
if k2 > k1:
if inn1.split("[")[0] == inn2.split("[")[0]:
if inn1 != inn2:
transfer[inn1.split("[")[0].replace(' ', '')] = True
return transfer
def extract_iterator(self, string):
index = string.find("[")
string = string[index:]
string = string.replace("][", "!")
string = string.replace("[", "")
string = string.replace("]", "")
string = string.split("!")
return string
def multi_split(self, str_, delimiters, delete_array=False):
for delim in delimiters:
str_ = str_.replace(delim, "@")
res = str_.split("@")
new_res = []
for r in res:
if "[" in r:
new_res.append(r)
res = new_res
new_res = []
if delete_array:
for r in res:
if "[" in r:
r = r.split("[")[0]
new_res.append(r)
while "" in res:
res.remove("")
return new_res
while "" in res:
res.remove("")
return res
def remove_init_on_chip(self, all_arrays):
# FIXME need to be sure it is not read before
self.dont_need_load = []
for stat in self.statements:
out, inp = stat.split("=")
out = out.strip().split("[")[0]
inp = self.multi_split(inp.strip().replace(";", "").replace(" ", ""), ["+", "-", "*", "/"], True)
if len(inp) == 0:
if out in all_arrays:
all_arrays.remove(out)
self.dont_need_load.append(out)
return all_arrays
def multi_split2(self, str_, delimiters, delete_array=False):
for delim in delimiters:
str_ = str_.replace(delim, "@")
res = str_.split("@")
new_res = []
if delete_array:
for r in res:
if "[" in r:
r = r.split("[")[0]
new_res.append(r)
while "" in res:
res.remove("")
return new_res
while "" in res:
res.remove("")
return res
def extract_array(self, statement):
out = statement.split("=")[0]
out = out.strip().split("[")[0]
inp = statement.split("=")[1]
inp = self.multi_split(inp.strip().replace(";", "").replace(" ", ""), ["+", "-", "*", "/"], True)
return out, inp
def extract_array_and_constant(self, statement, remove_bracket=True):
out = statement.split("=")[0]
if remove_bracket:
out = out.strip().split("[")[0]
else:
if len(out) > 0 and "]" in out:
while out[-1] != "]":
out = out[:-1]
inp = statement.split("=")[1]
inp = self.multi_split2(inp.strip().replace(";", "").replace(" ", ""), ["+", "-", "*", "/"], remove_bracket)
return out, inp
def extract_operation(self, statement):
op = []
inside_bracket = False
for s in statement:
if s == "[":
inside_bracket = True
if s == "]":
inside_bracket = False
if not inside_bracket:
if s in ["+", "-", "*", "/"]:
op.append(s)
return op
def analyze_reuse(self):
self.array_use_in_statement = {}
self.Read = {}
self.Write = {}
self.posR = {}
self.posW = {}
self.nameR = {}
self.nameW = {}
self.lastWrite = {}
self.from_off_chip = {}
for id_stat, stat in enumerate(self.statements):
self.Read[id_stat] = {}
self.Write[id_stat] = {}
self.posR[id_stat] = {}
self.posW[id_stat] = {}
self.nameR[id_stat] = {}
self.nameW[id_stat] = {}
self.from_off_chip[id_stat] = {}
out, inp = self.extract_array(stat)
self.array_use_in_statement[out] = []
self.Write[id_stat][out] = False
self.Read[id_stat][out] = False
self.posW[id_stat][out] = -1
for i in inp:
self.array_use_in_statement[i] = []
self.Read[id_stat][i] = False
self.Write[id_stat][i] = False
self.posR[id_stat][i] = -1
self.posW[id_stat][i] = -1 # for next task if any
self.nameR[id_stat][i] = f"fifo_{i}_S{id_stat}"
for k, stat in enumerate(self.statements):
out, inp = self.extract_array(stat)
self.Write[k][out] = True
if k not in self.array_use_in_statement[out]:
self.array_use_in_statement[out].append(k)
for i in inp:
self.Read[k][i] = True
if k not in self.array_use_in_statement[i]:
self.array_use_in_statement[i].append(k)
for arr in list(self.array_use_in_statement.keys()):
self.lastWrite[arr] = -1
for stat in self.Write:
if arr in self.Write[stat]:
if self.Write[stat][arr]:
self.lastWrite[arr] = stat
for arr in list(self.array_use_in_statement.keys()):
for l in range(len(self.array_use_in_statement[arr])):
if l==0:
self.from_off_chip[self.array_use_in_statement[arr][l]][arr] = False # FIXME
else:
self.from_off_chip[self.array_use_in_statement[arr][l]][arr] = False
for id_stat, stat in enumerate(self.statements):
for array in list(self.array_use_in_statement.keys()):