| /src/external/gpl3/gcc/dist/gcc/ |
| tree-phinodes.cc | 33 were threaded through PHI nodes.
45 PHI nodes have different sizes, so we can't have a single list of all
46 the PHI nodes as it would be too expensive to walk down that list to
47 find a PHI of a suitable size.
49 Instead we have an array of lists of free PHI nodes. The array is
50 indexed by the number of PHI alternatives that PHI node can hold.
51 Except for the last array member, which holds all remaining PHI
54 So to find a free PHI node, we compute its index into the free PHI
96 gphi *phi; local
171 gphi *phi; local
348 gphi *phi = make_phi_node (var, EDGE_COUNT (bb->preds)); local
[all...] |
| tree-phinodes.h | 1 /* Header file for PHI node routines
46 /* Return the phi argument which contains the specified use. */
53 gimple *phi; local
55 /* Since the use is the first thing in a PHI argument element, we can
59 phi = USE_STMT (use);
62 root = gimple_phi_arg (phi, 0);
69 && index < gimple_phi_capacity (phi));
|
| gimple-ssa-split-paths.cc | 173 the output of that statement feed the same PHI in BB. */
194 gimple *phi = gsi_stmt (gsi); local
195 if ((gimple_phi_arg_def (phi, 0) == lhs1
196 && gimple_phi_arg_def (phi, 1) == lhs2)
197 || (gimple_phi_arg_def (phi, 1) == lhs1
198 && gimple_phi_arg_def (phi, 0) == lhs2))
240 gimple *phi = gsi_stmt (gsi); local
241 if ((gimple_phi_arg_def (phi, 0) == lhs1
242 && gimple_phi_arg_def (phi, 1) == rhs1)
243 || (gimple_phi_arg_def (phi, 1) == lhs
278 gimple *phi = gsi_stmt (gsi); local
301 gphi *phi = si.phi (); local
[all...] |
| gimple-streamer-out.cc | 36 /* Output PHI function PHI to the main stream in OB. */
39 output_phi (struct output_block *ob, gphi *phi)
41 unsigned i, len = gimple_phi_num_args (phi);
44 streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi)));
48 stream_write_tree (ob, gimple_phi_arg_def (phi, i), true);
49 streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index);
51 location_t loc = gimple_phi_arg_location (phi, i);
245 gphi *phi = psi.phi (); local
[all...] |
| tree-ssa-phiprop.cc | 38 /* This pass propagates indirect loads through the PHI node for its
40 allow for PHI optimization to trigger.
44 # addr_1 = PHI <&a, &b>
49 # tmp_1 = PHI <a, b>
56 # b_12 = PHI <&c(2), D.2077_2(3)>
60 # b_15 = PHI <b_12(4), &b(5)>
64 # b_18 = PHI <D.2080_5(6), &c(7)>
67 # b_21 = PHI <b_15(8), b_18(9)>
75 where this pass transforms it to a form later PHI optimization
92 /* Structure to keep track of the value of a dereferenced PHI resul
[all...] |
| gimple-range-path.cc | 214 // Return the range of the result of PHI in R.
219 // calculating the PHI's range must not trigger additional lookups.
222 path_range_query::ssa_range_in_phi (vrange &r, gphi *phi)
224 tree name = gimple_phi_result (phi);
228 if (m_resolve && m_ranger.range_of_expr (r, name, phi))
231 // Try to fold the phi exclusively with global values.
232 // This will get things like PHI <5(99), 6(88)>. We do this by
234 unsigned nargs = gimple_phi_num_args (phi);
239 tree arg = gimple_phi_arg_def (phi, i);
251 basic_block bb = gimple_bb (phi);
331 gphi *phi = iter.phi (); local
739 gphi *phi = iter.phi (); local
[all...] |
| tree-ssa-copy.cc | 64 When visiting a statement or PHI node the lattice value for an
325 /* Visit PHI node PHI. If all the arguments produce the same value,
326 set it to be the value of the LHS of PHI. */
329 copy_prop::visit_phi (gphi *phi)
335 tree lhs = gimple_phi_result (phi);
339 fprintf (dump_file, "\nVisiting PHI node: ");
340 print_gimple_stmt (dump_file, phi, 0, dump_flags);
343 for (i = 0; i < gimple_phi_num_args (phi); i++)
347 tree arg = gimple_phi_arg_def (phi, i)
478 gphi *phi = si.phi (); local
[all...] |
| gimple-ssa-sccopy.cc | 45 redundant PHI statements. The pass considers the following types of copy
53 2 A degenerate PHI statement. A degenerate PHI is a PHI that only refers to
56 _5 = PHI <_1>;
57 _6 = PHI <_6, _6, _1, _1>;
58 _7 = PHI <16, _7>;
60 3 A set of PHI statements that only refer to each other or to one other
63 _8 = PHI <_9, _10>;
64 _9 = PHI <_8, _10>
274 gphi *phi; local
354 gphi *phi = as_a <gphi *> (stmt); local
581 gphi *phi; local
[all...] |
| tree-ssa-sink.cc | 78 /* Given a PHI, and one of its arguments (DEF), find the edge for
79 that argument and return it. If the argument occurs twice in the PHI node,
83 find_bb_for_arg (gphi *phi, tree def)
88 for (i = 0; i < gimple_phi_num_args (phi); i++)
89 if (PHI_ARG_DEF (phi, i) == def)
94 result = gimple_phi_arg_edge (phi, i)->src;
101 We could also do the case where the first immediate use is in a phi node,
104 in the statement occurs for multiple edges in the various phi nodes it's
147 if (gphi *phi = dyn_cast <gphi *> (usestmt))
151 useblock = gimple_phi_arg_edge (phi, idx)->src
483 gphi *phi; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-phinodes.cc | 33 were threaded through PHI nodes.
45 PHI nodes have different sizes, so we can't have a single list of all
46 the PHI nodes as it would be too expensive to walk down that list to
47 find a PHI of a suitable size.
49 Instead we have an array of lists of free PHI nodes. The array is
50 indexed by the number of PHI alternatives that PHI node can hold.
51 Except for the last array member, which holds all remaining PHI
54 So to find a free PHI node, we compute its index into the free PHI
96 gphi *phi; local
171 gphi *phi; local
341 gphi *phi = make_phi_node (var, EDGE_COUNT (bb->preds)); local
[all...] |
| tree-phinodes.h | 1 /* Header file for PHI node routines
25 extern void add_phi_node_to_bb (gphi *phi, basic_block bb);
40 /* Return the phi argument which contains the specified use. */
47 gimple *phi; local
49 /* Since the use is the first thing in a PHI argument element, we can
53 phi = USE_STMT (use);
56 root = gimple_phi_arg (phi, 0);
63 && index < gimple_phi_capacity (phi));
|
| gimple-ssa-split-paths.cc | 173 the output of that statement feed the same PHI in BB. */
194 gimple *phi = gsi_stmt (gsi); local
195 if ((gimple_phi_arg_def (phi, 0) == lhs1
196 && gimple_phi_arg_def (phi, 1) == lhs2)
197 || (gimple_phi_arg_def (phi, 1) == lhs1
198 && gimple_phi_arg_def (phi, 0) == lhs2))
240 gimple *phi = gsi_stmt (gsi); local
241 if ((gimple_phi_arg_def (phi, 0) == lhs1
242 && gimple_phi_arg_def (phi, 1) == rhs1)
243 || (gimple_phi_arg_def (phi, 1) == lhs
279 gimple *phi = gsi_stmt (gsi); local
302 gphi *phi = si.phi (); local
[all...] |
| gimple-streamer-out.cc | 36 /* Output PHI function PHI to the main stream in OB. */
39 output_phi (struct output_block *ob, gphi *phi)
41 unsigned i, len = gimple_phi_num_args (phi);
44 streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi)));
48 stream_write_tree (ob, gimple_phi_arg_def (phi, i), true);
49 streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index);
51 location_t loc = gimple_phi_arg_location (phi, i);
246 gphi *phi = psi.phi (); local
[all...] |
| tree-ssa-phiprop.cc | 37 /* This pass propagates indirect loads through the PHI node for its
39 allow for PHI optimization to trigger.
43 # addr_1 = PHI <&a, &b>
48 # tmp_1 = PHI <a, b>
55 # b_12 = PHI <&c(2), D.2077_2(3)>
59 # b_15 = PHI <b_12(4), &b(5)>
63 # b_18 = PHI <D.2080_5(6), &c(7)>
66 # b_21 = PHI <b_15(8), b_18(9)>
74 where this pass transforms it to a form later PHI optimization
91 /* Structure to keep track of the value of a dereferenced PHI resul
[all...] |
| gimple-range-path.cc | 264 // Return the range of the result of PHI in R.
269 // calculating the PHI's range must not trigger additional lookups.
272 path_range_query::ssa_range_in_phi (irange &r, gphi *phi)
274 tree name = gimple_phi_result (phi);
275 basic_block bb = gimple_bb (phi);
276 unsigned nargs = gimple_phi_num_args (phi);
280 if (m_resolve && m_ranger->range_of_expr (r, name, phi))
283 // Try to fold the phi exclusively with global or cached values.
284 // This will get things like PHI <5(99), 6(88)>. We do this by
290 tree arg = gimple_phi_arg_def (phi, i)
390 gphi *phi = iter.phi (); local
822 gphi *phi = iter.phi (); local
[all...] |
| tree-ssa-sink.cc | 77 /* Given a PHI, and one of its arguments (DEF), find the edge for
78 that argument and return it. If the argument occurs twice in the PHI node,
82 find_bb_for_arg (gphi *phi, tree def)
87 for (i = 0; i < gimple_phi_num_args (phi); i++)
88 if (PHI_ARG_DEF (phi, i) == def)
93 result = gimple_phi_arg_edge (phi, i)->src;
100 We could also do the case where the first immediate use is in a phi node,
103 in the statement occurs for multiple edges in the various phi nodes it's
146 if (gphi *phi = dyn_cast <gphi *> (usestmt))
150 useblock = gimple_phi_arg_edge (phi, idx)->src
503 gphi *phi; local
[all...] |
| tree-ssa-uninit.cc | 57 ssa names that are defined by phi with operands that
122 The second pass follows PHI nodes to find uses that are potentially
133 PHI_ARG_LOC is the location of the PHI argument if T and VAR are one,
263 /* Use either the location of the read statement or that of the PHI
911 /* Warn about an uninitialized PHI argument on the fallthru path to
947 gphi *phi = si.phi (); local
948 tree def = PHI_ARG_DEF_FROM_EDGE (phi, found);
953 /* If there's a default def on the fallthru edge PHI
959 FOR_EACH_IMM_USE_FAST (use_p, iter, gimple_phi_result (phi))
1367 gphi *phi = gsi.phi (); local
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 156 // Cleanup PHI nodes.
159 // Prune unneeded PHI entries.
162 MachineBasicBlock::iterator phi = BB->begin(); local
163 while (phi != BB->end() && phi->isPHI()) {
164 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
165 if (!preds.count(phi->getOperand(i).getMBB())) {
166 phi->RemoveOperand(i);
167 phi->RemoveOperand(i-1);
171 if (phi->getNumOperands() == 3)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/rtl-ssa/ |
| functions.cc | 96 // The initial phase of the phi simplification process. The cumulative
98 // for a phi P with uid ID:
105 // This has already been done for phis with a lower uid than PHI,
107 // Now do the same for PHI. If this might invalidate any assumptions
110 function_info::simplify_phi_setup (phi_info *phi, set_info **assumed_values,
114 // to that value. Otherwise set NEW_VALUE to PHI, to indicate
115 // that PHI cannot be simplified.
116 unsigned int phi_uid = phi->uid ();
119 machine_mode phi_mode = phi->mode ();
120 for (use_info *input : phi->inputs ()
[all...] |
| blocks.cc | 73 // Start off with an empty set of phi nodes for each block.
264 for (const phi_info *phi : phis)
271 pp_access (pp, phi, PP_ACCESS_SETTER);
278 pp_string (pp, "no phi nodes");
283 pp_string (pp, "no phi insn");
347 if (auto *phi = safe_dyn_cast<phi_info *> (set))
348 if (phi->is_degenerate ())
350 set = phi->input_value (0);
352 // Remove the phi if it turned out to be useless. This is
355 if (bb == bb->ebb ()->last_bb () && all_uses_are_live_out_uses (phi))
467 phi_info *phi = m_free_phis; local
522 phi_info *phi = create_phi (ebb, def->resource (), &input, 1); local
796 phi_info *phi = create_phi (ebb, { E_BLKmode, regno }, local
1136 phi_info *phi = sorted_phis[phi_i]; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/ |
| functions.cc | 96 // The initial phase of the phi simplification process. The cumulative
98 // for a phi P with uid ID:
105 // This has already been done for phis with a lower uid than PHI,
107 // Now do the same for PHI. If this might invalidate any assumptions
110 function_info::simplify_phi_setup (phi_info *phi, set_info **assumed_values,
114 // to that value. Otherwise set NEW_VALUE to PHI, to indicate
115 // that PHI cannot be simplified.
116 unsigned int phi_uid = phi->uid ();
119 machine_mode phi_mode = phi->mode ();
120 for (use_info *input : phi->inputs ()
[all...] |
| blocks.cc | 72 // Start off with an empty set of phi nodes for each block.
276 for (const phi_info *phi : phis)
283 pp_access (pp, phi, PP_ACCESS_SETTER);
290 pp_string (pp, "no phi nodes");
295 pp_string (pp, "no phi insn");
359 if (auto *phi = safe_dyn_cast<phi_info *> (set))
360 if (phi->is_degenerate ())
362 set = phi->input_value (0);
364 // Remove the phi if it turned out to be useless. This is
367 if (bb == bb->ebb ()->last_bb () && all_uses_are_live_out_uses (phi))
479 phi_info *phi = m_free_phis; local
529 phi_info *phi = create_phi (ebb, def->resource (), &input, 1); local
790 phi_info *phi = create_phi (ebb, { E_BLKmode, regno }, local
1117 phi_info *phi = sorted_phis[phi_i]; local
[all...] |
| /src/external/gpl2/groff/dist/font/devps/generate/ |
| lgreekmap | 19 phi *f
|
| /src/external/lgpl3/gmp/dist/mpn/s390_32/ |
| addmul_1.asm | 50 alr 0,6 # add vlimb to phi
53 alr 0,6 # conditionally add vlimb to phi
56 ahi 0,1 # increment phi
60 ahi 0,1 # increment phi
76 alr 0,6 # conditionally add vlimb to phi
79 ahi 0,1 # increment phi
83 ahi 0,1 # increment phi
|
| submul_1.asm | 50 alr 0,6 # add vlimb to phi
53 alr 0,6 # conditionally add vlimb to phi
56 ahi 0,1 # increment phi
60 ahi 0,1 # increment phi
76 alr 0,6 # conditionally add vlimb to phi
79 ahi 0,1 # increment phi
83 ahi 0,1 # increment phi
|
