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
= first_htab_element (&iter
->hti
, referenced_vars
);
87 /* Return true if we have hit the end of the referenced variables ITER is
91 end_referenced_vars_p (referenced_var_iterator
*iter
)
93 return end_htab_p (&iter
->hti
);
96 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
97 and return that variable. */
100 next_referenced_var (referenced_var_iterator
*iter
)
102 struct int_tree_map
*itm
;
103 itm
= next_htab_element (&iter
->hti
);
109 /* Fill up VEC with the variables in the referenced vars hashtable. */
112 fill_referenced_var_vec (VEC (tree
, heap
) **vec
)
114 referenced_var_iterator rvi
;
117 FOR_EACH_REFERENCED_VAR (var
, rvi
)
118 VEC_safe_push (tree
, heap
, *vec
, var
);
121 /* Return the variable annotation for T, which must be a _DECL node.
122 Return NULL if the variable annotation doesn't already exist. */
123 static inline var_ann_t
127 gcc_assert (DECL_P (t
));
128 gcc_assert (!t
->common
.ann
|| t
->common
.ann
->common
.type
== VAR_ANN
);
130 return (var_ann_t
) t
->common
.ann
;
133 /* Return the variable annotation for T, which must be a _DECL node.
134 Create the variable annotation if it doesn't exist. */
135 static inline var_ann_t
136 get_var_ann (tree var
)
138 var_ann_t ann
= var_ann (var
);
139 return (ann
) ? ann
: create_var_ann (var
);
142 /* Return the statement annotation for T, which must be a statement
143 node. Return NULL if the statement annotation doesn't exist. */
144 static inline stmt_ann_t
147 #ifdef ENABLE_CHECKING
148 gcc_assert (is_gimple_stmt (t
));
150 return (stmt_ann_t
) t
->common
.ann
;
153 /* Return the statement annotation for T, which must be a statement
154 node. Create the statement annotation if it doesn't exist. */
155 static inline stmt_ann_t
156 get_stmt_ann (tree stmt
)
158 stmt_ann_t ann
= stmt_ann (stmt
);
159 return (ann
) ? ann
: create_stmt_ann (stmt
);
162 /* Return the annotation type for annotation ANN. */
163 static inline enum tree_ann_type
164 ann_type (tree_ann_t ann
)
166 return ann
->common
.type
;
169 /* Return the basic block for statement T. */
170 static inline basic_block
175 if (TREE_CODE (t
) == PHI_NODE
)
179 return ann
? ann
->bb
: NULL
;
182 /* Return the may_aliases varray for variable VAR, or NULL if it has
184 static inline varray_type
185 may_aliases (tree var
)
187 var_ann_t ann
= var_ann (var
);
188 return ann
? ann
->may_aliases
: NULL
;
191 /* Return the line number for EXPR, or return -1 if we have no line
192 number information for it. */
194 get_lineno (tree expr
)
196 if (expr
== NULL_TREE
)
199 if (TREE_CODE (expr
) == COMPOUND_EXPR
)
200 expr
= TREE_OPERAND (expr
, 0);
202 if (! EXPR_HAS_LOCATION (expr
))
205 return EXPR_LINENO (expr
);
208 /* Return the file name for EXPR, or return "???" if we have no
209 filename information. */
210 static inline const char *
211 get_filename (tree expr
)
213 const char *filename
;
214 if (expr
== NULL_TREE
)
217 if (TREE_CODE (expr
) == COMPOUND_EXPR
)
218 expr
= TREE_OPERAND (expr
, 0);
220 if (EXPR_HAS_LOCATION (expr
) && (filename
= EXPR_FILENAME (expr
)))
226 /* Return true if T is a noreturn call. */
228 noreturn_call_p (tree t
)
230 tree call
= get_call_expr_in (t
);
231 return call
!= 0 && (call_expr_flags (call
) & ECF_NORETURN
) != 0;
234 /* Mark statement T as modified. */
236 mark_stmt_modified (tree t
)
239 if (TREE_CODE (t
) == PHI_NODE
)
244 ann
= create_stmt_ann (t
);
245 else if (noreturn_call_p (t
) && cfun
->ssa
)
246 VEC_safe_push (tree
, gc
, modified_noreturn_calls
, t
);
250 /* Mark statement T as modified, and update it. */
254 if (TREE_CODE (t
) == PHI_NODE
)
256 mark_stmt_modified (t
);
257 update_stmt_operands (t
);
261 update_stmt_if_modified (tree t
)
263 if (stmt_modified_p (t
))
264 update_stmt_operands (t
);
267 /* Return true if T is marked as modified, false otherwise. */
269 stmt_modified_p (tree t
)
271 stmt_ann_t ann
= stmt_ann (t
);
273 /* Note that if the statement doesn't yet have an annotation, we consider it
274 modified. This will force the next call to update_stmt_operands to scan
276 return ann
? ann
->modified
: true;
279 /* Delink an immediate_uses node from its chain. */
281 delink_imm_use (ssa_use_operand_t
*linknode
)
283 /* Return if this node is not in a list. */
284 if (linknode
->prev
== NULL
)
287 linknode
->prev
->next
= linknode
->next
;
288 linknode
->next
->prev
= linknode
->prev
;
289 linknode
->prev
= NULL
;
290 linknode
->next
= NULL
;
293 /* Link ssa_imm_use node LINKNODE into the chain for LIST. */
295 link_imm_use_to_list (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*list
)
297 /* Link the new node at the head of the list. If we are in the process of
298 traversing the list, we won't visit any new nodes added to it. */
299 linknode
->prev
= list
;
300 linknode
->next
= list
->next
;
301 list
->next
->prev
= linknode
;
302 list
->next
= linknode
;
305 /* Link ssa_imm_use node LINKNODE into the chain for DEF. */
307 link_imm_use (ssa_use_operand_t
*linknode
, tree def
)
309 ssa_use_operand_t
*root
;
311 if (!def
|| TREE_CODE (def
) != SSA_NAME
)
312 linknode
->prev
= NULL
;
315 root
= &(SSA_NAME_IMM_USE_NODE (def
));
316 #ifdef ENABLE_CHECKING
318 gcc_assert (*(linknode
->use
) == def
);
320 link_imm_use_to_list (linknode
, root
);
324 /* Set the value of a use pointed to by USE to VAL. */
326 set_ssa_use_from_ptr (use_operand_p use
, tree val
)
328 delink_imm_use (use
);
330 link_imm_use (use
, val
);
333 /* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
336 link_imm_use_stmt (ssa_use_operand_t
*linknode
, tree def
, tree stmt
)
339 link_imm_use (linknode
, def
);
341 link_imm_use (linknode
, NULL
);
342 linknode
->stmt
= stmt
;
345 /* Relink a new node in place of an old node in the list. */
347 relink_imm_use (ssa_use_operand_t
*node
, ssa_use_operand_t
*old
)
349 /* The node one had better be in the same list. */
350 gcc_assert (*(old
->use
) == *(node
->use
));
351 node
->prev
= old
->prev
;
352 node
->next
= old
->next
;
355 old
->prev
->next
= node
;
356 old
->next
->prev
= node
;
357 /* Remove the old node from the list. */
362 /* Relink ssa_imm_use node LINKNODE into the chain for OLD, with use occurring
365 relink_imm_use_stmt (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*old
, tree stmt
)
368 relink_imm_use (linknode
, old
);
370 link_imm_use (linknode
, NULL
);
371 linknode
->stmt
= stmt
;
374 /* Finished the traverse of an immediate use list IMM by removing it from
377 end_safe_imm_use_traverse (imm_use_iterator
*imm
)
379 delink_imm_use (&(imm
->iter_node
));
382 /* Return true if IMM is at the end of the list. */
384 end_safe_imm_use_p (imm_use_iterator
*imm
)
386 return (imm
->imm_use
== imm
->end_p
);
389 /* Initialize iterator IMM to process the list for VAR. */
390 static inline use_operand_p
391 first_safe_imm_use (imm_use_iterator
*imm
, tree var
)
393 /* Set up and link the iterator node into the linked list for VAR. */
394 imm
->iter_node
.use
= NULL
;
395 imm
->iter_node
.stmt
= NULL_TREE
;
396 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
397 /* Check if there are 0 elements. */
398 if (imm
->end_p
->next
== imm
->end_p
)
400 imm
->imm_use
= imm
->end_p
;
401 return NULL_USE_OPERAND_P
;
404 link_imm_use (&(imm
->iter_node
), var
);
405 imm
->imm_use
= imm
->iter_node
.next
;
409 /* Bump IMM to the next use in the list. */
410 static inline use_operand_p
411 next_safe_imm_use (imm_use_iterator
*imm
)
413 ssa_use_operand_t
*ptr
;
417 /* If the next node following the iter_node is still the one referred to by
418 imm_use, then the list hasn't changed, go to the next node. */
419 if (imm
->iter_node
.next
== imm
->imm_use
)
421 ptr
= &(imm
->iter_node
);
422 /* Remove iternode from the list. */
423 delink_imm_use (ptr
);
424 imm
->imm_use
= imm
->imm_use
->next
;
425 if (! end_safe_imm_use_p (imm
))
427 /* This isn't the end, link iternode before the next use. */
428 ptr
->prev
= imm
->imm_use
->prev
;
429 ptr
->next
= imm
->imm_use
;
430 imm
->imm_use
->prev
->next
= ptr
;
431 imm
->imm_use
->prev
= ptr
;
438 /* If the 'next' value after the iterator isn't the same as it was, then
439 a node has been deleted, so we simply proceed to the node following
440 where the iterator is in the list. */
441 imm
->imm_use
= imm
->iter_node
.next
;
442 if (end_safe_imm_use_p (imm
))
444 end_safe_imm_use_traverse (imm
);
452 /* Return true is IMM has reached the end of the immediate use list. */
454 end_readonly_imm_use_p (imm_use_iterator
*imm
)
456 return (imm
->imm_use
== imm
->end_p
);
459 /* Initialize iterator IMM to process the list for VAR. */
460 static inline use_operand_p
461 first_readonly_imm_use (imm_use_iterator
*imm
, tree var
)
463 gcc_assert (TREE_CODE (var
) == SSA_NAME
);
465 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
466 imm
->imm_use
= imm
->end_p
->next
;
467 #ifdef ENABLE_CHECKING
468 imm
->iter_node
.next
= imm
->imm_use
->next
;
470 if (end_readonly_imm_use_p (imm
))
471 return NULL_USE_OPERAND_P
;
475 /* Bump IMM to the next use in the list. */
476 static inline use_operand_p
477 next_readonly_imm_use (imm_use_iterator
*imm
)
479 use_operand_p old
= imm
->imm_use
;
481 #ifdef ENABLE_CHECKING
482 /* If this assertion fails, it indicates the 'next' pointer has changed
483 since we the last bump. This indicates that the list is being modified
484 via stmt changes, or SET_USE, or somesuch thing, and you need to be
485 using the SAFE version of the iterator. */
486 gcc_assert (imm
->iter_node
.next
== old
->next
);
487 imm
->iter_node
.next
= old
->next
->next
;
490 imm
->imm_use
= old
->next
;
491 if (end_readonly_imm_use_p (imm
))
496 /* Return true if VAR has no uses. */
498 has_zero_uses (tree var
)
500 ssa_use_operand_t
*ptr
;
501 ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
502 /* A single use means there is no items in the list. */
503 return (ptr
== ptr
->next
);
506 /* Return true if VAR has a single use. */
508 has_single_use (tree var
)
510 ssa_use_operand_t
*ptr
;
511 ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
512 /* A single use means there is one item in the list. */
513 return (ptr
!= ptr
->next
&& ptr
== ptr
->next
->next
);
516 /* If VAR has only a single immediate use, return true, and set USE_P and STMT
517 to the use pointer and stmt of occurrence. */
519 single_imm_use (tree var
, use_operand_p
*use_p
, tree
*stmt
)
521 ssa_use_operand_t
*ptr
;
523 ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
524 if (ptr
!= ptr
->next
&& ptr
== ptr
->next
->next
)
527 *stmt
= ptr
->next
->stmt
;
530 *use_p
= NULL_USE_OPERAND_P
;
535 /* Return the number of immediate uses of VAR. */
536 static inline unsigned int
537 num_imm_uses (tree var
)
539 ssa_use_operand_t
*ptr
, *start
;
542 start
= &(SSA_NAME_IMM_USE_NODE (var
));
544 for (ptr
= start
->next
; ptr
!= start
; ptr
= ptr
->next
)
551 /* Return the tree pointer to by USE. */
553 get_use_from_ptr (use_operand_p use
)
558 /* Return the tree pointer to by DEF. */
560 get_def_from_ptr (def_operand_p def
)
565 /* Return a def_operand_p pointer for the result of PHI. */
566 static inline def_operand_p
567 get_phi_result_ptr (tree phi
)
569 return &(PHI_RESULT_TREE (phi
));
572 /* Return a use_operand_p pointer for argument I of phinode PHI. */
573 static inline use_operand_p
574 get_phi_arg_def_ptr (tree phi
, int i
)
576 return &(PHI_ARG_IMM_USE_NODE (phi
,i
));
580 /* Return the bitmap of addresses taken by STMT, or NULL if it takes
583 addresses_taken (tree stmt
)
585 stmt_ann_t ann
= stmt_ann (stmt
);
586 return ann
? ann
->addresses_taken
: NULL
;
589 /* Return the PHI nodes for basic block BB, or NULL if there are no
592 phi_nodes (basic_block bb
)
594 return bb
->phi_nodes
;
597 /* Set list of phi nodes of a basic block BB to L. */
600 set_phi_nodes (basic_block bb
, tree l
)
605 for (phi
= l
; phi
; phi
= PHI_CHAIN (phi
))
606 set_bb_for_stmt (phi
, bb
);
609 /* Return the phi argument which contains the specified use. */
612 phi_arg_index_from_use (use_operand_p use
)
614 struct phi_arg_d
*element
, *root
;
618 /* Since the use is the first thing in a PHI argument element, we can
619 calculate its index based on casting it to an argument, and performing
620 pointer arithmetic. */
622 phi
= USE_STMT (use
);
623 gcc_assert (TREE_CODE (phi
) == PHI_NODE
);
625 element
= (struct phi_arg_d
*)use
;
626 root
= &(PHI_ARG_ELT (phi
, 0));
627 index
= element
- root
;
629 #ifdef ENABLE_CHECKING
630 /* Make sure the calculation doesn't have any leftover bytes. If it does,
631 then imm_use is likely not the first element in phi_arg_d. */
633 (((char *)element
- (char *)root
) % sizeof (struct phi_arg_d
)) == 0);
634 gcc_assert (index
>= 0 && index
< PHI_ARG_CAPACITY (phi
));
640 /* Mark VAR as used, so that it'll be preserved during rtl expansion. */
643 set_is_used (tree var
)
645 var_ann_t ann
= get_var_ann (var
);
650 /* ----------------------------------------------------------------------- */
652 /* Return true if T is an executable statement. */
654 is_exec_stmt (tree t
)
656 return (t
&& !IS_EMPTY_STMT (t
) && t
!= error_mark_node
);
660 /* Return true if this stmt can be the target of a control transfer stmt such
663 is_label_stmt (tree t
)
666 switch (TREE_CODE (t
))
670 case CASE_LABEL_EXPR
:
678 /* PHI nodes should contain only ssa_names and invariants. A test
679 for ssa_name is definitely simpler; don't let invalid contents
680 slip in in the meantime. */
683 phi_ssa_name_p (tree t
)
685 if (TREE_CODE (t
) == SSA_NAME
)
687 #ifdef ENABLE_CHECKING
688 gcc_assert (is_gimple_min_invariant (t
));
693 /* ----------------------------------------------------------------------- */
695 /* Return a block_stmt_iterator that points to beginning of basic
697 static inline block_stmt_iterator
698 bsi_start (basic_block bb
)
700 block_stmt_iterator bsi
;
702 bsi
.tsi
= tsi_start (bb
->stmt_list
);
705 gcc_assert (bb
->index
< 0);
707 bsi
.tsi
.container
= NULL
;
713 /* Return a block statement iterator that points to the first non-label
716 static inline block_stmt_iterator
717 bsi_after_labels (basic_block bb
)
719 block_stmt_iterator bsi
;
720 tree_stmt_iterator next
;
726 gcc_assert (bb
->index
< 0);
728 bsi
.tsi
.container
= NULL
;
732 bsi
.tsi
= tsi_start (bb
->stmt_list
);
733 if (tsi_end_p (bsi
.tsi
))
739 while (!tsi_end_p (next
)
740 && TREE_CODE (tsi_stmt (next
)) == LABEL_EXPR
)
749 /* Return a block statement iterator that points to the end of basic
751 static inline block_stmt_iterator
752 bsi_last (basic_block bb
)
754 block_stmt_iterator bsi
;
756 bsi
.tsi
= tsi_last (bb
->stmt_list
);
759 gcc_assert (bb
->index
< 0);
761 bsi
.tsi
.container
= NULL
;
767 /* Return true if block statement iterator I has reached the end of
770 bsi_end_p (block_stmt_iterator i
)
772 return tsi_end_p (i
.tsi
);
775 /* Modify block statement iterator I so that it is at the next
776 statement in the basic block. */
778 bsi_next (block_stmt_iterator
*i
)
783 /* Modify block statement iterator I so that it is at the previous
784 statement in the basic block. */
786 bsi_prev (block_stmt_iterator
*i
)
791 /* Return the statement that block statement iterator I is currently
794 bsi_stmt (block_stmt_iterator i
)
796 return tsi_stmt (i
.tsi
);
799 /* Return a pointer to the statement that block statement iterator I
802 bsi_stmt_ptr (block_stmt_iterator i
)
804 return tsi_stmt_ptr (i
.tsi
);
807 /* Returns the loop of the statement STMT. */
809 static inline struct loop
*
810 loop_containing_stmt (tree stmt
)
812 basic_block bb
= bb_for_stmt (stmt
);
816 return bb
->loop_father
;
819 /* Return true if VAR is a clobbered by function calls. */
821 is_call_clobbered (tree var
)
823 return is_global_var (var
)
824 || bitmap_bit_p (cfun
->ssa
->call_clobbered_vars
, DECL_UID (var
));
827 /* Mark variable VAR as being clobbered by function calls. */
829 mark_call_clobbered (tree var
)
831 var_ann_t ann
= var_ann (var
);
832 /* If VAR is a memory tag, then we need to consider it a global
833 variable. This is because the pointer that VAR represents has
834 been found to point to either an arbitrary location or to a known
835 location in global memory. */
836 if (ann
->mem_tag_kind
!= NOT_A_TAG
&& ann
->mem_tag_kind
!= STRUCT_FIELD
)
837 DECL_EXTERNAL (var
) = 1;
838 bitmap_set_bit (cfun
->ssa
->call_clobbered_vars
, DECL_UID (var
));
839 ssa_call_clobbered_cache_valid_for
= NULL
;
840 ssa_ro_call_cache_valid_for
= NULL
;
843 /* Clear the call-clobbered attribute from variable VAR. */
845 clear_call_clobbered (tree var
)
847 var_ann_t ann
= var_ann (var
);
848 if (ann
->mem_tag_kind
!= NOT_A_TAG
&& ann
->mem_tag_kind
!= STRUCT_FIELD
)
849 DECL_EXTERNAL (var
) = 0;
850 bitmap_clear_bit (cfun
->ssa
->call_clobbered_vars
, DECL_UID (var
));
851 ssa_call_clobbered_cache_valid_for
= NULL
;
852 ssa_ro_call_cache_valid_for
= NULL
;
855 /* Mark variable VAR as being non-addressable. */
857 mark_non_addressable (tree var
)
859 bitmap_clear_bit (cfun
->ssa
->call_clobbered_vars
, DECL_UID (var
));
860 TREE_ADDRESSABLE (var
) = 0;
861 ssa_call_clobbered_cache_valid_for
= NULL
;
862 ssa_ro_call_cache_valid_for
= NULL
;
865 /* Return the common annotation for T. Return NULL if the annotation
866 doesn't already exist. */
867 static inline tree_ann_t
870 return t
->common
.ann
;
873 /* Return a common annotation for T. Create the constant annotation if it
875 static inline tree_ann_t
876 get_tree_ann (tree t
)
878 tree_ann_t ann
= tree_ann (t
);
879 return (ann
) ? ann
: create_tree_ann (t
);
882 /* ----------------------------------------------------------------------- */
884 /* The following set of routines are used to iterator over various type of
887 /* Return true if PTR is finished iterating. */
889 op_iter_done (ssa_op_iter
*ptr
)
894 /* Get the next iterator use value for PTR. */
895 static inline use_operand_p
896 op_iter_next_use (ssa_op_iter
*ptr
)
899 #ifdef ENABLE_CHECKING
900 gcc_assert (ptr
->iter_type
== ssa_op_iter_use
);
904 use_p
= USE_OP_PTR (ptr
->uses
);
905 ptr
->uses
= ptr
->uses
->next
;
910 use_p
= VUSE_OP_PTR (ptr
->vuses
);
911 ptr
->vuses
= ptr
->vuses
->next
;
916 use_p
= MAYDEF_OP_PTR (ptr
->mayuses
);
917 ptr
->mayuses
= ptr
->mayuses
->next
;
922 use_p
= MUSTDEF_KILL_PTR (ptr
->mustkills
);
923 ptr
->mustkills
= ptr
->mustkills
->next
;
926 if (ptr
->phi_i
< ptr
->num_phi
)
928 return PHI_ARG_DEF_PTR (ptr
->phi_stmt
, (ptr
->phi_i
)++);
931 return NULL_USE_OPERAND_P
;
934 /* Get the next iterator def value for PTR. */
935 static inline def_operand_p
936 op_iter_next_def (ssa_op_iter
*ptr
)
939 #ifdef ENABLE_CHECKING
940 gcc_assert (ptr
->iter_type
== ssa_op_iter_def
);
944 def_p
= DEF_OP_PTR (ptr
->defs
);
945 ptr
->defs
= ptr
->defs
->next
;
950 def_p
= MUSTDEF_RESULT_PTR (ptr
->mustdefs
);
951 ptr
->mustdefs
= ptr
->mustdefs
->next
;
956 def_p
= MAYDEF_RESULT_PTR (ptr
->maydefs
);
957 ptr
->maydefs
= ptr
->maydefs
->next
;
961 return NULL_DEF_OPERAND_P
;
964 /* Get the next iterator tree value for PTR. */
966 op_iter_next_tree (ssa_op_iter
*ptr
)
969 #ifdef ENABLE_CHECKING
970 gcc_assert (ptr
->iter_type
== ssa_op_iter_tree
);
974 val
= USE_OP (ptr
->uses
);
975 ptr
->uses
= ptr
->uses
->next
;
980 val
= VUSE_OP (ptr
->vuses
);
981 ptr
->vuses
= ptr
->vuses
->next
;
986 val
= MAYDEF_OP (ptr
->mayuses
);
987 ptr
->mayuses
= ptr
->mayuses
->next
;
992 val
= MUSTDEF_KILL (ptr
->mustkills
);
993 ptr
->mustkills
= ptr
->mustkills
->next
;
998 val
= DEF_OP (ptr
->defs
);
999 ptr
->defs
= ptr
->defs
->next
;
1004 val
= MUSTDEF_RESULT (ptr
->mustdefs
);
1005 ptr
->mustdefs
= ptr
->mustdefs
->next
;
1010 val
= MAYDEF_RESULT (ptr
->maydefs
);
1011 ptr
->maydefs
= ptr
->maydefs
->next
;
1021 /* This functions clears the iterator PTR, and marks it done. This is normally
1022 used to prevent warnings in the compile about might be uninitailzied
1026 clear_and_done_ssa_iter (ssa_op_iter
*ptr
)
1031 ptr
->maydefs
= NULL
;
1032 ptr
->mayuses
= NULL
;
1033 ptr
->mustdefs
= NULL
;
1034 ptr
->mustkills
= NULL
;
1035 ptr
->iter_type
= ssa_op_iter_none
;
1038 ptr
->phi_stmt
= NULL_TREE
;
1042 /* Initialize the iterator PTR to the virtual defs in STMT. */
1044 op_iter_init (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1046 #ifdef ENABLE_CHECKING
1047 gcc_assert (stmt_ann (stmt
));
1050 ptr
->defs
= (flags
& SSA_OP_DEF
) ? DEF_OPS (stmt
) : NULL
;
1051 ptr
->uses
= (flags
& SSA_OP_USE
) ? USE_OPS (stmt
) : NULL
;
1052 ptr
->vuses
= (flags
& SSA_OP_VUSE
) ? VUSE_OPS (stmt
) : NULL
;
1053 ptr
->maydefs
= (flags
& SSA_OP_VMAYDEF
) ? MAYDEF_OPS (stmt
) : NULL
;
1054 ptr
->mayuses
= (flags
& SSA_OP_VMAYUSE
) ? MAYDEF_OPS (stmt
) : NULL
;
1055 ptr
->mustdefs
= (flags
& SSA_OP_VMUSTDEF
) ? MUSTDEF_OPS (stmt
) : NULL
;
1056 ptr
->mustkills
= (flags
& SSA_OP_VMUSTKILL
) ? MUSTDEF_OPS (stmt
) : NULL
;
1061 ptr
->phi_stmt
= NULL_TREE
;
1064 /* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
1066 static inline use_operand_p
1067 op_iter_init_use (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1069 gcc_assert ((flags
& SSA_OP_ALL_DEFS
) == 0);
1070 op_iter_init (ptr
, stmt
, flags
);
1071 ptr
->iter_type
= ssa_op_iter_use
;
1072 return op_iter_next_use (ptr
);
1075 /* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
1077 static inline def_operand_p
1078 op_iter_init_def (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1080 gcc_assert ((flags
& (SSA_OP_ALL_USES
| SSA_OP_VIRTUAL_KILLS
)) == 0);
1081 op_iter_init (ptr
, stmt
, flags
);
1082 ptr
->iter_type
= ssa_op_iter_def
;
1083 return op_iter_next_def (ptr
);
1086 /* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
1087 the first operand as a tree. */
1089 op_iter_init_tree (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1091 op_iter_init (ptr
, stmt
, flags
);
1092 ptr
->iter_type
= ssa_op_iter_tree
;
1093 return op_iter_next_tree (ptr
);
1096 /* Get the next iterator mustdef value for PTR, returning the mustdef values in
1099 op_iter_next_maymustdef (use_operand_p
*use
, def_operand_p
*def
,
1102 #ifdef ENABLE_CHECKING
1103 gcc_assert (ptr
->iter_type
== ssa_op_iter_maymustdef
);
1107 *def
= MAYDEF_RESULT_PTR (ptr
->mayuses
);
1108 *use
= MAYDEF_OP_PTR (ptr
->mayuses
);
1109 ptr
->mayuses
= ptr
->mayuses
->next
;
1115 *def
= MUSTDEF_RESULT_PTR (ptr
->mustkills
);
1116 *use
= MUSTDEF_KILL_PTR (ptr
->mustkills
);
1117 ptr
->mustkills
= ptr
->mustkills
->next
;
1121 *def
= NULL_DEF_OPERAND_P
;
1122 *use
= NULL_USE_OPERAND_P
;
1128 /* Initialize iterator PTR to the operands in STMT. Return the first operands
1131 op_iter_init_maydef (ssa_op_iter
*ptr
, tree stmt
, use_operand_p
*use
,
1134 gcc_assert (TREE_CODE (stmt
) != PHI_NODE
);
1136 op_iter_init (ptr
, stmt
, SSA_OP_VMAYUSE
);
1137 ptr
->iter_type
= ssa_op_iter_maymustdef
;
1138 op_iter_next_maymustdef (use
, def
, ptr
);
1142 /* Initialize iterator PTR to the operands in STMT. Return the first operands
1145 op_iter_init_mustdef (ssa_op_iter
*ptr
, tree stmt
, use_operand_p
*kill
,
1148 gcc_assert (TREE_CODE (stmt
) != PHI_NODE
);
1150 op_iter_init (ptr
, stmt
, SSA_OP_VMUSTKILL
);
1151 ptr
->iter_type
= ssa_op_iter_maymustdef
;
1152 op_iter_next_maymustdef (kill
, def
, ptr
);
1155 /* Initialize iterator PTR to the operands in STMT. Return the first operands
1158 op_iter_init_must_and_may_def (ssa_op_iter
*ptr
, tree stmt
,
1159 use_operand_p
*kill
, def_operand_p
*def
)
1161 gcc_assert (TREE_CODE (stmt
) != PHI_NODE
);
1163 op_iter_init (ptr
, stmt
, SSA_OP_VMUSTKILL
|SSA_OP_VMAYUSE
);
1164 ptr
->iter_type
= ssa_op_iter_maymustdef
;
1165 op_iter_next_maymustdef (kill
, def
, ptr
);
1169 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1172 single_ssa_tree_operand (tree stmt
, int flags
)
1177 var
= op_iter_init_tree (&iter
, stmt
, flags
);
1178 if (op_iter_done (&iter
))
1180 op_iter_next_tree (&iter
);
1181 if (op_iter_done (&iter
))
1187 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1189 static inline use_operand_p
1190 single_ssa_use_operand (tree stmt
, int flags
)
1195 var
= op_iter_init_use (&iter
, stmt
, flags
);
1196 if (op_iter_done (&iter
))
1197 return NULL_USE_OPERAND_P
;
1198 op_iter_next_use (&iter
);
1199 if (op_iter_done (&iter
))
1201 return NULL_USE_OPERAND_P
;
1206 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1208 static inline def_operand_p
1209 single_ssa_def_operand (tree stmt
, int flags
)
1214 var
= op_iter_init_def (&iter
, stmt
, flags
);
1215 if (op_iter_done (&iter
))
1216 return NULL_DEF_OPERAND_P
;
1217 op_iter_next_def (&iter
);
1218 if (op_iter_done (&iter
))
1220 return NULL_DEF_OPERAND_P
;
1224 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1227 zero_ssa_operands (tree stmt
, int flags
)
1231 op_iter_init_tree (&iter
, stmt
, flags
);
1232 return op_iter_done (&iter
);
1236 /* Return the number of operands matching FLAGS in STMT. */
1238 num_ssa_operands (tree stmt
, int flags
)
1244 FOR_EACH_SSA_TREE_OPERAND (t
, stmt
, iter
, flags
)
1250 /* Delink all immediate_use information for STMT. */
1252 delink_stmt_imm_use (tree stmt
)
1255 use_operand_p use_p
;
1257 if (ssa_operands_active ())
1258 FOR_EACH_SSA_USE_OPERAND (use_p
, stmt
, iter
,
1259 (SSA_OP_ALL_USES
| SSA_OP_ALL_KILLS
))
1260 delink_imm_use (use_p
);
1264 /* This routine will compare all the operands matching FLAGS in STMT1 to those
1265 in STMT2. TRUE is returned if they are the same. STMTs can be NULL. */
1267 compare_ssa_operands_equal (tree stmt1
, tree stmt2
, int flags
)
1269 ssa_op_iter iter1
, iter2
;
1270 tree op1
= NULL_TREE
;
1271 tree op2
= NULL_TREE
;
1277 look1
= stmt1
&& stmt_ann (stmt1
);
1278 look2
= stmt2
&& stmt_ann (stmt2
);
1282 op1
= op_iter_init_tree (&iter1
, stmt1
, flags
);
1284 return op_iter_done (&iter1
);
1287 clear_and_done_ssa_iter (&iter1
);
1291 op2
= op_iter_init_tree (&iter2
, stmt2
, flags
);
1293 return op_iter_done (&iter2
);
1296 clear_and_done_ssa_iter (&iter2
);
1298 while (!op_iter_done (&iter1
) && !op_iter_done (&iter2
))
1302 op1
= op_iter_next_tree (&iter1
);
1303 op2
= op_iter_next_tree (&iter2
);
1306 return (op_iter_done (&iter1
) && op_iter_done (&iter2
));
1310 /* If there is a single DEF in the PHI node which matches FLAG, return it.
1311 Otherwise return NULL_DEF_OPERAND_P. */
1313 single_phi_def (tree stmt
, int flags
)
1315 tree def
= PHI_RESULT (stmt
);
1316 if ((flags
& SSA_OP_DEF
) && is_gimple_reg (def
))
1318 if ((flags
& SSA_OP_VIRTUAL_DEFS
) && !is_gimple_reg (def
))
1323 /* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
1324 be either SSA_OP_USES or SAS_OP_VIRTUAL_USES. */
1325 static inline use_operand_p
1326 op_iter_init_phiuse (ssa_op_iter
*ptr
, tree phi
, int flags
)
1328 tree phi_def
= PHI_RESULT (phi
);
1331 clear_and_done_ssa_iter (ptr
);
1334 gcc_assert ((flags
& (SSA_OP_USE
| SSA_OP_VIRTUAL_USES
)) != 0);
1336 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
1338 /* If the PHI node doesn't the operand type we care about, we're done. */
1339 if ((flags
& comp
) == 0)
1342 return NULL_USE_OPERAND_P
;
1345 ptr
->phi_stmt
= phi
;
1346 ptr
->num_phi
= PHI_NUM_ARGS (phi
);
1347 ptr
->iter_type
= ssa_op_iter_use
;
1348 return op_iter_next_use (ptr
);
1352 /* Start an iterator for a PHI definition. */
1354 static inline def_operand_p
1355 op_iter_init_phidef (ssa_op_iter
*ptr
, tree phi
, int flags
)
1357 tree phi_def
= PHI_RESULT (phi
);
1360 clear_and_done_ssa_iter (ptr
);
1363 gcc_assert ((flags
& (SSA_OP_DEF
| SSA_OP_VIRTUAL_DEFS
)) != 0);
1365 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_DEF
: SSA_OP_VIRTUAL_DEFS
);
1367 /* If the PHI node doesn't the operand type we care about, we're done. */
1368 if ((flags
& comp
) == 0)
1371 return NULL_USE_OPERAND_P
;
1374 ptr
->iter_type
= ssa_op_iter_def
;
1375 /* The first call to op_iter_next_def will terminate the iterator since
1376 all the fields are NULL. Simply return the result here as the first and
1377 therefore only result. */
1378 return PHI_RESULT_PTR (phi
);
1383 /* Return true if VAR cannot be modified by the program. */
1386 unmodifiable_var_p (tree var
)
1388 if (TREE_CODE (var
) == SSA_NAME
)
1389 var
= SSA_NAME_VAR (var
);
1390 return TREE_READONLY (var
) && (TREE_STATIC (var
) || DECL_EXTERNAL (var
));
1393 /* Return true if REF, an ARRAY_REF, has an INDIRECT_REF somewhere in
1397 ref_contains_indirect_ref (tree ref
)
1399 while (handled_component_p (ref
))
1401 if (TREE_CODE (ref
) == INDIRECT_REF
)
1403 ref
= TREE_OPERAND (ref
, 0);
1408 /* Return true if REF, a COMPONENT_REF, has an ARRAY_REF somewhere in it. */
1411 ref_contains_array_ref (tree ref
)
1413 while (handled_component_p (ref
))
1415 if (TREE_CODE (ref
) == ARRAY_REF
)
1417 ref
= TREE_OPERAND (ref
, 0);
1422 /* Given a variable VAR, lookup and return a pointer to the list of
1423 subvariables for it. */
1425 static inline subvar_t
*
1426 lookup_subvars_for_var (tree var
)
1428 var_ann_t ann
= var_ann (var
);
1430 return &ann
->subvars
;
1433 /* Given a variable VAR, return a linked list of subvariables for VAR, or
1434 NULL, if there are no subvariables. */
1436 static inline subvar_t
1437 get_subvars_for_var (tree var
)
1441 gcc_assert (SSA_VAR_P (var
));
1443 if (TREE_CODE (var
) == SSA_NAME
)
1444 subvars
= *(lookup_subvars_for_var (SSA_NAME_VAR (var
)));
1446 subvars
= *(lookup_subvars_for_var (var
));
1450 /* Return the subvariable of VAR at offset OFFSET. */
1453 get_subvar_at (tree var
, unsigned HOST_WIDE_INT offset
)
1457 for (sv
= get_subvars_for_var (var
); sv
; sv
= sv
->next
)
1458 if (sv
->offset
== offset
)
1464 /* Return true if V is a tree that we can have subvars for.
1465 Normally, this is any aggregate type, however, due to implementation
1466 limitations ATM, we exclude array types as well. */
1469 var_can_have_subvars (tree v
)
1471 return (AGGREGATE_TYPE_P (TREE_TYPE (v
)) &&
1472 TREE_CODE (TREE_TYPE (v
)) != ARRAY_TYPE
);
1476 /* Return true if OFFSET and SIZE define a range that overlaps with some
1477 portion of the range of SV, a subvar. If there was an exact overlap,
1478 *EXACT will be set to true upon return. */
1481 overlap_subvar (unsigned HOST_WIDE_INT offset
, unsigned HOST_WIDE_INT size
,
1482 subvar_t sv
, bool *exact
)
1484 /* There are three possible cases of overlap.
1485 1. We can have an exact overlap, like so:
1486 |offset, offset + size |
1487 |sv->offset, sv->offset + sv->size |
1489 2. We can have offset starting after sv->offset, like so:
1491 |offset, offset + size |
1492 |sv->offset, sv->offset + sv->size |
1494 3. We can have offset starting before sv->offset, like so:
1496 |offset, offset + size |
1497 |sv->offset, sv->offset + sv->size|
1502 if (offset
== sv
->offset
&& size
== sv
->size
)
1508 else if (offset
>= sv
->offset
&& offset
< (sv
->offset
+ sv
->size
))
1512 else if (offset
< sv
->offset
&& (size
> sv
->offset
- offset
))
1520 #endif /* _TREE_FLOW_INLINE_H */