1 /* Lower complex number operations to scalar operations.
2 Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 3, or (at your option) any
12 GCC is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
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/>. */
23 #include "coretypes.h"
29 #include "tree-flow.h"
31 #include "tree-iterator.h"
32 #include "tree-pass.h"
33 #include "tree-ssa-propagate.h"
34 #include "diagnostic.h"
37 /* For each complex ssa name, a lattice value. We're interested in finding
38 out whether a complex number is degenerate in some way, having only real
39 or only complex parts. */
49 /* The type complex_lattice_t holds combinations of the above
51 typedef int complex_lattice_t
;
53 #define PAIR(a, b) ((a) << 2 | (b))
55 DEF_VEC_I(complex_lattice_t
);
56 DEF_VEC_ALLOC_I(complex_lattice_t
, heap
);
58 static VEC(complex_lattice_t
, heap
) *complex_lattice_values
;
60 /* For each complex variable, a pair of variables for the components exists in
62 static htab_t complex_variable_components
;
64 /* For each complex SSA_NAME, a pair of ssa names for the components. */
65 static VEC(tree
, heap
) *complex_ssa_name_components
;
67 /* Lookup UID in the complex_variable_components hashtable and return the
70 cvc_lookup (unsigned int uid
)
72 struct int_tree_map
*h
, in
;
74 h
= (struct int_tree_map
*) htab_find_with_hash (complex_variable_components
, &in
, uid
);
75 return h
? h
->to
: NULL
;
78 /* Insert the pair UID, TO into the complex_variable_components hashtable. */
81 cvc_insert (unsigned int uid
, tree to
)
83 struct int_tree_map
*h
;
86 h
= XNEW (struct int_tree_map
);
89 loc
= htab_find_slot_with_hash (complex_variable_components
, h
,
91 *(struct int_tree_map
**) loc
= h
;
94 /* Return true if T is not a zero constant. In the case of real values,
95 we're only interested in +0.0. */
98 some_nonzerop (tree t
)
102 /* Operations with real or imaginary part of a complex number zero
103 cannot be treated the same as operations with a real or imaginary
104 operand if we care about the signs of zeros in the result. */
105 if (TREE_CODE (t
) == REAL_CST
&& !flag_signed_zeros
)
106 zerop
= REAL_VALUES_IDENTICAL (TREE_REAL_CST (t
), dconst0
);
107 else if (TREE_CODE (t
) == FIXED_CST
)
108 zerop
= fixed_zerop (t
);
109 else if (TREE_CODE (t
) == INTEGER_CST
)
110 zerop
= integer_zerop (t
);
116 /* Compute a lattice value from the components of a complex type REAL
119 static complex_lattice_t
120 find_lattice_value_parts (tree real
, tree imag
)
123 complex_lattice_t ret
;
125 r
= some_nonzerop (real
);
126 i
= some_nonzerop (imag
);
127 ret
= r
* ONLY_REAL
+ i
* ONLY_IMAG
;
129 /* ??? On occasion we could do better than mapping 0+0i to real, but we
130 certainly don't want to leave it UNINITIALIZED, which eventually gets
131 mapped to VARYING. */
132 if (ret
== UNINITIALIZED
)
139 /* Compute a lattice value from gimple_val T. */
141 static complex_lattice_t
142 find_lattice_value (tree t
)
146 switch (TREE_CODE (t
))
149 return VEC_index (complex_lattice_t
, complex_lattice_values
,
150 SSA_NAME_VERSION (t
));
153 real
= TREE_REALPART (t
);
154 imag
= TREE_IMAGPART (t
);
161 return find_lattice_value_parts (real
, imag
);
164 /* Determine if LHS is something for which we're interested in seeing
165 simulation results. */
168 is_complex_reg (tree lhs
)
170 return TREE_CODE (TREE_TYPE (lhs
)) == COMPLEX_TYPE
&& is_gimple_reg (lhs
);
173 /* Mark the incoming parameters to the function as VARYING. */
176 init_parameter_lattice_values (void)
180 for (parm
= DECL_ARGUMENTS (cfun
->decl
); parm
; parm
= TREE_CHAIN (parm
))
181 if (is_complex_reg (parm
)
182 && var_ann (parm
) != NULL
183 && (ssa_name
= gimple_default_def (cfun
, parm
)) != NULL_TREE
)
184 VEC_replace (complex_lattice_t
, complex_lattice_values
,
185 SSA_NAME_VERSION (ssa_name
), VARYING
);
188 /* Initialize simulation state for each statement. Return false if we
189 found no statements we want to simulate, and thus there's nothing
190 for the entire pass to do. */
193 init_dont_simulate_again (void)
196 gimple_stmt_iterator gsi
;
198 bool saw_a_complex_op
= false;
202 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
204 phi
= gsi_stmt (gsi
);
205 prop_set_simulate_again (phi
,
206 is_complex_reg (gimple_phi_result (phi
)));
209 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
215 stmt
= gsi_stmt (gsi
);
216 op0
= op1
= NULL_TREE
;
218 /* Most control-altering statements must be initially
219 simulated, else we won't cover the entire cfg. */
220 sim_again_p
= stmt_ends_bb_p (stmt
);
222 switch (gimple_code (stmt
))
225 if (gimple_call_lhs (stmt
))
226 sim_again_p
= is_complex_reg (gimple_call_lhs (stmt
));
230 sim_again_p
= is_complex_reg (gimple_assign_lhs (stmt
));
231 if (gimple_assign_rhs_code (stmt
) == REALPART_EXPR
232 || gimple_assign_rhs_code (stmt
) == IMAGPART_EXPR
)
233 op0
= TREE_OPERAND (gimple_assign_rhs1 (stmt
), 0);
235 op0
= gimple_assign_rhs1 (stmt
);
236 if (gimple_num_ops (stmt
) > 2)
237 op1
= gimple_assign_rhs2 (stmt
);
241 op0
= gimple_cond_lhs (stmt
);
242 op1
= gimple_cond_rhs (stmt
);
250 switch (gimple_expr_code (stmt
))
262 if (TREE_CODE (TREE_TYPE (op0
)) == COMPLEX_TYPE
263 || TREE_CODE (TREE_TYPE (op1
)) == COMPLEX_TYPE
)
264 saw_a_complex_op
= true;
269 if (TREE_CODE (TREE_TYPE (op0
)) == COMPLEX_TYPE
)
270 saw_a_complex_op
= true;
275 /* The total store transformation performed during
276 gimplification creates such uninitialized loads
277 and we need to lower the statement to be able
279 if (TREE_CODE (op0
) == SSA_NAME
280 && ssa_undefined_value_p (op0
))
281 saw_a_complex_op
= true;
288 prop_set_simulate_again (stmt
, sim_again_p
);
292 return saw_a_complex_op
;
296 /* Evaluate statement STMT against the complex lattice defined above. */
298 static enum ssa_prop_result
299 complex_visit_stmt (gimple stmt
, edge
*taken_edge_p ATTRIBUTE_UNUSED
,
302 complex_lattice_t new_l
, old_l
, op1_l
, op2_l
;
306 lhs
= gimple_get_lhs (stmt
);
307 /* Skip anything but GIMPLE_ASSIGN and GIMPLE_CALL with a lhs. */
309 return SSA_PROP_VARYING
;
311 /* These conditions should be satisfied due to the initial filter
312 set up in init_dont_simulate_again. */
313 gcc_assert (TREE_CODE (lhs
) == SSA_NAME
);
314 gcc_assert (TREE_CODE (TREE_TYPE (lhs
)) == COMPLEX_TYPE
);
317 ver
= SSA_NAME_VERSION (lhs
);
318 old_l
= VEC_index (complex_lattice_t
, complex_lattice_values
, ver
);
320 switch (gimple_expr_code (stmt
))
324 new_l
= find_lattice_value (gimple_assign_rhs1 (stmt
));
328 new_l
= find_lattice_value_parts (gimple_assign_rhs1 (stmt
),
329 gimple_assign_rhs2 (stmt
));
334 op1_l
= find_lattice_value (gimple_assign_rhs1 (stmt
));
335 op2_l
= find_lattice_value (gimple_assign_rhs2 (stmt
));
337 /* We've set up the lattice values such that IOR neatly
339 new_l
= op1_l
| op2_l
;
348 op1_l
= find_lattice_value (gimple_assign_rhs1 (stmt
));
349 op2_l
= find_lattice_value (gimple_assign_rhs2 (stmt
));
351 /* Obviously, if either varies, so does the result. */
352 if (op1_l
== VARYING
|| op2_l
== VARYING
)
354 /* Don't prematurely promote variables if we've not yet seen
356 else if (op1_l
== UNINITIALIZED
)
358 else if (op2_l
== UNINITIALIZED
)
362 /* At this point both numbers have only one component. If the
363 numbers are of opposite kind, the result is imaginary,
364 otherwise the result is real. The add/subtract translates
365 the real/imag from/to 0/1; the ^ performs the comparison. */
366 new_l
= ((op1_l
- ONLY_REAL
) ^ (op2_l
- ONLY_REAL
)) + ONLY_REAL
;
368 /* Don't allow the lattice value to flip-flop indefinitely. */
375 new_l
= find_lattice_value (gimple_assign_rhs1 (stmt
));
383 /* If nothing changed this round, let the propagator know. */
385 return SSA_PROP_NOT_INTERESTING
;
387 VEC_replace (complex_lattice_t
, complex_lattice_values
, ver
, new_l
);
388 return new_l
== VARYING
? SSA_PROP_VARYING
: SSA_PROP_INTERESTING
;
391 /* Evaluate a PHI node against the complex lattice defined above. */
393 static enum ssa_prop_result
394 complex_visit_phi (gimple phi
)
396 complex_lattice_t new_l
, old_l
;
401 lhs
= gimple_phi_result (phi
);
403 /* This condition should be satisfied due to the initial filter
404 set up in init_dont_simulate_again. */
405 gcc_assert (TREE_CODE (TREE_TYPE (lhs
)) == COMPLEX_TYPE
);
407 /* We've set up the lattice values such that IOR neatly models PHI meet. */
408 new_l
= UNINITIALIZED
;
409 for (i
= gimple_phi_num_args (phi
) - 1; i
>= 0; --i
)
410 new_l
|= find_lattice_value (gimple_phi_arg_def (phi
, i
));
412 ver
= SSA_NAME_VERSION (lhs
);
413 old_l
= VEC_index (complex_lattice_t
, complex_lattice_values
, ver
);
416 return SSA_PROP_NOT_INTERESTING
;
418 VEC_replace (complex_lattice_t
, complex_lattice_values
, ver
, new_l
);
419 return new_l
== VARYING
? SSA_PROP_VARYING
: SSA_PROP_INTERESTING
;
422 /* Create one backing variable for a complex component of ORIG. */
425 create_one_component_var (tree type
, tree orig
, const char *prefix
,
426 const char *suffix
, enum tree_code code
)
428 tree r
= create_tmp_var (type
, prefix
);
429 add_referenced_var (r
);
431 DECL_SOURCE_LOCATION (r
) = DECL_SOURCE_LOCATION (orig
);
432 DECL_ARTIFICIAL (r
) = 1;
434 if (DECL_NAME (orig
) && !DECL_IGNORED_P (orig
))
436 const char *name
= IDENTIFIER_POINTER (DECL_NAME (orig
));
439 DECL_NAME (r
) = get_identifier (ACONCAT ((name
, suffix
, NULL
)));
441 inner_type
= TREE_TYPE (TREE_TYPE (orig
));
442 SET_DECL_DEBUG_EXPR (r
, build1 (code
, type
, orig
));
443 DECL_DEBUG_EXPR_IS_FROM (r
) = 1;
444 DECL_IGNORED_P (r
) = 0;
445 TREE_NO_WARNING (r
) = TREE_NO_WARNING (orig
);
449 DECL_IGNORED_P (r
) = 1;
450 TREE_NO_WARNING (r
) = 1;
456 /* Retrieve a value for a complex component of VAR. */
459 get_component_var (tree var
, bool imag_p
)
461 size_t decl_index
= DECL_UID (var
) * 2 + imag_p
;
462 tree ret
= cvc_lookup (decl_index
);
466 ret
= create_one_component_var (TREE_TYPE (TREE_TYPE (var
)), var
,
467 imag_p
? "CI" : "CR",
468 imag_p
? "$imag" : "$real",
469 imag_p
? IMAGPART_EXPR
: REALPART_EXPR
);
470 cvc_insert (decl_index
, ret
);
476 /* Retrieve a value for a complex component of SSA_NAME. */
479 get_component_ssa_name (tree ssa_name
, bool imag_p
)
481 complex_lattice_t lattice
= find_lattice_value (ssa_name
);
482 size_t ssa_name_index
;
485 if (lattice
== (imag_p
? ONLY_REAL
: ONLY_IMAG
))
487 tree inner_type
= TREE_TYPE (TREE_TYPE (ssa_name
));
488 if (SCALAR_FLOAT_TYPE_P (inner_type
))
489 return build_real (inner_type
, dconst0
);
491 return build_int_cst (inner_type
, 0);
494 ssa_name_index
= SSA_NAME_VERSION (ssa_name
) * 2 + imag_p
;
495 ret
= VEC_index (tree
, complex_ssa_name_components
, ssa_name_index
);
498 ret
= get_component_var (SSA_NAME_VAR (ssa_name
), imag_p
);
499 ret
= make_ssa_name (ret
, NULL
);
501 /* Copy some properties from the original. In particular, whether it
502 is used in an abnormal phi, and whether it's uninitialized. */
503 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ret
)
504 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name
);
505 if (TREE_CODE (SSA_NAME_VAR (ssa_name
)) == VAR_DECL
506 && gimple_nop_p (SSA_NAME_DEF_STMT (ssa_name
)))
508 SSA_NAME_DEF_STMT (ret
) = SSA_NAME_DEF_STMT (ssa_name
);
509 set_default_def (SSA_NAME_VAR (ret
), ret
);
512 VEC_replace (tree
, complex_ssa_name_components
, ssa_name_index
, ret
);
518 /* Set a value for a complex component of SSA_NAME, return a
519 gimple_seq of stuff that needs doing. */
522 set_component_ssa_name (tree ssa_name
, bool imag_p
, tree value
)
524 complex_lattice_t lattice
= find_lattice_value (ssa_name
);
525 size_t ssa_name_index
;
530 /* We know the value must be zero, else there's a bug in our lattice
531 analysis. But the value may well be a variable known to contain
532 zero. We should be safe ignoring it. */
533 if (lattice
== (imag_p
? ONLY_REAL
: ONLY_IMAG
))
536 /* If we've already assigned an SSA_NAME to this component, then this
537 means that our walk of the basic blocks found a use before the set.
538 This is fine. Now we should create an initialization for the value
539 we created earlier. */
540 ssa_name_index
= SSA_NAME_VERSION (ssa_name
) * 2 + imag_p
;
541 comp
= VEC_index (tree
, complex_ssa_name_components
, ssa_name_index
);
545 /* If we've nothing assigned, and the value we're given is already stable,
546 then install that as the value for this SSA_NAME. This preemptively
547 copy-propagates the value, which avoids unnecessary memory allocation. */
548 else if (is_gimple_min_invariant (value
)
549 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name
))
551 VEC_replace (tree
, complex_ssa_name_components
, ssa_name_index
, value
);
554 else if (TREE_CODE (value
) == SSA_NAME
555 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name
))
557 /* Replace an anonymous base value with the variable from cvc_lookup.
558 This should result in better debug info. */
559 if (DECL_IGNORED_P (SSA_NAME_VAR (value
))
560 && !DECL_IGNORED_P (SSA_NAME_VAR (ssa_name
)))
562 comp
= get_component_var (SSA_NAME_VAR (ssa_name
), imag_p
);
563 replace_ssa_name_symbol (value
, comp
);
566 VEC_replace (tree
, complex_ssa_name_components
, ssa_name_index
, value
);
570 /* Finally, we need to stabilize the result by installing the value into
573 comp
= get_component_ssa_name (ssa_name
, imag_p
);
575 /* Do all the work to assign VALUE to COMP. */
577 value
= force_gimple_operand (value
, &list
, false, NULL
);
578 last
= gimple_build_assign (comp
, value
);
579 gimple_seq_add_stmt (&list
, last
);
580 gcc_assert (SSA_NAME_DEF_STMT (comp
) == last
);
585 /* Extract the real or imaginary part of a complex variable or constant.
586 Make sure that it's a proper gimple_val and gimplify it if not.
587 Emit any new code before gsi. */
590 extract_component (gimple_stmt_iterator
*gsi
, tree t
, bool imagpart_p
,
593 switch (TREE_CODE (t
))
596 return imagpart_p
? TREE_IMAGPART (t
) : TREE_REALPART (t
);
608 tree inner_type
= TREE_TYPE (TREE_TYPE (t
));
610 t
= build1 ((imagpart_p
? IMAGPART_EXPR
: REALPART_EXPR
),
611 inner_type
, unshare_expr (t
));
614 t
= force_gimple_operand_gsi (gsi
, t
, true, NULL
, true,
621 return get_component_ssa_name (t
, imagpart_p
);
628 /* Update the complex components of the ssa name on the lhs of STMT. */
631 update_complex_components (gimple_stmt_iterator
*gsi
, gimple stmt
, tree r
,
637 lhs
= gimple_get_lhs (stmt
);
639 list
= set_component_ssa_name (lhs
, false, r
);
641 gsi_insert_seq_after (gsi
, list
, GSI_CONTINUE_LINKING
);
643 list
= set_component_ssa_name (lhs
, true, i
);
645 gsi_insert_seq_after (gsi
, list
, GSI_CONTINUE_LINKING
);
649 update_complex_components_on_edge (edge e
, tree lhs
, tree r
, tree i
)
653 list
= set_component_ssa_name (lhs
, false, r
);
655 gsi_insert_seq_on_edge (e
, list
);
657 list
= set_component_ssa_name (lhs
, true, i
);
659 gsi_insert_seq_on_edge (e
, list
);
663 /* Update an assignment to a complex variable in place. */
666 update_complex_assignment (gimple_stmt_iterator
*gsi
, tree r
, tree i
)
668 gimple_stmt_iterator orig_si
= *gsi
;
670 if (gimple_in_ssa_p (cfun
))
671 update_complex_components (gsi
, gsi_stmt (*gsi
), r
, i
);
673 gimple_assign_set_rhs_with_ops (&orig_si
, COMPLEX_EXPR
, r
, i
);
674 update_stmt (gsi_stmt (orig_si
));
678 /* Generate code at the entry point of the function to initialize the
679 component variables for a complex parameter. */
682 update_parameter_components (void)
684 edge entry_edge
= single_succ_edge (ENTRY_BLOCK_PTR
);
687 for (parm
= DECL_ARGUMENTS (cfun
->decl
); parm
; parm
= TREE_CHAIN (parm
))
689 tree type
= TREE_TYPE (parm
);
692 if (TREE_CODE (type
) != COMPLEX_TYPE
|| !is_gimple_reg (parm
))
695 type
= TREE_TYPE (type
);
696 ssa_name
= gimple_default_def (cfun
, parm
);
700 r
= build1 (REALPART_EXPR
, type
, ssa_name
);
701 i
= build1 (IMAGPART_EXPR
, type
, ssa_name
);
702 update_complex_components_on_edge (entry_edge
, ssa_name
, r
, i
);
706 /* Generate code to set the component variables of a complex variable
707 to match the PHI statements in block BB. */
710 update_phi_components (basic_block bb
)
712 gimple_stmt_iterator gsi
;
714 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
716 gimple phi
= gsi_stmt (gsi
);
718 if (is_complex_reg (gimple_phi_result (phi
)))
721 gimple pr
= NULL
, pi
= NULL
;
724 lr
= get_component_ssa_name (gimple_phi_result (phi
), false);
725 if (TREE_CODE (lr
) == SSA_NAME
)
727 pr
= create_phi_node (lr
, bb
);
728 SSA_NAME_DEF_STMT (lr
) = pr
;
731 li
= get_component_ssa_name (gimple_phi_result (phi
), true);
732 if (TREE_CODE (li
) == SSA_NAME
)
734 pi
= create_phi_node (li
, bb
);
735 SSA_NAME_DEF_STMT (li
) = pi
;
738 for (i
= 0, n
= gimple_phi_num_args (phi
); i
< n
; ++i
)
740 tree comp
, arg
= gimple_phi_arg_def (phi
, i
);
743 comp
= extract_component (NULL
, arg
, false, false);
744 SET_PHI_ARG_DEF (pr
, i
, comp
);
748 comp
= extract_component (NULL
, arg
, true, false);
749 SET_PHI_ARG_DEF (pi
, i
, comp
);
756 /* Expand a complex move to scalars. */
759 expand_complex_move (gimple_stmt_iterator
*gsi
, tree type
)
761 tree inner_type
= TREE_TYPE (type
);
763 gimple stmt
= gsi_stmt (*gsi
);
765 if (is_gimple_assign (stmt
))
767 lhs
= gimple_assign_lhs (stmt
);
768 if (gimple_num_ops (stmt
) == 2)
769 rhs
= gimple_assign_rhs1 (stmt
);
773 else if (is_gimple_call (stmt
))
775 lhs
= gimple_call_lhs (stmt
);
781 if (TREE_CODE (lhs
) == SSA_NAME
)
783 if (is_ctrl_altering_stmt (stmt
))
788 /* The value is not assigned on the exception edges, so we need not
789 concern ourselves there. We do need to update on the fallthru
791 FOR_EACH_EDGE (e
, ei
, gsi_bb (*gsi
)->succs
)
792 if (e
->flags
& EDGE_FALLTHRU
)
797 r
= build1 (REALPART_EXPR
, inner_type
, lhs
);
798 i
= build1 (IMAGPART_EXPR
, inner_type
, lhs
);
799 update_complex_components_on_edge (e
, lhs
, r
, i
);
801 else if (is_gimple_call (stmt
)
802 || gimple_has_side_effects (stmt
)
803 || gimple_assign_rhs_code (stmt
) == PAREN_EXPR
)
805 r
= build1 (REALPART_EXPR
, inner_type
, lhs
);
806 i
= build1 (IMAGPART_EXPR
, inner_type
, lhs
);
807 update_complex_components (gsi
, stmt
, r
, i
);
811 if (gimple_assign_rhs_code (stmt
) != COMPLEX_EXPR
)
813 r
= extract_component (gsi
, rhs
, 0, true);
814 i
= extract_component (gsi
, rhs
, 1, true);
818 r
= gimple_assign_rhs1 (stmt
);
819 i
= gimple_assign_rhs2 (stmt
);
821 update_complex_assignment (gsi
, r
, i
);
824 else if (rhs
&& TREE_CODE (rhs
) == SSA_NAME
&& !TREE_SIDE_EFFECTS (lhs
))
829 r
= extract_component (gsi
, rhs
, 0, false);
830 i
= extract_component (gsi
, rhs
, 1, false);
832 x
= build1 (REALPART_EXPR
, inner_type
, unshare_expr (lhs
));
833 t
= gimple_build_assign (x
, r
);
834 gsi_insert_before (gsi
, t
, GSI_SAME_STMT
);
836 if (stmt
== gsi_stmt (*gsi
))
838 x
= build1 (IMAGPART_EXPR
, inner_type
, unshare_expr (lhs
));
839 gimple_assign_set_lhs (stmt
, x
);
840 gimple_assign_set_rhs1 (stmt
, i
);
844 x
= build1 (IMAGPART_EXPR
, inner_type
, unshare_expr (lhs
));
845 t
= gimple_build_assign (x
, i
);
846 gsi_insert_before (gsi
, t
, GSI_SAME_STMT
);
848 stmt
= gsi_stmt (*gsi
);
849 gcc_assert (gimple_code (stmt
) == GIMPLE_RETURN
);
850 gimple_return_set_retval (stmt
, lhs
);
857 /* Expand complex addition to scalars:
858 a + b = (ar + br) + i(ai + bi)
859 a - b = (ar - br) + i(ai + bi)
863 expand_complex_addition (gimple_stmt_iterator
*gsi
, tree inner_type
,
864 tree ar
, tree ai
, tree br
, tree bi
,
866 complex_lattice_t al
, complex_lattice_t bl
)
870 switch (PAIR (al
, bl
))
872 case PAIR (ONLY_REAL
, ONLY_REAL
):
873 rr
= gimplify_build2 (gsi
, code
, inner_type
, ar
, br
);
877 case PAIR (ONLY_REAL
, ONLY_IMAG
):
879 if (code
== MINUS_EXPR
)
880 ri
= gimplify_build2 (gsi
, MINUS_EXPR
, inner_type
, ai
, bi
);
885 case PAIR (ONLY_IMAG
, ONLY_REAL
):
886 if (code
== MINUS_EXPR
)
887 rr
= gimplify_build2 (gsi
, MINUS_EXPR
, inner_type
, ar
, br
);
893 case PAIR (ONLY_IMAG
, ONLY_IMAG
):
895 ri
= gimplify_build2 (gsi
, code
, inner_type
, ai
, bi
);
898 case PAIR (VARYING
, ONLY_REAL
):
899 rr
= gimplify_build2 (gsi
, code
, inner_type
, ar
, br
);
903 case PAIR (VARYING
, ONLY_IMAG
):
905 ri
= gimplify_build2 (gsi
, code
, inner_type
, ai
, bi
);
908 case PAIR (ONLY_REAL
, VARYING
):
909 if (code
== MINUS_EXPR
)
911 rr
= gimplify_build2 (gsi
, code
, inner_type
, ar
, br
);
915 case PAIR (ONLY_IMAG
, VARYING
):
916 if (code
== MINUS_EXPR
)
919 ri
= gimplify_build2 (gsi
, code
, inner_type
, ai
, bi
);
922 case PAIR (VARYING
, VARYING
):
924 rr
= gimplify_build2 (gsi
, code
, inner_type
, ar
, br
);
925 ri
= gimplify_build2 (gsi
, code
, inner_type
, ai
, bi
);
932 update_complex_assignment (gsi
, rr
, ri
);
935 /* Expand a complex multiplication or division to a libcall to the c99
936 compliant routines. */
939 expand_complex_libcall (gimple_stmt_iterator
*gsi
, tree ar
, tree ai
,
940 tree br
, tree bi
, enum tree_code code
)
942 enum machine_mode mode
;
943 enum built_in_function bcode
;
945 gimple old_stmt
, stmt
;
947 old_stmt
= gsi_stmt (*gsi
);
948 lhs
= gimple_assign_lhs (old_stmt
);
949 type
= TREE_TYPE (lhs
);
951 mode
= TYPE_MODE (type
);
952 gcc_assert (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
);
954 if (code
== MULT_EXPR
)
955 bcode
= ((enum built_in_function
)
956 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
957 else if (code
== RDIV_EXPR
)
958 bcode
= ((enum built_in_function
)
959 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
962 fn
= built_in_decls
[bcode
];
964 stmt
= gimple_build_call (fn
, 4, ar
, ai
, br
, bi
);
965 gimple_call_set_lhs (stmt
, lhs
);
967 gsi_replace (gsi
, stmt
, false);
969 if (maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
))
970 gimple_purge_dead_eh_edges (gsi_bb (*gsi
));
972 if (gimple_in_ssa_p (cfun
))
974 type
= TREE_TYPE (type
);
975 update_complex_components (gsi
, stmt
,
976 build1 (REALPART_EXPR
, type
, lhs
),
977 build1 (IMAGPART_EXPR
, type
, lhs
));
978 SSA_NAME_DEF_STMT (lhs
) = stmt
;
982 /* Expand complex multiplication to scalars:
983 a * b = (ar*br - ai*bi) + i(ar*bi + br*ai)
987 expand_complex_multiplication (gimple_stmt_iterator
*gsi
, tree inner_type
,
988 tree ar
, tree ai
, tree br
, tree bi
,
989 complex_lattice_t al
, complex_lattice_t bl
)
995 complex_lattice_t tl
;
996 rr
= ar
, ar
= br
, br
= rr
;
997 ri
= ai
, ai
= bi
, bi
= ri
;
998 tl
= al
, al
= bl
, bl
= tl
;
1001 switch (PAIR (al
, bl
))
1003 case PAIR (ONLY_REAL
, ONLY_REAL
):
1004 rr
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, br
);
1008 case PAIR (ONLY_IMAG
, ONLY_REAL
):
1010 if (TREE_CODE (ai
) == REAL_CST
1011 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai
), dconst1
))
1014 ri
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, br
);
1017 case PAIR (ONLY_IMAG
, ONLY_IMAG
):
1018 rr
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, bi
);
1019 rr
= gimplify_build1 (gsi
, NEGATE_EXPR
, inner_type
, rr
);
1023 case PAIR (VARYING
, ONLY_REAL
):
1024 rr
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, br
);
1025 ri
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, br
);
1028 case PAIR (VARYING
, ONLY_IMAG
):
1029 rr
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, bi
);
1030 rr
= gimplify_build1 (gsi
, NEGATE_EXPR
, inner_type
, rr
);
1031 ri
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, bi
);
1034 case PAIR (VARYING
, VARYING
):
1035 if (flag_complex_method
== 2 && SCALAR_FLOAT_TYPE_P (inner_type
))
1037 expand_complex_libcall (gsi
, ar
, ai
, br
, bi
, MULT_EXPR
);
1042 tree t1
, t2
, t3
, t4
;
1044 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, br
);
1045 t2
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, bi
);
1046 t3
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, bi
);
1048 /* Avoid expanding redundant multiplication for the common
1049 case of squaring a complex number. */
1050 if (ar
== br
&& ai
== bi
)
1053 t4
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, br
);
1055 rr
= gimplify_build2 (gsi
, MINUS_EXPR
, inner_type
, t1
, t2
);
1056 ri
= gimplify_build2 (gsi
, PLUS_EXPR
, inner_type
, t3
, t4
);
1064 update_complex_assignment (gsi
, rr
, ri
);
1067 /* Expand complex division to scalars, straightforward algorithm.
1068 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1073 expand_complex_div_straight (gimple_stmt_iterator
*gsi
, tree inner_type
,
1074 tree ar
, tree ai
, tree br
, tree bi
,
1075 enum tree_code code
)
1077 tree rr
, ri
, div
, t1
, t2
, t3
;
1079 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, br
, br
);
1080 t2
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, bi
, bi
);
1081 div
= gimplify_build2 (gsi
, PLUS_EXPR
, inner_type
, t1
, t2
);
1083 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, br
);
1084 t2
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, bi
);
1085 t3
= gimplify_build2 (gsi
, PLUS_EXPR
, inner_type
, t1
, t2
);
1086 rr
= gimplify_build2 (gsi
, code
, inner_type
, t3
, div
);
1088 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, br
);
1089 t2
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, bi
);
1090 t3
= gimplify_build2 (gsi
, MINUS_EXPR
, inner_type
, t1
, t2
);
1091 ri
= gimplify_build2 (gsi
, code
, inner_type
, t3
, div
);
1093 update_complex_assignment (gsi
, rr
, ri
);
1096 /* Expand complex division to scalars, modified algorithm to minimize
1097 overflow with wide input ranges. */
1100 expand_complex_div_wide (gimple_stmt_iterator
*gsi
, tree inner_type
,
1101 tree ar
, tree ai
, tree br
, tree bi
,
1102 enum tree_code code
)
1104 tree rr
, ri
, ratio
, div
, t1
, t2
, tr
, ti
, compare
;
1105 basic_block bb_cond
, bb_true
, bb_false
, bb_join
;
1108 /* Examine |br| < |bi|, and branch. */
1109 t1
= gimplify_build1 (gsi
, ABS_EXPR
, inner_type
, br
);
1110 t2
= gimplify_build1 (gsi
, ABS_EXPR
, inner_type
, bi
);
1111 compare
= fold_build2 (LT_EXPR
, boolean_type_node
, t1
, t2
);
1112 STRIP_NOPS (compare
);
1114 bb_cond
= bb_true
= bb_false
= bb_join
= NULL
;
1115 rr
= ri
= tr
= ti
= NULL
;
1116 if (!TREE_CONSTANT (compare
))
1122 tmp
= create_tmp_var (boolean_type_node
, NULL
);
1123 stmt
= gimple_build_assign (tmp
, compare
);
1124 if (gimple_in_ssa_p (cfun
))
1126 tmp
= make_ssa_name (tmp
, stmt
);
1127 gimple_assign_set_lhs (stmt
, tmp
);
1130 gsi_insert_before (gsi
, stmt
, GSI_SAME_STMT
);
1132 cond
= fold_build2 (EQ_EXPR
, boolean_type_node
, tmp
, boolean_true_node
);
1133 stmt
= gimple_build_cond_from_tree (cond
, NULL_TREE
, NULL_TREE
);
1134 gsi_insert_before (gsi
, stmt
, GSI_SAME_STMT
);
1136 /* Split the original block, and create the TRUE and FALSE blocks. */
1137 e
= split_block (gsi_bb (*gsi
), stmt
);
1140 bb_true
= create_empty_bb (bb_cond
);
1141 bb_false
= create_empty_bb (bb_true
);
1143 /* Wire the blocks together. */
1144 e
->flags
= EDGE_TRUE_VALUE
;
1145 redirect_edge_succ (e
, bb_true
);
1146 make_edge (bb_cond
, bb_false
, EDGE_FALSE_VALUE
);
1147 make_edge (bb_true
, bb_join
, EDGE_FALLTHRU
);
1148 make_edge (bb_false
, bb_join
, EDGE_FALLTHRU
);
1150 /* Update dominance info. Note that bb_join's data was
1151 updated by split_block. */
1152 if (dom_info_available_p (CDI_DOMINATORS
))
1154 set_immediate_dominator (CDI_DOMINATORS
, bb_true
, bb_cond
);
1155 set_immediate_dominator (CDI_DOMINATORS
, bb_false
, bb_cond
);
1158 rr
= make_rename_temp (inner_type
, NULL
);
1159 ri
= make_rename_temp (inner_type
, NULL
);
1162 /* In the TRUE branch, we compute
1164 div = (br * ratio) + bi;
1165 tr = (ar * ratio) + ai;
1166 ti = (ai * ratio) - ar;
1169 if (bb_true
|| integer_nonzerop (compare
))
1173 *gsi
= gsi_last_bb (bb_true
);
1174 gsi_insert_after (gsi
, gimple_build_nop (), GSI_NEW_STMT
);
1177 ratio
= gimplify_build2 (gsi
, code
, inner_type
, br
, bi
);
1179 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, br
, ratio
);
1180 div
= gimplify_build2 (gsi
, PLUS_EXPR
, inner_type
, t1
, bi
);
1182 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, ratio
);
1183 tr
= gimplify_build2 (gsi
, PLUS_EXPR
, inner_type
, t1
, ai
);
1185 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, ratio
);
1186 ti
= gimplify_build2 (gsi
, MINUS_EXPR
, inner_type
, t1
, ar
);
1188 tr
= gimplify_build2 (gsi
, code
, inner_type
, tr
, div
);
1189 ti
= gimplify_build2 (gsi
, code
, inner_type
, ti
, div
);
1193 stmt
= gimple_build_assign (rr
, tr
);
1194 gsi_insert_before (gsi
, stmt
, GSI_SAME_STMT
);
1195 stmt
= gimple_build_assign (ri
, ti
);
1196 gsi_insert_before (gsi
, stmt
, GSI_SAME_STMT
);
1197 gsi_remove (gsi
, true);
1201 /* In the FALSE branch, we compute
1203 divisor = (d * ratio) + c;
1204 tr = (b * ratio) + a;
1205 ti = b - (a * ratio);
1208 if (bb_false
|| integer_zerop (compare
))
1212 *gsi
= gsi_last_bb (bb_false
);
1213 gsi_insert_after (gsi
, gimple_build_nop (), GSI_NEW_STMT
);
1216 ratio
= gimplify_build2 (gsi
, code
, inner_type
, bi
, br
);
1218 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, bi
, ratio
);
1219 div
= gimplify_build2 (gsi
, PLUS_EXPR
, inner_type
, t1
, br
);
1221 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ai
, ratio
);
1222 tr
= gimplify_build2 (gsi
, PLUS_EXPR
, inner_type
, t1
, ar
);
1224 t1
= gimplify_build2 (gsi
, MULT_EXPR
, inner_type
, ar
, ratio
);
1225 ti
= gimplify_build2 (gsi
, MINUS_EXPR
, inner_type
, ai
, t1
);
1227 tr
= gimplify_build2 (gsi
, code
, inner_type
, tr
, div
);
1228 ti
= gimplify_build2 (gsi
, code
, inner_type
, ti
, div
);
1232 stmt
= gimple_build_assign (rr
, tr
);
1233 gsi_insert_before (gsi
, stmt
, GSI_SAME_STMT
);
1234 stmt
= gimple_build_assign (ri
, ti
);
1235 gsi_insert_before (gsi
, stmt
, GSI_SAME_STMT
);
1236 gsi_remove (gsi
, true);
1241 *gsi
= gsi_start_bb (bb_join
);
1245 update_complex_assignment (gsi
, rr
, ri
);
1248 /* Expand complex division to scalars. */
1251 expand_complex_division (gimple_stmt_iterator
*gsi
, tree inner_type
,
1252 tree ar
, tree ai
, tree br
, tree bi
,
1253 enum tree_code code
,
1254 complex_lattice_t al
, complex_lattice_t bl
)
1258 switch (PAIR (al
, bl
))
1260 case PAIR (ONLY_REAL
, ONLY_REAL
):
1261 rr
= gimplify_build2 (gsi
, code
, inner_type
, ar
, br
);
1265 case PAIR (ONLY_REAL
, ONLY_IMAG
):
1267 ri
= gimplify_build2 (gsi
, code
, inner_type
, ar
, bi
);
1268 ri
= gimplify_build1 (gsi
, NEGATE_EXPR
, inner_type
, ri
);
1271 case PAIR (ONLY_IMAG
, ONLY_REAL
):
1273 ri
= gimplify_build2 (gsi
, code
, inner_type
, ai
, br
);
1276 case PAIR (ONLY_IMAG
, ONLY_IMAG
):
1277 rr
= gimplify_build2 (gsi
, code
, inner_type
, ai
, bi
);
1281 case PAIR (VARYING
, ONLY_REAL
):
1282 rr
= gimplify_build2 (gsi
, code
, inner_type
, ar
, br
);
1283 ri
= gimplify_build2 (gsi
, code
, inner_type
, ai
, br
);
1286 case PAIR (VARYING
, ONLY_IMAG
):
1287 rr
= gimplify_build2 (gsi
, code
, inner_type
, ai
, bi
);
1288 ri
= gimplify_build2 (gsi
, code
, inner_type
, ar
, bi
);
1289 ri
= gimplify_build1 (gsi
, NEGATE_EXPR
, inner_type
, ri
);
1291 case PAIR (ONLY_REAL
, VARYING
):
1292 case PAIR (ONLY_IMAG
, VARYING
):
1293 case PAIR (VARYING
, VARYING
):
1294 switch (flag_complex_method
)
1297 /* straightforward implementation of complex divide acceptable. */
1298 expand_complex_div_straight (gsi
, inner_type
, ar
, ai
, br
, bi
, code
);
1302 if (SCALAR_FLOAT_TYPE_P (inner_type
))
1304 expand_complex_libcall (gsi
, ar
, ai
, br
, bi
, code
);
1310 /* wide ranges of inputs must work for complex divide. */
1311 expand_complex_div_wide (gsi
, inner_type
, ar
, ai
, br
, bi
, code
);
1323 update_complex_assignment (gsi
, rr
, ri
);
1326 /* Expand complex negation to scalars:
1331 expand_complex_negation (gimple_stmt_iterator
*gsi
, tree inner_type
,
1336 rr
= gimplify_build1 (gsi
, NEGATE_EXPR
, inner_type
, ar
);
1337 ri
= gimplify_build1 (gsi
, NEGATE_EXPR
, inner_type
, ai
);
1339 update_complex_assignment (gsi
, rr
, ri
);
1342 /* Expand complex conjugate to scalars:
1347 expand_complex_conjugate (gimple_stmt_iterator
*gsi
, tree inner_type
,
1352 ri
= gimplify_build1 (gsi
, NEGATE_EXPR
, inner_type
, ai
);
1354 update_complex_assignment (gsi
, ar
, ri
);
1357 /* Expand complex comparison (EQ or NE only). */
1360 expand_complex_comparison (gimple_stmt_iterator
*gsi
, tree ar
, tree ai
,
1361 tree br
, tree bi
, enum tree_code code
)
1363 tree cr
, ci
, cc
, type
;
1366 cr
= gimplify_build2 (gsi
, code
, boolean_type_node
, ar
, br
);
1367 ci
= gimplify_build2 (gsi
, code
, boolean_type_node
, ai
, bi
);
1368 cc
= gimplify_build2 (gsi
,
1369 (code
== EQ_EXPR
? TRUTH_AND_EXPR
: TRUTH_OR_EXPR
),
1370 boolean_type_node
, cr
, ci
);
1372 stmt
= gsi_stmt (*gsi
);
1374 switch (gimple_code (stmt
))
1377 type
= TREE_TYPE (gimple_return_retval (stmt
));
1378 gimple_return_set_retval (stmt
, fold_convert (type
, cc
));
1382 type
= TREE_TYPE (gimple_assign_lhs (stmt
));
1383 gimple_assign_set_rhs_from_tree (gsi
, fold_convert (type
, cc
));
1384 stmt
= gsi_stmt (*gsi
);
1388 gimple_cond_set_code (stmt
, EQ_EXPR
);
1389 gimple_cond_set_lhs (stmt
, cc
);
1390 gimple_cond_set_rhs (stmt
, boolean_true_node
);
1401 /* Process one statement. If we identify a complex operation, expand it. */
1404 expand_complex_operations_1 (gimple_stmt_iterator
*gsi
)
1406 gimple stmt
= gsi_stmt (*gsi
);
1407 tree type
, inner_type
, lhs
;
1408 tree ac
, ar
, ai
, bc
, br
, bi
;
1409 complex_lattice_t al
, bl
;
1410 enum tree_code code
;
1412 lhs
= gimple_get_lhs (stmt
);
1413 if (!lhs
&& gimple_code (stmt
) != GIMPLE_COND
)
1416 type
= TREE_TYPE (gimple_op (stmt
, 0));
1417 code
= gimple_expr_code (stmt
);
1419 /* Initial filter for operations we handle. */
1425 case TRUNC_DIV_EXPR
:
1427 case FLOOR_DIV_EXPR
:
1428 case ROUND_DIV_EXPR
:
1432 if (TREE_CODE (type
) != COMPLEX_TYPE
)
1434 inner_type
= TREE_TYPE (type
);
1439 /* Note, both GIMPLE_ASSIGN and GIMPLE_COND may have an EQ_EXPR
1440 subocde, so we need to access the operands using gimple_op. */
1441 inner_type
= TREE_TYPE (gimple_op (stmt
, 1));
1442 if (TREE_CODE (inner_type
) != COMPLEX_TYPE
)
1450 /* GIMPLE_COND may also fallthru here, but we do not need to
1451 do anything with it. */
1452 if (gimple_code (stmt
) == GIMPLE_COND
)
1455 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1456 expand_complex_move (gsi
, type
);
1457 else if (is_gimple_assign (stmt
)
1458 && (gimple_assign_rhs_code (stmt
) == REALPART_EXPR
1459 || gimple_assign_rhs_code (stmt
) == IMAGPART_EXPR
)
1460 && TREE_CODE (lhs
) == SSA_NAME
)
1462 rhs
= gimple_assign_rhs1 (stmt
);
1463 rhs
= extract_component (gsi
, TREE_OPERAND (rhs
, 0),
1464 gimple_assign_rhs_code (stmt
)
1467 gimple_assign_set_rhs_from_tree (gsi
, rhs
);
1468 stmt
= gsi_stmt (*gsi
);
1475 /* Extract the components of the two complex values. Make sure and
1476 handle the common case of the same value used twice specially. */
1477 if (is_gimple_assign (stmt
))
1479 ac
= gimple_assign_rhs1 (stmt
);
1480 bc
= (gimple_num_ops (stmt
) > 2) ? gimple_assign_rhs2 (stmt
) : NULL
;
1482 /* GIMPLE_CALL can not get here. */
1485 ac
= gimple_cond_lhs (stmt
);
1486 bc
= gimple_cond_rhs (stmt
);
1489 ar
= extract_component (gsi
, ac
, false, true);
1490 ai
= extract_component (gsi
, ac
, true, true);
1496 br
= extract_component (gsi
, bc
, 0, true);
1497 bi
= extract_component (gsi
, bc
, 1, true);
1500 br
= bi
= NULL_TREE
;
1502 if (gimple_in_ssa_p (cfun
))
1504 al
= find_lattice_value (ac
);
1505 if (al
== UNINITIALIZED
)
1508 if (TREE_CODE_CLASS (code
) == tcc_unary
)
1514 bl
= find_lattice_value (bc
);
1515 if (bl
== UNINITIALIZED
)
1526 expand_complex_addition (gsi
, inner_type
, ar
, ai
, br
, bi
, code
, al
, bl
);
1530 expand_complex_multiplication (gsi
, inner_type
, ar
, ai
, br
, bi
, al
, bl
);
1533 case TRUNC_DIV_EXPR
:
1535 case FLOOR_DIV_EXPR
:
1536 case ROUND_DIV_EXPR
:
1538 expand_complex_division (gsi
, inner_type
, ar
, ai
, br
, bi
, code
, al
, bl
);
1542 expand_complex_negation (gsi
, inner_type
, ar
, ai
);
1546 expand_complex_conjugate (gsi
, inner_type
, ar
, ai
);
1551 expand_complex_comparison (gsi
, ar
, ai
, br
, bi
, code
);
1560 /* Entry point for complex operation lowering during optimization. */
1563 tree_lower_complex (void)
1565 int old_last_basic_block
;
1566 gimple_stmt_iterator gsi
;
1569 if (!init_dont_simulate_again ())
1572 complex_lattice_values
= VEC_alloc (complex_lattice_t
, heap
, num_ssa_names
);
1573 VEC_safe_grow_cleared (complex_lattice_t
, heap
,
1574 complex_lattice_values
, num_ssa_names
);
1576 init_parameter_lattice_values ();
1577 ssa_propagate (complex_visit_stmt
, complex_visit_phi
);
1579 complex_variable_components
= htab_create (10, int_tree_map_hash
,
1580 int_tree_map_eq
, free
);
1582 complex_ssa_name_components
= VEC_alloc (tree
, heap
, 2*num_ssa_names
);
1583 VEC_safe_grow_cleared (tree
, heap
, complex_ssa_name_components
,
1586 update_parameter_components ();
1588 /* ??? Ideally we'd traverse the blocks in breadth-first order. */
1589 old_last_basic_block
= last_basic_block
;
1592 if (bb
->index
>= old_last_basic_block
)
1595 update_phi_components (bb
);
1596 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1597 expand_complex_operations_1 (&gsi
);
1600 gsi_commit_edge_inserts ();
1602 htab_delete (complex_variable_components
);
1603 VEC_free (tree
, heap
, complex_ssa_name_components
);
1604 VEC_free (complex_lattice_t
, heap
, complex_lattice_values
);
1608 struct gimple_opt_pass pass_lower_complex
=
1612 "cplxlower", /* name */
1614 tree_lower_complex
, /* execute */
1617 0, /* static_pass_number */
1618 TV_NONE
, /* tv_id */
1619 PROP_ssa
, /* properties_required */
1620 0, /* properties_provided */
1621 0, /* properties_destroyed */
1622 0, /* todo_flags_start */
1626 | TODO_verify_stmts
/* todo_flags_finish */
1631 /* Entry point for complex operation lowering without optimization. */
1634 tree_lower_complex_O0 (void)
1636 int old_last_basic_block
= last_basic_block
;
1637 gimple_stmt_iterator gsi
;
1642 if (bb
->index
>= old_last_basic_block
)
1645 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1646 expand_complex_operations_1 (&gsi
);
1652 gate_no_optimization (void)
1654 /* With errors, normal optimization passes are not run. If we don't
1655 lower complex operations at all, rtl expansion will abort. */
1656 return optimize
== 0 || sorrycount
|| errorcount
;
1659 struct gimple_opt_pass pass_lower_complex_O0
=
1663 "cplxlower0", /* name */
1664 gate_no_optimization
, /* gate */
1665 tree_lower_complex_O0
, /* execute */
1668 0, /* static_pass_number */
1669 TV_NONE
, /* tv_id */
1670 PROP_cfg
, /* properties_required */
1671 0, /* properties_provided */
1672 0, /* properties_destroyed */
1673 0, /* todo_flags_start */
1674 TODO_dump_func
| TODO_ggc_collect
1675 | TODO_verify_stmts
, /* todo_flags_finish */