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
));
233 #ifdef ENABLE_CHECKING
235 gcc_checking_assert (*(linknode
->use
) == def
);
237 link_imm_use_to_list (linknode
, root
);
241 /* Set the value of a use pointed to by USE to VAL. */
243 set_ssa_use_from_ptr (use_operand_p use
, tree val
)
245 delink_imm_use (use
);
247 link_imm_use (use
, val
);
250 /* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
253 link_imm_use_stmt (ssa_use_operand_t
*linknode
, tree def
, gimple stmt
)
256 link_imm_use (linknode
, def
);
258 link_imm_use (linknode
, NULL
);
259 linknode
->loc
.stmt
= stmt
;
262 /* Relink a new node in place of an old node in the list. */
264 relink_imm_use (ssa_use_operand_t
*node
, ssa_use_operand_t
*old
)
266 /* The node one had better be in the same list. */
267 gcc_checking_assert (*(old
->use
) == *(node
->use
));
268 node
->prev
= old
->prev
;
269 node
->next
= old
->next
;
272 old
->prev
->next
= node
;
273 old
->next
->prev
= node
;
274 /* Remove the old node from the list. */
279 /* Relink ssa_imm_use node LINKNODE into the chain for OLD, with use occurring
282 relink_imm_use_stmt (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*old
,
286 relink_imm_use (linknode
, old
);
288 link_imm_use (linknode
, NULL
);
289 linknode
->loc
.stmt
= stmt
;
293 /* Return true is IMM has reached the end of the immediate use list. */
295 end_readonly_imm_use_p (const imm_use_iterator
*imm
)
297 return (imm
->imm_use
== imm
->end_p
);
300 /* Initialize iterator IMM to process the list for VAR. */
301 static inline use_operand_p
302 first_readonly_imm_use (imm_use_iterator
*imm
, tree var
)
304 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
305 imm
->imm_use
= imm
->end_p
->next
;
306 #ifdef ENABLE_CHECKING
307 imm
->iter_node
.next
= imm
->imm_use
->next
;
309 if (end_readonly_imm_use_p (imm
))
310 return NULL_USE_OPERAND_P
;
314 /* Bump IMM to the next use in the list. */
315 static inline use_operand_p
316 next_readonly_imm_use (imm_use_iterator
*imm
)
318 use_operand_p old
= imm
->imm_use
;
320 #ifdef ENABLE_CHECKING
321 /* If this assertion fails, it indicates the 'next' pointer has changed
322 since the last bump. This indicates that the list is being modified
323 via stmt changes, or SET_USE, or somesuch thing, and you need to be
324 using the SAFE version of the iterator. */
325 gcc_assert (imm
->iter_node
.next
== old
->next
);
326 imm
->iter_node
.next
= old
->next
->next
;
329 imm
->imm_use
= old
->next
;
330 if (end_readonly_imm_use_p (imm
))
331 return NULL_USE_OPERAND_P
;
336 extern bool has_zero_uses_1 (const ssa_use_operand_t
*head
);
337 extern bool single_imm_use_1 (const ssa_use_operand_t
*head
,
338 use_operand_p
*use_p
, gimple
*stmt
);
340 /* Return true if VAR has no nondebug uses. */
342 has_zero_uses (const_tree var
)
344 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
346 /* A single use_operand means there is no items in the list. */
347 if (ptr
== ptr
->next
)
350 /* If there are debug stmts, we have to look at each use and see
351 whether there are any nondebug uses. */
352 if (!MAY_HAVE_DEBUG_STMTS
)
355 return has_zero_uses_1 (ptr
);
358 /* Return true if VAR has a single nondebug use. */
360 has_single_use (const_tree var
)
362 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
364 /* If there aren't any uses whatsoever, we're done. */
365 if (ptr
== ptr
->next
)
368 /* If there's a single use, check that it's not a debug stmt. */
369 if (ptr
== ptr
->next
->next
)
370 return !is_gimple_debug (USE_STMT (ptr
->next
));
372 /* If there are debug stmts, we have to look at each of them. */
373 if (!MAY_HAVE_DEBUG_STMTS
)
376 return single_imm_use_1 (ptr
, NULL
, NULL
);
380 /* If VAR has only a single immediate nondebug use, return true, and
381 set USE_P and STMT to the use pointer and stmt of occurrence. */
383 single_imm_use (const_tree var
, use_operand_p
*use_p
, gimple
*stmt
)
385 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
387 /* If there aren't any uses whatsoever, we're done. */
388 if (ptr
== ptr
->next
)
391 *use_p
= NULL_USE_OPERAND_P
;
396 /* If there's a single use, check that it's not a debug stmt. */
397 if (ptr
== ptr
->next
->next
)
399 if (!is_gimple_debug (USE_STMT (ptr
->next
)))
402 *stmt
= ptr
->next
->loc
.stmt
;
409 /* If there are debug stmts, we have to look at each of them. */
410 if (!MAY_HAVE_DEBUG_STMTS
)
413 return single_imm_use_1 (ptr
, use_p
, stmt
);
416 /* Return the number of nondebug immediate uses of VAR. */
417 static inline unsigned int
418 num_imm_uses (const_tree var
)
420 const ssa_use_operand_t
*const start
= &(SSA_NAME_IMM_USE_NODE (var
));
421 const ssa_use_operand_t
*ptr
;
422 unsigned int num
= 0;
424 if (!MAY_HAVE_DEBUG_STMTS
)
425 for (ptr
= start
->next
; ptr
!= start
; ptr
= ptr
->next
)
428 for (ptr
= start
->next
; ptr
!= start
; ptr
= ptr
->next
)
429 if (!is_gimple_debug (USE_STMT (ptr
)))
435 /* Return the tree pointed-to by USE. */
437 get_use_from_ptr (use_operand_p use
)
442 /* Return the tree pointed-to by DEF. */
444 get_def_from_ptr (def_operand_p def
)
449 /* Return a use_operand_p pointer for argument I of PHI node GS. */
451 static inline use_operand_p
452 gimple_phi_arg_imm_use_ptr (gimple gs
, int i
)
454 return &gimple_phi_arg (gs
, i
)->imm_use
;
457 /* Return the tree operand for argument I of PHI node GS. */
460 gimple_phi_arg_def (gimple gs
, size_t index
)
462 struct phi_arg_d
*pd
= gimple_phi_arg (gs
, index
);
463 return get_use_from_ptr (&pd
->imm_use
);
466 /* Return a pointer to the tree operand for argument I of PHI node GS. */
469 gimple_phi_arg_def_ptr (gimple gs
, size_t index
)
471 return &gimple_phi_arg (gs
, index
)->def
;
474 /* Return the edge associated with argument I of phi node GS. */
477 gimple_phi_arg_edge (gimple gs
, size_t i
)
479 return EDGE_PRED (gimple_bb (gs
), i
);
482 /* Return the source location of gimple argument I of phi node GS. */
484 static inline source_location
485 gimple_phi_arg_location (gimple gs
, size_t i
)
487 return gimple_phi_arg (gs
, i
)->locus
;
490 /* Return the source location of the argument on edge E of phi node GS. */
492 static inline source_location
493 gimple_phi_arg_location_from_edge (gimple gs
, edge e
)
495 return gimple_phi_arg (gs
, e
->dest_idx
)->locus
;
498 /* Set the source location of gimple argument I of phi node GS to LOC. */
501 gimple_phi_arg_set_location (gimple gs
, size_t i
, source_location loc
)
503 gimple_phi_arg (gs
, i
)->locus
= loc
;
506 /* Return TRUE if argument I of phi node GS has a location record. */
509 gimple_phi_arg_has_location (gimple gs
, size_t i
)
511 return gimple_phi_arg_location (gs
, i
) != UNKNOWN_LOCATION
;
515 /* Return the PHI nodes for basic block BB, or NULL if there are no
517 static inline gimple_seq
518 phi_nodes (const_basic_block bb
)
520 gcc_checking_assert (!(bb
->flags
& BB_RTL
));
523 return bb
->il
.gimple
->phi_nodes
;
526 /* Set PHI nodes of a basic block BB to SEQ. */
529 set_phi_nodes (basic_block bb
, gimple_seq seq
)
531 gimple_stmt_iterator i
;
533 gcc_checking_assert (!(bb
->flags
& BB_RTL
));
534 bb
->il
.gimple
->phi_nodes
= seq
;
536 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
537 gimple_set_bb (gsi_stmt (i
), bb
);
540 /* Return the phi argument which contains the specified use. */
543 phi_arg_index_from_use (use_operand_p use
)
545 struct phi_arg_d
*element
, *root
;
549 /* Since the use is the first thing in a PHI argument element, we can
550 calculate its index based on casting it to an argument, and performing
551 pointer arithmetic. */
553 phi
= USE_STMT (use
);
555 element
= (struct phi_arg_d
*)use
;
556 root
= gimple_phi_arg (phi
, 0);
557 index
= element
- root
;
559 #ifdef ENABLE_CHECKING
560 /* Make sure the calculation doesn't have any leftover bytes. If it does,
561 then imm_use is likely not the first element in phi_arg_d. */
562 gcc_assert ((((char *)element
- (char *)root
)
563 % sizeof (struct phi_arg_d
)) == 0
564 && index
< gimple_phi_capacity (phi
));
570 /* Mark VAR as used, so that it'll be preserved during rtl expansion. */
573 set_is_used (tree var
)
575 var_ann_t ann
= get_var_ann (var
);
580 /* Return true if T (assumed to be a DECL) is a global variable.
581 A variable is considered global if its storage is not automatic. */
584 is_global_var (const_tree t
)
586 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
590 /* Return true if VAR may be aliased. A variable is considered as
591 maybe aliased if it has its address taken by the local TU
592 or possibly by another TU and might be modified through a pointer. */
595 may_be_aliased (const_tree var
)
597 return (TREE_CODE (var
) != CONST_DECL
598 && !((TREE_STATIC (var
) || TREE_PUBLIC (var
) || DECL_EXTERNAL (var
))
599 && TREE_READONLY (var
)
600 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var
)))
601 && (TREE_PUBLIC (var
)
602 || DECL_EXTERNAL (var
)
603 || TREE_ADDRESSABLE (var
)));
607 /* PHI nodes should contain only ssa_names and invariants. A test
608 for ssa_name is definitely simpler; don't let invalid contents
609 slip in in the meantime. */
612 phi_ssa_name_p (const_tree t
)
614 if (TREE_CODE (t
) == SSA_NAME
)
616 #ifdef ENABLE_CHECKING
617 gcc_assert (is_gimple_min_invariant (t
));
623 /* Returns the loop of the statement STMT. */
625 static inline struct loop
*
626 loop_containing_stmt (gimple stmt
)
628 basic_block bb
= gimple_bb (stmt
);
632 return bb
->loop_father
;
636 /* ----------------------------------------------------------------------- */
638 /* The following set of routines are used to iterator over various type of
641 /* Return true if PTR is finished iterating. */
643 op_iter_done (const ssa_op_iter
*ptr
)
648 /* Get the next iterator use value for PTR. */
649 static inline use_operand_p
650 op_iter_next_use (ssa_op_iter
*ptr
)
653 gcc_checking_assert (ptr
->iter_type
== ssa_op_iter_use
);
656 use_p
= USE_OP_PTR (ptr
->uses
);
657 ptr
->uses
= ptr
->uses
->next
;
660 if (ptr
->phi_i
< ptr
->num_phi
)
662 return PHI_ARG_DEF_PTR (ptr
->phi_stmt
, (ptr
->phi_i
)++);
665 return NULL_USE_OPERAND_P
;
668 /* Get the next iterator def value for PTR. */
669 static inline def_operand_p
670 op_iter_next_def (ssa_op_iter
*ptr
)
673 gcc_checking_assert (ptr
->iter_type
== ssa_op_iter_def
);
676 def_p
= DEF_OP_PTR (ptr
->defs
);
677 ptr
->defs
= ptr
->defs
->next
;
681 return NULL_DEF_OPERAND_P
;
684 /* Get the next iterator tree value for PTR. */
686 op_iter_next_tree (ssa_op_iter
*ptr
)
689 gcc_checking_assert (ptr
->iter_type
== ssa_op_iter_tree
);
692 val
= USE_OP (ptr
->uses
);
693 ptr
->uses
= ptr
->uses
->next
;
698 val
= DEF_OP (ptr
->defs
);
699 ptr
->defs
= ptr
->defs
->next
;
709 /* This functions clears the iterator PTR, and marks it done. This is normally
710 used to prevent warnings in the compile about might be uninitialized
714 clear_and_done_ssa_iter (ssa_op_iter
*ptr
)
718 ptr
->iter_type
= ssa_op_iter_none
;
721 ptr
->phi_stmt
= NULL
;
725 /* Initialize the iterator PTR to the virtual defs in STMT. */
727 op_iter_init (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
729 /* We do not support iterating over virtual defs or uses without
730 iterating over defs or uses at the same time. */
731 gcc_checking_assert ((!(flags
& SSA_OP_VDEF
) || (flags
& SSA_OP_DEF
))
732 && (!(flags
& SSA_OP_VUSE
) || (flags
& SSA_OP_USE
)));
733 ptr
->defs
= (flags
& (SSA_OP_DEF
|SSA_OP_VDEF
)) ? gimple_def_ops (stmt
) : NULL
;
734 if (!(flags
& SSA_OP_VDEF
)
736 && gimple_vdef (stmt
) != NULL_TREE
)
737 ptr
->defs
= ptr
->defs
->next
;
738 ptr
->uses
= (flags
& (SSA_OP_USE
|SSA_OP_VUSE
)) ? gimple_use_ops (stmt
) : NULL
;
739 if (!(flags
& SSA_OP_VUSE
)
741 && gimple_vuse (stmt
) != NULL_TREE
)
742 ptr
->uses
= ptr
->uses
->next
;
747 ptr
->phi_stmt
= NULL
;
750 /* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
752 static inline use_operand_p
753 op_iter_init_use (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
755 gcc_checking_assert ((flags
& SSA_OP_ALL_DEFS
) == 0
756 && (flags
& SSA_OP_USE
));
757 op_iter_init (ptr
, stmt
, flags
);
758 ptr
->iter_type
= ssa_op_iter_use
;
759 return op_iter_next_use (ptr
);
762 /* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
764 static inline def_operand_p
765 op_iter_init_def (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
767 gcc_checking_assert ((flags
& SSA_OP_ALL_USES
) == 0
768 && (flags
& SSA_OP_DEF
));
769 op_iter_init (ptr
, stmt
, flags
);
770 ptr
->iter_type
= ssa_op_iter_def
;
771 return op_iter_next_def (ptr
);
774 /* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
775 the first operand as a tree. */
777 op_iter_init_tree (ssa_op_iter
*ptr
, gimple stmt
, int flags
)
779 op_iter_init (ptr
, stmt
, flags
);
780 ptr
->iter_type
= ssa_op_iter_tree
;
781 return op_iter_next_tree (ptr
);
785 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
788 single_ssa_tree_operand (gimple stmt
, int flags
)
793 var
= op_iter_init_tree (&iter
, stmt
, flags
);
794 if (op_iter_done (&iter
))
796 op_iter_next_tree (&iter
);
797 if (op_iter_done (&iter
))
803 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
805 static inline use_operand_p
806 single_ssa_use_operand (gimple stmt
, int flags
)
811 var
= op_iter_init_use (&iter
, stmt
, flags
);
812 if (op_iter_done (&iter
))
813 return NULL_USE_OPERAND_P
;
814 op_iter_next_use (&iter
);
815 if (op_iter_done (&iter
))
817 return NULL_USE_OPERAND_P
;
822 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
824 static inline def_operand_p
825 single_ssa_def_operand (gimple stmt
, int flags
)
830 var
= op_iter_init_def (&iter
, stmt
, flags
);
831 if (op_iter_done (&iter
))
832 return NULL_DEF_OPERAND_P
;
833 op_iter_next_def (&iter
);
834 if (op_iter_done (&iter
))
836 return NULL_DEF_OPERAND_P
;
840 /* Return true if there are zero operands in STMT matching the type
843 zero_ssa_operands (gimple stmt
, int flags
)
847 op_iter_init_tree (&iter
, stmt
, flags
);
848 return op_iter_done (&iter
);
852 /* Return the number of operands matching FLAGS in STMT. */
854 num_ssa_operands (gimple stmt
, int flags
)
860 FOR_EACH_SSA_TREE_OPERAND (t
, stmt
, iter
, flags
)
866 /* Delink all immediate_use information for STMT. */
868 delink_stmt_imm_use (gimple stmt
)
873 if (ssa_operands_active ())
874 FOR_EACH_SSA_USE_OPERAND (use_p
, stmt
, iter
, SSA_OP_ALL_USES
)
875 delink_imm_use (use_p
);
879 /* If there is a single DEF in the PHI node which matches FLAG, return it.
880 Otherwise return NULL_DEF_OPERAND_P. */
882 single_phi_def (gimple stmt
, int flags
)
884 tree def
= PHI_RESULT (stmt
);
885 if ((flags
& SSA_OP_DEF
) && is_gimple_reg (def
))
887 if ((flags
& SSA_OP_VIRTUAL_DEFS
) && !is_gimple_reg (def
))
892 /* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
893 be either SSA_OP_USES or SSA_OP_VIRTUAL_USES. */
894 static inline use_operand_p
895 op_iter_init_phiuse (ssa_op_iter
*ptr
, gimple phi
, int flags
)
897 tree phi_def
= gimple_phi_result (phi
);
900 clear_and_done_ssa_iter (ptr
);
903 gcc_checking_assert ((flags
& (SSA_OP_USE
| SSA_OP_VIRTUAL_USES
)) != 0);
905 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
907 /* If the PHI node doesn't the operand type we care about, we're done. */
908 if ((flags
& comp
) == 0)
911 return NULL_USE_OPERAND_P
;
915 ptr
->num_phi
= gimple_phi_num_args (phi
);
916 ptr
->iter_type
= ssa_op_iter_use
;
917 return op_iter_next_use (ptr
);
921 /* Start an iterator for a PHI definition. */
923 static inline def_operand_p
924 op_iter_init_phidef (ssa_op_iter
*ptr
, gimple phi
, int flags
)
926 tree phi_def
= PHI_RESULT (phi
);
929 clear_and_done_ssa_iter (ptr
);
932 gcc_checking_assert ((flags
& (SSA_OP_DEF
| SSA_OP_VIRTUAL_DEFS
)) != 0);
934 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_DEF
: SSA_OP_VIRTUAL_DEFS
);
936 /* If the PHI node doesn't have the operand type we care about,
938 if ((flags
& comp
) == 0)
941 return NULL_DEF_OPERAND_P
;
944 ptr
->iter_type
= ssa_op_iter_def
;
945 /* The first call to op_iter_next_def will terminate the iterator since
946 all the fields are NULL. Simply return the result here as the first and
947 therefore only result. */
948 return PHI_RESULT_PTR (phi
);
951 /* Return true is IMM has reached the end of the immediate use stmt list. */
954 end_imm_use_stmt_p (const imm_use_iterator
*imm
)
956 return (imm
->imm_use
== imm
->end_p
);
959 /* Finished the traverse of an immediate use stmt list IMM by removing the
960 placeholder node from the list. */
963 end_imm_use_stmt_traverse (imm_use_iterator
*imm
)
965 delink_imm_use (&(imm
->iter_node
));
968 /* Immediate use traversal of uses within a stmt require that all the
969 uses on a stmt be sequentially listed. This routine is used to build up
970 this sequential list by adding USE_P to the end of the current list
971 currently delimited by HEAD and LAST_P. The new LAST_P value is
974 static inline use_operand_p
975 move_use_after_head (use_operand_p use_p
, use_operand_p head
,
976 use_operand_p last_p
)
978 #ifdef ENABLE_CHECKING
979 gcc_assert (USE_FROM_PTR (use_p
) == USE_FROM_PTR (head
));
981 /* Skip head when we find it. */
984 /* If use_p is already linked in after last_p, continue. */
985 if (last_p
->next
== use_p
)
989 /* Delink from current location, and link in at last_p. */
990 delink_imm_use (use_p
);
991 link_imm_use_to_list (use_p
, last_p
);
999 /* This routine will relink all uses with the same stmt as HEAD into the list
1000 immediately following HEAD for iterator IMM. */
1003 link_use_stmts_after (use_operand_p head
, imm_use_iterator
*imm
)
1005 use_operand_p use_p
;
1006 use_operand_p last_p
= head
;
1007 gimple head_stmt
= USE_STMT (head
);
1008 tree use
= USE_FROM_PTR (head
);
1009 ssa_op_iter op_iter
;
1012 /* Only look at virtual or real uses, depending on the type of HEAD. */
1013 flag
= (is_gimple_reg (use
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
1015 if (gimple_code (head_stmt
) == GIMPLE_PHI
)
1017 FOR_EACH_PHI_ARG (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
);
1023 if (flag
== SSA_OP_USE
)
1025 FOR_EACH_SSA_USE_OPERAND (use_p
, head_stmt
, op_iter
, flag
)
1026 if (USE_FROM_PTR (use_p
) == use
)
1027 last_p
= move_use_after_head (use_p
, head
, last_p
);
1029 else if ((use_p
= gimple_vuse_op (head_stmt
)) != NULL_USE_OPERAND_P
)
1031 if (USE_FROM_PTR (use_p
) == use
)
1032 last_p
= move_use_after_head (use_p
, head
, last_p
);
1035 /* Link iter node in after last_p. */
1036 if (imm
->iter_node
.prev
!= NULL
)
1037 delink_imm_use (&imm
->iter_node
);
1038 link_imm_use_to_list (&(imm
->iter_node
), last_p
);
1041 /* Initialize IMM to traverse over uses of VAR. Return the first statement. */
1042 static inline gimple
1043 first_imm_use_stmt (imm_use_iterator
*imm
, tree var
)
1045 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
1046 imm
->imm_use
= imm
->end_p
->next
;
1047 imm
->next_imm_name
= NULL_USE_OPERAND_P
;
1049 /* iter_node is used as a marker within the immediate use list to indicate
1050 where the end of the current stmt's uses are. Initialize it to NULL
1051 stmt and use, which indicates a marker node. */
1052 imm
->iter_node
.prev
= NULL_USE_OPERAND_P
;
1053 imm
->iter_node
.next
= NULL_USE_OPERAND_P
;
1054 imm
->iter_node
.loc
.stmt
= NULL
;
1055 imm
->iter_node
.use
= NULL
;
1057 if (end_imm_use_stmt_p (imm
))
1060 link_use_stmts_after (imm
->imm_use
, imm
);
1062 return USE_STMT (imm
->imm_use
);
1065 /* Bump IMM to the next stmt which has a use of var. */
1067 static inline gimple
1068 next_imm_use_stmt (imm_use_iterator
*imm
)
1070 imm
->imm_use
= imm
->iter_node
.next
;
1071 if (end_imm_use_stmt_p (imm
))
1073 if (imm
->iter_node
.prev
!= NULL
)
1074 delink_imm_use (&imm
->iter_node
);
1078 link_use_stmts_after (imm
->imm_use
, imm
);
1079 return USE_STMT (imm
->imm_use
);
1082 /* This routine will return the first use on the stmt IMM currently refers
1085 static inline use_operand_p
1086 first_imm_use_on_stmt (imm_use_iterator
*imm
)
1088 imm
->next_imm_name
= imm
->imm_use
->next
;
1089 return imm
->imm_use
;
1092 /* Return TRUE if the last use on the stmt IMM refers to has been visited. */
1095 end_imm_use_on_stmt_p (const imm_use_iterator
*imm
)
1097 return (imm
->imm_use
== &(imm
->iter_node
));
1100 /* Bump to the next use on the stmt IMM refers to, return NULL if done. */
1102 static inline use_operand_p
1103 next_imm_use_on_stmt (imm_use_iterator
*imm
)
1105 imm
->imm_use
= imm
->next_imm_name
;
1106 if (end_imm_use_on_stmt_p (imm
))
1107 return NULL_USE_OPERAND_P
;
1110 imm
->next_imm_name
= imm
->imm_use
->next
;
1111 return imm
->imm_use
;
1115 /* Return true if VAR cannot be modified by the program. */
1118 unmodifiable_var_p (const_tree var
)
1120 if (TREE_CODE (var
) == SSA_NAME
)
1121 var
= SSA_NAME_VAR (var
);
1123 return TREE_READONLY (var
) && (TREE_STATIC (var
) || DECL_EXTERNAL (var
));
1126 /* Return true if REF, a handled component reference, has an ARRAY_REF
1130 ref_contains_array_ref (const_tree ref
)
1132 gcc_checking_assert (handled_component_p (ref
));
1135 if (TREE_CODE (ref
) == ARRAY_REF
)
1137 ref
= TREE_OPERAND (ref
, 0);
1138 } while (handled_component_p (ref
));
1143 /* Return true if REF has an VIEW_CONVERT_EXPR somewhere in it. */
1146 contains_view_convert_expr_p (const_tree ref
)
1148 while (handled_component_p (ref
))
1150 if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
1152 ref
= TREE_OPERAND (ref
, 0);
1158 /* Return true, if the two ranges [POS1, SIZE1] and [POS2, SIZE2]
1159 overlap. SIZE1 and/or SIZE2 can be (unsigned)-1 in which case the
1160 range is open-ended. Otherwise return false. */
1163 ranges_overlap_p (unsigned HOST_WIDE_INT pos1
,
1164 unsigned HOST_WIDE_INT size1
,
1165 unsigned HOST_WIDE_INT pos2
,
1166 unsigned HOST_WIDE_INT size2
)
1169 && (size2
== (unsigned HOST_WIDE_INT
)-1
1170 || pos1
< (pos2
+ size2
)))
1173 && (size1
== (unsigned HOST_WIDE_INT
)-1
1174 || pos2
< (pos1
+ size1
)))
1180 /* Accessor to tree-ssa-operands.c caches. */
1181 static inline struct ssa_operands
*
1182 gimple_ssa_operands (const struct function
*fun
)
1184 return &fun
->gimple_df
->ssa_operands
;
1187 /* Given an edge_var_map V, return the PHI arg definition. */
1190 redirect_edge_var_map_def (edge_var_map
*v
)
1195 /* Given an edge_var_map V, return the PHI result. */
1198 redirect_edge_var_map_result (edge_var_map
*v
)
1203 /* Given an edge_var_map V, return the PHI arg location. */
1205 static inline source_location
1206 redirect_edge_var_map_location (edge_var_map
*v
)
1212 /* Return an SSA_NAME node for variable VAR defined in statement STMT
1213 in function cfun. */
1216 make_ssa_name (tree var
, gimple stmt
)
1218 return make_ssa_name_fn (cfun
, var
, stmt
);
1221 #endif /* _TREE_FLOW_INLINE_H */