Lines Matching defs:phi
496 /* Return a use_operand_p pointer for argument I of PHI node GS. */
504 /* Return the tree operand for argument I of PHI node GS. */
513 /* Return a pointer to the tree operand for argument I of PHI node GS. */
521 /* Return the edge associated with argument I of phi node GS. */
529 /* Return the source location of gimple argument I of phi node GS. */
537 /* Return the source location of the argument on edge E of phi node GS. */
545 /* Set the source location of gimple argument I of phi node GS to LOC. */
553 /* Return TRUE if argument I of phi node GS has a location record. */
562 /* Return the PHI nodes for basic block BB, or NULL if there are no
563 PHI nodes. */
573 /* Set PHI nodes of a basic block BB to SEQ. */
587 /* Return the phi argument which contains the specified use. */
594 gimple phi;
596 /* Since the use is the first thing in a PHI argument element, we can
600 phi = USE_STMT (use);
601 gcc_assert (gimple_code (phi) == GIMPLE_PHI);
604 root = gimple_phi_arg (phi, 0);
612 gcc_assert (index < gimple_phi_capacity (phi));
639 /* PHI nodes should contain only ssa_names and invariants. A test
1156 /* If there is a single DEF in the PHI node which matches FLAG, return it.
1169 /* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
1172 op_iter_init_phiuse (ssa_op_iter *ptr, gimple phi, int flags)
1174 tree phi_def = gimple_phi_result (phi);
1184 /* If the PHI node doesn't the operand type we care about, we're done. */
1191 ptr->phi_stmt = phi;
1192 ptr->num_phi = gimple_phi_num_args (phi);
1198 /* Start an iterator for a PHI definition. */
1201 op_iter_init_phidef (ssa_op_iter *ptr, gimple phi, int flags)
1203 tree phi_def = PHI_RESULT (phi);
1213 /* If the PHI node doesn't the operand type we care about, we're done. */
1224 return PHI_RESULT_PTR (phi);
1493 /* Given an edge_var_map V, return the PHI arg definition. */
1501 /* Given an edge_var_map V, return the PHI result. */
1509 /* Given an edge_var_map V, return the PHI arg location. */
