forked from illumos/gcc
-
Notifications
You must be signed in to change notification settings - Fork 1
/
graphite-sese-to-poly.c
3009 lines (2406 loc) · 77.9 KB
/
graphite-sese-to-poly.c
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
/* Conversion of SESE regions to Polyhedra.
Copyright (C) 2009, 2010 Free Software Foundation, Inc.
Contributed by Sebastian Pop <sebastian.pop@amd.com>.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GCC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "ggc.h"
#include "tree.h"
#include "rtl.h"
#include "basic-block.h"
#include "diagnostic.h"
#include "tree-flow.h"
#include "toplev.h"
#include "tree-dump.h"
#include "timevar.h"
#include "cfgloop.h"
#include "tree-chrec.h"
#include "tree-data-ref.h"
#include "tree-scalar-evolution.h"
#include "tree-pass.h"
#include "domwalk.h"
#include "value-prof.h"
#include "pointer-set.h"
#include "gimple.h"
#include "sese.h"
#ifdef HAVE_cloog
#include "cloog/cloog.h"
#include "ppl_c.h"
#include "graphite-ppl.h"
#include "graphite.h"
#include "graphite-poly.h"
#include "graphite-scop-detection.h"
#include "graphite-clast-to-gimple.h"
#include "graphite-sese-to-poly.h"
/* Check if VAR is used in a phi node, that is no loop header. */
static bool
var_used_in_not_loop_header_phi_node (tree var)
{
imm_use_iterator imm_iter;
gimple stmt;
bool result = false;
FOR_EACH_IMM_USE_STMT (stmt, imm_iter, var)
{
basic_block bb = gimple_bb (stmt);
if (gimple_code (stmt) == GIMPLE_PHI
&& bb->loop_father->header != bb)
result = true;
}
return result;
}
/* Returns the index of the phi argument corresponding to the initial
value in the loop. */
static size_t
loop_entry_phi_arg (gimple phi)
{
loop_p loop = gimple_bb (phi)->loop_father;
size_t i;
for (i = 0; i < gimple_phi_num_args (phi); i++)
if (!flow_bb_inside_loop_p (loop, gimple_phi_arg_edge (phi, i)->src))
return i;
gcc_unreachable ();
return 0;
}
/* Removes a simple copy phi node "RES = phi (INIT, RES)" at position
PSI by inserting on the loop ENTRY edge assignment "RES = INIT". */
static void
remove_simple_copy_phi (gimple_stmt_iterator *psi)
{
gimple phi = gsi_stmt (*psi);
tree res = gimple_phi_result (phi);
size_t entry = loop_entry_phi_arg (phi);
tree init = gimple_phi_arg_def (phi, entry);
gimple stmt = gimple_build_assign (res, init);
edge e = gimple_phi_arg_edge (phi, entry);
remove_phi_node (psi, false);
gsi_insert_on_edge_immediate (e, stmt);
SSA_NAME_DEF_STMT (res) = stmt;
}
/* Removes an invariant phi node at position PSI by inserting on the
loop ENTRY edge the assignment RES = INIT. */
static void
remove_invariant_phi (sese region, gimple_stmt_iterator *psi)
{
gimple phi = gsi_stmt (*psi);
loop_p loop = loop_containing_stmt (phi);
tree res = gimple_phi_result (phi);
tree scev = scalar_evolution_in_region (region, loop, res);
size_t entry = loop_entry_phi_arg (phi);
edge e = gimple_phi_arg_edge (phi, entry);
tree var;
gimple stmt;
gimple_seq stmts;
gimple_stmt_iterator gsi;
if (tree_contains_chrecs (scev, NULL))
scev = gimple_phi_arg_def (phi, entry);
var = force_gimple_operand (scev, &stmts, true, NULL_TREE);
stmt = gimple_build_assign (res, var);
remove_phi_node (psi, false);
if (!stmts)
stmts = gimple_seq_alloc ();
gsi = gsi_last (stmts);
gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
gsi_insert_seq_on_edge (e, stmts);
gsi_commit_edge_inserts ();
SSA_NAME_DEF_STMT (res) = stmt;
}
/* Returns true when the phi node at PSI is of the form "a = phi (a, x)". */
static inline bool
simple_copy_phi_p (gimple phi)
{
tree res;
if (gimple_phi_num_args (phi) != 2)
return false;
res = gimple_phi_result (phi);
return (res == gimple_phi_arg_def (phi, 0)
|| res == gimple_phi_arg_def (phi, 1));
}
/* Returns true when the phi node at position PSI is a reduction phi
node in REGION. Otherwise moves the pointer PSI to the next phi to
be considered. */
static bool
reduction_phi_p (sese region, gimple_stmt_iterator *psi)
{
loop_p loop;
tree scev;
affine_iv iv;
gimple phi = gsi_stmt (*psi);
tree res = gimple_phi_result (phi);
if (!is_gimple_reg (res))
{
gsi_next (psi);
return false;
}
loop = loop_containing_stmt (phi);
if (simple_copy_phi_p (phi))
{
/* PRE introduces phi nodes like these, for an example,
see id-5.f in the fortran graphite testsuite:
# prephitmp.85_265 = PHI <prephitmp.85_258(33), prephitmp.85_265(18)>
*/
remove_simple_copy_phi (psi);
return false;
}
/* Main induction variables with constant strides in LOOP are not
reductions. */
if (simple_iv (loop, loop, res, &iv, true))
{
if (integer_zerop (iv.step))
remove_invariant_phi (region, psi);
else
gsi_next (psi);
return false;
}
scev = scalar_evolution_in_region (region, loop, res);
if (chrec_contains_undetermined (scev))
return true;
if (evolution_function_is_invariant_p (scev, loop->num))
{
remove_invariant_phi (region, psi);
return false;
}
/* All the other cases are considered reductions. */
return true;
}
/* Returns true when BB will be represented in graphite. Return false
for the basic blocks that contain code eliminated in the code
generation pass: i.e. induction variables and exit conditions. */
static bool
graphite_stmt_p (sese region, basic_block bb,
VEC (data_reference_p, heap) *drs)
{
gimple_stmt_iterator gsi;
loop_p loop = bb->loop_father;
if (VEC_length (data_reference_p, drs) > 0)
return true;
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
{
gimple stmt = gsi_stmt (gsi);
switch (gimple_code (stmt))
{
case GIMPLE_DEBUG:
/* Control flow expressions can be ignored, as they are
represented in the iteration domains and will be
regenerated by graphite. */
case GIMPLE_COND:
case GIMPLE_GOTO:
case GIMPLE_SWITCH:
break;
case GIMPLE_ASSIGN:
{
tree var = gimple_assign_lhs (stmt);
/* We need these bbs to be able to construct the phi nodes. */
if (var_used_in_not_loop_header_phi_node (var))
return true;
var = scalar_evolution_in_region (region, loop, var);
if (chrec_contains_undetermined (var))
return true;
break;
}
default:
return true;
}
}
return false;
}
/* Store the GRAPHITE representation of BB. */
static gimple_bb_p
new_gimple_bb (basic_block bb, VEC (data_reference_p, heap) *drs)
{
struct gimple_bb *gbb;
gbb = XNEW (struct gimple_bb);
bb->aux = gbb;
GBB_BB (gbb) = bb;
GBB_DATA_REFS (gbb) = drs;
GBB_CONDITIONS (gbb) = NULL;
GBB_CONDITION_CASES (gbb) = NULL;
GBB_CLOOG_IV_TYPES (gbb) = NULL;
return gbb;
}
static void
free_data_refs_aux (VEC (data_reference_p, heap) *datarefs)
{
unsigned int i;
struct data_reference *dr;
for (i = 0; VEC_iterate (data_reference_p, datarefs, i, dr); i++)
if (dr->aux)
{
base_alias_pair *bap = (base_alias_pair *)(dr->aux);
if (bap->alias_set)
free (bap->alias_set);
free (bap);
dr->aux = NULL;
}
}
/* Frees GBB. */
static void
free_gimple_bb (struct gimple_bb *gbb)
{
if (GBB_CLOOG_IV_TYPES (gbb))
htab_delete (GBB_CLOOG_IV_TYPES (gbb));
free_data_refs_aux (GBB_DATA_REFS (gbb));
free_data_refs (GBB_DATA_REFS (gbb));
VEC_free (gimple, heap, GBB_CONDITIONS (gbb));
VEC_free (gimple, heap, GBB_CONDITION_CASES (gbb));
GBB_BB (gbb)->aux = 0;
XDELETE (gbb);
}
/* Deletes all gimple bbs in SCOP. */
static void
remove_gbbs_in_scop (scop_p scop)
{
int i;
poly_bb_p pbb;
for (i = 0; VEC_iterate (poly_bb_p, SCOP_BBS (scop), i, pbb); i++)
free_gimple_bb (PBB_BLACK_BOX (pbb));
}
/* Deletes all scops in SCOPS. */
void
free_scops (VEC (scop_p, heap) *scops)
{
int i;
scop_p scop;
for (i = 0; VEC_iterate (scop_p, scops, i, scop); i++)
{
remove_gbbs_in_scop (scop);
free_sese (SCOP_REGION (scop));
free_scop (scop);
}
VEC_free (scop_p, heap, scops);
}
/* Generates a polyhedral black box only if the bb contains interesting
information. */
static void
try_generate_gimple_bb (scop_p scop, basic_block bb, sbitmap reductions)
{
VEC (data_reference_p, heap) *drs = VEC_alloc (data_reference_p, heap, 5);
loop_p nest = outermost_loop_in_sese (SCOP_REGION (scop), bb);
gimple_stmt_iterator gsi;
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
{
gimple stmt = gsi_stmt (gsi);
if (!is_gimple_debug (stmt))
graphite_find_data_references_in_stmt (nest, stmt, &drs);
}
if (!graphite_stmt_p (SCOP_REGION (scop), bb, drs))
free_data_refs (drs);
else
new_poly_bb (scop, new_gimple_bb (bb, drs), TEST_BIT (reductions,
bb->index));
}
/* Returns true if all predecessors of BB, that are not dominated by BB, are
marked in MAP. The predecessors dominated by BB are loop latches and will
be handled after BB. */
static bool
all_non_dominated_preds_marked_p (basic_block bb, sbitmap map)
{
edge e;
edge_iterator ei;
FOR_EACH_EDGE (e, ei, bb->preds)
if (!TEST_BIT (map, e->src->index)
&& !dominated_by_p (CDI_DOMINATORS, e->src, bb))
return false;
return true;
}
/* Compare the depth of two basic_block's P1 and P2. */
static int
compare_bb_depths (const void *p1, const void *p2)
{
const_basic_block const bb1 = *(const_basic_block const*)p1;
const_basic_block const bb2 = *(const_basic_block const*)p2;
int d1 = loop_depth (bb1->loop_father);
int d2 = loop_depth (bb2->loop_father);
if (d1 < d2)
return 1;
if (d1 > d2)
return -1;
return 0;
}
/* Sort the basic blocks from DOM such that the first are the ones at
a deepest loop level. */
static void
graphite_sort_dominated_info (VEC (basic_block, heap) *dom)
{
size_t len = VEC_length (basic_block, dom);
qsort (VEC_address (basic_block, dom), len, sizeof (basic_block),
compare_bb_depths);
}
/* Recursive helper function for build_scops_bbs. */
static void
build_scop_bbs_1 (scop_p scop, sbitmap visited, basic_block bb, sbitmap reductions)
{
sese region = SCOP_REGION (scop);
VEC (basic_block, heap) *dom;
if (TEST_BIT (visited, bb->index)
|| !bb_in_sese_p (bb, region))
return;
try_generate_gimple_bb (scop, bb, reductions);
SET_BIT (visited, bb->index);
dom = get_dominated_by (CDI_DOMINATORS, bb);
if (dom == NULL)
return;
graphite_sort_dominated_info (dom);
while (!VEC_empty (basic_block, dom))
{
int i;
basic_block dom_bb;
for (i = 0; VEC_iterate (basic_block, dom, i, dom_bb); i++)
if (all_non_dominated_preds_marked_p (dom_bb, visited))
{
build_scop_bbs_1 (scop, visited, dom_bb, reductions);
VEC_unordered_remove (basic_block, dom, i);
break;
}
}
VEC_free (basic_block, heap, dom);
}
/* Gather the basic blocks belonging to the SCOP. */
static void
build_scop_bbs (scop_p scop, sbitmap reductions)
{
sbitmap visited = sbitmap_alloc (last_basic_block);
sese region = SCOP_REGION (scop);
sbitmap_zero (visited);
build_scop_bbs_1 (scop, visited, SESE_ENTRY_BB (region), reductions);
sbitmap_free (visited);
}
/* Converts the STATIC_SCHEDULE of PBB into a scattering polyhedron.
We generate SCATTERING_DIMENSIONS scattering dimensions.
CLooG 0.15.0 and previous versions require, that all
scattering functions of one CloogProgram have the same number of
scattering dimensions, therefore we allow to specify it. This
should be removed in future versions of CLooG.
The scattering polyhedron consists of these dimensions: scattering,
loop_iterators, parameters.
Example:
| scattering_dimensions = 5
| used_scattering_dimensions = 3
| nb_iterators = 1
| scop_nb_params = 2
|
| Schedule:
| i
| 4 5
|
| Scattering polyhedron:
|
| scattering: {s1, s2, s3, s4, s5}
| loop_iterators: {i}
| parameters: {p1, p2}
|
| s1 s2 s3 s4 s5 i p1 p2 1
| 1 0 0 0 0 0 0 0 -4 = 0
| 0 1 0 0 0 -1 0 0 0 = 0
| 0 0 1 0 0 0 0 0 -5 = 0 */
static void
build_pbb_scattering_polyhedrons (ppl_Linear_Expression_t static_schedule,
poly_bb_p pbb, int scattering_dimensions)
{
int i;
scop_p scop = PBB_SCOP (pbb);
int nb_iterators = pbb_dim_iter_domain (pbb);
int used_scattering_dimensions = nb_iterators * 2 + 1;
int nb_params = scop_nb_params (scop);
ppl_Coefficient_t c;
ppl_dimension_type dim = scattering_dimensions + nb_iterators + nb_params;
Value v;
gcc_assert (scattering_dimensions >= used_scattering_dimensions);
value_init (v);
ppl_new_Coefficient (&c);
PBB_TRANSFORMED (pbb) = poly_scattering_new ();
ppl_new_C_Polyhedron_from_space_dimension
(&PBB_TRANSFORMED_SCATTERING (pbb), dim, 0);
PBB_NB_SCATTERING_TRANSFORM (pbb) = scattering_dimensions;
for (i = 0; i < scattering_dimensions; i++)
{
ppl_Constraint_t cstr;
ppl_Linear_Expression_t expr;
ppl_new_Linear_Expression_with_dimension (&expr, dim);
value_set_si (v, 1);
ppl_assign_Coefficient_from_mpz_t (c, v);
ppl_Linear_Expression_add_to_coefficient (expr, i, c);
/* Textual order inside this loop. */
if ((i % 2) == 0)
{
ppl_Linear_Expression_coefficient (static_schedule, i / 2, c);
ppl_Coefficient_to_mpz_t (c, v);
value_oppose (v, v);
ppl_assign_Coefficient_from_mpz_t (c, v);
ppl_Linear_Expression_add_to_inhomogeneous (expr, c);
}
/* Iterations of this loop. */
else /* if ((i % 2) == 1) */
{
int loop = (i - 1) / 2;
value_set_si (v, -1);
ppl_assign_Coefficient_from_mpz_t (c, v);
ppl_Linear_Expression_add_to_coefficient
(expr, scattering_dimensions + loop, c);
}
ppl_new_Constraint (&cstr, expr, PPL_CONSTRAINT_TYPE_EQUAL);
ppl_Polyhedron_add_constraint (PBB_TRANSFORMED_SCATTERING (pbb), cstr);
ppl_delete_Linear_Expression (expr);
ppl_delete_Constraint (cstr);
}
value_clear (v);
ppl_delete_Coefficient (c);
PBB_ORIGINAL (pbb) = poly_scattering_copy (PBB_TRANSFORMED (pbb));
}
/* Build for BB the static schedule.
The static schedule is a Dewey numbering of the abstract syntax
tree: http://en.wikipedia.org/wiki/Dewey_Decimal_Classification
The following example informally defines the static schedule:
A
for (i: ...)
{
for (j: ...)
{
B
C
}
for (k: ...)
{
D
E
}
}
F
Static schedules for A to F:
DEPTH
0 1 2
A 0
B 1 0 0
C 1 0 1
D 1 1 0
E 1 1 1
F 2
*/
static void
build_scop_scattering (scop_p scop)
{
int i;
poly_bb_p pbb;
gimple_bb_p previous_gbb = NULL;
ppl_Linear_Expression_t static_schedule;
ppl_Coefficient_t c;
Value v;
value_init (v);
ppl_new_Coefficient (&c);
ppl_new_Linear_Expression (&static_schedule);
/* We have to start schedules at 0 on the first component and
because we cannot compare_prefix_loops against a previous loop,
prefix will be equal to zero, and that index will be
incremented before copying. */
value_set_si (v, -1);
ppl_assign_Coefficient_from_mpz_t (c, v);
ppl_Linear_Expression_add_to_coefficient (static_schedule, 0, c);
for (i = 0; VEC_iterate (poly_bb_p, SCOP_BBS (scop), i, pbb); i++)
{
gimple_bb_p gbb = PBB_BLACK_BOX (pbb);
ppl_Linear_Expression_t common;
int prefix;
int nb_scat_dims = pbb_dim_iter_domain (pbb) * 2 + 1;
if (previous_gbb)
prefix = nb_common_loops (SCOP_REGION (scop), previous_gbb, gbb);
else
prefix = 0;
previous_gbb = gbb;
ppl_new_Linear_Expression_with_dimension (&common, prefix + 1);
ppl_assign_Linear_Expression_from_Linear_Expression (common,
static_schedule);
value_set_si (v, 1);
ppl_assign_Coefficient_from_mpz_t (c, v);
ppl_Linear_Expression_add_to_coefficient (common, prefix, c);
ppl_assign_Linear_Expression_from_Linear_Expression (static_schedule,
common);
build_pbb_scattering_polyhedrons (common, pbb, nb_scat_dims);
ppl_delete_Linear_Expression (common);
}
value_clear (v);
ppl_delete_Coefficient (c);
ppl_delete_Linear_Expression (static_schedule);
}
/* Add the value K to the dimension D of the linear expression EXPR. */
static void
add_value_to_dim (ppl_dimension_type d, ppl_Linear_Expression_t expr,
Value k)
{
Value val;
ppl_Coefficient_t coef;
ppl_new_Coefficient (&coef);
ppl_Linear_Expression_coefficient (expr, d, coef);
value_init (val);
ppl_Coefficient_to_mpz_t (coef, val);
value_addto (val, val, k);
ppl_assign_Coefficient_from_mpz_t (coef, val);
ppl_Linear_Expression_add_to_coefficient (expr, d, coef);
value_clear (val);
ppl_delete_Coefficient (coef);
}
/* In the context of scop S, scan E, the right hand side of a scalar
evolution function in loop VAR, and translate it to a linear
expression EXPR. */
static void
scan_tree_for_params_right_scev (sese s, tree e, int var,
ppl_Linear_Expression_t expr)
{
if (expr)
{
loop_p loop = get_loop (var);
ppl_dimension_type l = sese_loop_depth (s, loop) - 1;
Value val;
/* Scalar evolutions should happen in the sese region. */
gcc_assert (sese_loop_depth (s, loop) > 0);
/* We can not deal with parametric strides like:
| p = parameter;
|
| for i:
| a [i * p] = ... */
gcc_assert (TREE_CODE (e) == INTEGER_CST);
value_init (val);
value_set_si (val, int_cst_value (e));
add_value_to_dim (l, expr, val);
value_clear (val);
}
}
/* Scan the integer constant CST, and add it to the inhomogeneous part of the
linear expression EXPR. K is the multiplier of the constant. */
static void
scan_tree_for_params_int (tree cst, ppl_Linear_Expression_t expr, Value k)
{
Value val;
ppl_Coefficient_t coef;
int v = int_cst_value (cst);
value_init (val);
value_set_si (val, 0);
/* Necessary to not get "-1 = 2^n - 1". */
if (v < 0)
value_sub_int (val, val, -v);
else
value_add_int (val, val, v);
value_multiply (val, val, k);
ppl_new_Coefficient (&coef);
ppl_assign_Coefficient_from_mpz_t (coef, val);
ppl_Linear_Expression_add_to_inhomogeneous (expr, coef);
value_clear (val);
ppl_delete_Coefficient (coef);
}
/* When parameter NAME is in REGION, returns its index in SESE_PARAMS.
Otherwise returns -1. */
static inline int
parameter_index_in_region_1 (tree name, sese region)
{
int i;
tree p;
gcc_assert (TREE_CODE (name) == SSA_NAME);
for (i = 0; VEC_iterate (tree, SESE_PARAMS (region), i, p); i++)
if (p == name)
return i;
return -1;
}
/* When the parameter NAME is in REGION, returns its index in
SESE_PARAMS. Otherwise this function inserts NAME in SESE_PARAMS
and returns the index of NAME. */
static int
parameter_index_in_region (tree name, sese region)
{
int i;
gcc_assert (TREE_CODE (name) == SSA_NAME);
i = parameter_index_in_region_1 (name, region);
if (i != -1)
return i;
gcc_assert (SESE_ADD_PARAMS (region));
i = VEC_length (tree, SESE_PARAMS (region));
VEC_safe_push (tree, heap, SESE_PARAMS (region), name);
return i;
}
/* In the context of sese S, scan the expression E and translate it to
a linear expression C. When parsing a symbolic multiplication, K
represents the constant multiplier of an expression containing
parameters. */
static void
scan_tree_for_params (sese s, tree e, ppl_Linear_Expression_t c,
Value k)
{
if (e == chrec_dont_know)
return;
switch (TREE_CODE (e))
{
case POLYNOMIAL_CHREC:
scan_tree_for_params_right_scev (s, CHREC_RIGHT (e),
CHREC_VARIABLE (e), c);
scan_tree_for_params (s, CHREC_LEFT (e), c, k);
break;
case MULT_EXPR:
if (chrec_contains_symbols (TREE_OPERAND (e, 0)))
{
if (c)
{
Value val;
gcc_assert (host_integerp (TREE_OPERAND (e, 1), 0));
value_init (val);
value_set_si (val, int_cst_value (TREE_OPERAND (e, 1)));
value_multiply (val, val, k);
scan_tree_for_params (s, TREE_OPERAND (e, 0), c, val);
value_clear (val);
}
else
scan_tree_for_params (s, TREE_OPERAND (e, 0), c, k);
}
else
{
if (c)
{
Value val;
gcc_assert (host_integerp (TREE_OPERAND (e, 0), 0));
value_init (val);
value_set_si (val, int_cst_value (TREE_OPERAND (e, 0)));
value_multiply (val, val, k);
scan_tree_for_params (s, TREE_OPERAND (e, 1), c, val);
value_clear (val);
}
else
scan_tree_for_params (s, TREE_OPERAND (e, 1), c, k);
}
break;
case PLUS_EXPR:
case POINTER_PLUS_EXPR:
scan_tree_for_params (s, TREE_OPERAND (e, 0), c, k);
scan_tree_for_params (s, TREE_OPERAND (e, 1), c, k);
break;
case MINUS_EXPR:
{
ppl_Linear_Expression_t tmp_expr = NULL;
if (c)
{
ppl_dimension_type dim;
ppl_Linear_Expression_space_dimension (c, &dim);
ppl_new_Linear_Expression_with_dimension (&tmp_expr, dim);
}
scan_tree_for_params (s, TREE_OPERAND (e, 0), c, k);
scan_tree_for_params (s, TREE_OPERAND (e, 1), tmp_expr, k);
if (c)
{
ppl_subtract_Linear_Expression_from_Linear_Expression (c,
tmp_expr);
ppl_delete_Linear_Expression (tmp_expr);
}
break;
}
case NEGATE_EXPR:
{
ppl_Linear_Expression_t tmp_expr = NULL;
if (c)
{
ppl_dimension_type dim;
ppl_Linear_Expression_space_dimension (c, &dim);
ppl_new_Linear_Expression_with_dimension (&tmp_expr, dim);
}
scan_tree_for_params (s, TREE_OPERAND (e, 0), tmp_expr, k);
if (c)
{
ppl_subtract_Linear_Expression_from_Linear_Expression (c,
tmp_expr);
ppl_delete_Linear_Expression (tmp_expr);
}
break;
}
case BIT_NOT_EXPR:
{
ppl_Linear_Expression_t tmp_expr = NULL;
if (c)
{
ppl_dimension_type dim;
ppl_Linear_Expression_space_dimension (c, &dim);
ppl_new_Linear_Expression_with_dimension (&tmp_expr, dim);
}
scan_tree_for_params (s, TREE_OPERAND (e, 0), tmp_expr, k);
if (c)
{
ppl_Coefficient_t coef;
Value minus_one;
ppl_subtract_Linear_Expression_from_Linear_Expression (c,
tmp_expr);
ppl_delete_Linear_Expression (tmp_expr);
value_init (minus_one);
value_set_si (minus_one, -1);
ppl_new_Coefficient_from_mpz_t (&coef, minus_one);
ppl_Linear_Expression_add_to_inhomogeneous (c, coef);
value_clear (minus_one);
ppl_delete_Coefficient (coef);
}
break;
}
case SSA_NAME:
{
ppl_dimension_type p = parameter_index_in_region (e, s);
if (c)
{
ppl_dimension_type dim;
ppl_Linear_Expression_space_dimension (c, &dim);
p += dim - sese_nb_params (s);
add_value_to_dim (p, c, k);
}
break;
}
case INTEGER_CST:
if (c)
scan_tree_for_params_int (e, c, k);
break;
CASE_CONVERT:
case NON_LVALUE_EXPR:
scan_tree_for_params (s, TREE_OPERAND (e, 0), c, k);
break;
default:
gcc_unreachable ();
break;
}
}
/* Find parameters with respect to REGION in BB. We are looking in memory
access functions, conditions and loop bounds. */
static void
find_params_in_bb (sese region, gimple_bb_p gbb)
{
int i;
unsigned j;
data_reference_p dr;
gimple stmt;
loop_p loop = GBB_BB (gbb)->loop_father;
Value one;
value_init (one);
value_set_si (one, 1);
/* Find parameters in the access functions of data references. */
for (i = 0; VEC_iterate (data_reference_p, GBB_DATA_REFS (gbb), i, dr); i++)
for (j = 0; j < DR_NUM_DIMENSIONS (dr); j++)
scan_tree_for_params (region, DR_ACCESS_FN (dr, j), NULL, one);
/* Find parameters in conditional statements. */
for (i = 0; VEC_iterate (gimple, GBB_CONDITIONS (gbb), i, stmt); i++)
{
tree lhs = scalar_evolution_in_region (region, loop,
gimple_cond_lhs (stmt));
tree rhs = scalar_evolution_in_region (region, loop,
gimple_cond_rhs (stmt));
scan_tree_for_params (region, lhs, NULL, one);
scan_tree_for_params (region, rhs, NULL, one);
}
value_clear (one);
}
/* Record the parameters used in the SCOP. A variable is a parameter
in a scop if it does not vary during the execution of that scop. */
static void
find_scop_parameters (scop_p scop)
{
poly_bb_p pbb;
unsigned i;