forked from illumos/gcc
/
tree-ssa-operands.c
2140 lines (1777 loc) · 63.2 KB
/
tree-ssa-operands.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
/* SSA operands management for trees.
Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
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 2, 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 COPYING. If not, write to
the Free Software Foundation, 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "flags.h"
#include "function.h"
#include "diagnostic.h"
#include "tree-flow.h"
#include "tree-inline.h"
#include "tree-pass.h"
#include "ggc.h"
#include "timevar.h"
#include "toplev.h"
#include "langhooks.h"
#include "ipa-reference.h"
/* This file contains the code required to manage the operands cache of the
SSA optimizer. For every stmt, we maintain an operand cache in the stmt
annotation. This cache contains operands that will be of interest to
optimizers and other passes wishing to manipulate the IL.
The operand type are broken up into REAL and VIRTUAL operands. The real
operands are represented as pointers into the stmt's operand tree. Thus
any manipulation of the real operands will be reflected in the actual tree.
Virtual operands are represented solely in the cache, although the base
variable for the SSA_NAME may, or may not occur in the stmt's tree.
Manipulation of the virtual operands will not be reflected in the stmt tree.
The routines in this file are concerned with creating this operand cache
from a stmt tree.
The operand tree is the parsed by the various get_* routines which look
through the stmt tree for the occurrence of operands which may be of
interest, and calls are made to the append_* routines whenever one is
found. There are 5 of these routines, each representing one of the
5 types of operands. Defs, Uses, Virtual Uses, Virtual May Defs, and
Virtual Must Defs.
The append_* routines check for duplication, and simply keep a list of
unique objects for each operand type in the build_* extendable vectors.
Once the stmt tree is completely parsed, the finalize_ssa_operands()
routine is called, which proceeds to perform the finalization routine
on each of the 5 operand vectors which have been built up.
If the stmt had a previous operand cache, the finalization routines
attempt to match up the new operands with the old ones. If it's a perfect
match, the old vector is simply reused. If it isn't a perfect match, then
a new vector is created and the new operands are placed there. For
virtual operands, if the previous cache had SSA_NAME version of a
variable, and that same variable occurs in the same operands cache, then
the new cache vector will also get the same SSA_NAME.
i.e., if a stmt had a VUSE of 'a_5', and 'a' occurs in the new operand
vector for VUSE, then the new vector will also be modified such that
it contains 'a_5' rather than 'a'.
*/
/* Flags to describe operand properties in helpers. */
/* By default, operands are loaded. */
#define opf_none 0
/* Operand is the target of an assignment expression or a
call-clobbered variable */
#define opf_is_def (1 << 0)
/* Operand is the target of an assignment expression. */
#define opf_kill_def (1 << 1)
/* No virtual operands should be created in the expression. This is used
when traversing ADDR_EXPR nodes which have different semantics than
other expressions. Inside an ADDR_EXPR node, the only operands that we
need to consider are indices into arrays. For instance, &a.b[i] should
generate a USE of 'i' but it should not generate a VUSE for 'a' nor a
VUSE for 'b'. */
#define opf_no_vops (1 << 2)
/* Operand is a "non-specific" kill for call-clobbers and such. This is used
to distinguish "reset the world" events from explicit MODIFY_EXPRs. */
#define opf_non_specific (1 << 3)
/* Array for building all the def operands. */
static VEC(tree,heap) *build_defs;
/* Array for building all the use operands. */
static VEC(tree,heap) *build_uses;
/* Array for building all the v_may_def operands. */
static VEC(tree,heap) *build_v_may_defs;
/* Array for building all the vuse operands. */
static VEC(tree,heap) *build_vuses;
/* Array for building all the v_must_def operands. */
static VEC(tree,heap) *build_v_must_defs;
/* True if the operands for call clobbered vars are cached and valid. */
bool ssa_call_clobbered_cache_valid;
bool ssa_ro_call_cache_valid;
/* These arrays are the cached operand vectors for call clobbered calls. */
static VEC(tree,heap) *clobbered_v_may_defs;
static VEC(tree,heap) *clobbered_vuses;
static VEC(tree,heap) *ro_call_vuses;
static bool clobbered_aliased_loads;
static bool clobbered_aliased_stores;
static bool ro_call_aliased_loads;
static bool ops_active = false;
static GTY (()) struct ssa_operand_memory_d *operand_memory = NULL;
static unsigned operand_memory_index;
static void get_expr_operands (tree, tree *, int);
static void get_asm_expr_operands (tree);
static void get_indirect_ref_operands (tree, tree, int);
static void get_tmr_operands (tree, tree, int);
static void get_call_expr_operands (tree, tree);
static inline void append_def (tree *);
static inline void append_use (tree *);
static void append_v_may_def (tree);
static void append_v_must_def (tree);
static void add_call_clobber_ops (tree, tree);
static void add_call_read_ops (tree);
static void add_stmt_operand (tree *, stmt_ann_t, int);
static void build_ssa_operands (tree stmt);
static def_optype_p free_defs = NULL;
static use_optype_p free_uses = NULL;
static vuse_optype_p free_vuses = NULL;
static maydef_optype_p free_maydefs = NULL;
static mustdef_optype_p free_mustdefs = NULL;
/* Return the DECL_UID of the base variable of T. */
static inline unsigned
get_name_decl (tree t)
{
if (TREE_CODE (t) != SSA_NAME)
return DECL_UID (t);
else
return DECL_UID (SSA_NAME_VAR (t));
}
/* Comparison function for qsort used in operand_build_sort_virtual. */
static int
operand_build_cmp (const void *p, const void *q)
{
tree e1 = *((const tree *)p);
tree e2 = *((const tree *)q);
unsigned int u1,u2;
u1 = get_name_decl (e1);
u2 = get_name_decl (e2);
/* We want to sort in ascending order. They can never be equal. */
#ifdef ENABLE_CHECKING
gcc_assert (u1 != u2);
#endif
return (u1 > u2 ? 1 : -1);
}
/* Sort the virtual operands in LIST from lowest DECL_UID to highest. */
static inline void
operand_build_sort_virtual (VEC(tree,heap) *list)
{
int num = VEC_length (tree, list);
if (num < 2)
return;
if (num == 2)
{
if (get_name_decl (VEC_index (tree, list, 0))
> get_name_decl (VEC_index (tree, list, 1)))
{
/* Swap elements if in the wrong order. */
tree tmp = VEC_index (tree, list, 0);
VEC_replace (tree, list, 0, VEC_index (tree, list, 1));
VEC_replace (tree, list, 1, tmp);
}
return;
}
/* There are 3 or more elements, call qsort. */
qsort (VEC_address (tree, list),
VEC_length (tree, list),
sizeof (tree),
operand_build_cmp);
}
/* Return true if the ssa operands cache is active. */
bool
ssa_operands_active (void)
{
return ops_active;
}
/* Initialize the operand cache routines. */
void
init_ssa_operands (void)
{
build_defs = VEC_alloc (tree, heap, 5);
build_uses = VEC_alloc (tree, heap, 10);
build_vuses = VEC_alloc (tree, heap, 25);
build_v_may_defs = VEC_alloc (tree, heap, 25);
build_v_must_defs = VEC_alloc (tree, heap, 25);
gcc_assert (operand_memory == NULL);
operand_memory_index = SSA_OPERAND_MEMORY_SIZE;
ops_active = true;
}
/* Dispose of anything required by the operand routines. */
void
fini_ssa_operands (void)
{
struct ssa_operand_memory_d *ptr;
VEC_free (tree, heap, build_defs);
VEC_free (tree, heap, build_uses);
VEC_free (tree, heap, build_v_must_defs);
VEC_free (tree, heap, build_v_may_defs);
VEC_free (tree, heap, build_vuses);
free_defs = NULL;
free_uses = NULL;
free_vuses = NULL;
free_maydefs = NULL;
free_mustdefs = NULL;
while ((ptr = operand_memory) != NULL)
{
operand_memory = operand_memory->next;
ggc_free (ptr);
}
VEC_free (tree, heap, clobbered_v_may_defs);
VEC_free (tree, heap, clobbered_vuses);
VEC_free (tree, heap, ro_call_vuses);
ops_active = false;
}
/* Return memory for operands of SIZE chunks. */
static inline void *
ssa_operand_alloc (unsigned size)
{
char *ptr;
if (operand_memory_index + size >= SSA_OPERAND_MEMORY_SIZE)
{
struct ssa_operand_memory_d *ptr;
ptr = ggc_alloc (sizeof (struct ssa_operand_memory_d));
ptr->next = operand_memory;
operand_memory = ptr;
operand_memory_index = 0;
}
ptr = &(operand_memory->mem[operand_memory_index]);
operand_memory_index += size;
return ptr;
}
/* Make sure PTR is in the correct immediate use list. Since uses are simply
pointers into the stmt TREE, there is no way of telling if anyone has
changed what this pointer points to via TREE_OPERANDS (exp, 0) = <...>.
The contents are different, but the pointer is still the same. This
routine will check to make sure PTR is in the correct list, and if it isn't
put it in the correct list. We cannot simply check the previous node
because all nodes in the same stmt might have be changed. */
static inline void
correct_use_link (use_operand_p ptr, tree stmt)
{
use_operand_p prev;
tree root;
/* Fold_stmt () may have changed the stmt pointers. */
if (ptr->stmt != stmt)
ptr->stmt = stmt;
prev = ptr->prev;
if (prev)
{
/* Find the root element, making sure we skip any safe iterators. */
while (prev->use != NULL || prev->stmt == NULL)
prev = prev->prev;
/* Get the ssa_name of the list the node is in. */
root = prev->stmt;
/* If it's the right list, simply return. */
if (root == *(ptr->use))
return;
}
/* Its in the wrong list if we reach here. */
delink_imm_use (ptr);
link_imm_use (ptr, *(ptr->use));
}
/* This routine makes sure that PTR is in an immediate use list, and makes
sure the stmt pointer is set to the current stmt. Virtual uses do not need
the overhead of correct_use_link since they cannot be directly manipulated
like a real use can be. (They don't exist in the TREE_OPERAND nodes.) */
static inline void
set_virtual_use_link (use_operand_p ptr, tree stmt)
{
/* Fold_stmt () may have changed the stmt pointers. */
if (ptr->stmt != stmt)
ptr->stmt = stmt;
/* If this use isn't in a list, add it to the correct list. */
if (!ptr->prev)
link_imm_use (ptr, *(ptr->use));
}
#define FINALIZE_OPBUILD build_defs
#define FINALIZE_OPBUILD_BASE(I) (tree *)VEC_index (tree, \
build_defs, (I))
#define FINALIZE_OPBUILD_ELEM(I) (tree *)VEC_index (tree, \
build_defs, (I))
#define FINALIZE_FUNC finalize_ssa_def_ops
#define FINALIZE_ALLOC alloc_def
#define FINALIZE_FREE free_defs
#define FINALIZE_TYPE struct def_optype_d
#define FINALIZE_ELEM(PTR) ((PTR)->def_ptr)
#define FINALIZE_OPS DEF_OPS
#define FINALIZE_BASE(VAR) VAR
#define FINALIZE_BASE_TYPE tree *
#define FINALIZE_BASE_ZERO NULL
#define FINALIZE_INITIALIZE(PTR, VAL, STMT) FINALIZE_ELEM (PTR) = (VAL)
#include "tree-ssa-opfinalize.h"
/* This routine will create stmt operands for STMT from the def build list. */
static void
finalize_ssa_defs (tree stmt)
{
unsigned int num = VEC_length (tree, build_defs);
/* There should only be a single real definition per assignment. */
gcc_assert ((stmt && TREE_CODE (stmt) != MODIFY_EXPR) || num <= 1);
/* If there is an old list, often the new list is identical, or close, so
find the elements at the beginning that are the same as the vector. */
finalize_ssa_def_ops (stmt);
VEC_truncate (tree, build_defs, 0);
}
#define FINALIZE_OPBUILD build_uses
#define FINALIZE_OPBUILD_BASE(I) (tree *)VEC_index (tree, \
build_uses, (I))
#define FINALIZE_OPBUILD_ELEM(I) (tree *)VEC_index (tree, \
build_uses, (I))
#define FINALIZE_FUNC finalize_ssa_use_ops
#define FINALIZE_ALLOC alloc_use
#define FINALIZE_FREE free_uses
#define FINALIZE_TYPE struct use_optype_d
#define FINALIZE_ELEM(PTR) ((PTR)->use_ptr.use)
#define FINALIZE_OPS USE_OPS
#define FINALIZE_USE_PTR(PTR) USE_OP_PTR (PTR)
#define FINALIZE_CORRECT_USE correct_use_link
#define FINALIZE_BASE(VAR) VAR
#define FINALIZE_BASE_TYPE tree *
#define FINALIZE_BASE_ZERO NULL
#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
(PTR)->use_ptr.use = (VAL); \
link_imm_use_stmt (&((PTR)->use_ptr), \
*(VAL), (STMT))
#include "tree-ssa-opfinalize.h"
/* Return a new use operand vector for STMT, comparing to OLD_OPS_P. */
static void
finalize_ssa_uses (tree stmt)
{
#ifdef ENABLE_CHECKING
{
unsigned x;
unsigned num = VEC_length (tree, build_uses);
/* If the pointer to the operand is the statement itself, something is
wrong. It means that we are pointing to a local variable (the
initial call to get_stmt_operands does not pass a pointer to a
statement). */
for (x = 0; x < num; x++)
gcc_assert (*((tree *)VEC_index (tree, build_uses, x)) != stmt);
}
#endif
finalize_ssa_use_ops (stmt);
VEC_truncate (tree, build_uses, 0);
}
/* Return a new v_may_def operand vector for STMT, comparing to OLD_OPS_P. */
#define FINALIZE_OPBUILD build_v_may_defs
#define FINALIZE_OPBUILD_ELEM(I) VEC_index (tree, build_v_may_defs, (I))
#define FINALIZE_OPBUILD_BASE(I) get_name_decl (VEC_index (tree, \
build_v_may_defs, (I)))
#define FINALIZE_FUNC finalize_ssa_v_may_def_ops
#define FINALIZE_ALLOC alloc_maydef
#define FINALIZE_FREE free_maydefs
#define FINALIZE_TYPE struct maydef_optype_d
#define FINALIZE_ELEM(PTR) MAYDEF_RESULT (PTR)
#define FINALIZE_OPS MAYDEF_OPS
#define FINALIZE_USE_PTR(PTR) MAYDEF_OP_PTR (PTR)
#define FINALIZE_CORRECT_USE set_virtual_use_link
#define FINALIZE_BASE_ZERO 0
#define FINALIZE_BASE(VAR) get_name_decl (VAR)
#define FINALIZE_BASE_TYPE unsigned
#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
(PTR)->def_var = (VAL); \
(PTR)->use_var = (VAL); \
(PTR)->use_ptr.use = &((PTR)->use_var); \
link_imm_use_stmt (&((PTR)->use_ptr), \
(VAL), (STMT))
#include "tree-ssa-opfinalize.h"
static void
finalize_ssa_v_may_defs (tree stmt)
{
finalize_ssa_v_may_def_ops (stmt);
}
/* Clear the in_list bits and empty the build array for v_may_defs. */
static inline void
cleanup_v_may_defs (void)
{
unsigned x, num;
num = VEC_length (tree, build_v_may_defs);
for (x = 0; x < num; x++)
{
tree t = VEC_index (tree, build_v_may_defs, x);
if (TREE_CODE (t) != SSA_NAME)
{
var_ann_t ann = var_ann (t);
ann->in_v_may_def_list = 0;
}
}
VEC_truncate (tree, build_v_may_defs, 0);
}
#define FINALIZE_OPBUILD build_vuses
#define FINALIZE_OPBUILD_ELEM(I) VEC_index (tree, build_vuses, (I))
#define FINALIZE_OPBUILD_BASE(I) get_name_decl (VEC_index (tree, \
build_vuses, (I)))
#define FINALIZE_FUNC finalize_ssa_vuse_ops
#define FINALIZE_ALLOC alloc_vuse
#define FINALIZE_FREE free_vuses
#define FINALIZE_TYPE struct vuse_optype_d
#define FINALIZE_ELEM(PTR) VUSE_OP (PTR)
#define FINALIZE_OPS VUSE_OPS
#define FINALIZE_USE_PTR(PTR) VUSE_OP_PTR (PTR)
#define FINALIZE_CORRECT_USE set_virtual_use_link
#define FINALIZE_BASE_ZERO 0
#define FINALIZE_BASE(VAR) get_name_decl (VAR)
#define FINALIZE_BASE_TYPE unsigned
#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
(PTR)->use_var = (VAL); \
(PTR)->use_ptr.use = &((PTR)->use_var); \
link_imm_use_stmt (&((PTR)->use_ptr), \
(VAL), (STMT))
#include "tree-ssa-opfinalize.h"
/* Return a new vuse operand vector, comparing to OLD_OPS_P. */
static void
finalize_ssa_vuses (tree stmt)
{
unsigned num, num_v_may_defs;
unsigned vuse_index;
/* Remove superfluous VUSE operands. If the statement already has a
V_MAY_DEF operation for a variable 'a', then a VUSE for 'a' is not
needed because V_MAY_DEFs imply a VUSE of the variable. For instance,
suppose that variable 'a' is aliased:
# VUSE <a_2>
# a_3 = V_MAY_DEF <a_2>
a = a + 1;
The VUSE <a_2> is superfluous because it is implied by the V_MAY_DEF
operation. */
num = VEC_length (tree, build_vuses);
num_v_may_defs = VEC_length (tree, build_v_may_defs);
if (num > 0 && num_v_may_defs > 0)
{
for (vuse_index = 0; vuse_index < VEC_length (tree, build_vuses); )
{
tree vuse;
vuse = VEC_index (tree, build_vuses, vuse_index);
if (TREE_CODE (vuse) != SSA_NAME)
{
var_ann_t ann = var_ann (vuse);
ann->in_vuse_list = 0;
if (ann->in_v_may_def_list)
{
VEC_ordered_remove (tree, build_vuses, vuse_index);
continue;
}
}
vuse_index++;
}
}
else
/* Clear out the in_list bits. */
for (vuse_index = 0;
vuse_index < VEC_length (tree, build_vuses);
vuse_index++)
{
tree t = VEC_index (tree, build_vuses, vuse_index);
if (TREE_CODE (t) != SSA_NAME)
{
var_ann_t ann = var_ann (t);
ann->in_vuse_list = 0;
}
}
finalize_ssa_vuse_ops (stmt);
/* The v_may_def build vector wasn't cleaned up because we needed it. */
cleanup_v_may_defs ();
/* Free the vuses build vector. */
VEC_truncate (tree, build_vuses, 0);
}
/* Return a new v_must_def operand vector for STMT, comparing to OLD_OPS_P. */
#define FINALIZE_OPBUILD build_v_must_defs
#define FINALIZE_OPBUILD_ELEM(I) VEC_index (tree, build_v_must_defs, (I))
#define FINALIZE_OPBUILD_BASE(I) get_name_decl (VEC_index (tree, \
build_v_must_defs, (I)))
#define FINALIZE_FUNC finalize_ssa_v_must_def_ops
#define FINALIZE_ALLOC alloc_mustdef
#define FINALIZE_FREE free_mustdefs
#define FINALIZE_TYPE struct mustdef_optype_d
#define FINALIZE_ELEM(PTR) MUSTDEF_RESULT (PTR)
#define FINALIZE_OPS MUSTDEF_OPS
#define FINALIZE_USE_PTR(PTR) MUSTDEF_KILL_PTR (PTR)
#define FINALIZE_CORRECT_USE set_virtual_use_link
#define FINALIZE_BASE_ZERO 0
#define FINALIZE_BASE(VAR) get_name_decl (VAR)
#define FINALIZE_BASE_TYPE unsigned
#define FINALIZE_INITIALIZE(PTR, VAL, STMT) \
(PTR)->def_var = (VAL); \
(PTR)->kill_var = (VAL); \
(PTR)->use_ptr.use = &((PTR)->kill_var);\
link_imm_use_stmt (&((PTR)->use_ptr), \
(VAL), (STMT))
#include "tree-ssa-opfinalize.h"
static void
finalize_ssa_v_must_defs (tree stmt)
{
/* In the presence of subvars, there may be more than one V_MUST_DEF per
statement (one for each subvar). It is a bit expensive to verify that
all must-defs in a statement belong to subvars if there is more than one
MUST-def, so we don't do it. Suffice to say, if you reach here without
having subvars, and have num >1, you have hit a bug. */
finalize_ssa_v_must_def_ops (stmt);
VEC_truncate (tree, build_v_must_defs, 0);
}
/* Finalize all the build vectors, fill the new ones into INFO. */
static inline void
finalize_ssa_stmt_operands (tree stmt)
{
finalize_ssa_defs (stmt);
finalize_ssa_uses (stmt);
finalize_ssa_v_must_defs (stmt);
finalize_ssa_v_may_defs (stmt);
finalize_ssa_vuses (stmt);
}
/* Start the process of building up operands vectors in INFO. */
static inline void
start_ssa_stmt_operands (void)
{
gcc_assert (VEC_length (tree, build_defs) == 0);
gcc_assert (VEC_length (tree, build_uses) == 0);
gcc_assert (VEC_length (tree, build_vuses) == 0);
gcc_assert (VEC_length (tree, build_v_may_defs) == 0);
gcc_assert (VEC_length (tree, build_v_must_defs) == 0);
}
/* Add DEF_P to the list of pointers to operands. */
static inline void
append_def (tree *def_p)
{
VEC_safe_push (tree, heap, build_defs, (tree)def_p);
}
/* Add USE_P to the list of pointers to operands. */
static inline void
append_use (tree *use_p)
{
VEC_safe_push (tree, heap, build_uses, (tree)use_p);
}
/* Add a new virtual may def for variable VAR to the build array. */
static inline void
append_v_may_def (tree var)
{
if (TREE_CODE (var) != SSA_NAME)
{
var_ann_t ann = get_var_ann (var);
/* Don't allow duplicate entries. */
if (ann->in_v_may_def_list)
return;
ann->in_v_may_def_list = 1;
}
VEC_safe_push (tree, heap, build_v_may_defs, (tree)var);
}
/* Add VAR to the list of virtual uses. */
static inline void
append_vuse (tree var)
{
/* Don't allow duplicate entries. */
if (TREE_CODE (var) != SSA_NAME)
{
var_ann_t ann = get_var_ann (var);
if (ann->in_vuse_list || ann->in_v_may_def_list)
return;
ann->in_vuse_list = 1;
}
VEC_safe_push (tree, heap, build_vuses, (tree)var);
}
/* Add VAR to the list of virtual must definitions for INFO. */
static inline void
append_v_must_def (tree var)
{
unsigned i;
/* Don't allow duplicate entries. */
for (i = 0; i < VEC_length (tree, build_v_must_defs); i++)
if (var == VEC_index (tree, build_v_must_defs, i))
return;
VEC_safe_push (tree, heap, build_v_must_defs, (tree)var);
}
/* Parse STMT looking for operands. OLD_OPS is the original stmt operand
cache for STMT, if it existed before. When finished, the various build_*
operand vectors will have potential operands. in them. */
static void
parse_ssa_operands (tree stmt)
{
enum tree_code code;
code = TREE_CODE (stmt);
switch (code)
{
case MODIFY_EXPR:
/* First get operands from the RHS. For the LHS, we use a V_MAY_DEF if
either only part of LHS is modified or if the RHS might throw,
otherwise, use V_MUST_DEF.
??? If it might throw, we should represent somehow that it is killed
on the fallthrough path. */
{
tree lhs = TREE_OPERAND (stmt, 0);
int lhs_flags = opf_is_def;
get_expr_operands (stmt, &TREE_OPERAND (stmt, 1), opf_none);
/* If the LHS is a VIEW_CONVERT_EXPR, it isn't changing whether
or not the entire LHS is modified; that depends on what's
inside the VIEW_CONVERT_EXPR. */
if (TREE_CODE (lhs) == VIEW_CONVERT_EXPR)
lhs = TREE_OPERAND (lhs, 0);
if (TREE_CODE (lhs) != ARRAY_REF
&& TREE_CODE (lhs) != ARRAY_RANGE_REF
&& TREE_CODE (lhs) != BIT_FIELD_REF
&& TREE_CODE (lhs) != REALPART_EXPR
&& TREE_CODE (lhs) != IMAGPART_EXPR)
lhs_flags |= opf_kill_def;
get_expr_operands (stmt, &TREE_OPERAND (stmt, 0), lhs_flags);
}
break;
case COND_EXPR:
get_expr_operands (stmt, &COND_EXPR_COND (stmt), opf_none);
break;
case SWITCH_EXPR:
get_expr_operands (stmt, &SWITCH_COND (stmt), opf_none);
break;
case ASM_EXPR:
get_asm_expr_operands (stmt);
break;
case RETURN_EXPR:
get_expr_operands (stmt, &TREE_OPERAND (stmt, 0), opf_none);
break;
case GOTO_EXPR:
get_expr_operands (stmt, &GOTO_DESTINATION (stmt), opf_none);
break;
case LABEL_EXPR:
get_expr_operands (stmt, &LABEL_EXPR_LABEL (stmt), opf_none);
break;
/* These nodes contain no variable references. */
case BIND_EXPR:
case CASE_LABEL_EXPR:
case TRY_CATCH_EXPR:
case TRY_FINALLY_EXPR:
case EH_FILTER_EXPR:
case CATCH_EXPR:
case RESX_EXPR:
break;
default:
/* Notice that if get_expr_operands tries to use &STMT as the operand
pointer (which may only happen for USE operands), we will fail in
append_use. This default will handle statements like empty
statements, or CALL_EXPRs that may appear on the RHS of a statement
or as statements themselves. */
get_expr_operands (stmt, &stmt, opf_none);
break;
}
}
/* Create an operands cache for STMT, returning it in NEW_OPS. OLD_OPS are the
original operands, and if ANN is non-null, appropriate stmt flags are set
in the stmt's annotation. If ANN is NULL, this is not considered a "real"
stmt, and none of the operands will be entered into their respective
immediate uses tables. This is to allow stmts to be processed when they
are not actually in the CFG.
Note that some fields in old_ops may change to NULL, although none of the
memory they originally pointed to will be destroyed. It is appropriate
to call free_stmt_operands() on the value returned in old_ops.
The rationale for this: Certain optimizations wish to examine the difference
between new_ops and old_ops after processing. If a set of operands don't
change, new_ops will simply assume the pointer in old_ops, and the old_ops
pointer will be set to NULL, indicating no memory needs to be cleared.
Usage might appear something like:
old_ops_copy = old_ops = stmt_ann(stmt)->operands;
build_ssa_operands (stmt, NULL, &old_ops, &new_ops);
<* compare old_ops_copy and new_ops *>
free_ssa_operands (old_ops); */
static void
build_ssa_operands (tree stmt)
{
stmt_ann_t ann = get_stmt_ann (stmt);
/* Initially assume that the statement has no volatile operands, nor
makes aliased loads or stores. */
if (ann)
{
ann->has_volatile_ops = false;
ann->makes_aliased_stores = false;
ann->makes_aliased_loads = false;
}
start_ssa_stmt_operands ();
parse_ssa_operands (stmt);
operand_build_sort_virtual (build_vuses);
operand_build_sort_virtual (build_v_may_defs);
operand_build_sort_virtual (build_v_must_defs);
finalize_ssa_stmt_operands (stmt);
}
/* Free any operands vectors in OPS. */
void
free_ssa_operands (stmt_operands_p ops)
{
ops->def_ops = NULL;
ops->use_ops = NULL;
ops->maydef_ops = NULL;
ops->mustdef_ops = NULL;
ops->vuse_ops = NULL;
}
/* Get the operands of statement STMT. Note that repeated calls to
get_stmt_operands for the same statement will do nothing until the
statement is marked modified by a call to mark_stmt_modified(). */
void
update_stmt_operands (tree stmt)
{
stmt_ann_t ann = get_stmt_ann (stmt);
/* If get_stmt_operands is called before SSA is initialized, dont
do anything. */
if (!ssa_operands_active ())
return;
/* The optimizers cannot handle statements that are nothing but a
_DECL. This indicates a bug in the gimplifier. */
gcc_assert (!SSA_VAR_P (stmt));
gcc_assert (ann->modified);
timevar_push (TV_TREE_OPS);
build_ssa_operands (stmt);
/* Clear the modified bit for STMT. Subsequent calls to
get_stmt_operands for this statement will do nothing until the
statement is marked modified by a call to mark_stmt_modified(). */
ann->modified = 0;
timevar_pop (TV_TREE_OPS);
}
/* Copies virtual operands from SRC to DST. */
void
copy_virtual_operands (tree dest, tree src)
{
tree t;
ssa_op_iter iter, old_iter;
use_operand_p use_p, u2;
def_operand_p def_p, d2;
build_ssa_operands (dest);
/* Copy all the virtual fields. */
FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VUSE)
append_vuse (t);
FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VMAYDEF)
append_v_may_def (t);
FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VMUSTDEF)
append_v_must_def (t);
if (VEC_length (tree, build_vuses) == 0
&& VEC_length (tree, build_v_may_defs) == 0
&& VEC_length (tree, build_v_must_defs) == 0)
return;
/* Now commit the virtual operands to this stmt. */
finalize_ssa_v_must_defs (dest);
finalize_ssa_v_may_defs (dest);
finalize_ssa_vuses (dest);
/* Finally, set the field to the same values as then originals. */
t = op_iter_init_tree (&old_iter, src, SSA_OP_VUSE);
FOR_EACH_SSA_USE_OPERAND (use_p, dest, iter, SSA_OP_VUSE)
{
gcc_assert (!op_iter_done (&old_iter));
SET_USE (use_p, t);
t = op_iter_next_tree (&old_iter);
}
gcc_assert (op_iter_done (&old_iter));
op_iter_init_maydef (&old_iter, src, &u2, &d2);
FOR_EACH_SSA_MAYDEF_OPERAND (def_p, use_p, dest, iter)
{
gcc_assert (!op_iter_done (&old_iter));
SET_USE (use_p, USE_FROM_PTR (u2));
SET_DEF (def_p, DEF_FROM_PTR (d2));
op_iter_next_maymustdef (&u2, &d2, &old_iter);
}
gcc_assert (op_iter_done (&old_iter));
op_iter_init_mustdef (&old_iter, src, &u2, &d2);
FOR_EACH_SSA_MUSTDEF_OPERAND (def_p, use_p, dest, iter)
{
gcc_assert (!op_iter_done (&old_iter));
SET_USE (use_p, USE_FROM_PTR (u2));
SET_DEF (def_p, DEF_FROM_PTR (d2));
op_iter_next_maymustdef (&u2, &d2, &old_iter);
}
gcc_assert (op_iter_done (&old_iter));
}
/* Specifically for use in DOM's expression analysis. Given a store, we
create an artificial stmt which looks like a load from the store, this can
be used to eliminate redundant loads. OLD_OPS are the operands from the
store stmt, and NEW_STMT is the new load which represents a load of the
values stored. */
void
create_ssa_artficial_load_stmt (tree new_stmt, tree old_stmt)
{
stmt_ann_t ann;
tree op;
ssa_op_iter iter;
use_operand_p use_p;
unsigned x;
ann = get_stmt_ann (new_stmt);
/* process the stmt looking for operands. */
start_ssa_stmt_operands ();
parse_ssa_operands (new_stmt);
for (x = 0; x < VEC_length (tree, build_vuses); x++)
{
tree t = VEC_index (tree, build_vuses, x);
if (TREE_CODE (t) != SSA_NAME)
{
var_ann_t ann = var_ann (t);
ann->in_vuse_list = 0;
}
}
for (x = 0; x < VEC_length (tree, build_v_may_defs); x++)
{
tree t = VEC_index (tree, build_v_may_defs, x);
if (TREE_CODE (t) != SSA_NAME)
{
var_ann_t ann = var_ann (t);
ann->in_v_may_def_list = 0;
}
}
/* Remove any virtual operands that were found. */
VEC_truncate (tree, build_v_may_defs, 0);
VEC_truncate (tree, build_v_must_defs, 0);
VEC_truncate (tree, build_vuses, 0);
/* For each VDEF on the original statement, we want to create a
VUSE of the V_MAY_DEF result or V_MUST_DEF op on the new
statement. */
FOR_EACH_SSA_TREE_OPERAND (op, old_stmt, iter,
(SSA_OP_VMAYDEF | SSA_OP_VMUSTDEF))
append_vuse (op);