@@ -889,7 +889,7 @@ def get_parfors_simple(self, print_loop_search):
889
889
if print_loop_search :
890
890
print_wrapped (fmt % (pf .id , loc , r_pattern ))
891
891
parfors_simple [pf .id ] = (pf , loc , r_pattern )
892
- return parfors_simple
892
+ return parfors_simple
893
893
894
894
def get_all_lines (self , parfors_simple ):
895
895
# ensure adjacency lists are the same size for both sets of info
@@ -983,6 +983,17 @@ def print_unoptimised(self, lines):
983
983
# This prints the unoptimised parfors state
984
984
sword = '+--'
985
985
fac = len (sword )
986
+ fadj , froots = self .compute_graph_info (self .fusion_info )
987
+ nadj , _nroots = self .compute_graph_info (self .nested_fusion_info )
988
+
989
+ if len (fadj ) > len (nadj ):
990
+ lim = len (fadj )
991
+ tmp = nadj
992
+ else :
993
+ lim = len (nadj )
994
+ tmp = fadj
995
+ for x in range (len (tmp ), lim ):
996
+ tmp .append ([])
986
997
987
998
def print_nest (fadj_ , nadj_ , theroot , reported , region_id ):
988
999
def print_g (fadj_ , nadj_ , nroot , depth ):
@@ -1038,6 +1049,17 @@ def print_optimised(self, lines):
1038
1049
# occurred during loop fusion and rewriting of loop nests
1039
1050
sword = '+--'
1040
1051
fac = len (sword )
1052
+ fadj , froots = self .compute_graph_info (self .fusion_info )
1053
+ nadj , _nroots = self .compute_graph_info (self .nested_fusion_info )
1054
+
1055
+ if len (fadj ) > len (nadj ):
1056
+ lim = len (fadj )
1057
+ tmp = nadj
1058
+ else :
1059
+ lim = len (nadj )
1060
+ tmp = fadj
1061
+ for x in range (len (tmp ), lim ):
1062
+ tmp .append ([])
1041
1063
1042
1064
summary = dict ()
1043
1065
# region : {fused, serialized}
0 commit comments