| /src/external/gpl3/gcc.old/dist/gcc/ |
| 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-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...] |
| gimple-iterator.h | 41 gphi *phi () const function in struct:gphi_iterator
338 while (!gsi_end_p (*i) && virtual_operand_p (gimple_phi_result (i->phi ())));
341 /* Return a new iterator pointing to the first non-virtual phi statement in
349 if (!gsi_end_p (i) && virtual_operand_p (gimple_phi_result (i.phi ())))
|
| gimple-walk.cc | 523 gphi *phi = as_a <gphi *> (stmt); local
529 ret = walk_tree (gimple_phi_result_ptr (phi), callback_op, wi, pset);
534 for (unsigned i = 0; i < gimple_phi_num_args (phi); ++i)
536 ret = walk_tree (gimple_phi_arg_def_ptr (phi, i),
|
| 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...] |
| value-pointer-equiv.cc | 186 gphi *phi = iter.phi (); local
187 tree lhs = gimple_phi_result (phi);
190 tree arg0 = gimple_phi_arg_def (phi, 0);
195 // If all the PHI args point to the same place, set the
196 // pointer equivalency info for the PHI result. This can
198 // PHI<&foo, &foo> or PHI<&foo>.
199 for (size_t i = 1; i < gimple_phi_num_args (phi); ++i)
201 tree argi = gimple_phi_arg_def (phi, i)
[all...] |
| gimple-harden-conditionals.cc | 570 gphi *phi = psi.phi (); local
571 add_phi_arg (phi, PHI_ARG_DEF_FROM_EDGE (phi, aseh), ckeh,
572 gimple_phi_arg_location_from_edge (phi, aseh));
577 "Copying PHI args in EH block %i from %i to %i\n",
|
| /src/external/gpl3/gcc/dist/gcc/ |
| 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-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...] |
| gimple-match-head.cc | 140 is an exact integer, arg1 = phi_res +/- cst1 and phi_res = PHI <cst2, ...>
156 gphi *phi = dyn_cast <gphi *> (def); local
159 if (!phi)
178 phi = dyn_cast <gphi *> (SSA_NAME_DEF_STMT (gimple_assign_rhs1 (def)));
179 if (!phi)
184 int n = gimple_phi_num_args (phi);
187 tree arg = PHI_ARG_DEF (phi, i);
|
| 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...] |
| value-pointer-equiv.cc | 186 gphi *phi = iter.phi (); local
187 tree lhs = gimple_phi_result (phi);
190 tree arg0 = gimple_phi_arg_def (phi, 0);
195 // If all the PHI args point to the same place, set the
196 // pointer equivalency info for the PHI result. This can
198 // PHI<&foo, &foo> or PHI<&foo>.
199 for (size_t i = 1; i < gimple_phi_num_args (phi); ++i)
201 tree argi = gimple_phi_arg_def (phi, i)
[all...] |
| gimple-harden-conditionals.cc | 616 gphi *phi = psi.phi (); local
617 add_phi_arg (phi, PHI_ARG_DEF_FROM_EDGE (phi, aseh), ckeh,
618 gimple_phi_arg_location_from_edge (phi, aseh));
623 "Copying PHI args in EH block %i from %i to %i\n",
|
| gimple-iterator.h | 45 gphi *phi () const function in struct:gphi_iterator
395 while (!gsi_end_p (*i) && virtual_operand_p (gimple_phi_result (i->phi ())));
398 /* Return a new iterator pointing to the first non-virtual phi statement in
406 if (!gsi_end_p (i) && virtual_operand_p (gimple_phi_result (i.phi ())))
|
| 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...] |
| 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...] |
| 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-walk.cc | 539 gphi *phi = as_a <gphi *> (stmt); local
545 ret = walk_tree (gimple_phi_result_ptr (phi), callback_op, wi, pset);
550 for (unsigned i = 0; i < gimple_phi_num_args (phi); ++i)
552 ret = walk_tree (gimple_phi_arg_def_ptr (phi, i),
|
| sese.cc | 78 FOR_EACH_PHI_ARG (use_p, bsi.phi (), iter, SSA_OP_USE)
186 gphi *phi = create_phi_node (NULL_TREE, exit); local
187 create_new_def_for (use, phi, gimple_phi_result_ptr (phi));
188 add_phi_arg (phi, use, false_e, UNKNOWN_LOCATION);
189 add_phi_arg (phi, use, true_e, UNKNOWN_LOCATION);
190 update_stmt (phi);
193 /* Insert in the block BB phi nodes for variables defined in REGION
|
| 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...] |
| tree-ssa-ifcombine.cc | 176 /* Verify if all PHI node arguments in DEST for edges from BB1 or
186 gphi *phi; local
190 phi = gsi.phi ();
191 if (!operand_equal_p (PHI_ARG_DEF_FROM_EDGE (phi, e1),
192 PHI_ARG_DEF_FROM_EDGE (phi, e2), 0))
681 guaranteed by matching PHI arguments in the else_bb and
720 by matching PHI arguments in the then_bb and the inner cond_bb
862 block. This is opposite of PHI-OPT, because we cascade the
|
| tree-ssa-scopedtables.h | 46 struct { size_t nargs; tree *args; } phi; member in union:hashable_expr::__anon13974
|
| tree-ssa-uncprop.cc | 227 constant initializations on edges to eliminate PHI nodes.
261 When we encounter a PHI node, we walk its arguments to see if we
262 have an equivalence for the PHI argument. If so, then we replace
329 /* Unpropagate values from PHI nodes in successor blocks of BB. */
338 on that edge. Then unpropagate values in any PHI nodes at the
345 /* If there are no PHI nodes in this destination, then there is
357 /* Walk over the PHI nodes, unpropagating values. */
360 gimple *phi = gsi_stmt (gsi); local
361 tree arg = PHI_ARG_DEF (phi, e->dest_idx);
362 tree res = PHI_RESULT (phi);
[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.old/dist/gcc/analyzer/ |
| program-point.cc | 141 const gphi *phi = gpi.phi (); local
142 pp_gimple_stmt_1 (pp, phi, 0, (dump_flags_t)0);
|
