1 /* Inline functions for tree-flow.h
2 Copyright (C) 2001, 2003, 2005, 2006, 2007 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 3, 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 COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 #ifndef _TREE_FLOW_INLINE_H
22 #define _TREE_FLOW_INLINE_H 1
24 /* Inline functions for manipulating various data structures defined in
25 tree-flow.h. See tree-flow.h for documentation. */
27 /* Return true when gimple SSA form was built.
28 gimple_in_ssa_p is queried by gimplifier in various early stages before SSA
29 infrastructure is initialized. Check for presence of the datastructures
32 gimple_in_ssa_p (const struct function
*fun
)
34 return fun
&& fun
->gimple_df
&& fun
->gimple_df
->in_ssa_p
;
37 /* 'true' after aliases have been computed (see compute_may_aliases). */
39 gimple_aliases_computed_p (const struct function
*fun
)
41 gcc_assert (fun
&& fun
->gimple_df
);
42 return fun
->gimple_df
->aliases_computed_p
;
45 /* Addressable variables in the function. If bit I is set, then
46 REFERENCED_VARS (I) has had its address taken. Note that
47 CALL_CLOBBERED_VARS and ADDRESSABLE_VARS are not related. An
48 addressable variable is not necessarily call-clobbered (e.g., a
49 local addressable whose address does not escape) and not all
50 call-clobbered variables are addressable (e.g., a local static
53 gimple_addressable_vars (const struct function
*fun
)
55 gcc_assert (fun
&& fun
->gimple_df
);
56 return fun
->gimple_df
->addressable_vars
;
59 /* Call clobbered variables in the function. If bit I is set, then
60 REFERENCED_VARS (I) is call-clobbered. */
62 gimple_call_clobbered_vars (const struct function
*fun
)
64 gcc_assert (fun
&& fun
->gimple_df
);
65 return fun
->gimple_df
->call_clobbered_vars
;
68 /* Array of all variables referenced in the function. */
70 gimple_referenced_vars (const struct function
*fun
)
74 return fun
->gimple_df
->referenced_vars
;
77 /* Artificial variable used to model the effects of function calls. */
79 gimple_global_var (const struct function
*fun
)
81 gcc_assert (fun
&& fun
->gimple_df
);
82 return fun
->gimple_df
->global_var
;
85 /* Artificial variable used to model the effects of nonlocal
88 gimple_nonlocal_all (const struct function
*fun
)
90 gcc_assert (fun
&& fun
->gimple_df
);
91 return fun
->gimple_df
->nonlocal_all
;
94 /* Hashtable of variables annotations. Used for static variables only;
95 local variables have direct pointer in the tree node. */
97 gimple_var_anns (const struct function
*fun
)
99 return fun
->gimple_df
->var_anns
;
102 /* Initialize the hashtable iterator HTI to point to hashtable TABLE */
105 first_htab_element (htab_iterator
*hti
, htab_t table
)
108 hti
->slot
= table
->entries
;
109 hti
->limit
= hti
->slot
+ htab_size (table
);
112 PTR x
= *(hti
->slot
);
113 if (x
!= HTAB_EMPTY_ENTRY
&& x
!= HTAB_DELETED_ENTRY
)
115 } while (++(hti
->slot
) < hti
->limit
);
117 if (hti
->slot
< hti
->limit
)
122 /* Return current non-empty/deleted slot of the hashtable pointed to by HTI,
123 or NULL if we have reached the end. */
126 end_htab_p (const htab_iterator
*hti
)
128 if (hti
->slot
>= hti
->limit
)
133 /* Advance the hashtable iterator pointed to by HTI to the next element of the
137 next_htab_element (htab_iterator
*hti
)
139 while (++(hti
->slot
) < hti
->limit
)
141 PTR x
= *(hti
->slot
);
142 if (x
!= HTAB_EMPTY_ENTRY
&& x
!= HTAB_DELETED_ENTRY
)
148 /* Initialize ITER to point to the first referenced variable in the
149 referenced_vars hashtable, and return that variable. */
152 first_referenced_var (referenced_var_iterator
*iter
)
154 struct int_tree_map
*itm
;
155 itm
= (struct int_tree_map
*) first_htab_element (&iter
->hti
,
156 gimple_referenced_vars
163 /* Return true if we have hit the end of the referenced variables ITER is
164 iterating through. */
167 end_referenced_vars_p (const referenced_var_iterator
*iter
)
169 return end_htab_p (&iter
->hti
);
172 /* Make ITER point to the next referenced_var in the referenced_var hashtable,
173 and return that variable. */
176 next_referenced_var (referenced_var_iterator
*iter
)
178 struct int_tree_map
*itm
;
179 itm
= (struct int_tree_map
*) next_htab_element (&iter
->hti
);
185 /* Fill up VEC with the variables in the referenced vars hashtable. */
188 fill_referenced_var_vec (VEC (tree
, heap
) **vec
)
190 referenced_var_iterator rvi
;
193 FOR_EACH_REFERENCED_VAR (var
, rvi
)
194 VEC_safe_push (tree
, heap
, *vec
, var
);
197 /* Return the variable annotation for T, which must be a _DECL node.
198 Return NULL if the variable annotation doesn't already exist. */
199 static inline var_ann_t
200 var_ann (const_tree t
)
203 gcc_assert (DECL_P (t
));
204 gcc_assert (TREE_CODE (t
) != FUNCTION_DECL
);
205 if (!MTAG_P (t
) && (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
207 struct static_var_ann_d
*sann
208 = ((struct static_var_ann_d
*)
209 htab_find_with_hash (gimple_var_anns (cfun
), t
, DECL_UID (t
)));
212 gcc_assert (sann
->ann
.common
.type
== VAR_ANN
);
215 gcc_assert (!t
->base
.ann
216 || t
->base
.ann
->common
.type
== VAR_ANN
);
218 return (var_ann_t
) t
->base
.ann
;
221 /* Return the variable annotation for T, which must be a _DECL node.
222 Create the variable annotation if it doesn't exist. */
223 static inline var_ann_t
224 get_var_ann (tree var
)
226 var_ann_t ann
= var_ann (var
);
227 return (ann
) ? ann
: create_var_ann (var
);
230 /* Return the function annotation for T, which must be a FUNCTION_DECL node.
231 Return NULL if the function annotation doesn't already exist. */
232 static inline function_ann_t
233 function_ann (const_tree t
)
236 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
);
237 gcc_assert (!t
->base
.ann
238 || t
->base
.ann
->common
.type
== FUNCTION_ANN
);
240 return (function_ann_t
) t
->base
.ann
;
243 /* Return the function annotation for T, which must be a FUNCTION_DECL node.
244 Create the function annotation if it doesn't exist. */
245 static inline function_ann_t
246 get_function_ann (tree var
)
248 function_ann_t ann
= function_ann (var
);
249 gcc_assert (!var
->base
.ann
|| var
->base
.ann
->common
.type
== FUNCTION_ANN
);
250 return (ann
) ? ann
: create_function_ann (var
);
253 /* Return true if T has a statement annotation attached to it. */
256 has_stmt_ann (tree t
)
258 #ifdef ENABLE_CHECKING
259 gcc_assert (is_gimple_stmt (t
));
261 return t
->base
.ann
&& t
->base
.ann
->common
.type
== STMT_ANN
;
264 /* Return the statement annotation for T, which must be a statement
265 node. Return NULL if the statement annotation doesn't exist. */
266 static inline stmt_ann_t
269 #ifdef ENABLE_CHECKING
270 gcc_assert (is_gimple_stmt (t
));
272 gcc_assert (!t
->base
.ann
|| t
->base
.ann
->common
.type
== STMT_ANN
);
273 return (stmt_ann_t
) t
->base
.ann
;
276 /* Return the statement annotation for T, which must be a statement
277 node. Create the statement annotation if it doesn't exist. */
278 static inline stmt_ann_t
279 get_stmt_ann (tree stmt
)
281 stmt_ann_t ann
= stmt_ann (stmt
);
282 return (ann
) ? ann
: create_stmt_ann (stmt
);
285 /* Return the annotation type for annotation ANN. */
286 static inline enum tree_ann_type
287 ann_type (tree_ann_t ann
)
289 return ann
->common
.type
;
292 /* Return the basic block for statement T. */
293 static inline basic_block
298 if (TREE_CODE (t
) == PHI_NODE
)
302 return ann
? ann
->bb
: NULL
;
305 /* Return the may_aliases bitmap for variable VAR, or NULL if it has
308 may_aliases (const_tree var
)
310 return MTAG_ALIASES (var
);
313 /* Return the line number for EXPR, or return -1 if we have no line
314 number information for it. */
316 get_lineno (tree expr
)
318 if (expr
== NULL_TREE
)
321 if (TREE_CODE (expr
) == COMPOUND_EXPR
)
322 expr
= TREE_OPERAND (expr
, 0);
324 if (! EXPR_HAS_LOCATION (expr
))
327 return EXPR_LINENO (expr
);
330 /* Return true if T is a noreturn call. */
332 noreturn_call_p (tree t
)
334 tree call
= get_call_expr_in (t
);
335 return call
!= 0 && (call_expr_flags (call
) & ECF_NORETURN
) != 0;
338 /* Mark statement T as modified. */
340 mark_stmt_modified (tree t
)
343 if (TREE_CODE (t
) == PHI_NODE
)
348 ann
= create_stmt_ann (t
);
349 else if (noreturn_call_p (t
) && cfun
->gimple_df
)
350 VEC_safe_push (tree
, gc
, MODIFIED_NORETURN_CALLS (cfun
), t
);
354 /* Mark statement T as modified, and update it. */
358 if (TREE_CODE (t
) == PHI_NODE
)
360 mark_stmt_modified (t
);
361 update_stmt_operands (t
);
365 update_stmt_if_modified (tree t
)
367 if (stmt_modified_p (t
))
368 update_stmt_operands (t
);
371 /* Return true if T is marked as modified, false otherwise. */
373 stmt_modified_p (tree t
)
375 stmt_ann_t ann
= stmt_ann (t
);
377 /* Note that if the statement doesn't yet have an annotation, we consider it
378 modified. This will force the next call to update_stmt_operands to scan
380 return ann
? ann
->modified
: true;
383 /* Delink an immediate_uses node from its chain. */
385 delink_imm_use (ssa_use_operand_t
*linknode
)
387 /* Return if this node is not in a list. */
388 if (linknode
->prev
== NULL
)
391 linknode
->prev
->next
= linknode
->next
;
392 linknode
->next
->prev
= linknode
->prev
;
393 linknode
->prev
= NULL
;
394 linknode
->next
= NULL
;
397 /* Link ssa_imm_use node LINKNODE into the chain for LIST. */
399 link_imm_use_to_list (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*list
)
401 /* Link the new node at the head of the list. If we are in the process of
402 traversing the list, we won't visit any new nodes added to it. */
403 linknode
->prev
= list
;
404 linknode
->next
= list
->next
;
405 list
->next
->prev
= linknode
;
406 list
->next
= linknode
;
409 /* Link ssa_imm_use node LINKNODE into the chain for DEF. */
411 link_imm_use (ssa_use_operand_t
*linknode
, tree def
)
413 ssa_use_operand_t
*root
;
415 if (!def
|| TREE_CODE (def
) != SSA_NAME
)
416 linknode
->prev
= NULL
;
419 root
= &(SSA_NAME_IMM_USE_NODE (def
));
420 #ifdef ENABLE_CHECKING
422 gcc_assert (*(linknode
->use
) == def
);
424 link_imm_use_to_list (linknode
, root
);
428 /* Set the value of a use pointed to by USE to VAL. */
430 set_ssa_use_from_ptr (use_operand_p use
, tree val
)
432 delink_imm_use (use
);
434 link_imm_use (use
, val
);
437 /* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
440 link_imm_use_stmt (ssa_use_operand_t
*linknode
, tree def
, tree stmt
)
443 link_imm_use (linknode
, def
);
445 link_imm_use (linknode
, NULL
);
446 linknode
->stmt
= stmt
;
449 /* Relink a new node in place of an old node in the list. */
451 relink_imm_use (ssa_use_operand_t
*node
, ssa_use_operand_t
*old
)
453 /* The node one had better be in the same list. */
454 gcc_assert (*(old
->use
) == *(node
->use
));
455 node
->prev
= old
->prev
;
456 node
->next
= old
->next
;
459 old
->prev
->next
= node
;
460 old
->next
->prev
= node
;
461 /* Remove the old node from the list. */
466 /* Relink ssa_imm_use node LINKNODE into the chain for OLD, with use occurring
469 relink_imm_use_stmt (ssa_use_operand_t
*linknode
, ssa_use_operand_t
*old
, tree stmt
)
472 relink_imm_use (linknode
, old
);
474 link_imm_use (linknode
, NULL
);
475 linknode
->stmt
= stmt
;
479 /* Return true is IMM has reached the end of the immediate use list. */
481 end_readonly_imm_use_p (const imm_use_iterator
*imm
)
483 return (imm
->imm_use
== imm
->end_p
);
486 /* Initialize iterator IMM to process the list for VAR. */
487 static inline use_operand_p
488 first_readonly_imm_use (imm_use_iterator
*imm
, tree var
)
490 gcc_assert (TREE_CODE (var
) == SSA_NAME
);
492 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
493 imm
->imm_use
= imm
->end_p
->next
;
494 #ifdef ENABLE_CHECKING
495 imm
->iter_node
.next
= imm
->imm_use
->next
;
497 if (end_readonly_imm_use_p (imm
))
498 return NULL_USE_OPERAND_P
;
502 /* Bump IMM to the next use in the list. */
503 static inline use_operand_p
504 next_readonly_imm_use (imm_use_iterator
*imm
)
506 use_operand_p old
= imm
->imm_use
;
508 #ifdef ENABLE_CHECKING
509 /* If this assertion fails, it indicates the 'next' pointer has changed
510 since we the last bump. This indicates that the list is being modified
511 via stmt changes, or SET_USE, or somesuch thing, and you need to be
512 using the SAFE version of the iterator. */
513 gcc_assert (imm
->iter_node
.next
== old
->next
);
514 imm
->iter_node
.next
= old
->next
->next
;
517 imm
->imm_use
= old
->next
;
518 if (end_readonly_imm_use_p (imm
))
523 /* Return true if VAR has no uses. */
525 has_zero_uses (const_tree var
)
527 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
528 /* A single use means there is no items in the list. */
529 return (ptr
== ptr
->next
);
532 /* Return true if VAR has a single use. */
534 has_single_use (const_tree var
)
536 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
537 /* A single use means there is one item in the list. */
538 return (ptr
!= ptr
->next
&& ptr
== ptr
->next
->next
);
542 /* If VAR has only a single immediate use, return true, and set USE_P and STMT
543 to the use pointer and stmt of occurrence. */
545 single_imm_use (const_tree var
, use_operand_p
*use_p
, tree
*stmt
)
547 const ssa_use_operand_t
*const ptr
= &(SSA_NAME_IMM_USE_NODE (var
));
548 if (ptr
!= ptr
->next
&& ptr
== ptr
->next
->next
)
551 *stmt
= ptr
->next
->stmt
;
554 *use_p
= NULL_USE_OPERAND_P
;
559 /* Return the number of immediate uses of VAR. */
560 static inline unsigned int
561 num_imm_uses (const_tree var
)
563 const ssa_use_operand_t
*const start
= &(SSA_NAME_IMM_USE_NODE (var
));
564 const ssa_use_operand_t
*ptr
;
565 unsigned int num
= 0;
567 for (ptr
= start
->next
; ptr
!= start
; ptr
= ptr
->next
)
573 /* Return the tree pointer to by USE. */
575 get_use_from_ptr (use_operand_p use
)
580 /* Return the tree pointer to by DEF. */
582 get_def_from_ptr (def_operand_p def
)
587 /* Return a def_operand_p pointer for the result of PHI. */
588 static inline def_operand_p
589 get_phi_result_ptr (tree phi
)
591 return &(PHI_RESULT_TREE (phi
));
594 /* Return a use_operand_p pointer for argument I of phinode PHI. */
595 static inline use_operand_p
596 get_phi_arg_def_ptr (tree phi
, int i
)
598 return &(PHI_ARG_IMM_USE_NODE (phi
,i
));
602 /* Return the bitmap of addresses taken by STMT, or NULL if it takes
605 addresses_taken (tree stmt
)
607 stmt_ann_t ann
= stmt_ann (stmt
);
608 return ann
? ann
->addresses_taken
: NULL
;
611 /* Return the PHI nodes for basic block BB, or NULL if there are no
614 phi_nodes (const_basic_block bb
)
616 gcc_assert (!(bb
->flags
& BB_RTL
));
619 return bb
->il
.tree
->phi_nodes
;
622 /* Return pointer to the list of PHI nodes for basic block BB. */
625 phi_nodes_ptr (basic_block bb
)
627 gcc_assert (!(bb
->flags
& BB_RTL
));
628 return &bb
->il
.tree
->phi_nodes
;
631 /* Set list of phi nodes of a basic block BB to L. */
634 set_phi_nodes (basic_block bb
, tree l
)
638 gcc_assert (!(bb
->flags
& BB_RTL
));
639 bb
->il
.tree
->phi_nodes
= l
;
640 for (phi
= l
; phi
; phi
= PHI_CHAIN (phi
))
641 set_bb_for_stmt (phi
, bb
);
644 /* Return the phi argument which contains the specified use. */
647 phi_arg_index_from_use (use_operand_p use
)
649 struct phi_arg_d
*element
, *root
;
653 /* Since the use is the first thing in a PHI argument element, we can
654 calculate its index based on casting it to an argument, and performing
655 pointer arithmetic. */
657 phi
= USE_STMT (use
);
658 gcc_assert (TREE_CODE (phi
) == PHI_NODE
);
660 element
= (struct phi_arg_d
*)use
;
661 root
= &(PHI_ARG_ELT (phi
, 0));
662 index
= element
- root
;
664 #ifdef ENABLE_CHECKING
665 /* Make sure the calculation doesn't have any leftover bytes. If it does,
666 then imm_use is likely not the first element in phi_arg_d. */
668 (((char *)element
- (char *)root
) % sizeof (struct phi_arg_d
)) == 0);
669 gcc_assert (index
>= 0 && index
< PHI_ARG_CAPACITY (phi
));
675 /* Mark VAR as used, so that it'll be preserved during rtl expansion. */
678 set_is_used (tree var
)
680 var_ann_t ann
= get_var_ann (var
);
685 /* Return true if T (assumed to be a DECL) is a global variable. */
688 is_global_var (const_tree t
)
691 return (TREE_STATIC (t
) || MTAG_GLOBAL (t
));
693 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
696 /* PHI nodes should contain only ssa_names and invariants. A test
697 for ssa_name is definitely simpler; don't let invalid contents
698 slip in in the meantime. */
701 phi_ssa_name_p (const_tree t
)
703 if (TREE_CODE (t
) == SSA_NAME
)
705 #ifdef ENABLE_CHECKING
706 gcc_assert (is_gimple_min_invariant (t
));
711 /* ----------------------------------------------------------------------- */
713 /* Returns the list of statements in BB. */
716 bb_stmt_list (const_basic_block bb
)
718 gcc_assert (!(bb
->flags
& BB_RTL
));
719 return bb
->il
.tree
->stmt_list
;
722 /* Sets the list of statements in BB to LIST. */
725 set_bb_stmt_list (basic_block bb
, tree list
)
727 gcc_assert (!(bb
->flags
& BB_RTL
));
728 bb
->il
.tree
->stmt_list
= list
;
731 /* Return a block_stmt_iterator that points to beginning of basic
733 static inline block_stmt_iterator
734 bsi_start (basic_block bb
)
736 block_stmt_iterator bsi
;
737 if (bb
->index
< NUM_FIXED_BLOCKS
)
740 bsi
.tsi
.container
= NULL
;
743 bsi
.tsi
= tsi_start (bb_stmt_list (bb
));
748 static inline const_block_stmt_iterator
749 cbsi_start (const_basic_block bb
)
751 const_block_stmt_iterator bsi
;
752 if (bb
->index
< NUM_FIXED_BLOCKS
)
755 bsi
.tsi
.container
= NULL
;
758 bsi
.tsi
= ctsi_start (bb_stmt_list (bb
));
763 /* Return a block statement iterator that points to the first non-label
764 statement in block BB. */
766 static inline block_stmt_iterator
767 bsi_after_labels (basic_block bb
)
769 block_stmt_iterator bsi
= bsi_start (bb
);
771 while (!bsi_end_p (bsi
) && TREE_CODE (bsi_stmt (bsi
)) == LABEL_EXPR
)
777 /* Return a block statement iterator that points to the end of basic
779 static inline block_stmt_iterator
780 bsi_last (basic_block bb
)
782 block_stmt_iterator bsi
;
784 if (bb
->index
< NUM_FIXED_BLOCKS
)
787 bsi
.tsi
.container
= NULL
;
790 bsi
.tsi
= tsi_last (bb_stmt_list (bb
));
795 static inline const_block_stmt_iterator
796 cbsi_last (const_basic_block bb
)
798 const_block_stmt_iterator bsi
;
800 if (bb
->index
< NUM_FIXED_BLOCKS
)
803 bsi
.tsi
.container
= NULL
;
806 bsi
.tsi
= ctsi_last (bb_stmt_list (bb
));
811 /* Return true if block statement iterator I has reached the end of
814 bsi_end_p (block_stmt_iterator i
)
816 return tsi_end_p (i
.tsi
);
820 cbsi_end_p (const_block_stmt_iterator i
)
822 return ctsi_end_p (i
.tsi
);
825 /* Modify block statement iterator I so that it is at the next
826 statement in the basic block. */
828 bsi_next (block_stmt_iterator
*i
)
834 cbsi_next (const_block_stmt_iterator
*i
)
839 /* Modify block statement iterator I so that it is at the previous
840 statement in the basic block. */
842 bsi_prev (block_stmt_iterator
*i
)
848 cbsi_prev (const_block_stmt_iterator
*i
)
853 /* Return the statement that block statement iterator I is currently
856 bsi_stmt (block_stmt_iterator i
)
858 return tsi_stmt (i
.tsi
);
861 static inline const_tree
862 cbsi_stmt (const_block_stmt_iterator i
)
864 return ctsi_stmt (i
.tsi
);
867 /* Return a pointer to the statement that block statement iterator I
870 bsi_stmt_ptr (block_stmt_iterator i
)
872 return tsi_stmt_ptr (i
.tsi
);
875 /* Returns the loop of the statement STMT. */
877 static inline struct loop
*
878 loop_containing_stmt (tree stmt
)
880 basic_block bb
= bb_for_stmt (stmt
);
884 return bb
->loop_father
;
888 /* Return the memory partition tag associated with symbol SYM. */
891 memory_partition (tree sym
)
895 /* MPTs belong to their own partition. */
896 if (TREE_CODE (sym
) == MEMORY_PARTITION_TAG
)
899 gcc_assert (!is_gimple_reg (sym
));
900 tag
= get_var_ann (sym
)->mpt
;
902 #if defined ENABLE_CHECKING
904 gcc_assert (TREE_CODE (tag
) == MEMORY_PARTITION_TAG
);
910 /* Return true if NAME is a memory factoring SSA name (i.e., an SSA
911 name for a memory partition. */
914 factoring_name_p (const_tree name
)
916 return TREE_CODE (SSA_NAME_VAR (name
)) == MEMORY_PARTITION_TAG
;
919 /* Return true if VAR is a clobbered by function calls. */
921 is_call_clobbered (const_tree var
)
924 return var_ann (var
)->call_clobbered
;
926 return bitmap_bit_p (gimple_call_clobbered_vars (cfun
), DECL_UID (var
));
929 /* Mark variable VAR as being clobbered by function calls. */
931 mark_call_clobbered (tree var
, unsigned int escape_type
)
933 var_ann (var
)->escape_mask
|= escape_type
;
935 var_ann (var
)->call_clobbered
= true;
936 bitmap_set_bit (gimple_call_clobbered_vars (cfun
), DECL_UID (var
));
939 /* Clear the call-clobbered attribute from variable VAR. */
941 clear_call_clobbered (tree var
)
943 var_ann_t ann
= var_ann (var
);
944 ann
->escape_mask
= 0;
945 if (MTAG_P (var
) && TREE_CODE (var
) != STRUCT_FIELD_TAG
)
946 MTAG_GLOBAL (var
) = 0;
948 var_ann (var
)->call_clobbered
= false;
949 bitmap_clear_bit (gimple_call_clobbered_vars (cfun
), DECL_UID (var
));
952 /* Return the common annotation for T. Return NULL if the annotation
953 doesn't already exist. */
954 static inline tree_ann_common_t
955 tree_common_ann (const_tree t
)
957 /* Watch out static variables with unshared annotations. */
958 if (DECL_P (t
) && TREE_CODE (t
) == VAR_DECL
)
959 return &var_ann (t
)->common
;
960 return &t
->base
.ann
->common
;
963 /* Return a common annotation for T. Create the constant annotation if it
965 static inline tree_ann_common_t
966 get_tree_common_ann (tree t
)
968 tree_ann_common_t ann
= tree_common_ann (t
);
969 return (ann
) ? ann
: create_tree_common_ann (t
);
972 /* ----------------------------------------------------------------------- */
974 /* The following set of routines are used to iterator over various type of
977 /* Return true if PTR is finished iterating. */
979 op_iter_done (const ssa_op_iter
*ptr
)
984 /* Get the next iterator use value for PTR. */
985 static inline use_operand_p
986 op_iter_next_use (ssa_op_iter
*ptr
)
989 #ifdef ENABLE_CHECKING
990 gcc_assert (ptr
->iter_type
== ssa_op_iter_use
);
994 use_p
= USE_OP_PTR (ptr
->uses
);
995 ptr
->uses
= ptr
->uses
->next
;
1000 use_p
= VUSE_OP_PTR (ptr
->vuses
, ptr
->vuse_index
);
1001 if (++(ptr
->vuse_index
) >= VUSE_NUM (ptr
->vuses
))
1003 ptr
->vuse_index
= 0;
1004 ptr
->vuses
= ptr
->vuses
->next
;
1010 use_p
= VDEF_OP_PTR (ptr
->mayuses
, ptr
->mayuse_index
);
1011 if (++(ptr
->mayuse_index
) >= VDEF_NUM (ptr
->mayuses
))
1013 ptr
->mayuse_index
= 0;
1014 ptr
->mayuses
= ptr
->mayuses
->next
;
1018 if (ptr
->phi_i
< ptr
->num_phi
)
1020 return PHI_ARG_DEF_PTR (ptr
->phi_stmt
, (ptr
->phi_i
)++);
1023 return NULL_USE_OPERAND_P
;
1026 /* Get the next iterator def value for PTR. */
1027 static inline def_operand_p
1028 op_iter_next_def (ssa_op_iter
*ptr
)
1030 def_operand_p def_p
;
1031 #ifdef ENABLE_CHECKING
1032 gcc_assert (ptr
->iter_type
== ssa_op_iter_def
);
1036 def_p
= DEF_OP_PTR (ptr
->defs
);
1037 ptr
->defs
= ptr
->defs
->next
;
1042 def_p
= VDEF_RESULT_PTR (ptr
->vdefs
);
1043 ptr
->vdefs
= ptr
->vdefs
->next
;
1047 return NULL_DEF_OPERAND_P
;
1050 /* Get the next iterator tree value for PTR. */
1052 op_iter_next_tree (ssa_op_iter
*ptr
)
1055 #ifdef ENABLE_CHECKING
1056 gcc_assert (ptr
->iter_type
== ssa_op_iter_tree
);
1060 val
= USE_OP (ptr
->uses
);
1061 ptr
->uses
= ptr
->uses
->next
;
1066 val
= VUSE_OP (ptr
->vuses
, ptr
->vuse_index
);
1067 if (++(ptr
->vuse_index
) >= VUSE_NUM (ptr
->vuses
))
1069 ptr
->vuse_index
= 0;
1070 ptr
->vuses
= ptr
->vuses
->next
;
1076 val
= VDEF_OP (ptr
->mayuses
, ptr
->mayuse_index
);
1077 if (++(ptr
->mayuse_index
) >= VDEF_NUM (ptr
->mayuses
))
1079 ptr
->mayuse_index
= 0;
1080 ptr
->mayuses
= ptr
->mayuses
->next
;
1086 val
= DEF_OP (ptr
->defs
);
1087 ptr
->defs
= ptr
->defs
->next
;
1092 val
= VDEF_RESULT (ptr
->vdefs
);
1093 ptr
->vdefs
= ptr
->vdefs
->next
;
1103 /* This functions clears the iterator PTR, and marks it done. This is normally
1104 used to prevent warnings in the compile about might be uninitialized
1108 clear_and_done_ssa_iter (ssa_op_iter
*ptr
)
1114 ptr
->mayuses
= NULL
;
1115 ptr
->iter_type
= ssa_op_iter_none
;
1118 ptr
->phi_stmt
= NULL_TREE
;
1120 ptr
->vuse_index
= 0;
1121 ptr
->mayuse_index
= 0;
1124 /* Initialize the iterator PTR to the virtual defs in STMT. */
1126 op_iter_init (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1128 #ifdef ENABLE_CHECKING
1129 gcc_assert (stmt_ann (stmt
));
1132 ptr
->defs
= (flags
& SSA_OP_DEF
) ? DEF_OPS (stmt
) : NULL
;
1133 ptr
->uses
= (flags
& SSA_OP_USE
) ? USE_OPS (stmt
) : NULL
;
1134 ptr
->vuses
= (flags
& SSA_OP_VUSE
) ? VUSE_OPS (stmt
) : NULL
;
1135 ptr
->vdefs
= (flags
& SSA_OP_VDEF
) ? VDEF_OPS (stmt
) : NULL
;
1136 ptr
->mayuses
= (flags
& SSA_OP_VMAYUSE
) ? VDEF_OPS (stmt
) : NULL
;
1141 ptr
->phi_stmt
= NULL_TREE
;
1142 ptr
->vuse_index
= 0;
1143 ptr
->mayuse_index
= 0;
1146 /* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
1148 static inline use_operand_p
1149 op_iter_init_use (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1151 gcc_assert ((flags
& SSA_OP_ALL_DEFS
) == 0);
1152 op_iter_init (ptr
, stmt
, flags
);
1153 ptr
->iter_type
= ssa_op_iter_use
;
1154 return op_iter_next_use (ptr
);
1157 /* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
1159 static inline def_operand_p
1160 op_iter_init_def (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1162 gcc_assert ((flags
& SSA_OP_ALL_USES
) == 0);
1163 op_iter_init (ptr
, stmt
, flags
);
1164 ptr
->iter_type
= ssa_op_iter_def
;
1165 return op_iter_next_def (ptr
);
1168 /* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
1169 the first operand as a tree. */
1171 op_iter_init_tree (ssa_op_iter
*ptr
, tree stmt
, int flags
)
1173 op_iter_init (ptr
, stmt
, flags
);
1174 ptr
->iter_type
= ssa_op_iter_tree
;
1175 return op_iter_next_tree (ptr
);
1178 /* Get the next iterator mustdef value for PTR, returning the mustdef values in
1181 op_iter_next_vdef (vuse_vec_p
*use
, def_operand_p
*def
,
1184 #ifdef ENABLE_CHECKING
1185 gcc_assert (ptr
->iter_type
== ssa_op_iter_vdef
);
1189 *def
= VDEF_RESULT_PTR (ptr
->mayuses
);
1190 *use
= VDEF_VECT (ptr
->mayuses
);
1191 ptr
->mayuses
= ptr
->mayuses
->next
;
1195 *def
= NULL_DEF_OPERAND_P
;
1203 op_iter_next_mustdef (use_operand_p
*use
, def_operand_p
*def
,
1207 op_iter_next_vdef (&vp
, def
, ptr
);
1210 gcc_assert (VUSE_VECT_NUM_ELEM (*vp
) == 1);
1211 *use
= VUSE_ELEMENT_PTR (*vp
, 0);
1214 *use
= NULL_USE_OPERAND_P
;
1217 /* Initialize iterator PTR to the operands in STMT. Return the first operands
1220 op_iter_init_vdef (ssa_op_iter
*ptr
, tree stmt
, vuse_vec_p
*use
,
1223 gcc_assert (TREE_CODE (stmt
) != PHI_NODE
);
1225 op_iter_init (ptr
, stmt
, SSA_OP_VMAYUSE
);
1226 ptr
->iter_type
= ssa_op_iter_vdef
;
1227 op_iter_next_vdef (use
, def
, ptr
);
1231 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1234 single_ssa_tree_operand (tree stmt
, int flags
)
1239 var
= op_iter_init_tree (&iter
, stmt
, flags
);
1240 if (op_iter_done (&iter
))
1242 op_iter_next_tree (&iter
);
1243 if (op_iter_done (&iter
))
1249 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1251 static inline use_operand_p
1252 single_ssa_use_operand (tree stmt
, int flags
)
1257 var
= op_iter_init_use (&iter
, stmt
, flags
);
1258 if (op_iter_done (&iter
))
1259 return NULL_USE_OPERAND_P
;
1260 op_iter_next_use (&iter
);
1261 if (op_iter_done (&iter
))
1263 return NULL_USE_OPERAND_P
;
1268 /* If there is a single operand in STMT matching FLAGS, return it. Otherwise
1270 static inline def_operand_p
1271 single_ssa_def_operand (tree stmt
, int flags
)
1276 var
= op_iter_init_def (&iter
, stmt
, flags
);
1277 if (op_iter_done (&iter
))
1278 return NULL_DEF_OPERAND_P
;
1279 op_iter_next_def (&iter
);
1280 if (op_iter_done (&iter
))
1282 return NULL_DEF_OPERAND_P
;
1286 /* Return true if there are zero operands in STMT matching the type
1289 zero_ssa_operands (tree stmt
, int flags
)
1293 op_iter_init_tree (&iter
, stmt
, flags
);
1294 return op_iter_done (&iter
);
1298 /* Return the number of operands matching FLAGS in STMT. */
1300 num_ssa_operands (tree stmt
, int flags
)
1306 FOR_EACH_SSA_TREE_OPERAND (t
, stmt
, iter
, flags
)
1312 /* Delink all immediate_use information for STMT. */
1314 delink_stmt_imm_use (tree stmt
)
1317 use_operand_p use_p
;
1319 if (ssa_operands_active ())
1320 FOR_EACH_SSA_USE_OPERAND (use_p
, stmt
, iter
, SSA_OP_ALL_USES
)
1321 delink_imm_use (use_p
);
1325 /* This routine will compare all the operands matching FLAGS in STMT1 to those
1326 in STMT2. TRUE is returned if they are the same. STMTs can be NULL. */
1328 compare_ssa_operands_equal (tree stmt1
, tree stmt2
, int flags
)
1330 ssa_op_iter iter1
, iter2
;
1331 tree op1
= NULL_TREE
;
1332 tree op2
= NULL_TREE
;
1338 look1
= stmt1
&& stmt_ann (stmt1
);
1339 look2
= stmt2
&& stmt_ann (stmt2
);
1343 op1
= op_iter_init_tree (&iter1
, stmt1
, flags
);
1345 return op_iter_done (&iter1
);
1348 clear_and_done_ssa_iter (&iter1
);
1352 op2
= op_iter_init_tree (&iter2
, stmt2
, flags
);
1354 return op_iter_done (&iter2
);
1357 clear_and_done_ssa_iter (&iter2
);
1359 while (!op_iter_done (&iter1
) && !op_iter_done (&iter2
))
1363 op1
= op_iter_next_tree (&iter1
);
1364 op2
= op_iter_next_tree (&iter2
);
1367 return (op_iter_done (&iter1
) && op_iter_done (&iter2
));
1371 /* If there is a single DEF in the PHI node which matches FLAG, return it.
1372 Otherwise return NULL_DEF_OPERAND_P. */
1374 single_phi_def (tree stmt
, int flags
)
1376 tree def
= PHI_RESULT (stmt
);
1377 if ((flags
& SSA_OP_DEF
) && is_gimple_reg (def
))
1379 if ((flags
& SSA_OP_VIRTUAL_DEFS
) && !is_gimple_reg (def
))
1384 /* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
1385 be either SSA_OP_USES or SSA_OP_VIRTUAL_USES. */
1386 static inline use_operand_p
1387 op_iter_init_phiuse (ssa_op_iter
*ptr
, tree phi
, int flags
)
1389 tree phi_def
= PHI_RESULT (phi
);
1392 clear_and_done_ssa_iter (ptr
);
1395 gcc_assert ((flags
& (SSA_OP_USE
| SSA_OP_VIRTUAL_USES
)) != 0);
1397 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
1399 /* If the PHI node doesn't the operand type we care about, we're done. */
1400 if ((flags
& comp
) == 0)
1403 return NULL_USE_OPERAND_P
;
1406 ptr
->phi_stmt
= phi
;
1407 ptr
->num_phi
= PHI_NUM_ARGS (phi
);
1408 ptr
->iter_type
= ssa_op_iter_use
;
1409 return op_iter_next_use (ptr
);
1413 /* Start an iterator for a PHI definition. */
1415 static inline def_operand_p
1416 op_iter_init_phidef (ssa_op_iter
*ptr
, tree phi
, int flags
)
1418 tree phi_def
= PHI_RESULT (phi
);
1421 clear_and_done_ssa_iter (ptr
);
1424 gcc_assert ((flags
& (SSA_OP_DEF
| SSA_OP_VIRTUAL_DEFS
)) != 0);
1426 comp
= (is_gimple_reg (phi_def
) ? SSA_OP_DEF
: SSA_OP_VIRTUAL_DEFS
);
1428 /* If the PHI node doesn't the operand type we care about, we're done. */
1429 if ((flags
& comp
) == 0)
1432 return NULL_USE_OPERAND_P
;
1435 ptr
->iter_type
= ssa_op_iter_def
;
1436 /* The first call to op_iter_next_def will terminate the iterator since
1437 all the fields are NULL. Simply return the result here as the first and
1438 therefore only result. */
1439 return PHI_RESULT_PTR (phi
);
1442 /* Return true is IMM has reached the end of the immediate use stmt list. */
1445 end_imm_use_stmt_p (const imm_use_iterator
*imm
)
1447 return (imm
->imm_use
== imm
->end_p
);
1450 /* Finished the traverse of an immediate use stmt list IMM by removing the
1451 placeholder node from the list. */
1454 end_imm_use_stmt_traverse (imm_use_iterator
*imm
)
1456 delink_imm_use (&(imm
->iter_node
));
1459 /* Immediate use traversal of uses within a stmt require that all the
1460 uses on a stmt be sequentially listed. This routine is used to build up
1461 this sequential list by adding USE_P to the end of the current list
1462 currently delimited by HEAD and LAST_P. The new LAST_P value is
1465 static inline use_operand_p
1466 move_use_after_head (use_operand_p use_p
, use_operand_p head
,
1467 use_operand_p last_p
)
1469 gcc_assert (USE_FROM_PTR (use_p
) == USE_FROM_PTR (head
));
1470 /* Skip head when we find it. */
1473 /* If use_p is already linked in after last_p, continue. */
1474 if (last_p
->next
== use_p
)
1478 /* Delink from current location, and link in at last_p. */
1479 delink_imm_use (use_p
);
1480 link_imm_use_to_list (use_p
, last_p
);
1488 /* This routine will relink all uses with the same stmt as HEAD into the list
1489 immediately following HEAD for iterator IMM. */
1492 link_use_stmts_after (use_operand_p head
, imm_use_iterator
*imm
)
1494 use_operand_p use_p
;
1495 use_operand_p last_p
= head
;
1496 tree head_stmt
= USE_STMT (head
);
1497 tree use
= USE_FROM_PTR (head
);
1498 ssa_op_iter op_iter
;
1501 /* Only look at virtual or real uses, depending on the type of HEAD. */
1502 flag
= (is_gimple_reg (use
) ? SSA_OP_USE
: SSA_OP_VIRTUAL_USES
);
1504 if (TREE_CODE (head_stmt
) == PHI_NODE
)
1506 FOR_EACH_PHI_ARG (use_p
, head_stmt
, op_iter
, flag
)
1507 if (USE_FROM_PTR (use_p
) == use
)
1508 last_p
= move_use_after_head (use_p
, head
, last_p
);
1512 FOR_EACH_SSA_USE_OPERAND (use_p
, head_stmt
, op_iter
, flag
)
1513 if (USE_FROM_PTR (use_p
) == use
)
1514 last_p
= move_use_after_head (use_p
, head
, last_p
);
1516 /* LInk iter node in after last_p. */
1517 if (imm
->iter_node
.prev
!= NULL
)
1518 delink_imm_use (&imm
->iter_node
);
1519 link_imm_use_to_list (&(imm
->iter_node
), last_p
);
1522 /* Initialize IMM to traverse over uses of VAR. Return the first statement. */
1524 first_imm_use_stmt (imm_use_iterator
*imm
, tree var
)
1526 gcc_assert (TREE_CODE (var
) == SSA_NAME
);
1528 imm
->end_p
= &(SSA_NAME_IMM_USE_NODE (var
));
1529 imm
->imm_use
= imm
->end_p
->next
;
1530 imm
->next_imm_name
= NULL_USE_OPERAND_P
;
1532 /* iter_node is used as a marker within the immediate use list to indicate
1533 where the end of the current stmt's uses are. Initialize it to NULL
1534 stmt and use, which indicates a marker node. */
1535 imm
->iter_node
.prev
= NULL_USE_OPERAND_P
;
1536 imm
->iter_node
.next
= NULL_USE_OPERAND_P
;
1537 imm
->iter_node
.stmt
= NULL_TREE
;
1538 imm
->iter_node
.use
= NULL_USE_OPERAND_P
;
1540 if (end_imm_use_stmt_p (imm
))
1543 link_use_stmts_after (imm
->imm_use
, imm
);
1545 return USE_STMT (imm
->imm_use
);
1548 /* Bump IMM to the next stmt which has a use of var. */
1551 next_imm_use_stmt (imm_use_iterator
*imm
)
1553 imm
->imm_use
= imm
->iter_node
.next
;
1554 if (end_imm_use_stmt_p (imm
))
1556 if (imm
->iter_node
.prev
!= NULL
)
1557 delink_imm_use (&imm
->iter_node
);
1561 link_use_stmts_after (imm
->imm_use
, imm
);
1562 return USE_STMT (imm
->imm_use
);
1565 /* This routine will return the first use on the stmt IMM currently refers
1568 static inline use_operand_p
1569 first_imm_use_on_stmt (imm_use_iterator
*imm
)
1571 imm
->next_imm_name
= imm
->imm_use
->next
;
1572 return imm
->imm_use
;
1575 /* Return TRUE if the last use on the stmt IMM refers to has been visited. */
1578 end_imm_use_on_stmt_p (const imm_use_iterator
*imm
)
1580 return (imm
->imm_use
== &(imm
->iter_node
));
1583 /* Bump to the next use on the stmt IMM refers to, return NULL if done. */
1585 static inline use_operand_p
1586 next_imm_use_on_stmt (imm_use_iterator
*imm
)
1588 imm
->imm_use
= imm
->next_imm_name
;
1589 if (end_imm_use_on_stmt_p (imm
))
1590 return NULL_USE_OPERAND_P
;
1593 imm
->next_imm_name
= imm
->imm_use
->next
;
1594 return imm
->imm_use
;
1598 /* Return true if VAR cannot be modified by the program. */
1601 unmodifiable_var_p (const_tree var
)
1603 if (TREE_CODE (var
) == SSA_NAME
)
1604 var
= SSA_NAME_VAR (var
);
1607 return TREE_READONLY (var
) && (TREE_STATIC (var
) || MTAG_GLOBAL (var
));
1609 return TREE_READONLY (var
) && (TREE_STATIC (var
) || DECL_EXTERNAL (var
));
1612 /* Return true if REF, an ARRAY_REF, has an INDIRECT_REF somewhere in it. */
1615 array_ref_contains_indirect_ref (const_tree ref
)
1617 gcc_assert (TREE_CODE (ref
) == ARRAY_REF
);
1620 ref
= TREE_OPERAND (ref
, 0);
1621 } while (handled_component_p (ref
));
1623 return TREE_CODE (ref
) == INDIRECT_REF
;
1626 /* Return true if REF, a handled component reference, has an ARRAY_REF
1630 ref_contains_array_ref (const_tree ref
)
1632 gcc_assert (handled_component_p (ref
));
1635 if (TREE_CODE (ref
) == ARRAY_REF
)
1637 ref
= TREE_OPERAND (ref
, 0);
1638 } while (handled_component_p (ref
));
1643 /* Given a variable VAR, lookup and return a pointer to the list of
1644 subvariables for it. */
1646 static inline subvar_t
*
1647 lookup_subvars_for_var (const_tree var
)
1649 var_ann_t ann
= var_ann (var
);
1651 return &ann
->subvars
;
1654 /* Given a variable VAR, return a linked list of subvariables for VAR, or
1655 NULL, if there are no subvariables. */
1657 static inline subvar_t
1658 get_subvars_for_var (tree var
)
1662 gcc_assert (SSA_VAR_P (var
));
1664 if (TREE_CODE (var
) == SSA_NAME
)
1665 subvars
= *(lookup_subvars_for_var (SSA_NAME_VAR (var
)));
1667 subvars
= *(lookup_subvars_for_var (var
));
1671 /* Return the subvariable of VAR at offset OFFSET. */
1674 get_subvar_at (tree var
, unsigned HOST_WIDE_INT offset
)
1678 for (sv
= get_subvars_for_var (var
); sv
; sv
= sv
->next
)
1679 if (SFT_OFFSET (sv
->var
) == offset
)
1685 /* Return true if V is a tree that we can have subvars for.
1686 Normally, this is any aggregate type. Also complex
1687 types which are not gimple registers can have subvars. */
1690 var_can_have_subvars (const_tree v
)
1692 /* Volatile variables should never have subvars. */
1693 if (TREE_THIS_VOLATILE (v
))
1696 /* Non decls or memory tags can never have subvars. */
1697 if (!DECL_P (v
) || MTAG_P (v
))
1700 /* Aggregates can have subvars. */
1701 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
1704 /* Complex types variables which are not also a gimple register can
1706 if (TREE_CODE (TREE_TYPE (v
)) == COMPLEX_TYPE
1707 && !DECL_GIMPLE_REG_P (v
))
1714 /* Return true if OFFSET and SIZE define a range that overlaps with some
1715 portion of the range of SV, a subvar. If there was an exact overlap,
1716 *EXACT will be set to true upon return. */
1719 overlap_subvar (unsigned HOST_WIDE_INT offset
, unsigned HOST_WIDE_INT size
,
1720 const_tree sv
, bool *exact
)
1722 /* There are three possible cases of overlap.
1723 1. We can have an exact overlap, like so:
1724 |offset, offset + size |
1725 |sv->offset, sv->offset + sv->size |
1727 2. We can have offset starting after sv->offset, like so:
1729 |offset, offset + size |
1730 |sv->offset, sv->offset + sv->size |
1732 3. We can have offset starting before sv->offset, like so:
1734 |offset, offset + size |
1735 |sv->offset, sv->offset + sv->size|
1740 if (offset
== SFT_OFFSET (sv
) && size
== SFT_SIZE (sv
))
1746 else if (offset
>= SFT_OFFSET (sv
)
1747 && offset
< (SFT_OFFSET (sv
) + SFT_SIZE (sv
)))
1751 else if (offset
< SFT_OFFSET (sv
)
1752 && (size
> SFT_OFFSET (sv
) - offset
))
1760 /* Return the memory tag associated with symbol SYM. */
1763 symbol_mem_tag (tree sym
)
1765 tree tag
= get_var_ann (sym
)->symbol_mem_tag
;
1767 #if defined ENABLE_CHECKING
1769 gcc_assert (TREE_CODE (tag
) == SYMBOL_MEMORY_TAG
);
1776 /* Set the memory tag associated with symbol SYM. */
1779 set_symbol_mem_tag (tree sym
, tree tag
)
1781 #if defined ENABLE_CHECKING
1783 gcc_assert (TREE_CODE (tag
) == SYMBOL_MEMORY_TAG
);
1786 get_var_ann (sym
)->symbol_mem_tag
= tag
;
1789 /* Get the value handle of EXPR. This is the only correct way to get
1790 the value handle for a "thing". If EXPR does not have a value
1791 handle associated, it returns NULL_TREE.
1792 NB: If EXPR is min_invariant, this function is *required* to return
1796 get_value_handle (tree expr
)
1798 if (TREE_CODE (expr
) == SSA_NAME
)
1799 return SSA_NAME_VALUE (expr
);
1800 else if (DECL_P (expr
) || TREE_CODE (expr
) == TREE_LIST
1801 || TREE_CODE (expr
) == CONSTRUCTOR
)
1803 tree_ann_common_t ann
= tree_common_ann (expr
);
1804 return ((ann
) ? ann
->value_handle
: NULL_TREE
);
1806 else if (is_gimple_min_invariant (expr
))
1808 else if (EXPR_P (expr
))
1810 tree_ann_common_t ann
= tree_common_ann (expr
);
1811 return ((ann
) ? ann
->value_handle
: NULL_TREE
);
1817 /* Accessor to tree-ssa-operands.c caches. */
1818 static inline struct ssa_operands
*
1819 gimple_ssa_operands (const struct function
*fun
)
1821 return &fun
->gimple_df
->ssa_operands
;
1824 /* Map describing reference statistics for function FN. */
1825 static inline struct mem_ref_stats_d
*
1826 gimple_mem_ref_stats (const struct function
*fn
)
1828 return &fn
->gimple_df
->mem_ref_stats
;
1830 #endif /* _TREE_FLOW_INLINE_H */