1 /* Inline functions for tree-flow.h
2 Copyright (C) 2001, 2003, 2005, 2006, 2007, 2008, 2010
3 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
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 /* Return true when gimple SSA form was built.
29 gimple_in_ssa_p is queried by gimplifier in various early stages before SSA
30 infrastructure is initialized. Check for presence of the datastructures
33 gimple_in_ssa_p (const struct function
*fun
)
35 return fun
&& fun
->gimple_df
&& fun
->gimple_df
->in_ssa_p
;
38 /* Array of all variables referenced in the function. */
40 gimple_referenced_vars (const struct function
*fun
)
44 return fun
->gimple_df
->referenced_vars
;
47 /* Artificial variable used for the virtual operand FUD chain. */
49 gimple_vop (const struct function
*fun
)
51 gcc_checking_assert (fun
&& fun
->gimple_df
);
52 return fun
->gimple_df
->vop
;
55 /* Initialize the hashtable iterator HTI to point to hashtable TABLE */
58 first_htab_element (htab_iterator
*hti
, htab_t table
)
61 hti
->slot
= table
->entries
;
62 hti
->limit
= hti
->slot
+ htab_size (table
);
66 if (x
!= HTAB_EMPTY_ENTRY
&& x
!= HTAB_DELETED_ENTRY
)
68 } while (++(hti
->slot
) < hti
->limit
);
70 if (hti
->slot
< hti
->limit
)
75 /* Return current non-empty/deleted slot of the hashtable pointed to by HTI,
76 or NULL if we have reached the end. */
79 end_htab_p (const htab_iterator
*hti
)
81 if (hti
->slot
>= hti
->limit
)
86 /* Advance the hashtable iterator pointed to by HTI to the next element of the
90 next_htab_element (htab_iterator
*hti
)
92 while (++(hti
->slot
) < hti
->limit
)
95 if (x
!= HTAB_EMPTY_ENTRY
&& x
!= HTAB_DELETED_ENTRY
)
101 /* Get the variable with uid UID from the list of referenced vars. */
104 referenced_var (unsigned int uid
)
106 tree var
= referenced_var_lookup (uid
);
107 gcc_assert (var
|| uid
== 0);
111 /* Initialize ITER to point to the first referenced variable in the
112 referenced_vars hashtable, and return that variable. */
115 first_referenced_var (referenced_var_iterator
*iter
)
117 return (tree
) first_htab_element (&iter
->hti
,
118 gimple_referenced_vars (cfun
));
121 /* Return true if we have hit the end of the referenced variables ITER is
122 iterating through. */
125 end_referenced_vars_p (const referenced_var_iterator
*iter
)
127 return end_htab_p (&iter
->hti
);
130 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
131 and return that variable. */
134 next_referenced_var (referenced_var_iterator
*iter
)
136 return (tree
) next_htab_element (&iter
->hti
);
139 /* Return the variable annotation for T, which must be a _DECL node.
140 Return NULL if the variable annotation doesn't already exist. */
141 static inline var_ann_t
142 var_ann (const_tree t
)
144 const var_ann_t
*p
= DECL_VAR_ANN_PTR (t
);
145 return p
? *p
: NULL
;
148 /* Return the variable annotation for T, which must be a _DECL node.
149 Create the variable annotation if it doesn't exist. */
150 static inline var_ann_t
151 get_var_ann (tree var
)
153 var_ann_t
*p
= DECL_VAR_ANN_PTR (var
);
154 gcc_checking_assert (p
);
155 return *p
? *p
: create_var_ann (var
);
158 /* Get the number of the next statement uid to be allocated. */
159 static inline unsigned int
160 gimple_stmt_max_uid (struct function
*fn
)
162 return fn
->last_stmt_uid
;
165 /* Set the number of the next statement uid to be allocated. */
167 set_gimple_stmt_max_uid (struct function
*fn
, unsigned int maxid
)
169 fn
->last_stmt_uid
= maxid
;
172 /* Set the number of the next statement uid to be allocated. */
173 static inline unsigned int
174 inc_gimple_stmt_max_uid (struct function
*fn
)
176 return fn
->last_stmt_uid
++;
179 /* Return the line number for EXPR, or return -1 if we have no line
180 number information for it. */
182 get_lineno (const_gimple stmt
)
189 loc
= gimple_location (stmt
);
190 if (loc
== UNKNOWN_LOCATION
)
193 return LOCATION_LINE (loc
);
196 /* Delink an immediate_uses node from its chain. */
198 delink_imm_use (ssa_use_operand_t
*linknode
)
200 /* Return if this node is not in a list. */
201 if (linknode
->prev
== NULL
)
204 linknode
->prev
->next
= linknode
->next
;
205 linknode
->next
->prev
= linknode
->prev
;
206 linknode
->prev
= NULL
;
207 linknode
->next
= NULL
;
210 /* Link ssa_imm_use node LINKNODE into the chain for LIST. */
212 link_imm_use_to_list (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*list
)
214 /* Link the new node at the head of the list. If we are in the process of
215 traversing the list, we won't visit any new nodes added to it. */
216 linknode
->prev
= list
;
217 linknode
->next
= list
->next
;
218 list
->next
->prev
= linknode
;
219 list
->next
= linknode
;
222 /* Link ssa_imm_use node LINKNODE into the chain for DEF. */
224 link_imm_use (ssa_use_operand_t
*linknode
, tree def
)
226 ssa_use_operand_t
*root
;
228 if (!def
|| TREE_CODE (def
) != SSA_NAME
)
229 linknode
->prev
= NULL
;
232 root
= &(SSA_NAME_IMM_USE_NODE (def
));
234 gcc_checking_assert (*(linknode
->use
) == def
);
235 link_imm_use_to_list (linknode
, root
);
239 /* Set the value of a use pointed to by USE to VAL. */
241 set_ssa_use_from_ptr (use_operand_p use
, tree val
)
243 delink_imm_use (use
);
245 link_imm_use (use
, val
);
248 /* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
251 link_imm_use_stmt (ssa_use_operand_t
*linknode
, tree def
, gimple stmt
)
254 link_imm_use (linknode
, def
);
256 link_imm_use (linknode
, NULL
);
257 linknode
->loc
.stmt
= stmt
;
260 /* Relink a new node in place of an old node in the list. */
262 relink_imm_use (ssa_use_operand_t
*node
, ssa_use_operand_t
*old
)
264 /* The node one had better be in the same list. */
265 gcc_checking_assert (*(old
->use
) == *(node
->use
));
266 node
->prev
= old
->prev
;
267 node
->next
= old
->next
;
270 old
->prev
->next
= node
;
271 old
->next
->prev
= node
;
272 /* Remove the old node from the list. */
277 /* Relink ssa_imm_use node LINKNODE into the chain for OLD, with use occurring
280 relink_imm_use_stmt (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*old
,
284 relink_imm_use (linknode
, old
);
286 link_imm_use (linknode
, NULL
);
287 linknode
->loc
.stmt
= stmt
;
291 /* Return true is IMM has reached the end of the immediate use list. */
293 end_readonly_imm_use_p (const imm_use_iterator
*imm
)
295 return (imm
->imm_use
== imm
->end_p
);
298 /* Initialize iterator IMM to process the list for VAR. */
299 static inline use_operand_p
300 first_readonly_imm_use (imm_use_iterator
*imm
, tree var
)
302 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
303 imm
->imm_use
= imm
->end_p
->next
;
304 #ifdef ENABLE_CHECKING
305 imm
->iter_node
.next
= imm
->imm_use
->next
;
307 if (end_readonly_imm_use_p (imm
))
308 return NULL_USE_OPERAND_P
;
312 /* Bump IMM to the next use in the list. */
313 static inline use_operand_p
314 next_readonly_imm_use (imm_use_iterator
*imm
)
316 use_operand_p old
= imm
->imm_use
;
318 #ifdef ENABLE_CHECKING
319 /* If this assertion fails, it indicates the 'next' pointer has changed
320 since the last bump. This indicates that the list is being modified
321 via stmt changes, or SET_USE, or somesuch thing, and you need to be
322 using the SAFE version of the iterator. */
323 gcc_assert (imm
->iter_node
.next
== old
->next
);
324 imm
->iter_node
.next
= old
->next
->next
;
327 imm
->imm_use
= old
->next
;
328 if (end_readonly_imm_use_p (imm
))
329 return NULL_USE_OPERAND_P
;
334 extern bool has_zero_uses_1 (const ssa_use_operand_t
*head
);
335 extern bool single_imm_use_1 (const ssa_use_operand_t
*head
,
336 use_operand_p
*use_p
, gimple
*stmt
);
338 /* Return true if VAR has no nondebug uses. */
340 has_zero_uses (const_tree var
)
342 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
344 /* A single use_operand means there is no items in the list. */
345 if (ptr
== ptr
->next
)
348 /* If there are debug stmts, we have to look at each use and see
349 whether there are any nondebug uses. */
350 if (!MAY_HAVE_DEBUG_STMTS
)
353 return has_zero_uses_1 (ptr
);
356 /* Return true if VAR has a single nondebug use. */
358 has_single_use (const_tree var
)
360 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
362 /* If there aren't any uses whatsoever, we're done. */
363 if (ptr
== ptr
->next
)
366 /* If there's a single use, check that it's not a debug stmt. */
367 if (ptr
== ptr
->next
->next
)
368 return !is_gimple_debug (USE_STMT (ptr
->next
));
370 /* If there are debug stmts, we have to look at each of them. */
371 if (!MAY_HAVE_DEBUG_STMTS
)
374 return single_imm_use_1 (ptr
, NULL
, NULL
);
378 /* If VAR has only a single immediate nondebug use, return true, and
379 set USE_P and STMT to the use pointer and stmt of occurrence. */
381 single_imm_use (const_tree var
, use_operand_p
*use_p
, gimple
*stmt
)
383 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
385 /* If there aren't any uses whatsoever, we're done. */
386 if (ptr
== ptr
->next
)
389 *use_p
= NULL_USE_OPERAND_P
;
394 /* If there's a single use, check that it's not a debug stmt. */
395 if (ptr
== ptr
->next
->next
)
397 if (!is_gimple_debug (USE_STMT (ptr
->next
)))
400 *stmt
= ptr
->next
->loc
.stmt
;
407 /* If there are debug stmts, we have to look at each of them. */
408 if (!MAY_HAVE_DEBUG_STMTS
)
411 return single_imm_use_1 (ptr
, use_p
, stmt
);
414 /* Return the number of nondebug immediate uses of VAR. */
415 static inline unsigned int
416 num_imm_uses (const_tree var
)
418 const ssa_use_operand_t
*const start
= &(SSA_NAME_IMM_USE_NODE (var
));
419 const ssa_use_operand_t
*ptr
;
420 unsigned int num
= 0;
422 if (!MAY_HAVE_DEBUG_STMTS
)
423 for (ptr
= start
->next
; ptr
!= start
; ptr
= ptr
->next
)
426 for (ptr
= start
->next
; ptr
!= start
; ptr
= ptr
->next
)
427 if (!is_gimple_debug (USE_STMT (ptr
)))
433 /* Return the tree pointed-to by USE. */
435 get_use_from_ptr (use_operand_p use
)
440 /* Return the tree pointed-to by DEF. */
442 get_def_from_ptr (def_operand_p def
)
447 /* Return a use_operand_p pointer for argument I of PHI node GS. */
449 static inline use_operand_p
450 gimple_phi_arg_imm_use_ptr (gimple gs
, int i
)
452 return &gimple_phi_arg (gs
, i
)->imm_use
;
455 /* Return the tree operand for argument I of PHI node GS. */
458 gimple_phi_arg_def (gimple gs
, size_t index
)
460 struct phi_arg_d
*pd
= gimple_phi_arg (gs
, index
);
461 return get_use_from_ptr (&pd
->imm_use
);
464 /* Return a pointer to the tree operand for argument I of PHI node GS. */
467 gimple_phi_arg_def_ptr (gimple gs
, size_t index
)
469 return &gimple_phi_arg (gs
, index
)->def
;
472 /* Return the edge associated with argument I of phi node GS. */
475 gimple_phi_arg_edge (gimple gs
, size_t i
)
477 return EDGE_PRED (gimple_bb (gs
), i
);
480 /* Return the source location of gimple argument I of phi node GS. */
482 static inline source_location
483 gimple_phi_arg_location (gimple gs
, size_t i
)
485 return gimple_phi_arg (gs
, i
)->locus
;
488 /* Return the source location of the argument on edge E of phi node GS. */
490 static inline source_location
491 gimple_phi_arg_location_from_edge (gimple gs
, edge e
)
493 return gimple_phi_arg (gs
, e
->dest_idx
)->locus
;
496 /* Set the source location of gimple argument I of phi node GS to LOC. */
499 gimple_phi_arg_set_location (gimple gs
, size_t i
, source_location loc
)
501 gimple_phi_arg (gs
, i
)->locus
= loc
;
504 /* Return TRUE if argument I of phi node GS has a location record. */
507 gimple_phi_arg_has_location (gimple gs
, size_t i
)
509 return gimple_phi_arg_location (gs
, i
) != UNKNOWN_LOCATION
;
513 /* Return the PHI nodes for basic block BB, or NULL if there are no
515 static inline gimple_seq
516 phi_nodes (const_basic_block bb
)
518 gcc_checking_assert (!(bb
->flags
& BB_RTL
));
521 return bb
->il
.gimple
->phi_nodes
;
524 /* Set PHI nodes of a basic block BB to SEQ. */
527 set_phi_nodes (basic_block bb
, gimple_seq seq
)
529 gimple_stmt_iterator i
;
531 gcc_checking_assert (!(bb
->flags
& BB_RTL
));
532 bb
->il
.gimple
->phi_nodes
= seq
;
534 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
535 gimple_set_bb (gsi_stmt (i
), bb
);
538 /* Return the phi argument which contains the specified use. */
541 phi_arg_index_from_use (use_operand_p use
)
543 struct phi_arg_d
*element
, *root
;
547 /* Since the use is the first thing in a PHI argument element, we can
548 calculate its index based on casting it to an argument, and performing
549 pointer arithmetic. */
551 phi
= USE_STMT (use
);
553 element
= (struct phi_arg_d
*)use
;
554 root
= gimple_phi_arg (phi
, 0);
555 index
= element
- root
;
557 /* Make sure the calculation doesn't have any leftover bytes. If it does,
558 then imm_use is likely not the first element in phi_arg_d. */
559 gcc_checking_assert ((((char *)element
- (char *)root
)
560 % sizeof (struct phi_arg_d
)) == 0
561 && index
< gimple_phi_capacity (phi
));
566 /* Mark VAR as used, so that it'll be preserved during rtl expansion. */
569 set_is_used (tree var
)
571 var_ann_t ann
= get_var_ann (var
);
576 /* Return true if T (assumed to be a DECL) is a global variable.
577 A variable is considered global if its storage is not automatic. */
580 is_global_var (const_tree t
)
582 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
586 /* Return true if VAR may be aliased. A variable is considered as
587 maybe aliased if it has its address taken by the local TU
588 or possibly by another TU and might be modified through a pointer. */
591 may_be_aliased (const_tree var
)
593 return (TREE_CODE (var
) != CONST_DECL
594 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
595 && TREE_READONLY (var
)
596 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
597 && (TREE_PUBLIC (var
)
598 || DECL_EXTERNAL (var
)
599 || TREE_ADDRESSABLE (var
)));
603 /* PHI nodes should contain only ssa_names and invariants. A test
604 for ssa_name is definitely simpler; don't let invalid contents
605 slip in in the meantime. */
608 phi_ssa_name_p (const_tree t
)
610 if (TREE_CODE (t
) == SSA_NAME
)
612 gcc_checking_assert (is_gimple_min_invariant (t
));
617 /* Returns the loop of the statement STMT. */
619 static inline struct loop
*
620 loop_containing_stmt (gimple stmt
)
622 basic_block bb
= gimple_bb (stmt
);
626 return bb
->loop_father
;
630 /* ----------------------------------------------------------------------- */
632 /* The following set of routines are used to iterator over various type of
635 /* Return true if PTR is finished iterating. */
637 op_iter_done (const ssa_op_iter
*ptr
)
642 /* Get the next iterator use value for PTR. */
643 static inline use_operand_p
644 op_iter_next_use (ssa_op_iter
*ptr
)
647 gcc_checking_assert (ptr
->iter_type
== ssa_op_iter_use
);
650 use_p
= USE_OP_PTR (ptr
->uses
);
651 ptr
->uses
= ptr
->uses
->next
;
654 if (ptr
->phi_i
< ptr
->num_phi
)
656 return PHI_ARG_DEF_PTR (ptr
->phi_stmt
, (ptr
->phi_i
)++);
659 return NULL_USE_OPERAND_P
;
662 /* Get the next iterator def value for PTR. */
663 static inline def_operand_p
664 op_iter_next_def (ssa_op_iter
*ptr
)
667 gcc_checking_assert (ptr
->iter_type
== ssa_op_iter_def
);
670 def_p
= DEF_OP_PTR (ptr
->defs
);
671 ptr
->defs
= ptr
->defs
->next
;
675 return NULL_DEF_OPERAND_P
;
678 /* Get the next iterator tree value for PTR. */
680 op_iter_next_tree (ssa_op_iter
*ptr
)
683 gcc_checking_assert (ptr
->iter_type
== ssa_op_iter_tree
);
686 val
= USE_OP (ptr
->uses
);
687 ptr
->uses
= ptr
->uses
->next
;
692 val
= DEF_OP (ptr
->defs
);
693 ptr
->defs
= ptr
->defs
->next
;
703 /* This functions clears the iterator PTR, and marks it done. This is normally
704 used to prevent warnings in the compile about might be uninitialized
708 clear_and_done_ssa_iter (ssa_op_iter
*ptr
)
712 ptr
->iter_type
= ssa_op_iter_none
;
715 ptr
->phi_stmt
= NULL
;
719 /* Initialize the iterator PTR to the virtual defs in STMT. */
721 op_iter_init (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
723 /* We do not support iterating over virtual defs or uses without
724 iterating over defs or uses at the same time. */
725 gcc_checking_assert ((!(flags
& SSA_OP_VDEF
) || (flags
& SSA_OP_DEF
))
726 && (!(flags
& SSA_OP_VUSE
) || (flags
& SSA_OP_USE
)));
727 ptr
->defs
= (flags
& (SSA_OP_DEF
|SSA_OP_VDEF
)) ? gimple_def_ops (stmt
) : NULL
;
728 if (!(flags
& SSA_OP_VDEF
)
730 && gimple_vdef (stmt
) != NULL_TREE
)
731 ptr
->defs
= ptr
->defs
->next
;
732 ptr
->uses
= (flags
& (SSA_OP_USE
|SSA_OP_VUSE
)) ? gimple_use_ops (stmt
) : NULL
;
733 if (!(flags
& SSA_OP_VUSE
)
735 && gimple_vuse (stmt
) != NULL_TREE
)
736 ptr
->uses
= ptr
->uses
->next
;
741 ptr
->phi_stmt
= NULL
;
744 /* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
746 static inline use_operand_p
747 op_iter_init_use (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
749 gcc_checking_assert ((flags
& SSA_OP_ALL_DEFS
) == 0
750 && (flags
& SSA_OP_USE
));
751 op_iter_init (ptr
, stmt
, flags
);
752 ptr
->iter_type
= ssa_op_iter_use
;
753 return op_iter_next_use (ptr
);
756 /* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
758 static inline def_operand_p
759 op_iter_init_def (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
761 gcc_checking_assert ((flags
& SSA_OP_ALL_USES
) == 0
762 && (flags
& SSA_OP_DEF
));
763 op_iter_init (ptr
, stmt
, flags
);
764 ptr
->iter_type
= ssa_op_iter_def
;
765 return op_iter_next_def (ptr
);
768 /* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
769 the first operand as a tree. */
771 op_iter_init_tree (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
773 op_iter_init (ptr
, stmt
, flags
);
774 ptr
->iter_type
= ssa_op_iter_tree
;
775 return op_iter_next_tree (ptr
);
779 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
782 single_ssa_tree_operand (gimple stmt
, int flags
)
787 var
= op_iter_init_tree (&iter
, stmt
, flags
);
788 if (op_iter_done (&iter
))
790 op_iter_next_tree (&iter
);
791 if (op_iter_done (&iter
))
797 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
799 static inline use_operand_p
800 single_ssa_use_operand (gimple stmt
, int flags
)
805 var
= op_iter_init_use (&iter
, stmt
, flags
);
806 if (op_iter_done (&iter
))
807 return NULL_USE_OPERAND_P
;
808 op_iter_next_use (&iter
);
809 if (op_iter_done (&iter
))
811 return NULL_USE_OPERAND_P
;
816 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
818 static inline def_operand_p
819 single_ssa_def_operand (gimple stmt
, int flags
)
824 var
= op_iter_init_def (&iter
, stmt
, flags
);
825 if (op_iter_done (&iter
))
826 return NULL_DEF_OPERAND_P
;
827 op_iter_next_def (&iter
);
828 if (op_iter_done (&iter
))
830 return NULL_DEF_OPERAND_P
;
834 /* Return true if there are zero operands in STMT matching the type
837 zero_ssa_operands (gimple stmt
, int flags
)
841 op_iter_init_tree (&iter
, stmt
, flags
);
842 return op_iter_done (&iter
);
846 /* Return the number of operands matching FLAGS in STMT. */
848 num_ssa_operands (gimple stmt
, int flags
)
854 FOR_EACH_SSA_TREE_OPERAND (t
, stmt
, iter
, flags
)
860 /* Delink all immediate_use information for STMT. */
862 delink_stmt_imm_use (gimple stmt
)
867 if (ssa_operands_active ())
868 FOR_EACH_SSA_USE_OPERAND (use_p
, stmt
, iter
, SSA_OP_ALL_USES
)
869 delink_imm_use (use_p
);
873 /* If there is a single DEF in the PHI node which matches FLAG, return it.
874 Otherwise return NULL_DEF_OPERAND_P. */
876 single_phi_def (gimple stmt
, int flags
)
878 tree def
= PHI_RESULT (stmt
);
879 if ((flags
& SSA_OP_DEF
) && is_gimple_reg (def
))
881 if ((flags
& SSA_OP_VIRTUAL_DEFS
) && !is_gimple_reg (def
))
886 /* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
887 be either SSA_OP_USES or SSA_OP_VIRTUAL_USES. */
888 static inline use_operand_p
889 op_iter_init_phiuse (ssa_op_iter
*ptr
, gimple phi
, int flags
)
891 tree phi_def
= gimple_phi_result (phi
);
894 clear_and_done_ssa_iter (ptr
);
897 gcc_checking_assert ((flags
& (SSA_OP_USE
| SSA_OP_VIRTUAL_USES
)) != 0);
899 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
901 /* If the PHI node doesn't the operand type we care about, we're done. */
902 if ((flags
& comp
) == 0)
905 return NULL_USE_OPERAND_P
;
909 ptr
->num_phi
= gimple_phi_num_args (phi
);
910 ptr
->iter_type
= ssa_op_iter_use
;
911 return op_iter_next_use (ptr
);
915 /* Start an iterator for a PHI definition. */
917 static inline def_operand_p
918 op_iter_init_phidef (ssa_op_iter
*ptr
, gimple phi
, int flags
)
920 tree phi_def
= PHI_RESULT (phi
);
923 clear_and_done_ssa_iter (ptr
);
926 gcc_checking_assert ((flags
& (SSA_OP_DEF
| SSA_OP_VIRTUAL_DEFS
)) != 0);
928 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_DEF
: SSA_OP_VIRTUAL_DEFS
);
930 /* If the PHI node doesn't have the operand type we care about,
932 if ((flags
& comp
) == 0)
935 return NULL_DEF_OPERAND_P
;
938 ptr
->iter_type
= ssa_op_iter_def
;
939 /* The first call to op_iter_next_def will terminate the iterator since
940 all the fields are NULL. Simply return the result here as the first and
941 therefore only result. */
942 return PHI_RESULT_PTR (phi
);
945 /* Return true is IMM has reached the end of the immediate use stmt list. */
948 end_imm_use_stmt_p (const imm_use_iterator
*imm
)
950 return (imm
->imm_use
== imm
->end_p
);
953 /* Finished the traverse of an immediate use stmt list IMM by removing the
954 placeholder node from the list. */
957 end_imm_use_stmt_traverse (imm_use_iterator
*imm
)
959 delink_imm_use (&(imm
->iter_node
));
962 /* Immediate use traversal of uses within a stmt require that all the
963 uses on a stmt be sequentially listed. This routine is used to build up
964 this sequential list by adding USE_P to the end of the current list
965 currently delimited by HEAD and LAST_P. The new LAST_P value is
968 static inline use_operand_p
969 move_use_after_head (use_operand_p use_p
, use_operand_p head
,
970 use_operand_p last_p
)
972 gcc_checking_assert (USE_FROM_PTR (use_p
) == USE_FROM_PTR (head
));
973 /* Skip head when we find it. */
976 /* If use_p is already linked in after last_p, continue. */
977 if (last_p
->next
== use_p
)
981 /* Delink from current location, and link in at last_p. */
982 delink_imm_use (use_p
);
983 link_imm_use_to_list (use_p
, last_p
);
991 /* This routine will relink all uses with the same stmt as HEAD into the list
992 immediately following HEAD for iterator IMM. */
995 link_use_stmts_after (use_operand_p head
, imm_use_iterator
*imm
)
998 use_operand_p last_p
= head
;
999 gimple head_stmt
= USE_STMT (head
);
1000 tree use
= USE_FROM_PTR (head
);
1001 ssa_op_iter op_iter
;
1004 /* Only look at virtual or real uses, depending on the type of HEAD. */
1005 flag
= (is_gimple_reg (use
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
1007 if (gimple_code (head_stmt
) == GIMPLE_PHI
)
1009 FOR_EACH_PHI_ARG (use_p
, head_stmt
, op_iter
, flag
)
1010 if (USE_FROM_PTR (use_p
) == use
)
1011 last_p
= move_use_after_head (use_p
, head
, last_p
);
1015 if (flag
== SSA_OP_USE
)
1017 FOR_EACH_SSA_USE_OPERAND (use_p
, head_stmt
, op_iter
, flag
)
1018 if (USE_FROM_PTR (use_p
) == use
)
1019 last_p
= move_use_after_head (use_p
, head
, last_p
);
1021 else if ((use_p
= gimple_vuse_op (head_stmt
)) != NULL_USE_OPERAND_P
)
1023 if (USE_FROM_PTR (use_p
) == use
)
1024 last_p
= move_use_after_head (use_p
, head
, last_p
);
1027 /* Link iter node in after last_p. */
1028 if (imm
->iter_node
.prev
!= NULL
)
1029 delink_imm_use (&imm
->iter_node
);
1030 link_imm_use_to_list (&(imm
->iter_node
), last_p
);
1033 /* Initialize IMM to traverse over uses of VAR. Return the first statement. */
1034 static inline gimple
1035 first_imm_use_stmt (imm_use_iterator
*imm
, tree var
)
1037 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
1038 imm
->imm_use
= imm
->end_p
->next
;
1039 imm
->next_imm_name
= NULL_USE_OPERAND_P
;
1041 /* iter_node is used as a marker within the immediate use list to indicate
1042 where the end of the current stmt's uses are. Initialize it to NULL
1043 stmt and use, which indicates a marker node. */
1044 imm
->iter_node
.prev
= NULL_USE_OPERAND_P
;
1045 imm
->iter_node
.next
= NULL_USE_OPERAND_P
;
1046 imm
->iter_node
.loc
.stmt
= NULL
;
1047 imm
->iter_node
.use
= NULL
;
1049 if (end_imm_use_stmt_p (imm
))
1052 link_use_stmts_after (imm
->imm_use
, imm
);
1054 return USE_STMT (imm
->imm_use
);
1057 /* Bump IMM to the next stmt which has a use of var. */
1059 static inline gimple
1060 next_imm_use_stmt (imm_use_iterator
*imm
)
1062 imm
->imm_use
= imm
->iter_node
.next
;
1063 if (end_imm_use_stmt_p (imm
))
1065 if (imm
->iter_node
.prev
!= NULL
)
1066 delink_imm_use (&imm
->iter_node
);
1070 link_use_stmts_after (imm
->imm_use
, imm
);
1071 return USE_STMT (imm
->imm_use
);
1074 /* This routine will return the first use on the stmt IMM currently refers
1077 static inline use_operand_p
1078 first_imm_use_on_stmt (imm_use_iterator
*imm
)
1080 imm
->next_imm_name
= imm
->imm_use
->next
;
1081 return imm
->imm_use
;
1084 /* Return TRUE if the last use on the stmt IMM refers to has been visited. */
1087 end_imm_use_on_stmt_p (const imm_use_iterator
*imm
)
1089 return (imm
->imm_use
== &(imm
->iter_node
));
1092 /* Bump to the next use on the stmt IMM refers to, return NULL if done. */
1094 static inline use_operand_p
1095 next_imm_use_on_stmt (imm_use_iterator
*imm
)
1097 imm
->imm_use
= imm
->next_imm_name
;
1098 if (end_imm_use_on_stmt_p (imm
))
1099 return NULL_USE_OPERAND_P
;
1102 imm
->next_imm_name
= imm
->imm_use
->next
;
1103 return imm
->imm_use
;
1107 /* Return true if VAR cannot be modified by the program. */
1110 unmodifiable_var_p (const_tree var
)
1112 if (TREE_CODE (var
) == SSA_NAME
)
1113 var
= SSA_NAME_VAR (var
);
1115 return TREE_READONLY (var
) && (TREE_STATIC (var
) || DECL_EXTERNAL (var
));
1118 /* Return true if REF, a handled component reference, has an ARRAY_REF
1122 ref_contains_array_ref (const_tree ref
)
1124 gcc_checking_assert (handled_component_p (ref
));
1127 if (TREE_CODE (ref
) == ARRAY_REF
)
1129 ref
= TREE_OPERAND (ref
, 0);
1130 } while (handled_component_p (ref
));
1135 /* Return true if REF has an VIEW_CONVERT_EXPR somewhere in it. */
1138 contains_view_convert_expr_p (const_tree ref
)
1140 while (handled_component_p (ref
))
1142 if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
1144 ref
= TREE_OPERAND (ref
, 0);
1150 /* Return true, if the two ranges [POS1, SIZE1] and [POS2, SIZE2]
1151 overlap. SIZE1 and/or SIZE2 can be (unsigned)-1 in which case the
1152 range is open-ended. Otherwise return false. */
1155 ranges_overlap_p (unsigned HOST_WIDE_INT pos1
,
1156 unsigned HOST_WIDE_INT size1
,
1157 unsigned HOST_WIDE_INT pos2
,
1158 unsigned HOST_WIDE_INT size2
)
1161 && (size2
== (unsigned HOST_WIDE_INT
)-1
1162 || pos1
< (pos2
+ size2
)))
1165 && (size1
== (unsigned HOST_WIDE_INT
)-1
1166 || pos2
< (pos1
+ size1
)))
1172 /* Accessor to tree-ssa-operands.c caches. */
1173 static inline struct ssa_operands
*
1174 gimple_ssa_operands (const struct function
*fun
)
1176 return &fun
->gimple_df
->ssa_operands
;
1179 /* Given an edge_var_map V, return the PHI arg definition. */
1182 redirect_edge_var_map_def (edge_var_map
*v
)
1187 /* Given an edge_var_map V, return the PHI result. */
1190 redirect_edge_var_map_result (edge_var_map
*v
)
1195 /* Given an edge_var_map V, return the PHI arg location. */
1197 static inline source_location
1198 redirect_edge_var_map_location (edge_var_map
*v
)
1204 /* Return an SSA_NAME node for variable VAR defined in statement STMT
1205 in function cfun. */
1208 make_ssa_name (tree var
, gimple stmt
)
1210 return make_ssa_name_fn (cfun
, var
, stmt
);
1213 #endif /* _TREE_FLOW_INLINE_H */