1 /* Inline functions for tree-flow.h
2 Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc.
3 Contributed by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to
19 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
22 #ifndef _TREE_FLOW_INLINE_H
23 #define _TREE_FLOW_INLINE_H 1
25 /* Inline functions for manipulating various data structures defined in
26 tree-flow.h. See tree-flow.h for documentation. */
28 /* Initialize the hashtable iterator HTI to point to hashtable TABLE */
31 first_htab_element (htab_iterator
*hti
, htab_t table
)
34 hti
->slot
= table
->entries
;
35 hti
->limit
= hti
->slot
+ htab_size (table
);
39 if (x
!= HTAB_EMPTY_ENTRY
&& x
!= HTAB_DELETED_ENTRY
)
41 } while (++(hti
->slot
) < hti
->limit
);
43 if (hti
->slot
< hti
->limit
)
48 /* Return current non-empty/deleted slot of the hashtable pointed to by HTI,
49 or NULL if we have reached the end. */
52 end_htab_p (htab_iterator
*hti
)
54 if (hti
->slot
>= hti
->limit
)
59 /* Advance the hashtable iterator pointed to by HTI to the next element of the
63 next_htab_element (htab_iterator
*hti
)
65 while (++(hti
->slot
) < hti
->limit
)
68 if (x
!= HTAB_EMPTY_ENTRY
&& x
!= HTAB_DELETED_ENTRY
)
74 /* Initialize ITER to point to the first referenced variable in the
75 referenced_vars hashtable, and return that variable. */
78 first_referenced_var (referenced_var_iterator
*iter
)
80 struct int_tree_map
*itm
;
81 itm
= (struct int_tree_map
*) first_htab_element (&iter
->hti
,
88 /* Return true if we have hit the end of the referenced variables ITER is
92 end_referenced_vars_p (referenced_var_iterator
*iter
)
94 return end_htab_p (&iter
->hti
);
97 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
98 and return that variable. */
101 next_referenced_var (referenced_var_iterator
*iter
)
103 struct int_tree_map
*itm
;
104 itm
= (struct int_tree_map
*) next_htab_element (&iter
->hti
);
110 /* Fill up VEC with the variables in the referenced vars hashtable. */
113 fill_referenced_var_vec (VEC (tree
, heap
) **vec
)
115 referenced_var_iterator rvi
;
118 FOR_EACH_REFERENCED_VAR (var
, rvi
)
119 VEC_safe_push (tree
, heap
, *vec
, var
);
122 /* Return the variable annotation for T, which must be a _DECL node.
123 Return NULL if the variable annotation doesn't already exist. */
124 static inline var_ann_t
128 gcc_assert (DECL_P (t
));
129 gcc_assert (TREE_CODE (t
) != FUNCTION_DECL
);
130 gcc_assert (!t
->common
.ann
|| t
->common
.ann
->common
.type
== VAR_ANN
);
132 return (var_ann_t
) t
->common
.ann
;
135 /* Return the variable annotation for T, which must be a _DECL node.
136 Create the variable annotation if it doesn't exist. */
137 static inline var_ann_t
138 get_var_ann (tree var
)
140 var_ann_t ann
= var_ann (var
);
141 return (ann
) ? ann
: create_var_ann (var
);
144 /* Return the function annotation for T, which must be a FUNCTION_DECL node.
145 Return NULL if the function annotation doesn't already exist. */
146 static inline function_ann_t
147 function_ann (tree t
)
150 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
);
151 gcc_assert (!t
->common
.ann
|| t
->common
.ann
->common
.type
== FUNCTION_ANN
);
153 return (function_ann_t
) t
->common
.ann
;
156 /* Return the function annotation for T, which must be a FUNCTION_DECL node.
157 Create the function annotation if it doesn't exist. */
158 static inline function_ann_t
159 get_function_ann (tree var
)
161 function_ann_t ann
= function_ann (var
);
162 return (ann
) ? ann
: create_function_ann (var
);
165 /* Return the statement annotation for T, which must be a statement
166 node. Return NULL if the statement annotation doesn't exist. */
167 static inline stmt_ann_t
170 #ifdef ENABLE_CHECKING
171 gcc_assert (is_gimple_stmt (t
));
173 return (stmt_ann_t
) t
->common
.ann
;
176 /* Return the statement annotation for T, which must be a statement
177 node. Create the statement annotation if it doesn't exist. */
178 static inline stmt_ann_t
179 get_stmt_ann (tree stmt
)
181 stmt_ann_t ann
= stmt_ann (stmt
);
182 return (ann
) ? ann
: create_stmt_ann (stmt
);
185 /* Return the annotation type for annotation ANN. */
186 static inline enum tree_ann_type
187 ann_type (tree_ann_t ann
)
189 return ann
->common
.type
;
192 /* Return the basic block for statement T. */
193 static inline basic_block
198 if (TREE_CODE (t
) == PHI_NODE
)
202 return ann
? ann
->bb
: NULL
;
205 /* Return the may_aliases varray for variable VAR, or NULL if it has
207 static inline VEC(tree
, gc
) *
208 may_aliases (tree var
)
210 var_ann_t ann
= var_ann (var
);
211 return ann
? ann
->may_aliases
: NULL
;
214 /* Return the line number for EXPR, or return -1 if we have no line
215 number information for it. */
217 get_lineno (tree expr
)
219 if (expr
== NULL_TREE
)
222 if (TREE_CODE (expr
) == COMPOUND_EXPR
)
223 expr
= TREE_OPERAND (expr
, 0);
225 if (! EXPR_HAS_LOCATION (expr
))
228 return EXPR_LINENO (expr
);
231 /* Return the file name for EXPR, or return "???" if we have no
232 filename information. */
233 static inline const char *
234 get_filename (tree expr
)
236 const char *filename
;
237 if (expr
== NULL_TREE
)
240 if (TREE_CODE (expr
) == COMPOUND_EXPR
)
241 expr
= TREE_OPERAND (expr
, 0);
243 if (EXPR_HAS_LOCATION (expr
) && (filename
= EXPR_FILENAME (expr
)))
249 /* Return true if T is a noreturn call. */
251 noreturn_call_p (tree t
)
253 tree call
= get_call_expr_in (t
);
254 return call
!= 0 && (call_expr_flags (call
) & ECF_NORETURN
) != 0;
257 /* Mark statement T as modified. */
259 mark_stmt_modified (tree t
)
262 if (TREE_CODE (t
) == PHI_NODE
)
267 ann
= create_stmt_ann (t
);
268 else if (noreturn_call_p (t
))
269 VEC_safe_push (tree
, gc
, modified_noreturn_calls
, t
);
273 /* Mark statement T as modified, and update it. */
277 if (TREE_CODE (t
) == PHI_NODE
)
279 mark_stmt_modified (t
);
280 update_stmt_operands (t
);
284 update_stmt_if_modified (tree t
)
286 if (stmt_modified_p (t
))
287 update_stmt_operands (t
);
290 /* Return true if T is marked as modified, false otherwise. */
292 stmt_modified_p (tree t
)
294 stmt_ann_t ann
= stmt_ann (t
);
296 /* Note that if the statement doesn't yet have an annotation, we consider it
297 modified. This will force the next call to update_stmt_operands to scan
299 return ann
? ann
->modified
: true;
302 /* Delink an immediate_uses node from its chain. */
304 delink_imm_use (ssa_use_operand_t
*linknode
)
306 /* Return if this node is not in a list. */
307 if (linknode
->prev
== NULL
)
310 linknode
->prev
->next
= linknode
->next
;
311 linknode
->next
->prev
= linknode
->prev
;
312 linknode
->prev
= NULL
;
313 linknode
->next
= NULL
;
316 /* Link ssa_imm_use node LINKNODE into the chain for LIST. */
318 link_imm_use_to_list (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*list
)
320 /* Link the new node at the head of the list. If we are in the process of
321 traversing the list, we won't visit any new nodes added to it. */
322 linknode
->prev
= list
;
323 linknode
->next
= list
->next
;
324 list
->next
->prev
= linknode
;
325 list
->next
= linknode
;
328 /* Link ssa_imm_use node LINKNODE into the chain for DEF. */
330 link_imm_use (ssa_use_operand_t
*linknode
, tree def
)
332 ssa_use_operand_t
*root
;
334 if (!def
|| TREE_CODE (def
) != SSA_NAME
)
335 linknode
->prev
= NULL
;
338 root
= &(SSA_NAME_IMM_USE_NODE (def
));
339 #ifdef ENABLE_CHECKING
341 gcc_assert (*(linknode
->use
) == def
);
343 link_imm_use_to_list (linknode
, root
);
347 /* Set the value of a use pointed to by USE to VAL. */
349 set_ssa_use_from_ptr (use_operand_p use
, tree val
)
351 delink_imm_use (use
);
353 link_imm_use (use
, val
);
356 /* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
359 link_imm_use_stmt (ssa_use_operand_t
*linknode
, tree def
, tree stmt
)
362 link_imm_use (linknode
, def
);
364 link_imm_use (linknode
, NULL
);
365 linknode
->stmt
= stmt
;
368 /* Relink a new node in place of an old node in the list. */
370 relink_imm_use (ssa_use_operand_t
*node
, ssa_use_operand_t
*old
)
372 /* The node one had better be in the same list. */
373 gcc_assert (*(old
->use
) == *(node
->use
));
374 node
->prev
= old
->prev
;
375 node
->next
= old
->next
;
378 old
->prev
->next
= node
;
379 old
->next
->prev
= node
;
380 /* Remove the old node from the list. */
385 /* Relink ssa_imm_use node LINKNODE into the chain for OLD, with use occurring
388 relink_imm_use_stmt (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*old
, tree stmt
)
391 relink_imm_use (linknode
, old
);
393 link_imm_use (linknode
, NULL
);
394 linknode
->stmt
= stmt
;
397 /* Finished the traverse of an immediate use list IMM by removing it from
400 end_safe_imm_use_traverse (imm_use_iterator
*imm
)
402 delink_imm_use (&(imm
->iter_node
));
405 /* Return true if IMM is at the end of the list. */
407 end_safe_imm_use_p (imm_use_iterator
*imm
)
409 return (imm
->imm_use
== imm
->end_p
);
412 /* Initialize iterator IMM to process the list for VAR. */
413 static inline use_operand_p
414 first_safe_imm_use (imm_use_iterator
*imm
, tree var
)
416 /* Set up and link the iterator node into the linked list for VAR. */
417 imm
->iter_node
.use
= NULL
;
418 imm
->iter_node
.stmt
= NULL_TREE
;
419 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
420 /* Check if there are 0 elements. */
421 if (imm
->end_p
->next
== imm
->end_p
)
423 imm
->imm_use
= imm
->end_p
;
424 return NULL_USE_OPERAND_P
;
427 link_imm_use (&(imm
->iter_node
), var
);
428 imm
->imm_use
= imm
->iter_node
.next
;
432 /* Bump IMM to the next use in the list. */
433 static inline use_operand_p
434 next_safe_imm_use (imm_use_iterator
*imm
)
436 ssa_use_operand_t
*ptr
;
440 /* If the next node following the iter_node is still the one referred to by
441 imm_use, then the list hasn't changed, go to the next node. */
442 if (imm
->iter_node
.next
== imm
->imm_use
)
444 ptr
= &(imm
->iter_node
);
445 /* Remove iternode from the list. */
446 delink_imm_use (ptr
);
447 imm
->imm_use
= imm
->imm_use
->next
;
448 if (! end_safe_imm_use_p (imm
))
450 /* This isn't the end, link iternode before the next use. */
451 ptr
->prev
= imm
->imm_use
->prev
;
452 ptr
->next
= imm
->imm_use
;
453 imm
->imm_use
->prev
->next
= ptr
;
454 imm
->imm_use
->prev
= ptr
;
461 /* If the 'next' value after the iterator isn't the same as it was, then
462 a node has been deleted, so we simply proceed to the node following
463 where the iterator is in the list. */
464 imm
->imm_use
= imm
->iter_node
.next
;
465 if (end_safe_imm_use_p (imm
))
467 end_safe_imm_use_traverse (imm
);
475 /* Return true is IMM has reached the end of the immediate use list. */
477 end_readonly_imm_use_p (imm_use_iterator
*imm
)
479 return (imm
->imm_use
== imm
->end_p
);
482 /* Initialize iterator IMM to process the list for VAR. */
483 static inline use_operand_p
484 first_readonly_imm_use (imm_use_iterator
*imm
, tree var
)
486 gcc_assert (TREE_CODE (var
) == SSA_NAME
);
488 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
489 imm
->imm_use
= imm
->end_p
->next
;
490 #ifdef ENABLE_CHECKING
491 imm
->iter_node
.next
= imm
->imm_use
->next
;
493 if (end_readonly_imm_use_p (imm
))
494 return NULL_USE_OPERAND_P
;
498 /* Bump IMM to the next use in the list. */
499 static inline use_operand_p
500 next_readonly_imm_use (imm_use_iterator
*imm
)
502 use_operand_p old
= imm
->imm_use
;
504 #ifdef ENABLE_CHECKING
505 /* If this assertion fails, it indicates the 'next' pointer has changed
506 since we the last bump. This indicates that the list is being modified
507 via stmt changes, or SET_USE, or somesuch thing, and you need to be
508 using the SAFE version of the iterator. */
509 gcc_assert (imm
->iter_node
.next
== old
->next
);
510 imm
->iter_node
.next
= old
->next
->next
;
513 imm
->imm_use
= old
->next
;
514 if (end_readonly_imm_use_p (imm
))
519 /* Return true if VAR has no uses. */
521 has_zero_uses (tree var
)
523 ssa_use_operand_t
*ptr
;
524 ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
525 /* A single use means there is no items in the list. */
526 return (ptr
== ptr
->next
);
529 /* Return true if VAR has a single use. */
531 has_single_use (tree var
)
533 ssa_use_operand_t
*ptr
;
534 ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
535 /* A single use means there is one item in the list. */
536 return (ptr
!= ptr
->next
&& ptr
== ptr
->next
->next
);
539 /* If VAR has only a single immediate use, return true, and set USE_P and STMT
540 to the use pointer and stmt of occurrence. */
542 single_imm_use (tree var
, use_operand_p
*use_p
, tree
*stmt
)
544 ssa_use_operand_t
*ptr
;
546 ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
547 if (ptr
!= ptr
->next
&& ptr
== ptr
->next
->next
)
550 *stmt
= ptr
->next
->stmt
;
553 *use_p
= NULL_USE_OPERAND_P
;
558 /* Return the number of immediate uses of VAR. */
559 static inline unsigned int
560 num_imm_uses (tree var
)
562 ssa_use_operand_t
*ptr
, *start
;
565 start
= &(SSA_NAME_IMM_USE_NODE (var
));
567 for (ptr
= start
->next
; ptr
!= start
; ptr
= ptr
->next
)
574 /* Return the tree pointer to by USE. */
576 get_use_from_ptr (use_operand_p use
)
581 /* Return the tree pointer to by DEF. */
583 get_def_from_ptr (def_operand_p def
)
588 /* Return a def_operand_p pointer for the result of PHI. */
589 static inline def_operand_p
590 get_phi_result_ptr (tree phi
)
592 return &(PHI_RESULT_TREE (phi
));
595 /* Return a use_operand_p pointer for argument I of phinode PHI. */
596 static inline use_operand_p
597 get_phi_arg_def_ptr (tree phi
, int i
)
599 return &(PHI_ARG_IMM_USE_NODE (phi
,i
));
603 /* Return the bitmap of addresses taken by STMT, or NULL if it takes
606 addresses_taken (tree stmt
)
608 stmt_ann_t ann
= stmt_ann (stmt
);
609 return ann
? ann
->addresses_taken
: NULL
;
612 /* Return the PHI nodes for basic block BB, or NULL if there are no
615 phi_nodes (basic_block bb
)
617 return bb
->phi_nodes
;
620 /* Set list of phi nodes of a basic block BB to L. */
623 set_phi_nodes (basic_block bb
, tree l
)
628 for (phi
= l
; phi
; phi
= PHI_CHAIN (phi
))
629 set_bb_for_stmt (phi
, bb
);
632 /* Return the phi argument which contains the specified use. */
635 phi_arg_index_from_use (use_operand_p use
)
637 struct phi_arg_d
*element
, *root
;
641 /* Since the use is the first thing in a PHI argument element, we can
642 calculate its index based on casting it to an argument, and performing
643 pointer arithmetic. */
645 phi
= USE_STMT (use
);
646 gcc_assert (TREE_CODE (phi
) == PHI_NODE
);
648 element
= (struct phi_arg_d
*)use
;
649 root
= &(PHI_ARG_ELT (phi
, 0));
650 index
= element
- root
;
652 #ifdef ENABLE_CHECKING
653 /* Make sure the calculation doesn't have any leftover bytes. If it does,
654 then imm_use is likely not the first element in phi_arg_d. */
656 (((char *)element
- (char *)root
) % sizeof (struct phi_arg_d
)) == 0);
657 gcc_assert (index
>= 0 && index
< PHI_ARG_CAPACITY (phi
));
663 /* Mark VAR as used, so that it'll be preserved during rtl expansion. */
666 set_is_used (tree var
)
668 var_ann_t ann
= get_var_ann (var
);
673 /* ----------------------------------------------------------------------- */
675 /* Return true if T is an executable statement. */
677 is_exec_stmt (tree t
)
679 return (t
&& !IS_EMPTY_STMT (t
) && t
!= error_mark_node
);
683 /* Return true if this stmt can be the target of a control transfer stmt such
686 is_label_stmt (tree t
)
689 switch (TREE_CODE (t
))
693 case CASE_LABEL_EXPR
:
701 /* PHI nodes should contain only ssa_names and invariants. A test
702 for ssa_name is definitely simpler; don't let invalid contents
703 slip in in the meantime. */
706 phi_ssa_name_p (tree t
)
708 if (TREE_CODE (t
) == SSA_NAME
)
710 #ifdef ENABLE_CHECKING
711 gcc_assert (is_gimple_min_invariant (t
));
716 /* ----------------------------------------------------------------------- */
718 /* Return a block_stmt_iterator that points to beginning of basic
720 static inline block_stmt_iterator
721 bsi_start (basic_block bb
)
723 block_stmt_iterator bsi
;
725 bsi
.tsi
= tsi_start (bb
->stmt_list
);
728 gcc_assert (bb
->index
< NUM_FIXED_BLOCKS
);
730 bsi
.tsi
.container
= NULL
;
736 /* Return a block statement iterator that points to the first non-label
737 statement in block BB. */
739 static inline block_stmt_iterator
740 bsi_after_labels (basic_block bb
)
742 block_stmt_iterator bsi
= bsi_start (bb
);
744 while (!bsi_end_p (bsi
) && TREE_CODE (bsi_stmt (bsi
)) == LABEL_EXPR
)
750 /* Return a block statement iterator that points to the end of basic
752 static inline block_stmt_iterator
753 bsi_last (basic_block bb
)
755 block_stmt_iterator bsi
;
757 bsi
.tsi
= tsi_last (bb
->stmt_list
);
760 gcc_assert (bb
->index
< NUM_FIXED_BLOCKS
);
762 bsi
.tsi
.container
= NULL
;
768 /* Return true if block statement iterator I has reached the end of
771 bsi_end_p (block_stmt_iterator i
)
773 return tsi_end_p (i
.tsi
);
776 /* Modify block statement iterator I so that it is at the next
777 statement in the basic block. */
779 bsi_next (block_stmt_iterator
*i
)
784 /* Modify block statement iterator I so that it is at the previous
785 statement in the basic block. */
787 bsi_prev (block_stmt_iterator
*i
)
792 /* Return the statement that block statement iterator I is currently
795 bsi_stmt (block_stmt_iterator i
)
797 return tsi_stmt (i
.tsi
);
800 /* Return a pointer to the statement that block statement iterator I
803 bsi_stmt_ptr (block_stmt_iterator i
)
805 return tsi_stmt_ptr (i
.tsi
);
808 /* Returns the loop of the statement STMT. */
810 static inline struct loop
*
811 loop_containing_stmt (tree stmt
)
813 basic_block bb
= bb_for_stmt (stmt
);
817 return bb
->loop_father
;
820 /* Return true if VAR is a clobbered by function calls. */
822 is_call_clobbered (tree var
)
824 return bitmap_bit_p (call_clobbered_vars
, DECL_UID (var
));
827 /* Mark variable VAR as being clobbered by function calls. */
829 mark_call_clobbered (tree var
, unsigned int escape_type
)
831 var_ann (var
)->escape_mask
|= escape_type
;
832 bitmap_set_bit (call_clobbered_vars
, DECL_UID (var
));
835 /* Clear the call-clobbered attribute from variable VAR. */
837 clear_call_clobbered (tree var
)
839 var_ann_t ann
= var_ann (var
);
840 ann
->escape_mask
= 0;
841 if (MTAG_P (var
) && TREE_CODE (var
) != STRUCT_FIELD_TAG
)
842 MTAG_GLOBAL (var
) = 0;
843 bitmap_clear_bit (call_clobbered_vars
, DECL_UID (var
));
846 /* Mark variable VAR as being non-addressable. */
848 mark_non_addressable (tree var
)
850 bitmap_clear_bit (call_clobbered_vars
, DECL_UID (var
));
851 TREE_ADDRESSABLE (var
) = 0;
854 /* Return the common annotation for T. Return NULL if the annotation
855 doesn't already exist. */
856 static inline tree_ann_t
859 return t
->common
.ann
;
862 /* Return a common annotation for T. Create the constant annotation if it
864 static inline tree_ann_t
865 get_tree_ann (tree t
)
867 tree_ann_t ann
= tree_ann (t
);
868 return (ann
) ? ann
: create_tree_ann (t
);
871 /* ----------------------------------------------------------------------- */
873 /* The following set of routines are used to iterator over various type of
876 /* Return true if PTR is finished iterating. */
878 op_iter_done (ssa_op_iter
*ptr
)
883 /* Get the next iterator use value for PTR. */
884 static inline use_operand_p
885 op_iter_next_use (ssa_op_iter
*ptr
)
888 #ifdef ENABLE_CHECKING
889 gcc_assert (ptr
->iter_type
== ssa_op_iter_use
);
893 use_p
= USE_OP_PTR (ptr
->uses
);
894 ptr
->uses
= ptr
->uses
->next
;
899 use_p
= VUSE_OP_PTR (ptr
->vuses
);
900 ptr
->vuses
= ptr
->vuses
->next
;
905 use_p
= MAYDEF_OP_PTR (ptr
->mayuses
);
906 ptr
->mayuses
= ptr
->mayuses
->next
;
911 use_p
= MUSTDEF_KILL_PTR (ptr
->mustkills
);
912 ptr
->mustkills
= ptr
->mustkills
->next
;
915 if (ptr
->phi_i
< ptr
->num_phi
)
917 return PHI_ARG_DEF_PTR (ptr
->phi_stmt
, (ptr
->phi_i
)++);
920 return NULL_USE_OPERAND_P
;
923 /* Get the next iterator def value for PTR. */
924 static inline def_operand_p
925 op_iter_next_def (ssa_op_iter
*ptr
)
928 #ifdef ENABLE_CHECKING
929 gcc_assert (ptr
->iter_type
== ssa_op_iter_def
);
933 def_p
= DEF_OP_PTR (ptr
->defs
);
934 ptr
->defs
= ptr
->defs
->next
;
939 def_p
= MUSTDEF_RESULT_PTR (ptr
->mustdefs
);
940 ptr
->mustdefs
= ptr
->mustdefs
->next
;
945 def_p
= MAYDEF_RESULT_PTR (ptr
->maydefs
);
946 ptr
->maydefs
= ptr
->maydefs
->next
;
950 return NULL_DEF_OPERAND_P
;
953 /* Get the next iterator tree value for PTR. */
955 op_iter_next_tree (ssa_op_iter
*ptr
)
958 #ifdef ENABLE_CHECKING
959 gcc_assert (ptr
->iter_type
== ssa_op_iter_tree
);
963 val
= USE_OP (ptr
->uses
);
964 ptr
->uses
= ptr
->uses
->next
;
969 val
= VUSE_OP (ptr
->vuses
);
970 ptr
->vuses
= ptr
->vuses
->next
;
975 val
= MAYDEF_OP (ptr
->mayuses
);
976 ptr
->mayuses
= ptr
->mayuses
->next
;
981 val
= MUSTDEF_KILL (ptr
->mustkills
);
982 ptr
->mustkills
= ptr
->mustkills
->next
;
987 val
= DEF_OP (ptr
->defs
);
988 ptr
->defs
= ptr
->defs
->next
;
993 val
= MUSTDEF_RESULT (ptr
->mustdefs
);
994 ptr
->mustdefs
= ptr
->mustdefs
->next
;
999 val
= MAYDEF_RESULT (ptr
->maydefs
);
1000 ptr
->maydefs
= ptr
->maydefs
->next
;
1010 /* This functions clears the iterator PTR, and marks it done. This is normally
1011 used to prevent warnings in the compile about might be uninitialized
1015 clear_and_done_ssa_iter (ssa_op_iter
*ptr
)
1020 ptr
->maydefs
= NULL
;
1021 ptr
->mayuses
= NULL
;
1022 ptr
->mustdefs
= NULL
;
1023 ptr
->mustkills
= NULL
;
1024 ptr
->iter_type
= ssa_op_iter_none
;
1027 ptr
->phi_stmt
= NULL_TREE
;
1031 /* Initialize the iterator PTR to the virtual defs in STMT. */
1033 op_iter_init (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1035 #ifdef ENABLE_CHECKING
1036 gcc_assert (stmt_ann (stmt
));
1039 ptr
->defs
= (flags
& SSA_OP_DEF
) ? DEF_OPS (stmt
) : NULL
;
1040 ptr
->uses
= (flags
& SSA_OP_USE
) ? USE_OPS (stmt
) : NULL
;
1041 ptr
->vuses
= (flags
& SSA_OP_VUSE
) ? VUSE_OPS (stmt
) : NULL
;
1042 ptr
->maydefs
= (flags
& SSA_OP_VMAYDEF
) ? MAYDEF_OPS (stmt
) : NULL
;
1043 ptr
->mayuses
= (flags
& SSA_OP_VMAYUSE
) ? MAYDEF_OPS (stmt
) : NULL
;
1044 ptr
->mustdefs
= (flags
& SSA_OP_VMUSTDEF
) ? MUSTDEF_OPS (stmt
) : NULL
;
1045 ptr
->mustkills
= (flags
& SSA_OP_VMUSTKILL
) ? MUSTDEF_OPS (stmt
) : NULL
;
1050 ptr
->phi_stmt
= NULL_TREE
;
1053 /* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
1055 static inline use_operand_p
1056 op_iter_init_use (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1058 gcc_assert ((flags
& SSA_OP_ALL_DEFS
) == 0);
1059 op_iter_init (ptr
, stmt
, flags
);
1060 ptr
->iter_type
= ssa_op_iter_use
;
1061 return op_iter_next_use (ptr
);
1064 /* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
1066 static inline def_operand_p
1067 op_iter_init_def (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1069 gcc_assert ((flags
& (SSA_OP_ALL_USES
| SSA_OP_VIRTUAL_KILLS
)) == 0);
1070 op_iter_init (ptr
, stmt
, flags
);
1071 ptr
->iter_type
= ssa_op_iter_def
;
1072 return op_iter_next_def (ptr
);
1075 /* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
1076 the first operand as a tree. */
1078 op_iter_init_tree (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1080 op_iter_init (ptr
, stmt
, flags
);
1081 ptr
->iter_type
= ssa_op_iter_tree
;
1082 return op_iter_next_tree (ptr
);
1085 /* Get the next iterator mustdef value for PTR, returning the mustdef values in
1088 op_iter_next_maymustdef (use_operand_p
*use
, def_operand_p
*def
,
1091 #ifdef ENABLE_CHECKING
1092 gcc_assert (ptr
->iter_type
== ssa_op_iter_maymustdef
);
1096 *def
= MAYDEF_RESULT_PTR (ptr
->mayuses
);
1097 *use
= MAYDEF_OP_PTR (ptr
->mayuses
);
1098 ptr
->mayuses
= ptr
->mayuses
->next
;
1104 *def
= MUSTDEF_RESULT_PTR (ptr
->mustkills
);
1105 *use
= MUSTDEF_KILL_PTR (ptr
->mustkills
);
1106 ptr
->mustkills
= ptr
->mustkills
->next
;
1110 *def
= NULL_DEF_OPERAND_P
;
1111 *use
= NULL_USE_OPERAND_P
;
1117 /* Initialize iterator PTR to the operands in STMT. Return the first operands
1120 op_iter_init_maydef (ssa_op_iter
*ptr
, tree stmt
, use_operand_p
*use
,
1123 gcc_assert (TREE_CODE (stmt
) != PHI_NODE
);
1125 op_iter_init (ptr
, stmt
, SSA_OP_VMAYUSE
);
1126 ptr
->iter_type
= ssa_op_iter_maymustdef
;
1127 op_iter_next_maymustdef (use
, def
, ptr
);
1131 /* Initialize iterator PTR to the operands in STMT. Return the first operands
1134 op_iter_init_mustdef (ssa_op_iter
*ptr
, tree stmt
, use_operand_p
*kill
,
1137 gcc_assert (TREE_CODE (stmt
) != PHI_NODE
);
1139 op_iter_init (ptr
, stmt
, SSA_OP_VMUSTKILL
);
1140 ptr
->iter_type
= ssa_op_iter_maymustdef
;
1141 op_iter_next_maymustdef (kill
, def
, ptr
);
1144 /* Initialize iterator PTR to the operands in STMT. Return the first operands
1147 op_iter_init_must_and_may_def (ssa_op_iter
*ptr
, tree stmt
,
1148 use_operand_p
*kill
, def_operand_p
*def
)
1150 gcc_assert (TREE_CODE (stmt
) != PHI_NODE
);
1152 op_iter_init (ptr
, stmt
, SSA_OP_VMUSTKILL
|SSA_OP_VMAYUSE
);
1153 ptr
->iter_type
= ssa_op_iter_maymustdef
;
1154 op_iter_next_maymustdef (kill
, def
, ptr
);
1158 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1161 single_ssa_tree_operand (tree stmt
, int flags
)
1166 var
= op_iter_init_tree (&iter
, stmt
, flags
);
1167 if (op_iter_done (&iter
))
1169 op_iter_next_tree (&iter
);
1170 if (op_iter_done (&iter
))
1176 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1178 static inline use_operand_p
1179 single_ssa_use_operand (tree stmt
, int flags
)
1184 var
= op_iter_init_use (&iter
, stmt
, flags
);
1185 if (op_iter_done (&iter
))
1186 return NULL_USE_OPERAND_P
;
1187 op_iter_next_use (&iter
);
1188 if (op_iter_done (&iter
))
1190 return NULL_USE_OPERAND_P
;
1195 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1197 static inline def_operand_p
1198 single_ssa_def_operand (tree stmt
, int flags
)
1203 var
= op_iter_init_def (&iter
, stmt
, flags
);
1204 if (op_iter_done (&iter
))
1205 return NULL_DEF_OPERAND_P
;
1206 op_iter_next_def (&iter
);
1207 if (op_iter_done (&iter
))
1209 return NULL_DEF_OPERAND_P
;
1213 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1216 zero_ssa_operands (tree stmt
, int flags
)
1220 op_iter_init_tree (&iter
, stmt
, flags
);
1221 return op_iter_done (&iter
);
1225 /* Return the number of operands matching FLAGS in STMT. */
1227 num_ssa_operands (tree stmt
, int flags
)
1233 FOR_EACH_SSA_TREE_OPERAND (t
, stmt
, iter
, flags
)
1239 /* Delink all immediate_use information for STMT. */
1241 delink_stmt_imm_use (tree stmt
)
1244 use_operand_p use_p
;
1246 if (ssa_operands_active ())
1247 FOR_EACH_SSA_USE_OPERAND (use_p
, stmt
, iter
,
1248 (SSA_OP_ALL_USES
| SSA_OP_ALL_KILLS
))
1249 delink_imm_use (use_p
);
1253 /* This routine will compare all the operands matching FLAGS in STMT1 to those
1254 in STMT2. TRUE is returned if they are the same. STMTs can be NULL. */
1256 compare_ssa_operands_equal (tree stmt1
, tree stmt2
, int flags
)
1258 ssa_op_iter iter1
, iter2
;
1259 tree op1
= NULL_TREE
;
1260 tree op2
= NULL_TREE
;
1266 look1
= stmt1
&& stmt_ann (stmt1
);
1267 look2
= stmt2
&& stmt_ann (stmt2
);
1271 op1
= op_iter_init_tree (&iter1
, stmt1
, flags
);
1273 return op_iter_done (&iter1
);
1276 clear_and_done_ssa_iter (&iter1
);
1280 op2
= op_iter_init_tree (&iter2
, stmt2
, flags
);
1282 return op_iter_done (&iter2
);
1285 clear_and_done_ssa_iter (&iter2
);
1287 while (!op_iter_done (&iter1
) && !op_iter_done (&iter2
))
1291 op1
= op_iter_next_tree (&iter1
);
1292 op2
= op_iter_next_tree (&iter2
);
1295 return (op_iter_done (&iter1
) && op_iter_done (&iter2
));
1299 /* If there is a single DEF in the PHI node which matches FLAG, return it.
1300 Otherwise return NULL_DEF_OPERAND_P. */
1302 single_phi_def (tree stmt
, int flags
)
1304 tree def
= PHI_RESULT (stmt
);
1305 if ((flags
& SSA_OP_DEF
) && is_gimple_reg (def
))
1307 if ((flags
& SSA_OP_VIRTUAL_DEFS
) && !is_gimple_reg (def
))
1312 /* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
1313 be either SSA_OP_USES or SAS_OP_VIRTUAL_USES. */
1314 static inline use_operand_p
1315 op_iter_init_phiuse (ssa_op_iter
*ptr
, tree phi
, int flags
)
1317 tree phi_def
= PHI_RESULT (phi
);
1320 clear_and_done_ssa_iter (ptr
);
1323 gcc_assert ((flags
& (SSA_OP_USE
| SSA_OP_VIRTUAL_USES
)) != 0);
1325 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
1327 /* If the PHI node doesn't the operand type we care about, we're done. */
1328 if ((flags
& comp
) == 0)
1331 return NULL_USE_OPERAND_P
;
1334 ptr
->phi_stmt
= phi
;
1335 ptr
->num_phi
= PHI_NUM_ARGS (phi
);
1336 ptr
->iter_type
= ssa_op_iter_use
;
1337 return op_iter_next_use (ptr
);
1341 /* Start an iterator for a PHI definition. */
1343 static inline def_operand_p
1344 op_iter_init_phidef (ssa_op_iter
*ptr
, tree phi
, int flags
)
1346 tree phi_def
= PHI_RESULT (phi
);
1349 clear_and_done_ssa_iter (ptr
);
1352 gcc_assert ((flags
& (SSA_OP_DEF
| SSA_OP_VIRTUAL_DEFS
)) != 0);
1354 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_DEF
: SSA_OP_VIRTUAL_DEFS
);
1356 /* If the PHI node doesn't the operand type we care about, we're done. */
1357 if ((flags
& comp
) == 0)
1360 return NULL_USE_OPERAND_P
;
1363 ptr
->iter_type
= ssa_op_iter_def
;
1364 /* The first call to op_iter_next_def will terminate the iterator since
1365 all the fields are NULL. Simply return the result here as the first and
1366 therefore only result. */
1367 return PHI_RESULT_PTR (phi
);
1372 /* Return true if VAR cannot be modified by the program. */
1375 unmodifiable_var_p (tree var
)
1377 if (TREE_CODE (var
) == SSA_NAME
)
1378 var
= SSA_NAME_VAR (var
);
1381 return TREE_READONLY (var
) && (TREE_STATIC (var
) || MTAG_GLOBAL (var
));
1383 return TREE_READONLY (var
) && (TREE_STATIC (var
) || DECL_EXTERNAL (var
));
1386 /* Return true if REF, an ARRAY_REF, has an INDIRECT_REF somewhere in it. */
1389 array_ref_contains_indirect_ref (tree ref
)
1391 gcc_assert (TREE_CODE (ref
) == ARRAY_REF
);
1394 ref
= TREE_OPERAND (ref
, 0);
1395 } while (handled_component_p (ref
));
1397 return TREE_CODE (ref
) == INDIRECT_REF
;
1400 /* Return true if REF, a handled component reference, has an ARRAY_REF
1404 ref_contains_array_ref (tree ref
)
1406 gcc_assert (handled_component_p (ref
));
1409 if (TREE_CODE (ref
) == ARRAY_REF
)
1411 ref
= TREE_OPERAND (ref
, 0);
1412 } while (handled_component_p (ref
));
1417 /* Given a variable VAR, lookup and return a pointer to the list of
1418 subvariables for it. */
1420 static inline subvar_t
*
1421 lookup_subvars_for_var (tree var
)
1423 var_ann_t ann
= var_ann (var
);
1425 return &ann
->subvars
;
1428 /* Given a variable VAR, return a linked list of subvariables for VAR, or
1429 NULL, if there are no subvariables. */
1431 static inline subvar_t
1432 get_subvars_for_var (tree var
)
1436 gcc_assert (SSA_VAR_P (var
));
1438 if (TREE_CODE (var
) == SSA_NAME
)
1439 subvars
= *(lookup_subvars_for_var (SSA_NAME_VAR (var
)));
1441 subvars
= *(lookup_subvars_for_var (var
));
1445 /* Return the subvariable of VAR at offset OFFSET. */
1448 get_subvar_at (tree var
, unsigned HOST_WIDE_INT offset
)
1452 for (sv
= get_subvars_for_var (var
); sv
; sv
= sv
->next
)
1453 if (sv
->offset
== offset
)
1459 /* Return true if V is a tree that we can have subvars for.
1460 Normally, this is any aggregate type. Also complex
1461 types which are not gimple registers can have subvars. */
1464 var_can_have_subvars (tree v
)
1466 /* Non decls or memory tags can never have subvars. */
1467 if (!DECL_P (v
) || MTAG_P (v
))
1470 /* Aggregates can have subvars. */
1471 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
1474 /* Complex types variables which are not also a gimple register can
1476 if (TREE_CODE (TREE_TYPE (v
)) == COMPLEX_TYPE
1477 && !DECL_COMPLEX_GIMPLE_REG_P (v
))
1484 /* Return true if OFFSET and SIZE define a range that overlaps with some
1485 portion of the range of SV, a subvar. If there was an exact overlap,
1486 *EXACT will be set to true upon return. */
1489 overlap_subvar (unsigned HOST_WIDE_INT offset
, unsigned HOST_WIDE_INT size
,
1490 subvar_t sv
, bool *exact
)
1492 /* There are three possible cases of overlap.
1493 1. We can have an exact overlap, like so:
1494 |offset, offset + size |
1495 |sv->offset, sv->offset + sv->size |
1497 2. We can have offset starting after sv->offset, like so:
1499 |offset, offset + size |
1500 |sv->offset, sv->offset + sv->size |
1502 3. We can have offset starting before sv->offset, like so:
1504 |offset, offset + size |
1505 |sv->offset, sv->offset + sv->size|
1510 if (offset
== sv
->offset
&& size
== sv
->size
)
1516 else if (offset
>= sv
->offset
&& offset
< (sv
->offset
+ sv
->size
))
1520 else if (offset
< sv
->offset
&& (size
> sv
->offset
- offset
))
1528 #endif /* _TREE_FLOW_INLINE_H */