1 /* Gimple IR support functions.
3 Copyright 2007, 2008 Free Software Foundation, Inc.
4 Contributed by Aldy Hernandez <aldyh@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
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/>. */
24 #include "coretypes.h"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
32 #include "diagnostic.h"
33 #include "tree-flow.h"
34 #include "value-prof.h"
37 #define DEFGSCODE(SYM, NAME, STRUCT) NAME,
38 const char *const gimple_code_name
[] = {
43 /* All the tuples have their operand vector at the very bottom
44 of the structure. Therefore, the offset required to find the
45 operands vector the size of the structure minus the size of the 1
46 element tree array at the end (see gimple_ops). */
47 #define DEFGSCODE(SYM, NAME, STRUCT) (sizeof (STRUCT) - sizeof (tree)),
48 const size_t gimple_ops_offset_
[] = {
53 #ifdef GATHER_STATISTICS
56 int gimple_alloc_counts
[(int) gimple_alloc_kind_all
];
57 int gimple_alloc_sizes
[(int) gimple_alloc_kind_all
];
59 /* Keep in sync with gimple.h:enum gimple_alloc_kind. */
60 static const char * const gimple_alloc_kind_names
[] = {
68 #endif /* GATHER_STATISTICS */
70 /* A cache of gimple_seq objects. Sequences are created and destroyed
71 fairly often during gimplification. */
72 static GTY ((deletable
)) struct gimple_seq_d
*gimple_seq_cache
;
74 /* Private API manipulation functions shared only with some
76 extern void gimple_set_stored_syms (gimple
, bitmap
, bitmap_obstack
*);
77 extern void gimple_set_loaded_syms (gimple
, bitmap
, bitmap_obstack
*);
79 /* Gimple tuple constructors.
80 Note: Any constructor taking a ``gimple_seq'' as a parameter, can
81 be passed a NULL to start with an empty sequence. */
83 /* Set the code for statement G to CODE. */
86 gimple_set_code (gimple g
, enum gimple_code code
)
88 g
->gsbase
.code
= code
;
92 /* Return the GSS_* identifier for the given GIMPLE statement CODE. */
94 static enum gimple_statement_structure_enum
95 gss_for_code (enum gimple_code code
)
101 case GIMPLE_RETURN
: return GSS_WITH_MEM_OPS
;
105 case GIMPLE_CHANGE_DYNAMIC_TYPE
:
106 case GIMPLE_SWITCH
: return GSS_WITH_OPS
;
107 case GIMPLE_ASM
: return GSS_ASM
;
108 case GIMPLE_BIND
: return GSS_BIND
;
109 case GIMPLE_CATCH
: return GSS_CATCH
;
110 case GIMPLE_EH_FILTER
: return GSS_EH_FILTER
;
111 case GIMPLE_NOP
: return GSS_BASE
;
112 case GIMPLE_PHI
: return GSS_PHI
;
113 case GIMPLE_RESX
: return GSS_RESX
;
114 case GIMPLE_TRY
: return GSS_TRY
;
115 case GIMPLE_WITH_CLEANUP_EXPR
: return GSS_WCE
;
116 case GIMPLE_OMP_CRITICAL
: return GSS_OMP_CRITICAL
;
117 case GIMPLE_OMP_FOR
: return GSS_OMP_FOR
;
118 case GIMPLE_OMP_MASTER
:
119 case GIMPLE_OMP_ORDERED
:
120 case GIMPLE_OMP_SECTION
: return GSS_OMP
;
121 case GIMPLE_OMP_RETURN
:
122 case GIMPLE_OMP_SECTIONS_SWITCH
: return GSS_BASE
;
123 case GIMPLE_OMP_CONTINUE
: return GSS_OMP_CONTINUE
;
124 case GIMPLE_OMP_PARALLEL
: return GSS_OMP_PARALLEL
;
125 case GIMPLE_OMP_TASK
: return GSS_OMP_TASK
;
126 case GIMPLE_OMP_SECTIONS
: return GSS_OMP_SECTIONS
;
127 case GIMPLE_OMP_SINGLE
: return GSS_OMP_SINGLE
;
128 case GIMPLE_OMP_ATOMIC_LOAD
: return GSS_OMP_ATOMIC_LOAD
;
129 case GIMPLE_OMP_ATOMIC_STORE
: return GSS_OMP_ATOMIC_STORE
;
130 case GIMPLE_PREDICT
: return GSS_BASE
;
131 default: gcc_unreachable ();
136 /* Return the number of bytes needed to hold a GIMPLE statement with
140 gimple_size (enum gimple_code code
)
142 enum gimple_statement_structure_enum gss
= gss_for_code (code
);
144 if (gss
== GSS_WITH_OPS
)
145 return sizeof (struct gimple_statement_with_ops
);
146 else if (gss
== GSS_WITH_MEM_OPS
)
147 return sizeof (struct gimple_statement_with_memory_ops
);
152 return sizeof (struct gimple_statement_asm
);
154 return sizeof (struct gimple_statement_base
);
156 return sizeof (struct gimple_statement_bind
);
158 return sizeof (struct gimple_statement_catch
);
159 case GIMPLE_EH_FILTER
:
160 return sizeof (struct gimple_statement_eh_filter
);
162 return sizeof (struct gimple_statement_try
);
164 return sizeof (struct gimple_statement_resx
);
165 case GIMPLE_OMP_CRITICAL
:
166 return sizeof (struct gimple_statement_omp_critical
);
168 return sizeof (struct gimple_statement_omp_for
);
169 case GIMPLE_OMP_PARALLEL
:
170 return sizeof (struct gimple_statement_omp_parallel
);
171 case GIMPLE_OMP_TASK
:
172 return sizeof (struct gimple_statement_omp_task
);
173 case GIMPLE_OMP_SECTION
:
174 case GIMPLE_OMP_MASTER
:
175 case GIMPLE_OMP_ORDERED
:
176 return sizeof (struct gimple_statement_omp
);
177 case GIMPLE_OMP_RETURN
:
178 return sizeof (struct gimple_statement_base
);
179 case GIMPLE_OMP_CONTINUE
:
180 return sizeof (struct gimple_statement_omp_continue
);
181 case GIMPLE_OMP_SECTIONS
:
182 return sizeof (struct gimple_statement_omp_sections
);
183 case GIMPLE_OMP_SECTIONS_SWITCH
:
184 return sizeof (struct gimple_statement_base
);
185 case GIMPLE_OMP_SINGLE
:
186 return sizeof (struct gimple_statement_omp_single
);
187 case GIMPLE_OMP_ATOMIC_LOAD
:
188 return sizeof (struct gimple_statement_omp_atomic_load
);
189 case GIMPLE_OMP_ATOMIC_STORE
:
190 return sizeof (struct gimple_statement_omp_atomic_store
);
191 case GIMPLE_WITH_CLEANUP_EXPR
:
192 return sizeof (struct gimple_statement_wce
);
193 case GIMPLE_CHANGE_DYNAMIC_TYPE
:
194 return sizeof (struct gimple_statement_with_ops
);
196 return sizeof (struct gimple_statement_base
);
205 /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS
208 #define gimple_alloc(c, n) gimple_alloc_stat (c, n MEM_STAT_INFO)
210 gimple_alloc_stat (enum gimple_code code
, unsigned num_ops MEM_STAT_DECL
)
215 size
= gimple_size (code
);
217 size
+= sizeof (tree
) * (num_ops
- 1);
219 #ifdef GATHER_STATISTICS
221 enum gimple_alloc_kind kind
= gimple_alloc_kind (code
);
222 gimple_alloc_counts
[(int) kind
]++;
223 gimple_alloc_sizes
[(int) kind
] += size
;
227 stmt
= (gimple
) ggc_alloc_cleared_stat (size PASS_MEM_STAT
);
228 gimple_set_code (stmt
, code
);
229 gimple_set_num_ops (stmt
, num_ops
);
231 /* Do not call gimple_set_modified here as it has other side
232 effects and this tuple is still not completely built. */
233 stmt
->gsbase
.modified
= 1;
238 /* Set SUBCODE to be the code of the expression computed by statement G. */
241 gimple_set_subcode (gimple g
, unsigned subcode
)
243 /* We only have 16 bits for the RHS code. Assert that we are not
245 gcc_assert (subcode
< (1 << 16));
246 g
->gsbase
.subcode
= subcode
;
251 /* Build a tuple with operands. CODE is the statement to build (which
252 must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the sub-code
253 for the new tuple. NUM_OPS is the number of operands to allocate. */
255 #define gimple_build_with_ops(c, s, n) \
256 gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO)
259 gimple_build_with_ops_stat (enum gimple_code code
, enum tree_code subcode
,
260 unsigned num_ops MEM_STAT_DECL
)
262 gimple s
= gimple_alloc_stat (code
, num_ops PASS_MEM_STAT
);
263 gimple_set_subcode (s
, subcode
);
269 /* Build a GIMPLE_RETURN statement returning RETVAL. */
272 gimple_build_return (tree retval
)
274 gimple s
= gimple_build_with_ops (GIMPLE_RETURN
, 0, 1);
276 gimple_return_set_retval (s
, retval
);
280 /* Helper for gimple_build_call, gimple_build_call_vec and
281 gimple_build_call_from_tree. Build the basic components of a
282 GIMPLE_CALL statement to function FN with NARGS arguments. */
285 gimple_build_call_1 (tree fn
, unsigned nargs
)
287 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, 0, nargs
+ 3);
288 if (TREE_CODE (fn
) == FUNCTION_DECL
)
289 fn
= build_fold_addr_expr (fn
);
290 gimple_set_op (s
, 1, fn
);
295 /* Build a GIMPLE_CALL statement to function FN with the arguments
296 specified in vector ARGS. */
299 gimple_build_call_vec (tree fn
, VEC(tree
, heap
) *args
)
302 unsigned nargs
= VEC_length (tree
, args
);
303 gimple call
= gimple_build_call_1 (fn
, nargs
);
305 for (i
= 0; i
< nargs
; i
++)
306 gimple_call_set_arg (call
, i
, VEC_index (tree
, args
, i
));
312 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
313 arguments. The ... are the arguments. */
316 gimple_build_call (tree fn
, unsigned nargs
, ...)
322 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
324 call
= gimple_build_call_1 (fn
, nargs
);
326 va_start (ap
, nargs
);
327 for (i
= 0; i
< nargs
; i
++)
328 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
335 /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is
336 assumed to be in GIMPLE form already. Minimal checking is done of
340 gimple_build_call_from_tree (tree t
)
344 tree fndecl
= get_callee_fndecl (t
);
346 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
348 nargs
= call_expr_nargs (t
);
349 call
= gimple_build_call_1 (fndecl
? fndecl
: CALL_EXPR_FN (t
), nargs
);
351 for (i
= 0; i
< nargs
; i
++)
352 gimple_call_set_arg (call
, i
, CALL_EXPR_ARG (t
, i
));
354 gimple_set_block (call
, TREE_BLOCK (t
));
356 /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */
357 gimple_call_set_chain (call
, CALL_EXPR_STATIC_CHAIN (t
));
358 gimple_call_set_tail (call
, CALL_EXPR_TAILCALL (t
));
359 gimple_call_set_cannot_inline (call
, CALL_CANNOT_INLINE_P (t
));
360 gimple_call_set_return_slot_opt (call
, CALL_EXPR_RETURN_SLOT_OPT (t
));
361 gimple_call_set_from_thunk (call
, CALL_FROM_THUNK_P (t
));
362 gimple_call_set_va_arg_pack (call
, CALL_EXPR_VA_ARG_PACK (t
));
368 /* Extract the operands and code for expression EXPR into *SUBCODE_P,
369 *OP1_P and *OP2_P respectively. */
372 extract_ops_from_tree (tree expr
, enum tree_code
*subcode_p
, tree
*op1_p
,
375 enum gimple_rhs_class grhs_class
;
377 *subcode_p
= TREE_CODE (expr
);
378 grhs_class
= get_gimple_rhs_class (*subcode_p
);
380 if (grhs_class
== GIMPLE_BINARY_RHS
)
382 *op1_p
= TREE_OPERAND (expr
, 0);
383 *op2_p
= TREE_OPERAND (expr
, 1);
385 else if (grhs_class
== GIMPLE_UNARY_RHS
)
387 *op1_p
= TREE_OPERAND (expr
, 0);
390 else if (grhs_class
== GIMPLE_SINGLE_RHS
)
400 /* Build a GIMPLE_ASSIGN statement.
402 LHS of the assignment.
403 RHS of the assignment which can be unary or binary. */
406 gimple_build_assign_stat (tree lhs
, tree rhs MEM_STAT_DECL
)
408 enum tree_code subcode
;
411 extract_ops_from_tree (rhs
, &subcode
, &op1
, &op2
);
412 return gimple_build_assign_with_ops_stat (subcode
, lhs
, op1
, op2
417 /* Build a GIMPLE_ASSIGN statement with sub-code SUBCODE and operands
418 OP1 and OP2. If OP2 is NULL then SUBCODE must be of class
419 GIMPLE_UNARY_RHS or GIMPLE_SINGLE_RHS. */
422 gimple_build_assign_with_ops_stat (enum tree_code subcode
, tree lhs
, tree op1
,
423 tree op2 MEM_STAT_DECL
)
428 /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the
430 num_ops
= get_gimple_rhs_num_ops (subcode
) + 1;
432 p
= gimple_build_with_ops_stat (GIMPLE_ASSIGN
, subcode
, num_ops
434 gimple_assign_set_lhs (p
, lhs
);
435 gimple_assign_set_rhs1 (p
, op1
);
438 gcc_assert (num_ops
> 2);
439 gimple_assign_set_rhs2 (p
, op2
);
446 /* Build a new GIMPLE_ASSIGN tuple and append it to the end of *SEQ_P.
448 DST/SRC are the destination and source respectively. You can pass
449 ungimplified trees in DST or SRC, in which case they will be
450 converted to a gimple operand if necessary.
452 This function returns the newly created GIMPLE_ASSIGN tuple. */
455 gimplify_assign (tree dst
, tree src
, gimple_seq
*seq_p
)
457 tree t
= build2 (MODIFY_EXPR
, TREE_TYPE (dst
), dst
, src
);
458 gimplify_and_add (t
, seq_p
);
460 return gimple_seq_last_stmt (*seq_p
);
464 /* Build a GIMPLE_COND statement.
466 PRED is the condition used to compare LHS and the RHS.
467 T_LABEL is the label to jump to if the condition is true.
468 F_LABEL is the label to jump to otherwise. */
471 gimple_build_cond (enum tree_code pred_code
, tree lhs
, tree rhs
,
472 tree t_label
, tree f_label
)
476 gcc_assert (TREE_CODE_CLASS (pred_code
) == tcc_comparison
);
477 p
= gimple_build_with_ops (GIMPLE_COND
, pred_code
, 4);
478 gimple_cond_set_lhs (p
, lhs
);
479 gimple_cond_set_rhs (p
, rhs
);
480 gimple_cond_set_true_label (p
, t_label
);
481 gimple_cond_set_false_label (p
, f_label
);
486 /* Extract operands for a GIMPLE_COND statement out of COND_EXPR tree COND. */
489 gimple_cond_get_ops_from_tree (tree cond
, enum tree_code
*code_p
,
490 tree
*lhs_p
, tree
*rhs_p
)
492 gcc_assert (TREE_CODE_CLASS (TREE_CODE (cond
)) == tcc_comparison
493 || TREE_CODE (cond
) == TRUTH_NOT_EXPR
494 || is_gimple_min_invariant (cond
)
495 || SSA_VAR_P (cond
));
497 extract_ops_from_tree (cond
, code_p
, lhs_p
, rhs_p
);
499 /* Canonicalize conditionals of the form 'if (!VAL)'. */
500 if (*code_p
== TRUTH_NOT_EXPR
)
503 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
504 *rhs_p
= fold_convert (TREE_TYPE (*lhs_p
), integer_zero_node
);
506 /* Canonicalize conditionals of the form 'if (VAL)' */
507 else if (TREE_CODE_CLASS (*code_p
) != tcc_comparison
)
510 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
511 *rhs_p
= fold_convert (TREE_TYPE (*lhs_p
), integer_zero_node
);
516 /* Build a GIMPLE_COND statement from the conditional expression tree
517 COND. T_LABEL and F_LABEL are as in gimple_build_cond. */
520 gimple_build_cond_from_tree (tree cond
, tree t_label
, tree f_label
)
525 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
526 return gimple_build_cond (code
, lhs
, rhs
, t_label
, f_label
);
529 /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable
530 boolean expression tree COND. */
533 gimple_cond_set_condition_from_tree (gimple stmt
, tree cond
)
538 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
539 gimple_cond_set_condition (stmt
, code
, lhs
, rhs
);
542 /* Build a GIMPLE_LABEL statement for LABEL. */
545 gimple_build_label (tree label
)
547 gimple p
= gimple_build_with_ops (GIMPLE_LABEL
, 0, 1);
548 gimple_label_set_label (p
, label
);
552 /* Build a GIMPLE_GOTO statement to label DEST. */
555 gimple_build_goto (tree dest
)
557 gimple p
= gimple_build_with_ops (GIMPLE_GOTO
, 0, 1);
558 gimple_goto_set_dest (p
, dest
);
563 /* Build a GIMPLE_NOP statement. */
566 gimple_build_nop (void)
568 return gimple_alloc (GIMPLE_NOP
, 0);
572 /* Build a GIMPLE_BIND statement.
573 VARS are the variables in BODY.
574 BLOCK is the containing block. */
577 gimple_build_bind (tree vars
, gimple_seq body
, tree block
)
579 gimple p
= gimple_alloc (GIMPLE_BIND
, 0);
580 gimple_bind_set_vars (p
, vars
);
582 gimple_bind_set_body (p
, body
);
584 gimple_bind_set_block (p
, block
);
588 /* Helper function to set the simple fields of a asm stmt.
590 STRING is a pointer to a string that is the asm blocks assembly code.
591 NINPUT is the number of register inputs.
592 NOUTPUT is the number of register outputs.
593 NCLOBBERS is the number of clobbered registers.
597 gimple_build_asm_1 (const char *string
, unsigned ninputs
, unsigned noutputs
,
601 int size
= strlen (string
);
603 p
= gimple_build_with_ops (GIMPLE_ASM
, 0, ninputs
+ noutputs
+ nclobbers
);
605 p
->gimple_asm
.ni
= ninputs
;
606 p
->gimple_asm
.no
= noutputs
;
607 p
->gimple_asm
.nc
= nclobbers
;
608 p
->gimple_asm
.string
= ggc_alloc_string (string
, size
);
610 #ifdef GATHER_STATISTICS
611 gimple_alloc_sizes
[(int) gimple_alloc_kind (GIMPLE_ASM
)] += size
;
617 /* Build a GIMPLE_ASM statement.
619 STRING is the assembly code.
620 NINPUT is the number of register inputs.
621 NOUTPUT is the number of register outputs.
622 NCLOBBERS is the number of clobbered registers.
623 INPUTS is a vector of the input register parameters.
624 OUTPUTS is a vector of the output register parameters.
625 CLOBBERS is a vector of the clobbered register parameters. */
628 gimple_build_asm_vec (const char *string
, VEC(tree
,gc
)* inputs
,
629 VEC(tree
,gc
)* outputs
, VEC(tree
,gc
)* clobbers
)
634 p
= gimple_build_asm_1 (string
,
635 VEC_length (tree
, inputs
),
636 VEC_length (tree
, outputs
),
637 VEC_length (tree
, clobbers
));
639 for (i
= 0; i
< VEC_length (tree
, inputs
); i
++)
640 gimple_asm_set_input_op (p
, i
, VEC_index (tree
, inputs
, i
));
642 for (i
= 0; i
< VEC_length (tree
, outputs
); i
++)
643 gimple_asm_set_output_op (p
, i
, VEC_index (tree
, outputs
, i
));
645 for (i
= 0; i
< VEC_length (tree
, clobbers
); i
++)
646 gimple_asm_set_clobber_op (p
, i
, VEC_index (tree
, clobbers
, i
));
651 /* Build a GIMPLE_ASM statement.
653 STRING is the assembly code.
654 NINPUT is the number of register inputs.
655 NOUTPUT is the number of register outputs.
656 NCLOBBERS is the number of clobbered registers.
657 ... are trees for each input, output and clobbered register. */
660 gimple_build_asm (const char *string
, unsigned ninputs
, unsigned noutputs
,
661 unsigned nclobbers
, ...)
667 p
= gimple_build_asm_1 (string
, ninputs
, noutputs
, nclobbers
);
669 va_start (ap
, nclobbers
);
671 for (i
= 0; i
< ninputs
; i
++)
672 gimple_asm_set_input_op (p
, i
, va_arg (ap
, tree
));
674 for (i
= 0; i
< noutputs
; i
++)
675 gimple_asm_set_output_op (p
, i
, va_arg (ap
, tree
));
677 for (i
= 0; i
< nclobbers
; i
++)
678 gimple_asm_set_clobber_op (p
, i
, va_arg (ap
, tree
));
685 /* Build a GIMPLE_CATCH statement.
687 TYPES are the catch types.
688 HANDLER is the exception handler. */
691 gimple_build_catch (tree types
, gimple_seq handler
)
693 gimple p
= gimple_alloc (GIMPLE_CATCH
, 0);
694 gimple_catch_set_types (p
, types
);
696 gimple_catch_set_handler (p
, handler
);
701 /* Build a GIMPLE_EH_FILTER statement.
703 TYPES are the filter's types.
704 FAILURE is the filter's failure action. */
707 gimple_build_eh_filter (tree types
, gimple_seq failure
)
709 gimple p
= gimple_alloc (GIMPLE_EH_FILTER
, 0);
710 gimple_eh_filter_set_types (p
, types
);
712 gimple_eh_filter_set_failure (p
, failure
);
717 /* Build a GIMPLE_TRY statement.
719 EVAL is the expression to evaluate.
720 CLEANUP is the cleanup expression.
721 KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on
722 whether this is a try/catch or a try/finally respectively. */
725 gimple_build_try (gimple_seq eval
, gimple_seq cleanup
,
726 enum gimple_try_flags kind
)
730 gcc_assert (kind
== GIMPLE_TRY_CATCH
|| kind
== GIMPLE_TRY_FINALLY
);
731 p
= gimple_alloc (GIMPLE_TRY
, 0);
732 gimple_set_subcode (p
, kind
);
734 gimple_try_set_eval (p
, eval
);
736 gimple_try_set_cleanup (p
, cleanup
);
741 /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement.
743 CLEANUP is the cleanup expression. */
746 gimple_build_wce (gimple_seq cleanup
)
748 gimple p
= gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR
, 0);
750 gimple_wce_set_cleanup (p
, cleanup
);
756 /* Build a GIMPLE_RESX statement.
758 REGION is the region number from which this resx causes control flow to
762 gimple_build_resx (int region
)
764 gimple p
= gimple_alloc (GIMPLE_RESX
, 0);
765 gimple_resx_set_region (p
, region
);
770 /* The helper for constructing a gimple switch statement.
771 INDEX is the switch's index.
772 NLABELS is the number of labels in the switch excluding the default.
773 DEFAULT_LABEL is the default label for the switch statement. */
776 gimple_build_switch_1 (unsigned nlabels
, tree index
, tree default_label
)
778 /* nlabels + 1 default label + 1 index. */
779 gimple p
= gimple_build_with_ops (GIMPLE_SWITCH
, 0, nlabels
+ 1 + 1);
780 gimple_switch_set_index (p
, index
);
781 gimple_switch_set_default_label (p
, default_label
);
786 /* Build a GIMPLE_SWITCH statement.
788 INDEX is the switch's index.
789 NLABELS is the number of labels in the switch excluding the DEFAULT_LABEL.
790 ... are the labels excluding the default. */
793 gimple_build_switch (unsigned nlabels
, tree index
, tree default_label
, ...)
799 p
= gimple_build_switch_1 (nlabels
, index
, default_label
);
801 /* Store the rest of the labels. */
802 va_start (al
, default_label
);
803 for (i
= 1; i
<= nlabels
; i
++)
804 gimple_switch_set_label (p
, i
, va_arg (al
, tree
));
811 /* Build a GIMPLE_SWITCH statement.
813 INDEX is the switch's index.
814 DEFAULT_LABEL is the default label
815 ARGS is a vector of labels excluding the default. */
818 gimple_build_switch_vec (tree index
, tree default_label
, VEC(tree
, heap
) *args
)
821 unsigned nlabels
= VEC_length (tree
, args
);
822 gimple p
= gimple_build_switch_1 (nlabels
, index
, default_label
);
824 /* Put labels in labels[1 - (nlabels + 1)].
825 Default label is in labels[0]. */
826 for (i
= 1; i
<= nlabels
; i
++)
827 gimple_switch_set_label (p
, i
, VEC_index (tree
, args
, i
- 1));
833 /* Build a GIMPLE_OMP_CRITICAL statement.
835 BODY is the sequence of statements for which only one thread can execute.
836 NAME is optional identifier for this critical block. */
839 gimple_build_omp_critical (gimple_seq body
, tree name
)
841 gimple p
= gimple_alloc (GIMPLE_OMP_CRITICAL
, 0);
842 gimple_omp_critical_set_name (p
, name
);
844 gimple_omp_set_body (p
, body
);
849 /* Build a GIMPLE_OMP_FOR statement.
851 BODY is sequence of statements inside the for loop.
852 CLAUSES, are any of the OMP loop construct's clauses: private, firstprivate,
853 lastprivate, reductions, ordered, schedule, and nowait.
854 COLLAPSE is the collapse count.
855 PRE_BODY is the sequence of statements that are loop invariant. */
858 gimple_build_omp_for (gimple_seq body
, tree clauses
, size_t collapse
,
861 gimple p
= gimple_alloc (GIMPLE_OMP_FOR
, 0);
863 gimple_omp_set_body (p
, body
);
864 gimple_omp_for_set_clauses (p
, clauses
);
865 p
->gimple_omp_for
.collapse
= collapse
;
866 p
->gimple_omp_for
.iter
= GGC_CNEWVEC (struct gimple_omp_for_iter
, collapse
);
868 gimple_omp_for_set_pre_body (p
, pre_body
);
874 /* Build a GIMPLE_OMP_PARALLEL statement.
876 BODY is sequence of statements which are executed in parallel.
877 CLAUSES, are the OMP parallel construct's clauses.
878 CHILD_FN is the function created for the parallel threads to execute.
879 DATA_ARG are the shared data argument(s). */
882 gimple_build_omp_parallel (gimple_seq body
, tree clauses
, tree child_fn
,
885 gimple p
= gimple_alloc (GIMPLE_OMP_PARALLEL
, 0);
887 gimple_omp_set_body (p
, body
);
888 gimple_omp_parallel_set_clauses (p
, clauses
);
889 gimple_omp_parallel_set_child_fn (p
, child_fn
);
890 gimple_omp_parallel_set_data_arg (p
, data_arg
);
896 /* Build a GIMPLE_OMP_TASK statement.
898 BODY is sequence of statements which are executed by the explicit task.
899 CLAUSES, are the OMP parallel construct's clauses.
900 CHILD_FN is the function created for the parallel threads to execute.
901 DATA_ARG are the shared data argument(s).
902 COPY_FN is the optional function for firstprivate initialization.
903 ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */
906 gimple_build_omp_task (gimple_seq body
, tree clauses
, tree child_fn
,
907 tree data_arg
, tree copy_fn
, tree arg_size
,
910 gimple p
= gimple_alloc (GIMPLE_OMP_TASK
, 0);
912 gimple_omp_set_body (p
, body
);
913 gimple_omp_task_set_clauses (p
, clauses
);
914 gimple_omp_task_set_child_fn (p
, child_fn
);
915 gimple_omp_task_set_data_arg (p
, data_arg
);
916 gimple_omp_task_set_copy_fn (p
, copy_fn
);
917 gimple_omp_task_set_arg_size (p
, arg_size
);
918 gimple_omp_task_set_arg_align (p
, arg_align
);
924 /* Build a GIMPLE_OMP_SECTION statement for a sections statement.
926 BODY is the sequence of statements in the section. */
929 gimple_build_omp_section (gimple_seq body
)
931 gimple p
= gimple_alloc (GIMPLE_OMP_SECTION
, 0);
933 gimple_omp_set_body (p
, body
);
939 /* Build a GIMPLE_OMP_MASTER statement.
941 BODY is the sequence of statements to be executed by just the master. */
944 gimple_build_omp_master (gimple_seq body
)
946 gimple p
= gimple_alloc (GIMPLE_OMP_MASTER
, 0);
948 gimple_omp_set_body (p
, body
);
954 /* Build a GIMPLE_OMP_CONTINUE statement.
956 CONTROL_DEF is the definition of the control variable.
957 CONTROL_USE is the use of the control variable. */
960 gimple_build_omp_continue (tree control_def
, tree control_use
)
962 gimple p
= gimple_alloc (GIMPLE_OMP_CONTINUE
, 0);
963 gimple_omp_continue_set_control_def (p
, control_def
);
964 gimple_omp_continue_set_control_use (p
, control_use
);
968 /* Build a GIMPLE_OMP_ORDERED statement.
970 BODY is the sequence of statements inside a loop that will executed in
974 gimple_build_omp_ordered (gimple_seq body
)
976 gimple p
= gimple_alloc (GIMPLE_OMP_ORDERED
, 0);
978 gimple_omp_set_body (p
, body
);
984 /* Build a GIMPLE_OMP_RETURN statement.
985 WAIT_P is true if this is a non-waiting return. */
988 gimple_build_omp_return (bool wait_p
)
990 gimple p
= gimple_alloc (GIMPLE_OMP_RETURN
, 0);
992 gimple_omp_return_set_nowait (p
);
998 /* Build a GIMPLE_OMP_SECTIONS statement.
1000 BODY is a sequence of section statements.
1001 CLAUSES are any of the OMP sections contsruct's clauses: private,
1002 firstprivate, lastprivate, reduction, and nowait. */
1005 gimple_build_omp_sections (gimple_seq body
, tree clauses
)
1007 gimple p
= gimple_alloc (GIMPLE_OMP_SECTIONS
, 0);
1009 gimple_omp_set_body (p
, body
);
1010 gimple_omp_sections_set_clauses (p
, clauses
);
1016 /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */
1019 gimple_build_omp_sections_switch (void)
1021 return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH
, 0);
1025 /* Build a GIMPLE_OMP_SINGLE statement.
1027 BODY is the sequence of statements that will be executed once.
1028 CLAUSES are any of the OMP single construct's clauses: private, firstprivate,
1029 copyprivate, nowait. */
1032 gimple_build_omp_single (gimple_seq body
, tree clauses
)
1034 gimple p
= gimple_alloc (GIMPLE_OMP_SINGLE
, 0);
1036 gimple_omp_set_body (p
, body
);
1037 gimple_omp_single_set_clauses (p
, clauses
);
1043 /* Build a GIMPLE_CHANGE_DYNAMIC_TYPE statement. TYPE is the new type
1044 for the location PTR. */
1047 gimple_build_cdt (tree type
, tree ptr
)
1049 gimple p
= gimple_build_with_ops (GIMPLE_CHANGE_DYNAMIC_TYPE
, 0, 2);
1050 gimple_cdt_set_new_type (p
, type
);
1051 gimple_cdt_set_location (p
, ptr
);
1057 /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */
1060 gimple_build_omp_atomic_load (tree lhs
, tree rhs
)
1062 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD
, 0);
1063 gimple_omp_atomic_load_set_lhs (p
, lhs
);
1064 gimple_omp_atomic_load_set_rhs (p
, rhs
);
1068 /* Build a GIMPLE_OMP_ATOMIC_STORE statement.
1070 VAL is the value we are storing. */
1073 gimple_build_omp_atomic_store (tree val
)
1075 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_STORE
, 0);
1076 gimple_omp_atomic_store_set_val (p
, val
);
1080 /* Build a GIMPLE_PREDICT statement. PREDICT is one of the predictors from
1081 predict.def, OUTCOME is NOT_TAKEN or TAKEN. */
1084 gimple_build_predict (enum br_predictor predictor
, enum prediction outcome
)
1086 gimple p
= gimple_alloc (GIMPLE_PREDICT
, 0);
1087 /* Ensure all the predictors fit into the lower bits of the subcode. */
1088 gcc_assert ((int) END_PREDICTORS
<= GF_PREDICT_TAKEN
);
1089 gimple_predict_set_predictor (p
, predictor
);
1090 gimple_predict_set_outcome (p
, outcome
);
1094 /* Return which gimple structure is used by T. The enums here are defined
1097 enum gimple_statement_structure_enum
1098 gimple_statement_structure (gimple gs
)
1100 return gss_for_code (gimple_code (gs
));
1103 #if defined ENABLE_GIMPLE_CHECKING
1104 /* Complain of a gimple type mismatch and die. */
1107 gimple_check_failed (const_gimple gs
, const char *file
, int line
,
1108 const char *function
, enum gimple_code code
,
1109 enum tree_code subcode
)
1111 internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d",
1112 gimple_code_name
[code
],
1113 tree_code_name
[subcode
],
1114 gimple_code_name
[gimple_code (gs
)],
1115 gs
->gsbase
.subcode
> 0
1116 ? tree_code_name
[gs
->gsbase
.subcode
]
1118 function
, trim_filename (file
), line
);
1120 #endif /* ENABLE_GIMPLE_CHECKING */
1123 /* Allocate a new GIMPLE sequence in GC memory and return it. If
1124 there are free sequences in GIMPLE_SEQ_CACHE return one of those
1128 gimple_seq_alloc (void)
1130 gimple_seq seq
= gimple_seq_cache
;
1133 gimple_seq_cache
= gimple_seq_cache
->next_free
;
1134 gcc_assert (gimple_seq_cache
!= seq
);
1135 memset (seq
, 0, sizeof (*seq
));
1139 seq
= (gimple_seq
) ggc_alloc_cleared (sizeof (*seq
));
1140 #ifdef GATHER_STATISTICS
1141 gimple_alloc_counts
[(int) gimple_alloc_kind_seq
]++;
1142 gimple_alloc_sizes
[(int) gimple_alloc_kind_seq
] += sizeof (*seq
);
1149 /* Return SEQ to the free pool of GIMPLE sequences. */
1152 gimple_seq_free (gimple_seq seq
)
1157 gcc_assert (gimple_seq_first (seq
) == NULL
);
1158 gcc_assert (gimple_seq_last (seq
) == NULL
);
1160 /* If this triggers, it's a sign that the same list is being freed
1162 gcc_assert (seq
!= gimple_seq_cache
|| gimple_seq_cache
== NULL
);
1164 /* Add SEQ to the pool of free sequences. */
1165 seq
->next_free
= gimple_seq_cache
;
1166 gimple_seq_cache
= seq
;
1170 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1171 *SEQ_P is NULL, a new sequence is allocated. */
1174 gimple_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
1176 gimple_stmt_iterator si
;
1182 *seq_p
= gimple_seq_alloc ();
1184 si
= gsi_last (*seq_p
);
1185 gsi_insert_after (&si
, gs
, GSI_NEW_STMT
);
1189 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1190 NULL, a new sequence is allocated. */
1193 gimple_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
1195 gimple_stmt_iterator si
;
1201 *dst_p
= gimple_seq_alloc ();
1203 si
= gsi_last (*dst_p
);
1204 gsi_insert_seq_after (&si
, src
, GSI_NEW_STMT
);
1208 /* Helper function of empty_body_p. Return true if STMT is an empty
1212 empty_stmt_p (gimple stmt
)
1214 if (gimple_code (stmt
) == GIMPLE_NOP
)
1216 if (gimple_code (stmt
) == GIMPLE_BIND
)
1217 return empty_body_p (gimple_bind_body (stmt
));
1222 /* Return true if BODY contains nothing but empty statements. */
1225 empty_body_p (gimple_seq body
)
1227 gimple_stmt_iterator i
;
1230 if (gimple_seq_empty_p (body
))
1232 for (i
= gsi_start (body
); !gsi_end_p (i
); gsi_next (&i
))
1233 if (!empty_stmt_p (gsi_stmt (i
)))
1240 /* Perform a deep copy of sequence SRC and return the result. */
1243 gimple_seq_copy (gimple_seq src
)
1245 gimple_stmt_iterator gsi
;
1246 gimple_seq new_seq
= gimple_seq_alloc ();
1249 for (gsi
= gsi_start (src
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1251 stmt
= gimple_copy (gsi_stmt (gsi
));
1252 gimple_seq_add_stmt (&new_seq
, stmt
);
1259 /* Walk all the statements in the sequence SEQ calling walk_gimple_stmt
1260 on each one. WI is as in walk_gimple_stmt.
1262 If walk_gimple_stmt returns non-NULL, the walk is stopped, the
1263 value is stored in WI->CALLBACK_RESULT and the statement that
1264 produced the value is returned.
1266 Otherwise, all the statements are walked and NULL returned. */
1269 walk_gimple_seq (gimple_seq seq
, walk_stmt_fn callback_stmt
,
1270 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1272 gimple_stmt_iterator gsi
;
1274 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1276 tree ret
= walk_gimple_stmt (&gsi
, callback_stmt
, callback_op
, wi
);
1279 /* If CALLBACK_STMT or CALLBACK_OP return a value, WI must exist
1282 wi
->callback_result
= ret
;
1283 return gsi_stmt (gsi
);
1288 wi
->callback_result
= NULL_TREE
;
1294 /* Helper function for walk_gimple_stmt. Walk operands of a GIMPLE_ASM. */
1297 walk_gimple_asm (gimple stmt
, walk_tree_fn callback_op
,
1298 struct walk_stmt_info
*wi
)
1302 const char **oconstraints
;
1304 const char *constraint
;
1305 bool allows_mem
, allows_reg
, is_inout
;
1307 noutputs
= gimple_asm_noutputs (stmt
);
1308 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
1313 for (i
= 0; i
< noutputs
; i
++)
1315 tree op
= gimple_asm_output_op (stmt
, i
);
1316 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1317 oconstraints
[i
] = constraint
;
1318 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
, &allows_reg
,
1321 wi
->val_only
= (allows_reg
|| !allows_mem
);
1322 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1327 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
1329 tree op
= gimple_asm_input_op (stmt
, i
);
1330 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1331 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
1332 oconstraints
, &allows_mem
, &allows_reg
);
1334 wi
->val_only
= (allows_reg
|| !allows_mem
);
1336 /* Although input "m" is not really a LHS, we need a lvalue. */
1338 wi
->is_lhs
= !wi
->val_only
;
1339 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1347 wi
->val_only
= true;
1354 /* Helper function of WALK_GIMPLE_STMT. Walk every tree operand in
1355 STMT. CALLBACK_OP and WI are as in WALK_GIMPLE_STMT.
1357 CALLBACK_OP is called on each operand of STMT via walk_tree.
1358 Additional parameters to walk_tree must be stored in WI. For each operand
1359 OP, walk_tree is called as:
1361 walk_tree (&OP, CALLBACK_OP, WI, WI->PSET)
1363 If CALLBACK_OP returns non-NULL for an operand, the remaining
1364 operands are not scanned.
1366 The return value is that returned by the last call to walk_tree, or
1367 NULL_TREE if no CALLBACK_OP is specified. */
1370 walk_gimple_op (gimple stmt
, walk_tree_fn callback_op
,
1371 struct walk_stmt_info
*wi
)
1373 struct pointer_set_t
*pset
= (wi
) ? wi
->pset
: NULL
;
1375 tree ret
= NULL_TREE
;
1377 switch (gimple_code (stmt
))
1380 /* Walk the RHS operands. A formal temporary LHS may use a
1381 COMPONENT_REF RHS. */
1383 wi
->val_only
= !is_gimple_reg (gimple_assign_lhs (stmt
))
1384 || !gimple_assign_single_p (stmt
);
1386 for (i
= 1; i
< gimple_num_ops (stmt
); i
++)
1388 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
,
1394 /* Walk the LHS. If the RHS is appropriate for a memory, we
1395 may use a COMPONENT_REF on the LHS. */
1398 /* If the RHS has more than 1 operand, it is not appropriate
1400 wi
->val_only
= !is_gimple_mem_rhs (gimple_assign_rhs1 (stmt
))
1401 || !gimple_assign_single_p (stmt
);
1405 ret
= walk_tree (gimple_op_ptr (stmt
, 0), callback_op
, wi
, pset
);
1411 wi
->val_only
= true;
1420 ret
= walk_tree (gimple_call_chain_ptr (stmt
), callback_op
, wi
, pset
);
1424 ret
= walk_tree (gimple_call_fn_ptr (stmt
), callback_op
, wi
, pset
);
1428 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
1430 ret
= walk_tree (gimple_call_arg_ptr (stmt
, i
), callback_op
, wi
,
1439 ret
= walk_tree (gimple_call_lhs_ptr (stmt
), callback_op
, wi
, pset
);
1448 ret
= walk_tree (gimple_catch_types_ptr (stmt
), callback_op
, wi
,
1454 case GIMPLE_EH_FILTER
:
1455 ret
= walk_tree (gimple_eh_filter_types_ptr (stmt
), callback_op
, wi
,
1461 case GIMPLE_CHANGE_DYNAMIC_TYPE
:
1462 ret
= walk_tree (gimple_cdt_location_ptr (stmt
), callback_op
, wi
, pset
);
1466 ret
= walk_tree (gimple_cdt_new_type_ptr (stmt
), callback_op
, wi
, pset
);
1472 ret
= walk_gimple_asm (stmt
, callback_op
, wi
);
1477 case GIMPLE_OMP_CONTINUE
:
1478 ret
= walk_tree (gimple_omp_continue_control_def_ptr (stmt
),
1479 callback_op
, wi
, pset
);
1483 ret
= walk_tree (gimple_omp_continue_control_use_ptr (stmt
),
1484 callback_op
, wi
, pset
);
1489 case GIMPLE_OMP_CRITICAL
:
1490 ret
= walk_tree (gimple_omp_critical_name_ptr (stmt
), callback_op
, wi
,
1496 case GIMPLE_OMP_FOR
:
1497 ret
= walk_tree (gimple_omp_for_clauses_ptr (stmt
), callback_op
, wi
,
1501 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1503 ret
= walk_tree (gimple_omp_for_index_ptr (stmt
, i
), callback_op
,
1507 ret
= walk_tree (gimple_omp_for_initial_ptr (stmt
, i
), callback_op
,
1511 ret
= walk_tree (gimple_omp_for_final_ptr (stmt
, i
), callback_op
,
1515 ret
= walk_tree (gimple_omp_for_incr_ptr (stmt
, i
), callback_op
,
1522 case GIMPLE_OMP_PARALLEL
:
1523 ret
= walk_tree (gimple_omp_parallel_clauses_ptr (stmt
), callback_op
,
1527 ret
= walk_tree (gimple_omp_parallel_child_fn_ptr (stmt
), callback_op
,
1531 ret
= walk_tree (gimple_omp_parallel_data_arg_ptr (stmt
), callback_op
,
1537 case GIMPLE_OMP_TASK
:
1538 ret
= walk_tree (gimple_omp_task_clauses_ptr (stmt
), callback_op
,
1542 ret
= walk_tree (gimple_omp_task_child_fn_ptr (stmt
), callback_op
,
1546 ret
= walk_tree (gimple_omp_task_data_arg_ptr (stmt
), callback_op
,
1550 ret
= walk_tree (gimple_omp_task_copy_fn_ptr (stmt
), callback_op
,
1554 ret
= walk_tree (gimple_omp_task_arg_size_ptr (stmt
), callback_op
,
1558 ret
= walk_tree (gimple_omp_task_arg_align_ptr (stmt
), callback_op
,
1564 case GIMPLE_OMP_SECTIONS
:
1565 ret
= walk_tree (gimple_omp_sections_clauses_ptr (stmt
), callback_op
,
1570 ret
= walk_tree (gimple_omp_sections_control_ptr (stmt
), callback_op
,
1577 case GIMPLE_OMP_SINGLE
:
1578 ret
= walk_tree (gimple_omp_single_clauses_ptr (stmt
), callback_op
, wi
,
1584 case GIMPLE_OMP_ATOMIC_LOAD
:
1585 ret
= walk_tree (gimple_omp_atomic_load_lhs_ptr (stmt
), callback_op
, wi
,
1590 ret
= walk_tree (gimple_omp_atomic_load_rhs_ptr (stmt
), callback_op
, wi
,
1596 case GIMPLE_OMP_ATOMIC_STORE
:
1597 ret
= walk_tree (gimple_omp_atomic_store_val_ptr (stmt
), callback_op
,
1603 /* Tuples that do not have operands. */
1606 case GIMPLE_OMP_RETURN
:
1607 case GIMPLE_PREDICT
:
1612 enum gimple_statement_structure_enum gss
;
1613 gss
= gimple_statement_structure (stmt
);
1614 if (gss
== GSS_WITH_OPS
|| gss
== GSS_WITH_MEM_OPS
)
1615 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1617 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
, pset
);
1629 /* Walk the current statement in GSI (optionally using traversal state
1630 stored in WI). If WI is NULL, no state is kept during traversal.
1631 The callback CALLBACK_STMT is called. If CALLBACK_STMT indicates
1632 that it has handled all the operands of the statement, its return
1633 value is returned. Otherwise, the return value from CALLBACK_STMT
1634 is discarded and its operands are scanned.
1636 If CALLBACK_STMT is NULL or it didn't handle the operands,
1637 CALLBACK_OP is called on each operand of the statement via
1638 walk_gimple_op. If walk_gimple_op returns non-NULL for any
1639 operand, the remaining operands are not scanned. In this case, the
1640 return value from CALLBACK_OP is returned.
1642 In any other case, NULL_TREE is returned. */
1645 walk_gimple_stmt (gimple_stmt_iterator
*gsi
, walk_stmt_fn callback_stmt
,
1646 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1650 gimple stmt
= gsi_stmt (*gsi
);
1655 if (wi
&& wi
->want_locations
&& gimple_has_location (stmt
))
1656 input_location
= gimple_location (stmt
);
1660 /* Invoke the statement callback. Return if the callback handled
1661 all of STMT operands by itself. */
1664 bool handled_ops
= false;
1665 tree_ret
= callback_stmt (gsi
, &handled_ops
, wi
);
1669 /* If CALLBACK_STMT did not handle operands, it should not have
1670 a value to return. */
1671 gcc_assert (tree_ret
== NULL
);
1673 /* Re-read stmt in case the callback changed it. */
1674 stmt
= gsi_stmt (*gsi
);
1677 /* If CALLBACK_OP is defined, invoke it on every operand of STMT. */
1680 tree_ret
= walk_gimple_op (stmt
, callback_op
, wi
);
1685 /* If STMT can have statements inside (e.g. GIMPLE_BIND), walk them. */
1686 switch (gimple_code (stmt
))
1689 ret
= walk_gimple_seq (gimple_bind_body (stmt
), callback_stmt
,
1692 return wi
->callback_result
;
1696 ret
= walk_gimple_seq (gimple_catch_handler (stmt
), callback_stmt
,
1699 return wi
->callback_result
;
1702 case GIMPLE_EH_FILTER
:
1703 ret
= walk_gimple_seq (gimple_eh_filter_failure (stmt
), callback_stmt
,
1706 return wi
->callback_result
;
1710 ret
= walk_gimple_seq (gimple_try_eval (stmt
), callback_stmt
, callback_op
,
1713 return wi
->callback_result
;
1715 ret
= walk_gimple_seq (gimple_try_cleanup (stmt
), callback_stmt
,
1718 return wi
->callback_result
;
1721 case GIMPLE_OMP_FOR
:
1722 ret
= walk_gimple_seq (gimple_omp_for_pre_body (stmt
), callback_stmt
,
1725 return wi
->callback_result
;
1728 case GIMPLE_OMP_CRITICAL
:
1729 case GIMPLE_OMP_MASTER
:
1730 case GIMPLE_OMP_ORDERED
:
1731 case GIMPLE_OMP_SECTION
:
1732 case GIMPLE_OMP_PARALLEL
:
1733 case GIMPLE_OMP_TASK
:
1734 case GIMPLE_OMP_SECTIONS
:
1735 case GIMPLE_OMP_SINGLE
:
1736 ret
= walk_gimple_seq (gimple_omp_body (stmt
), callback_stmt
, callback_op
,
1739 return wi
->callback_result
;
1742 case GIMPLE_WITH_CLEANUP_EXPR
:
1743 ret
= walk_gimple_seq (gimple_wce_cleanup (stmt
), callback_stmt
,
1746 return wi
->callback_result
;
1750 gcc_assert (!gimple_has_substatements (stmt
));
1758 /* Set sequence SEQ to be the GIMPLE body for function FN. */
1761 gimple_set_body (tree fndecl
, gimple_seq seq
)
1763 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1766 /* If FNDECL still does not have a function structure associated
1767 with it, then it does not make sense for it to receive a
1769 gcc_assert (seq
== NULL
);
1772 fn
->gimple_body
= seq
;
1776 /* Return the body of GIMPLE statements for function FN. */
1779 gimple_body (tree fndecl
)
1781 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1782 return fn
? fn
->gimple_body
: NULL
;
1785 /* Return true when FNDECL has Gimple body either in unlowered
1788 gimple_has_body_p (tree fndecl
)
1790 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1791 return (gimple_body (fndecl
) || (fn
&& fn
->cfg
));
1794 /* Detect flags from a GIMPLE_CALL. This is just like
1795 call_expr_flags, but for gimple tuples. */
1798 gimple_call_flags (const_gimple stmt
)
1801 tree decl
= gimple_call_fndecl (stmt
);
1805 flags
= flags_from_decl_or_type (decl
);
1808 t
= TREE_TYPE (gimple_call_fn (stmt
));
1809 if (t
&& TREE_CODE (t
) == POINTER_TYPE
)
1810 flags
= flags_from_decl_or_type (TREE_TYPE (t
));
1819 /* Return true if GS is a copy assignment. */
1822 gimple_assign_copy_p (gimple gs
)
1824 return gimple_code (gs
) == GIMPLE_ASSIGN
1825 && get_gimple_rhs_class (gimple_assign_rhs_code (gs
))
1826 == GIMPLE_SINGLE_RHS
1827 && is_gimple_val (gimple_op (gs
, 1));
1831 /* Return true if GS is a SSA_NAME copy assignment. */
1834 gimple_assign_ssa_name_copy_p (gimple gs
)
1836 return (gimple_code (gs
) == GIMPLE_ASSIGN
1837 && (get_gimple_rhs_class (gimple_assign_rhs_code (gs
))
1838 == GIMPLE_SINGLE_RHS
)
1839 && TREE_CODE (gimple_assign_lhs (gs
)) == SSA_NAME
1840 && TREE_CODE (gimple_assign_rhs1 (gs
)) == SSA_NAME
);
1844 /* Return true if GS is an assignment with a singleton RHS, i.e.,
1845 there is no operator associated with the assignment itself.
1846 Unlike gimple_assign_copy_p, this predicate returns true for
1847 any RHS operand, including those that perform an operation
1848 and do not have the semantics of a copy, such as COND_EXPR. */
1851 gimple_assign_single_p (gimple gs
)
1853 return (gimple_code (gs
) == GIMPLE_ASSIGN
1854 && get_gimple_rhs_class (gimple_assign_rhs_code (gs
))
1855 == GIMPLE_SINGLE_RHS
);
1858 /* Return true if GS is an assignment with a unary RHS, but the
1859 operator has no effect on the assigned value. The logic is adapted
1860 from STRIP_NOPS. This predicate is intended to be used in tuplifying
1861 instances in which STRIP_NOPS was previously applied to the RHS of
1864 NOTE: In the use cases that led to the creation of this function
1865 and of gimple_assign_single_p, it is typical to test for either
1866 condition and to proceed in the same manner. In each case, the
1867 assigned value is represented by the single RHS operand of the
1868 assignment. I suspect there may be cases where gimple_assign_copy_p,
1869 gimple_assign_single_p, or equivalent logic is used where a similar
1870 treatment of unary NOPs is appropriate. */
1873 gimple_assign_unary_nop_p (gimple gs
)
1875 return (gimple_code (gs
) == GIMPLE_ASSIGN
1876 && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs
))
1877 || gimple_assign_rhs_code (gs
) == NON_LVALUE_EXPR
)
1878 && gimple_assign_rhs1 (gs
) != error_mark_node
1879 && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs
)))
1880 == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs
)))));
1883 /* Set BB to be the basic block holding G. */
1886 gimple_set_bb (gimple stmt
, basic_block bb
)
1888 stmt
->gsbase
.bb
= bb
;
1890 /* If the statement is a label, add the label to block-to-labels map
1891 so that we can speed up edge creation for GIMPLE_GOTOs. */
1892 if (cfun
->cfg
&& gimple_code (stmt
) == GIMPLE_LABEL
)
1897 t
= gimple_label_label (stmt
);
1898 uid
= LABEL_DECL_UID (t
);
1901 unsigned old_len
= VEC_length (basic_block
, label_to_block_map
);
1902 LABEL_DECL_UID (t
) = uid
= cfun
->cfg
->last_label_uid
++;
1903 if (old_len
<= (unsigned) uid
)
1905 unsigned new_len
= 3 * uid
/ 2 + 1;
1907 VEC_safe_grow_cleared (basic_block
, gc
, label_to_block_map
,
1912 VEC_replace (basic_block
, label_to_block_map
, uid
, bb
);
1917 /* Fold the expression computed by STMT. If the expression can be
1918 folded, return the folded result, otherwise return NULL. STMT is
1922 gimple_fold (const_gimple stmt
)
1924 switch (gimple_code (stmt
))
1927 return fold_binary (gimple_cond_code (stmt
),
1929 gimple_cond_lhs (stmt
),
1930 gimple_cond_rhs (stmt
));
1933 switch (get_gimple_rhs_class (gimple_assign_rhs_code (stmt
)))
1935 case GIMPLE_UNARY_RHS
:
1936 return fold_unary (gimple_assign_rhs_code (stmt
),
1937 TREE_TYPE (gimple_assign_lhs (stmt
)),
1938 gimple_assign_rhs1 (stmt
));
1939 case GIMPLE_BINARY_RHS
:
1940 return fold_binary (gimple_assign_rhs_code (stmt
),
1941 TREE_TYPE (gimple_assign_lhs (stmt
)),
1942 gimple_assign_rhs1 (stmt
),
1943 gimple_assign_rhs2 (stmt
));
1944 case GIMPLE_SINGLE_RHS
:
1945 return fold (gimple_assign_rhs1 (stmt
));
1951 return gimple_switch_index (stmt
);
1964 /* Modify the RHS of the assignment pointed-to by GSI using the
1965 operands in the expression tree EXPR.
1967 NOTE: The statement pointed-to by GSI may be reallocated if it
1968 did not have enough operand slots.
1970 This function is useful to convert an existing tree expression into
1971 the flat representation used for the RHS of a GIMPLE assignment.
1972 It will reallocate memory as needed to expand or shrink the number
1973 of operand slots needed to represent EXPR.
1975 NOTE: If you find yourself building a tree and then calling this
1976 function, you are most certainly doing it the slow way. It is much
1977 better to build a new assignment or to use the function
1978 gimple_assign_set_rhs_with_ops, which does not require an
1979 expression tree to be built. */
1982 gimple_assign_set_rhs_from_tree (gimple_stmt_iterator
*gsi
, tree expr
)
1984 enum tree_code subcode
;
1987 extract_ops_from_tree (expr
, &subcode
, &op1
, &op2
);
1988 gimple_assign_set_rhs_with_ops (gsi
, subcode
, op1
, op2
);
1992 /* Set the RHS of assignment statement pointed-to by GSI to CODE with
1993 operands OP1 and OP2.
1995 NOTE: The statement pointed-to by GSI may be reallocated if it
1996 did not have enough operand slots. */
1999 gimple_assign_set_rhs_with_ops (gimple_stmt_iterator
*gsi
, enum tree_code code
,
2002 unsigned new_rhs_ops
= get_gimple_rhs_num_ops (code
);
2003 gimple stmt
= gsi_stmt (*gsi
);
2005 /* If the new CODE needs more operands, allocate a new statement. */
2006 if (gimple_num_ops (stmt
) < new_rhs_ops
+ 1)
2008 tree lhs
= gimple_assign_lhs (stmt
);
2009 gimple new_stmt
= gimple_alloc (gimple_code (stmt
), new_rhs_ops
+ 1);
2010 memcpy (new_stmt
, stmt
, gimple_size (gimple_code (stmt
)));
2011 gsi_replace (gsi
, new_stmt
, true);
2014 /* The LHS needs to be reset as this also changes the SSA name
2016 gimple_assign_set_lhs (stmt
, lhs
);
2019 gimple_set_num_ops (stmt
, new_rhs_ops
+ 1);
2020 gimple_set_subcode (stmt
, code
);
2021 gimple_assign_set_rhs1 (stmt
, op1
);
2022 if (new_rhs_ops
> 1)
2023 gimple_assign_set_rhs2 (stmt
, op2
);
2027 /* Return the LHS of a statement that performs an assignment,
2028 either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE
2029 for a call to a function that returns no value, or for a
2030 statement other than an assignment or a call. */
2033 gimple_get_lhs (const_gimple stmt
)
2035 enum gimple_code code
= gimple_code (stmt
);
2037 if (code
== GIMPLE_ASSIGN
)
2038 return gimple_assign_lhs (stmt
);
2039 else if (code
== GIMPLE_CALL
)
2040 return gimple_call_lhs (stmt
);
2046 /* Set the LHS of a statement that performs an assignment,
2047 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
2050 gimple_set_lhs (gimple stmt
, tree lhs
)
2052 enum gimple_code code
= gimple_code (stmt
);
2054 if (code
== GIMPLE_ASSIGN
)
2055 gimple_assign_set_lhs (stmt
, lhs
);
2056 else if (code
== GIMPLE_CALL
)
2057 gimple_call_set_lhs (stmt
, lhs
);
2063 /* Return a deep copy of statement STMT. All the operands from STMT
2064 are reallocated and copied using unshare_expr. The DEF, USE, VDEF
2065 and VUSE operand arrays are set to empty in the new copy. */
2068 gimple_copy (gimple stmt
)
2070 enum gimple_code code
= gimple_code (stmt
);
2071 unsigned num_ops
= gimple_num_ops (stmt
);
2072 gimple copy
= gimple_alloc (code
, num_ops
);
2075 /* Shallow copy all the fields from STMT. */
2076 memcpy (copy
, stmt
, gimple_size (code
));
2078 /* If STMT has sub-statements, deep-copy them as well. */
2079 if (gimple_has_substatements (stmt
))
2084 switch (gimple_code (stmt
))
2087 new_seq
= gimple_seq_copy (gimple_bind_body (stmt
));
2088 gimple_bind_set_body (copy
, new_seq
);
2089 gimple_bind_set_vars (copy
, unshare_expr (gimple_bind_vars (stmt
)));
2090 gimple_bind_set_block (copy
, gimple_bind_block (stmt
));
2094 new_seq
= gimple_seq_copy (gimple_catch_handler (stmt
));
2095 gimple_catch_set_handler (copy
, new_seq
);
2096 t
= unshare_expr (gimple_catch_types (stmt
));
2097 gimple_catch_set_types (copy
, t
);
2100 case GIMPLE_EH_FILTER
:
2101 new_seq
= gimple_seq_copy (gimple_eh_filter_failure (stmt
));
2102 gimple_eh_filter_set_failure (copy
, new_seq
);
2103 t
= unshare_expr (gimple_eh_filter_types (stmt
));
2104 gimple_eh_filter_set_types (copy
, t
);
2108 new_seq
= gimple_seq_copy (gimple_try_eval (stmt
));
2109 gimple_try_set_eval (copy
, new_seq
);
2110 new_seq
= gimple_seq_copy (gimple_try_cleanup (stmt
));
2111 gimple_try_set_cleanup (copy
, new_seq
);
2114 case GIMPLE_OMP_FOR
:
2115 new_seq
= gimple_seq_copy (gimple_omp_for_pre_body (stmt
));
2116 gimple_omp_for_set_pre_body (copy
, new_seq
);
2117 t
= unshare_expr (gimple_omp_for_clauses (stmt
));
2118 gimple_omp_for_set_clauses (copy
, t
);
2119 copy
->gimple_omp_for
.iter
2120 = GGC_NEWVEC (struct gimple_omp_for_iter
,
2121 gimple_omp_for_collapse (stmt
));
2122 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
2124 gimple_omp_for_set_cond (copy
, i
,
2125 gimple_omp_for_cond (stmt
, i
));
2126 gimple_omp_for_set_index (copy
, i
,
2127 gimple_omp_for_index (stmt
, i
));
2128 t
= unshare_expr (gimple_omp_for_initial (stmt
, i
));
2129 gimple_omp_for_set_initial (copy
, i
, t
);
2130 t
= unshare_expr (gimple_omp_for_final (stmt
, i
));
2131 gimple_omp_for_set_final (copy
, i
, t
);
2132 t
= unshare_expr (gimple_omp_for_incr (stmt
, i
));
2133 gimple_omp_for_set_incr (copy
, i
, t
);
2137 case GIMPLE_OMP_PARALLEL
:
2138 t
= unshare_expr (gimple_omp_parallel_clauses (stmt
));
2139 gimple_omp_parallel_set_clauses (copy
, t
);
2140 t
= unshare_expr (gimple_omp_parallel_child_fn (stmt
));
2141 gimple_omp_parallel_set_child_fn (copy
, t
);
2142 t
= unshare_expr (gimple_omp_parallel_data_arg (stmt
));
2143 gimple_omp_parallel_set_data_arg (copy
, t
);
2146 case GIMPLE_OMP_TASK
:
2147 t
= unshare_expr (gimple_omp_task_clauses (stmt
));
2148 gimple_omp_task_set_clauses (copy
, t
);
2149 t
= unshare_expr (gimple_omp_task_child_fn (stmt
));
2150 gimple_omp_task_set_child_fn (copy
, t
);
2151 t
= unshare_expr (gimple_omp_task_data_arg (stmt
));
2152 gimple_omp_task_set_data_arg (copy
, t
);
2153 t
= unshare_expr (gimple_omp_task_copy_fn (stmt
));
2154 gimple_omp_task_set_copy_fn (copy
, t
);
2155 t
= unshare_expr (gimple_omp_task_arg_size (stmt
));
2156 gimple_omp_task_set_arg_size (copy
, t
);
2157 t
= unshare_expr (gimple_omp_task_arg_align (stmt
));
2158 gimple_omp_task_set_arg_align (copy
, t
);
2161 case GIMPLE_OMP_CRITICAL
:
2162 t
= unshare_expr (gimple_omp_critical_name (stmt
));
2163 gimple_omp_critical_set_name (copy
, t
);
2166 case GIMPLE_OMP_SECTIONS
:
2167 t
= unshare_expr (gimple_omp_sections_clauses (stmt
));
2168 gimple_omp_sections_set_clauses (copy
, t
);
2169 t
= unshare_expr (gimple_omp_sections_control (stmt
));
2170 gimple_omp_sections_set_control (copy
, t
);
2173 case GIMPLE_OMP_SINGLE
:
2174 case GIMPLE_OMP_SECTION
:
2175 case GIMPLE_OMP_MASTER
:
2176 case GIMPLE_OMP_ORDERED
:
2178 new_seq
= gimple_seq_copy (gimple_omp_body (stmt
));
2179 gimple_omp_set_body (copy
, new_seq
);
2182 case GIMPLE_WITH_CLEANUP_EXPR
:
2183 new_seq
= gimple_seq_copy (gimple_wce_cleanup (stmt
));
2184 gimple_wce_set_cleanup (copy
, new_seq
);
2192 /* Make copy of operands. */
2195 for (i
= 0; i
< num_ops
; i
++)
2196 gimple_set_op (copy
, i
, unshare_expr (gimple_op (stmt
, i
)));
2198 /* Clear out SSA operand vectors on COPY. */
2199 if (gimple_has_ops (stmt
))
2201 gimple_set_def_ops (copy
, NULL
);
2202 gimple_set_use_ops (copy
, NULL
);
2205 if (gimple_has_mem_ops (stmt
))
2207 gimple_set_vdef (copy
, gimple_vdef (stmt
));
2208 gimple_set_vuse (copy
, gimple_vuse (stmt
));
2211 /* SSA operands need to be updated. */
2212 gimple_set_modified (copy
, true);
2219 /* Set the MODIFIED flag to MODIFIEDP, iff the gimple statement G has
2220 a MODIFIED field. */
2223 gimple_set_modified (gimple s
, bool modifiedp
)
2225 if (gimple_has_ops (s
))
2227 s
->gsbase
.modified
= (unsigned) modifiedp
;
2231 && is_gimple_call (s
)
2232 && gimple_call_noreturn_p (s
))
2233 VEC_safe_push (gimple
, gc
, MODIFIED_NORETURN_CALLS (cfun
), s
);
2238 /* Return true if statement S has side-effects. We consider a
2239 statement to have side effects if:
2241 - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST.
2242 - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */
2245 gimple_has_side_effects (const_gimple s
)
2249 /* We don't have to scan the arguments to check for
2250 volatile arguments, though, at present, we still
2251 do a scan to check for TREE_SIDE_EFFECTS. */
2252 if (gimple_has_volatile_ops (s
))
2255 if (is_gimple_call (s
))
2257 unsigned nargs
= gimple_call_num_args (s
);
2259 if (!(gimple_call_flags (s
) & (ECF_CONST
| ECF_PURE
)))
2261 else if (gimple_call_flags (s
) & ECF_LOOPING_CONST_OR_PURE
)
2262 /* An infinite loop is considered a side effect. */
2265 if (gimple_call_lhs (s
)
2266 && TREE_SIDE_EFFECTS (gimple_call_lhs (s
)))
2268 gcc_assert (gimple_has_volatile_ops (s
));
2272 if (TREE_SIDE_EFFECTS (gimple_call_fn (s
)))
2275 for (i
= 0; i
< nargs
; i
++)
2276 if (TREE_SIDE_EFFECTS (gimple_call_arg (s
, i
)))
2278 gcc_assert (gimple_has_volatile_ops (s
));
2286 for (i
= 0; i
< gimple_num_ops (s
); i
++)
2287 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
)))
2289 gcc_assert (gimple_has_volatile_ops (s
));
2297 /* Return true if the RHS of statement S has side effects.
2298 We may use it to determine if it is admissable to replace
2299 an assignment or call with a copy of a previously-computed
2300 value. In such cases, side-effects due the the LHS are
2304 gimple_rhs_has_side_effects (const_gimple s
)
2308 if (is_gimple_call (s
))
2310 unsigned nargs
= gimple_call_num_args (s
);
2312 if (!(gimple_call_flags (s
) & (ECF_CONST
| ECF_PURE
)))
2315 /* We cannot use gimple_has_volatile_ops here,
2316 because we must ignore a volatile LHS. */
2317 if (TREE_SIDE_EFFECTS (gimple_call_fn (s
))
2318 || TREE_THIS_VOLATILE (gimple_call_fn (s
)))
2320 gcc_assert (gimple_has_volatile_ops (s
));
2324 for (i
= 0; i
< nargs
; i
++)
2325 if (TREE_SIDE_EFFECTS (gimple_call_arg (s
, i
))
2326 || TREE_THIS_VOLATILE (gimple_call_arg (s
, i
)))
2331 else if (is_gimple_assign (s
))
2333 /* Skip the first operand, the LHS. */
2334 for (i
= 1; i
< gimple_num_ops (s
); i
++)
2335 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
))
2336 || TREE_THIS_VOLATILE (gimple_op (s
, i
)))
2338 gcc_assert (gimple_has_volatile_ops (s
));
2344 /* For statements without an LHS, examine all arguments. */
2345 for (i
= 0; i
< gimple_num_ops (s
); i
++)
2346 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
))
2347 || TREE_THIS_VOLATILE (gimple_op (s
, i
)))
2349 gcc_assert (gimple_has_volatile_ops (s
));
2358 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
2359 Return true if S can trap. If INCLUDE_LHS is true and S is a
2360 GIMPLE_ASSIGN, the LHS of the assignment is also checked.
2361 Otherwise, only the RHS of the assignment is checked. */
2364 gimple_could_trap_p_1 (gimple s
, bool include_lhs
)
2367 tree t
, div
= NULL_TREE
;
2370 start
= (is_gimple_assign (s
) && !include_lhs
) ? 1 : 0;
2372 for (i
= start
; i
< gimple_num_ops (s
); i
++)
2373 if (tree_could_trap_p (gimple_op (s
, i
)))
2376 switch (gimple_code (s
))
2379 return gimple_asm_volatile_p (s
);
2382 t
= gimple_call_fndecl (s
);
2383 /* Assume that calls to weak functions may trap. */
2384 if (!t
|| !DECL_P (t
) || DECL_WEAK (t
))
2389 t
= gimple_expr_type (s
);
2390 op
= gimple_assign_rhs_code (s
);
2391 if (get_gimple_rhs_class (op
) == GIMPLE_BINARY_RHS
)
2392 div
= gimple_assign_rhs2 (s
);
2393 return (operation_could_trap_p (op
, FLOAT_TYPE_P (t
),
2394 (INTEGRAL_TYPE_P (t
)
2395 && TYPE_OVERFLOW_TRAPS (t
)),
2407 /* Return true if statement S can trap. */
2410 gimple_could_trap_p (gimple s
)
2412 return gimple_could_trap_p_1 (s
, true);
2416 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
2419 gimple_assign_rhs_could_trap_p (gimple s
)
2421 gcc_assert (is_gimple_assign (s
));
2422 return gimple_could_trap_p_1 (s
, false);
2426 /* Print debugging information for gimple stmts generated. */
2429 dump_gimple_statistics (void)
2431 #ifdef GATHER_STATISTICS
2432 int i
, total_tuples
= 0, total_bytes
= 0;
2434 fprintf (stderr
, "\nGIMPLE statements\n");
2435 fprintf (stderr
, "Kind Stmts Bytes\n");
2436 fprintf (stderr
, "---------------------------------------\n");
2437 for (i
= 0; i
< (int) gimple_alloc_kind_all
; ++i
)
2439 fprintf (stderr
, "%-20s %7d %10d\n", gimple_alloc_kind_names
[i
],
2440 gimple_alloc_counts
[i
], gimple_alloc_sizes
[i
]);
2441 total_tuples
+= gimple_alloc_counts
[i
];
2442 total_bytes
+= gimple_alloc_sizes
[i
];
2444 fprintf (stderr
, "---------------------------------------\n");
2445 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_tuples
, total_bytes
);
2446 fprintf (stderr
, "---------------------------------------\n");
2448 fprintf (stderr
, "No gimple statistics\n");
2453 /* Return the number of operands needed on the RHS of a GIMPLE
2454 assignment for an expression with tree code CODE. */
2457 get_gimple_rhs_num_ops (enum tree_code code
)
2459 enum gimple_rhs_class rhs_class
= get_gimple_rhs_class (code
);
2461 if (rhs_class
== GIMPLE_UNARY_RHS
|| rhs_class
== GIMPLE_SINGLE_RHS
)
2463 else if (rhs_class
== GIMPLE_BINARY_RHS
)
2469 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
2471 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
2472 : ((TYPE) == tcc_binary \
2473 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
2474 : ((TYPE) == tcc_constant \
2475 || (TYPE) == tcc_declaration \
2476 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
2477 : ((SYM) == TRUTH_AND_EXPR \
2478 || (SYM) == TRUTH_OR_EXPR \
2479 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
2480 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
2481 : ((SYM) == COND_EXPR \
2482 || (SYM) == CONSTRUCTOR \
2483 || (SYM) == OBJ_TYPE_REF \
2484 || (SYM) == ASSERT_EXPR \
2485 || (SYM) == ADDR_EXPR \
2486 || (SYM) == WITH_SIZE_EXPR \
2487 || (SYM) == EXC_PTR_EXPR \
2488 || (SYM) == SSA_NAME \
2489 || (SYM) == FILTER_EXPR \
2490 || (SYM) == POLYNOMIAL_CHREC \
2491 || (SYM) == DOT_PROD_EXPR \
2492 || (SYM) == VEC_COND_EXPR \
2493 || (SYM) == REALIGN_LOAD_EXPR) ? GIMPLE_SINGLE_RHS \
2494 : GIMPLE_INVALID_RHS),
2495 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
2497 const unsigned char gimple_rhs_class_table
[] = {
2498 #include "all-tree.def"
2502 #undef END_OF_BASE_TREE_CODES
2504 /* For the definitive definition of GIMPLE, see doc/tree-ssa.texi. */
2506 /* Validation of GIMPLE expressions. */
2508 /* Return true if OP is an acceptable tree node to be used as a GIMPLE
2512 is_gimple_operand (const_tree op
)
2514 return op
&& get_gimple_rhs_class (TREE_CODE (op
)) == GIMPLE_SINGLE_RHS
;
2517 /* Returns true iff T is a valid RHS for an assignment to a renamed
2518 user -- or front-end generated artificial -- variable. */
2521 is_gimple_reg_rhs (tree t
)
2523 return get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
;
2526 /* Returns true iff T is a valid RHS for an assignment to an un-renamed
2527 LHS, or for a call argument. */
2530 is_gimple_mem_rhs (tree t
)
2532 /* If we're dealing with a renamable type, either source or dest must be
2533 a renamed variable. */
2534 if (is_gimple_reg_type (TREE_TYPE (t
)))
2535 return is_gimple_val (t
);
2537 return is_gimple_val (t
) || is_gimple_lvalue (t
);
2540 /* Return true if T is a valid LHS for a GIMPLE assignment expression. */
2543 is_gimple_lvalue (tree t
)
2545 return (is_gimple_addressable (t
)
2546 || TREE_CODE (t
) == WITH_SIZE_EXPR
2547 /* These are complex lvalues, but don't have addresses, so they
2549 || TREE_CODE (t
) == BIT_FIELD_REF
);
2552 /* Return true if T is a GIMPLE condition. */
2555 is_gimple_condexpr (tree t
)
2557 return (is_gimple_val (t
) || (COMPARISON_CLASS_P (t
)
2558 && !tree_could_trap_p (t
)
2559 && is_gimple_val (TREE_OPERAND (t
, 0))
2560 && is_gimple_val (TREE_OPERAND (t
, 1))));
2563 /* Return true if T is something whose address can be taken. */
2566 is_gimple_addressable (tree t
)
2568 return (is_gimple_id (t
) || handled_component_p (t
) || INDIRECT_REF_P (t
));
2571 /* Return true if T is a valid gimple constant. */
2574 is_gimple_constant (const_tree t
)
2576 switch (TREE_CODE (t
))
2586 /* Vector constant constructors are gimple invariant. */
2588 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2589 return TREE_CONSTANT (t
);
2598 /* Return true if T is a gimple address. */
2601 is_gimple_address (const_tree t
)
2605 if (TREE_CODE (t
) != ADDR_EXPR
)
2608 op
= TREE_OPERAND (t
, 0);
2609 while (handled_component_p (op
))
2611 if ((TREE_CODE (op
) == ARRAY_REF
2612 || TREE_CODE (op
) == ARRAY_RANGE_REF
)
2613 && !is_gimple_val (TREE_OPERAND (op
, 1)))
2616 op
= TREE_OPERAND (op
, 0);
2619 if (CONSTANT_CLASS_P (op
) || INDIRECT_REF_P (op
))
2622 switch (TREE_CODE (op
))
2637 /* Strip out all handled components that produce invariant
2641 strip_invariant_refs (const_tree op
)
2643 while (handled_component_p (op
))
2645 switch (TREE_CODE (op
))
2648 case ARRAY_RANGE_REF
:
2649 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
2650 || TREE_OPERAND (op
, 2) != NULL_TREE
2651 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2656 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2662 op
= TREE_OPERAND (op
, 0);
2668 /* Return true if T is a gimple invariant address. */
2671 is_gimple_invariant_address (const_tree t
)
2675 if (TREE_CODE (t
) != ADDR_EXPR
)
2678 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2680 return op
&& (CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
));
2683 /* Return true if T is a gimple invariant address at IPA level
2684 (so addresses of variables on stack are not allowed). */
2687 is_gimple_ip_invariant_address (const_tree t
)
2691 if (TREE_CODE (t
) != ADDR_EXPR
)
2694 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2696 return op
&& (CONSTANT_CLASS_P (op
) || decl_address_ip_invariant_p (op
));
2699 /* Return true if T is a GIMPLE minimal invariant. It's a restricted
2700 form of function invariant. */
2703 is_gimple_min_invariant (const_tree t
)
2705 if (TREE_CODE (t
) == ADDR_EXPR
)
2706 return is_gimple_invariant_address (t
);
2708 return is_gimple_constant (t
);
2711 /* Return true if T is a GIMPLE interprocedural invariant. It's a restricted
2712 form of gimple minimal invariant. */
2715 is_gimple_ip_invariant (const_tree t
)
2717 if (TREE_CODE (t
) == ADDR_EXPR
)
2718 return is_gimple_ip_invariant_address (t
);
2720 return is_gimple_constant (t
);
2723 /* Return true if T looks like a valid GIMPLE statement. */
2726 is_gimple_stmt (tree t
)
2728 const enum tree_code code
= TREE_CODE (t
);
2733 /* The only valid NOP_EXPR is the empty statement. */
2734 return IS_EMPTY_STMT (t
);
2738 /* These are only valid if they're void. */
2739 return TREE_TYPE (t
) == NULL
|| VOID_TYPE_P (TREE_TYPE (t
));
2745 case CASE_LABEL_EXPR
:
2746 case TRY_CATCH_EXPR
:
2747 case TRY_FINALLY_EXPR
:
2748 case EH_FILTER_EXPR
:
2750 case CHANGE_DYNAMIC_TYPE_EXPR
:
2753 case STATEMENT_LIST
:
2763 /* These are always void. */
2769 /* These are valid regardless of their type. */
2777 /* Return true if T is a variable. */
2780 is_gimple_variable (tree t
)
2782 return (TREE_CODE (t
) == VAR_DECL
2783 || TREE_CODE (t
) == PARM_DECL
2784 || TREE_CODE (t
) == RESULT_DECL
2785 || TREE_CODE (t
) == SSA_NAME
);
2788 /* Return true if T is a GIMPLE identifier (something with an address). */
2791 is_gimple_id (tree t
)
2793 return (is_gimple_variable (t
)
2794 || TREE_CODE (t
) == FUNCTION_DECL
2795 || TREE_CODE (t
) == LABEL_DECL
2796 || TREE_CODE (t
) == CONST_DECL
2797 /* Allow string constants, since they are addressable. */
2798 || TREE_CODE (t
) == STRING_CST
);
2801 /* Return true if TYPE is a suitable type for a scalar register variable. */
2804 is_gimple_reg_type (tree type
)
2806 /* In addition to aggregate types, we also exclude complex types if not
2807 optimizing because they can be subject to partial stores in GNU C by
2808 means of the __real__ and __imag__ operators and we cannot promote
2809 them to total stores (see gimplify_modify_expr_complex_part). */
2810 return !(AGGREGATE_TYPE_P (type
)
2811 || (TREE_CODE (type
) == COMPLEX_TYPE
&& !optimize
));
2815 /* Return true if T is a non-aggregate register variable. */
2818 is_gimple_reg (tree t
)
2820 if (TREE_CODE (t
) == SSA_NAME
)
2821 t
= SSA_NAME_VAR (t
);
2823 if (!is_gimple_variable (t
))
2826 /* Complex and vector values must have been put into SSA-like form.
2827 That is, no assignments to the individual components. */
2828 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
2829 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2830 return DECL_GIMPLE_REG_P (t
);
2832 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2835 /* A volatile decl is not acceptable because we can't reuse it as
2836 needed. We need to copy it into a temp first. */
2837 if (TREE_THIS_VOLATILE (t
))
2840 /* We define "registers" as things that can be renamed as needed,
2841 which with our infrastructure does not apply to memory. */
2842 if (needs_to_live_in_memory (t
))
2845 /* Hard register variables are an interesting case. For those that
2846 are call-clobbered, we don't know where all the calls are, since
2847 we don't (want to) take into account which operations will turn
2848 into libcalls at the rtl level. For those that are call-saved,
2849 we don't currently model the fact that calls may in fact change
2850 global hard registers, nor do we examine ASM_CLOBBERS at the tree
2851 level, and so miss variable changes that might imply. All around,
2852 it seems safest to not do too much optimization with these at the
2853 tree level at all. We'll have to rely on the rtl optimizers to
2854 clean this up, as there we've got all the appropriate bits exposed. */
2855 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
2862 /* Return true if T is a GIMPLE variable whose address is not needed. */
2865 is_gimple_non_addressable (tree t
)
2867 if (TREE_CODE (t
) == SSA_NAME
)
2868 t
= SSA_NAME_VAR (t
);
2870 return (is_gimple_variable (t
) && ! needs_to_live_in_memory (t
));
2873 /* Return true if T is a GIMPLE rvalue, i.e. an identifier or a constant. */
2876 is_gimple_val (tree t
)
2878 /* Make loads from volatiles and memory vars explicit. */
2879 if (is_gimple_variable (t
)
2880 && is_gimple_reg_type (TREE_TYPE (t
))
2881 && !is_gimple_reg (t
))
2884 /* FIXME make these decls. That can happen only when we expose the
2885 entire landing-pad construct at the tree level. */
2886 if (TREE_CODE (t
) == EXC_PTR_EXPR
|| TREE_CODE (t
) == FILTER_EXPR
)
2889 return (is_gimple_variable (t
) || is_gimple_min_invariant (t
));
2892 /* Similarly, but accept hard registers as inputs to asm statements. */
2895 is_gimple_asm_val (tree t
)
2897 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
2900 return is_gimple_val (t
);
2903 /* Return true if T is a GIMPLE minimal lvalue. */
2906 is_gimple_min_lval (tree t
)
2908 if (!(t
= CONST_CAST_TREE (strip_invariant_refs (t
))))
2910 return (is_gimple_id (t
) || TREE_CODE (t
) == INDIRECT_REF
);
2913 /* Return true if T is a typecast operation. */
2916 is_gimple_cast (tree t
)
2918 return (CONVERT_EXPR_P (t
)
2919 || TREE_CODE (t
) == FIX_TRUNC_EXPR
);
2922 /* Return true if T is a valid function operand of a CALL_EXPR. */
2925 is_gimple_call_addr (tree t
)
2927 return (TREE_CODE (t
) == OBJ_TYPE_REF
|| is_gimple_val (t
));
2930 /* If T makes a function call, return the corresponding CALL_EXPR operand.
2931 Otherwise, return NULL_TREE. */
2934 get_call_expr_in (tree t
)
2936 if (TREE_CODE (t
) == MODIFY_EXPR
)
2937 t
= TREE_OPERAND (t
, 1);
2938 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
2939 t
= TREE_OPERAND (t
, 0);
2940 if (TREE_CODE (t
) == CALL_EXPR
)
2946 /* Given a memory reference expression T, return its base address.
2947 The base address of a memory reference expression is the main
2948 object being referenced. For instance, the base address for
2949 'array[i].fld[j]' is 'array'. You can think of this as stripping
2950 away the offset part from a memory address.
2952 This function calls handled_component_p to strip away all the inner
2953 parts of the memory reference until it reaches the base object. */
2956 get_base_address (tree t
)
2958 while (handled_component_p (t
))
2959 t
= TREE_OPERAND (t
, 0);
2962 || TREE_CODE (t
) == STRING_CST
2963 || TREE_CODE (t
) == CONSTRUCTOR
2964 || INDIRECT_REF_P (t
))
2971 recalculate_side_effects (tree t
)
2973 enum tree_code code
= TREE_CODE (t
);
2974 int len
= TREE_OPERAND_LENGTH (t
);
2977 switch (TREE_CODE_CLASS (code
))
2979 case tcc_expression
:
2985 case PREDECREMENT_EXPR
:
2986 case PREINCREMENT_EXPR
:
2987 case POSTDECREMENT_EXPR
:
2988 case POSTINCREMENT_EXPR
:
2989 /* All of these have side-effects, no matter what their
2998 case tcc_comparison
: /* a comparison expression */
2999 case tcc_unary
: /* a unary arithmetic expression */
3000 case tcc_binary
: /* a binary arithmetic expression */
3001 case tcc_reference
: /* a reference */
3002 case tcc_vl_exp
: /* a function call */
3003 TREE_SIDE_EFFECTS (t
) = TREE_THIS_VOLATILE (t
);
3004 for (i
= 0; i
< len
; ++i
)
3006 tree op
= TREE_OPERAND (t
, i
);
3007 if (op
&& TREE_SIDE_EFFECTS (op
))
3008 TREE_SIDE_EFFECTS (t
) = 1;
3013 /* No side-effects. */
3021 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
3022 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
3023 we failed to create one. */
3026 canonicalize_cond_expr_cond (tree t
)
3028 /* For (bool)x use x != 0. */
3029 if (TREE_CODE (t
) == NOP_EXPR
3030 && TREE_TYPE (t
) == boolean_type_node
)
3032 tree top0
= TREE_OPERAND (t
, 0);
3033 t
= build2 (NE_EXPR
, TREE_TYPE (t
),
3034 top0
, build_int_cst (TREE_TYPE (top0
), 0));
3036 /* For !x use x == 0. */
3037 else if (TREE_CODE (t
) == TRUTH_NOT_EXPR
)
3039 tree top0
= TREE_OPERAND (t
, 0);
3040 t
= build2 (EQ_EXPR
, TREE_TYPE (t
),
3041 top0
, build_int_cst (TREE_TYPE (top0
), 0));
3043 /* For cmp ? 1 : 0 use cmp. */
3044 else if (TREE_CODE (t
) == COND_EXPR
3045 && COMPARISON_CLASS_P (TREE_OPERAND (t
, 0))
3046 && integer_onep (TREE_OPERAND (t
, 1))
3047 && integer_zerop (TREE_OPERAND (t
, 2)))
3049 tree top0
= TREE_OPERAND (t
, 0);
3050 t
= build2 (TREE_CODE (top0
), TREE_TYPE (t
),
3051 TREE_OPERAND (top0
, 0), TREE_OPERAND (top0
, 1));
3054 if (is_gimple_condexpr (t
))
3060 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
3061 the positions marked by the set ARGS_TO_SKIP. */
3064 gimple_call_copy_skip_args (gimple stmt
, bitmap args_to_skip
)
3067 tree fn
= gimple_call_fn (stmt
);
3068 int nargs
= gimple_call_num_args (stmt
);
3069 VEC(tree
, heap
) *vargs
= VEC_alloc (tree
, heap
, nargs
);
3072 for (i
= 0; i
< nargs
; i
++)
3073 if (!bitmap_bit_p (args_to_skip
, i
))
3074 VEC_quick_push (tree
, vargs
, gimple_call_arg (stmt
, i
));
3076 new_stmt
= gimple_build_call_vec (fn
, vargs
);
3077 VEC_free (tree
, heap
, vargs
);
3078 if (gimple_call_lhs (stmt
))
3079 gimple_call_set_lhs (new_stmt
, gimple_call_lhs (stmt
));
3081 gimple_set_vuse (new_stmt
, gimple_vuse (stmt
));
3082 gimple_set_vdef (new_stmt
, gimple_vdef (stmt
));
3084 gimple_set_block (new_stmt
, gimple_block (stmt
));
3085 if (gimple_has_location (stmt
))
3086 gimple_set_location (new_stmt
, gimple_location (stmt
));
3088 /* Carry all the flags to the new GIMPLE_CALL. */
3089 gimple_call_set_chain (new_stmt
, gimple_call_chain (stmt
));
3090 gimple_call_set_tail (new_stmt
, gimple_call_tail_p (stmt
));
3091 gimple_call_set_cannot_inline (new_stmt
, gimple_call_cannot_inline_p (stmt
));
3092 gimple_call_set_return_slot_opt (new_stmt
, gimple_call_return_slot_opt_p (stmt
));
3093 gimple_call_set_from_thunk (new_stmt
, gimple_call_from_thunk_p (stmt
));
3094 gimple_call_set_va_arg_pack (new_stmt
, gimple_call_va_arg_pack_p (stmt
));
3096 gimple_set_modified (new_stmt
, true);
3102 /* Data structure used to count the number of dereferences to PTR
3103 inside an expression. */
3107 unsigned num_stores
;
3111 /* Helper for count_uses_and_derefs. Called by walk_tree to look for
3112 (ALIGN/MISALIGNED_)INDIRECT_REF nodes for the pointer passed in DATA. */
3115 count_ptr_derefs (tree
*tp
, int *walk_subtrees
, void *data
)
3117 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
3118 struct count_ptr_d
*count_p
= (struct count_ptr_d
*) wi_p
->info
;
3120 /* Do not walk inside ADDR_EXPR nodes. In the expression &ptr->fld,
3121 pointer 'ptr' is *not* dereferenced, it is simply used to compute
3122 the address of 'fld' as 'ptr + offsetof(fld)'. */
3123 if (TREE_CODE (*tp
) == ADDR_EXPR
)
3129 if (INDIRECT_REF_P (*tp
) && TREE_OPERAND (*tp
, 0) == count_p
->ptr
)
3132 count_p
->num_stores
++;
3134 count_p
->num_loads
++;
3140 /* Count the number of direct and indirect uses for pointer PTR in
3141 statement STMT. The number of direct uses is stored in
3142 *NUM_USES_P. Indirect references are counted separately depending
3143 on whether they are store or load operations. The counts are
3144 stored in *NUM_STORES_P and *NUM_LOADS_P. */
3147 count_uses_and_derefs (tree ptr
, gimple stmt
, unsigned *num_uses_p
,
3148 unsigned *num_loads_p
, unsigned *num_stores_p
)
3157 /* Find out the total number of uses of PTR in STMT. */
3158 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, i
, SSA_OP_USE
)
3162 /* Now count the number of indirect references to PTR. This is
3163 truly awful, but we don't have much choice. There are no parent
3164 pointers inside INDIRECT_REFs, so an expression like
3165 '*x_1 = foo (x_1, *x_1)' needs to be traversed piece by piece to
3166 find all the indirect and direct uses of x_1 inside. The only
3167 shortcut we can take is the fact that GIMPLE only allows
3168 INDIRECT_REFs inside the expressions below. */
3169 if (is_gimple_assign (stmt
)
3170 || gimple_code (stmt
) == GIMPLE_RETURN
3171 || gimple_code (stmt
) == GIMPLE_ASM
3172 || is_gimple_call (stmt
))
3174 struct walk_stmt_info wi
;
3175 struct count_ptr_d count
;
3178 count
.num_stores
= 0;
3179 count
.num_loads
= 0;
3181 memset (&wi
, 0, sizeof (wi
));
3183 walk_gimple_op (stmt
, count_ptr_derefs
, &wi
);
3185 *num_stores_p
= count
.num_stores
;
3186 *num_loads_p
= count
.num_loads
;
3189 gcc_assert (*num_uses_p
>= *num_loads_p
+ *num_stores_p
);
3192 /* From a tree operand OP return the base of a load or store operation
3193 or NULL_TREE if OP is not a load or a store. */
3196 get_base_loadstore (tree op
)
3198 while (handled_component_p (op
))
3199 op
= TREE_OPERAND (op
, 0);
3201 || INDIRECT_REF_P (op
)
3202 || TREE_CODE (op
) == TARGET_MEM_REF
)
3207 /* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and
3208 VISIT_ADDR if non-NULL on loads, store and address-taken operands
3209 passing the STMT, the base of the operand and DATA to it. The base
3210 will be either a decl, an indirect reference (including TARGET_MEM_REF)
3211 or the argument of an address expression.
3212 Returns the results of these callbacks or'ed. */
3215 walk_stmt_load_store_addr_ops (gimple stmt
, void *data
,
3216 bool (*visit_load
)(gimple
, tree
, void *),
3217 bool (*visit_store
)(gimple
, tree
, void *),
3218 bool (*visit_addr
)(gimple
, tree
, void *))
3222 if (gimple_assign_single_p (stmt
))
3227 lhs
= get_base_loadstore (gimple_assign_lhs (stmt
));
3229 ret
|= visit_store (stmt
, lhs
, data
);
3231 rhs
= gimple_assign_rhs1 (stmt
);
3234 if (TREE_CODE (rhs
) == ADDR_EXPR
)
3235 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
3236 else if (TREE_CODE (rhs
) == TARGET_MEM_REF
3237 && TREE_CODE (TMR_BASE (rhs
)) == ADDR_EXPR
)
3238 ret
|= visit_addr (stmt
, TREE_OPERAND (TMR_BASE (rhs
), 0), data
);
3239 else if (TREE_CODE (rhs
) == OBJ_TYPE_REF
3240 && TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs
)) == ADDR_EXPR
)
3241 ret
|= visit_addr (stmt
, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs
),
3246 rhs
= get_base_loadstore (rhs
);
3248 ret
|= visit_load (stmt
, rhs
, data
);
3252 && (is_gimple_assign (stmt
)
3253 || gimple_code (stmt
) == GIMPLE_COND
3254 || gimple_code (stmt
) == GIMPLE_CHANGE_DYNAMIC_TYPE
))
3256 for (i
= 0; i
< gimple_num_ops (stmt
); ++i
)
3257 if (gimple_op (stmt
, i
)
3258 && TREE_CODE (gimple_op (stmt
, i
)) == ADDR_EXPR
)
3259 ret
|= visit_addr (stmt
, TREE_OPERAND (gimple_op (stmt
, i
), 0), data
);
3261 else if (is_gimple_call (stmt
))
3265 tree lhs
= gimple_call_lhs (stmt
);
3268 lhs
= get_base_loadstore (lhs
);
3270 ret
|= visit_store (stmt
, lhs
, data
);
3273 if (visit_load
|| visit_addr
)
3274 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3276 tree rhs
= gimple_call_arg (stmt
, i
);
3278 && TREE_CODE (rhs
) == ADDR_EXPR
)
3279 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
3280 else if (visit_load
)
3282 rhs
= get_base_loadstore (rhs
);
3284 ret
|= visit_load (stmt
, rhs
, data
);
3288 && gimple_call_chain (stmt
)
3289 && TREE_CODE (gimple_call_chain (stmt
)) == ADDR_EXPR
)
3290 ret
|= visit_addr (stmt
, TREE_OPERAND (gimple_call_chain (stmt
), 0),
3293 else if (gimple_code (stmt
) == GIMPLE_ASM
)
3296 const char *constraint
;
3297 const char **oconstraints
;
3298 bool allows_mem
, allows_reg
, is_inout
;
3299 noutputs
= gimple_asm_noutputs (stmt
);
3300 oconstraints
= XALLOCAVEC (const char *, noutputs
);
3301 if (visit_store
|| visit_addr
)
3302 for (i
= 0; i
< gimple_asm_noutputs (stmt
); ++i
)
3304 tree link
= gimple_asm_output_op (stmt
, i
);
3305 tree op
= get_base_loadstore (TREE_VALUE (link
));
3306 if (op
&& visit_store
)
3307 ret
|= visit_store (stmt
, op
, data
);
3310 constraint
= TREE_STRING_POINTER
3311 (TREE_VALUE (TREE_PURPOSE (link
)));
3312 oconstraints
[i
] = constraint
;
3313 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
3314 &allows_reg
, &is_inout
);
3315 if (op
&& !allows_reg
&& allows_mem
)
3316 ret
|= visit_addr (stmt
, op
, data
);
3319 if (visit_load
|| visit_addr
)
3320 for (i
= 0; i
< gimple_asm_ninputs (stmt
); ++i
)
3322 tree link
= gimple_asm_input_op (stmt
, i
);
3323 tree op
= TREE_VALUE (link
);
3325 && TREE_CODE (op
) == ADDR_EXPR
)
3326 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
3327 else if (visit_load
|| visit_addr
)
3329 op
= get_base_loadstore (op
);
3333 ret
|= visit_load (stmt
, op
, data
);
3336 constraint
= TREE_STRING_POINTER
3337 (TREE_VALUE (TREE_PURPOSE (link
)));
3338 parse_input_constraint (&constraint
, 0, 0, noutputs
,
3340 &allows_mem
, &allows_reg
);
3341 if (!allows_reg
&& allows_mem
)
3342 ret
|= visit_addr (stmt
, op
, data
);
3348 else if (gimple_code (stmt
) == GIMPLE_RETURN
)
3350 tree op
= gimple_return_retval (stmt
);
3354 && TREE_CODE (op
) == ADDR_EXPR
)
3355 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
3356 else if (visit_load
)
3358 op
= get_base_loadstore (op
);
3360 ret
|= visit_load (stmt
, op
, data
);
3365 && gimple_code (stmt
) == GIMPLE_PHI
)
3367 for (i
= 0; i
< gimple_phi_num_args (stmt
); ++i
)
3369 tree op
= PHI_ARG_DEF (stmt
, i
);
3370 if (TREE_CODE (op
) == ADDR_EXPR
)
3371 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
3378 /* Like walk_stmt_load_store_addr_ops but with NULL visit_addr. IPA-CP
3379 should make a faster clone for this case. */
3382 walk_stmt_load_store_ops (gimple stmt
, void *data
,
3383 bool (*visit_load
)(gimple
, tree
, void *),
3384 bool (*visit_store
)(gimple
, tree
, void *))
3386 return walk_stmt_load_store_addr_ops (stmt
, data
,
3387 visit_load
, visit_store
, NULL
);
3390 /* Helper for gimple_ior_addresses_taken_1. */
3393 gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED
,
3394 tree addr
, void *data
)
3396 bitmap addresses_taken
= (bitmap
)data
;
3397 while (handled_component_p (addr
))
3398 addr
= TREE_OPERAND (addr
, 0);
3401 bitmap_set_bit (addresses_taken
, DECL_UID (addr
));
3407 /* Set the bit for the uid of all decls that have their address taken
3408 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
3409 were any in this stmt. */
3412 gimple_ior_addresses_taken (bitmap addresses_taken
, gimple stmt
)
3414 return walk_stmt_load_store_addr_ops (stmt
, addresses_taken
, NULL
, NULL
,
3415 gimple_ior_addresses_taken_1
);
3418 #include "gt-gimple.h"