/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-phinodes.c | 133 tree phi; local 148 phi = free_phinodes[bucket]; 156 phi = ggc_alloc (size); 164 return phi; 206 tree phi; local 211 phi = allocate_phi_node (capacity); 216 memset (phi, 0, (sizeof (struct tree_phi_node) - sizeof (struct phi_arg_d) 218 TREE_SET_CODE (phi, PHI_NODE); 219 PHI_NUM_ARGS (phi) = len; 220 PHI_ARG_CAPACITY (phi) 242 release_phi_node(tree phi) argument 266 resize_phi_node(tree *phi, int len) argument 351 tree phi; local 372 add_phi_arg(tree phi, tree def, edge e) argument 403 remove_phi_arg_num(tree phi, int i) argument 436 tree phi; local 446 remove_phi_node(tree phi, tree prev) argument 476 phi_reverse(tree phi) argument [all...] |
H A D | tree-cfgcleanup.c | 359 tree phi; local 361 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 363 tree val1 = PHI_ARG_DEF (phi, n1); 364 tree val2 = PHI_ARG_DEF (phi, n2); 386 tree phi; local 406 dest, problems might occur during removal of the phi node at out 415 no abnormal edge to DEST and there are no phi node 657 tree phi; local 796 tree phi; local [all...] |
H A D | tree-tailcall.c | 362 tree phi; local 364 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 365 if (PHI_ARG_DEF_FROM_EDGE (phi, e) == var) 366 return PHI_RESULT (phi); 452 /* The parameter should be a real operand, so that phi node 544 the phi nodes on edge BACK. */ 549 tree stmt, var, phi, tm local 721 tree phi; local 876 tree stmt, param, ret_type, tmp, phi; local 916 tree phi; local [all...] |
H A D | tree-ssa-dce.c | 248 if we should only mark it necessary if it is a phi node. */ 399 tree phi; 402 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 404 NECESSARY (phi) = 0; 412 if (is_gimple_reg (PHI_RESULT (phi)) 413 && is_global_var (SSA_NAME_VAR (PHI_RESULT (phi)))) 414 mark_stmt_necessary (phi, tru 394 tree phi; local 578 tree phi; local 668 tree prev, phi; local [all...] |
H A D | tree-ssa-phiopt.c | 157 tree phi; local 214 phi = phi_nodes (bb2); 219 if (!phi || PHI_CHAIN (phi) != NULL) 222 arg0 = PHI_ARG_DEF_TREE (phi, e1->dest_idx); 223 arg1 = PHI_ARG_DEF_TREE (phi, e2->dest_idx); 230 if (conditional_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) 232 else if (value_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) 234 else if (abs_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) 236 else if (minmax_replacement (bb, bb1, e1, e2, phi, arg 324 replace_phi_edge_with_variable(basic_block cond_block, edge e, tree phi, tree new) argument 374 conditional_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument 544 value_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument 622 minmax_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument 873 abs_replacement(basic_block cond_bb, basic_block middle_bb, edge e0 ATTRIBUTE_UNUSED, edge e1, tree phi, tree arg0, tree arg1) argument [all...] |
H A D | tree-outof-ssa.c | 364 tree phi; local 370 for (phi = phi_nodes (B); phi; phi = PHI_CHAIN (phi)) 372 T0 = var_to_partition_to_var (g->map, PHI_RESULT (phi)); 378 Ti = PHI_ARG_DEF (phi, g->e->dest_idx); 493 /* Eliminate all the phi nodes on edge E in graph G. */ 583 tree phi, var, tmp; local 594 for (phi 683 tree phi; local 1095 tree phi, next; local 1160 tree phi, arg; local 1867 tree phi; local 1876 tree phi; local 2345 tree phi, next; local 2437 tree phi; local [all...] |
H A D | tree-ssa.c | 56 tree phi; local 61 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 63 if (PHI_ARG_DEF (phi, e->dest_idx) == NULL_TREE) 66 src = PHI_ARG_DEF (phi, e->dest_idx); 67 dst = PHI_RESULT (phi); 85 tree phi, arg; local 90 for (phi 304 verify_phi_args(tree phi, basic_block bb, basic_block *definition_block) argument 715 tree phi; local 1229 warn_uninitialized_phi(tree phi) argument 1266 tree phi; local [all...] |
H A D | tree-if-conv.c | 35 o Replace phi nodes with conditional modify expr 302 if_convertible_phi_p (struct loop *loop, basic_block bb, tree phi) argument 307 print_generic_stmt (dump_file, phi, TDF_SLIM); 310 if (bb != loop->header && PHI_NUM_ARGS (phi) != 2) 313 fprintf (dump_file, "More than two phi node args.\n"); 317 if (!is_gimple_reg (SSA_NAME_VAR (PHI_RESULT (phi)))) 321 FOR_EACH_IMM_USE_FAST (use_p, imm_iter, PHI_RESULT (phi)) argument 326 fprintf (dump_file, "Difficult to handle this virtual phi.\n"); 490 - If its basic blocks and phi nodes are if convertible. See above for 498 tree phi; local 798 replace_phi_with_cond_modify_expr(tree phi, tree cond, basic_block true_bb, block_stmt_iterator *bsi) argument 862 tree phi, cond; local [all...] |
H A D | tree-ssa-copyrename.c | 301 tree phi, stmt, var, part_var; local 332 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 335 tree res = PHI_RESULT (phi); 341 for (i = 0; i < PHI_NUM_ARGS (phi); i++) 343 tree arg = PHI_ARG_DEF (phi, i);
|
H A D | tree-ssa-propagate.c | 391 tree phi; local 402 for (phi = phi_nodes (block); phi; phi = PHI_CHAIN (phi)) 403 simulate_stmt (phi); 983 replace_phi_args_in (tree phi, prop_value_t *prop_value) argument 990 prev_phi = unshare_expr (phi); 992 for (i = 0; i < PHI_NUM_ARGS (phi); i++) 994 tree arg = PHI_ARG_DEF (phi, 1106 tree phi; local [all...] |
H A D | tree-into-ssa.c | 124 /* For each block, the phi nodes that need to be rewritten are stored into 413 tree phi, stmt; local 416 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 418 REWRITE_THIS_STMT (phi) = 0; 419 REGISTER_DEFS_IN_THIS_STMT (phi) = 0; 826 /* Clean bits from PHIS for phi nodes whose value cannot be used in USES. 849 /* The phi mus 1092 mark_phi_for_rewrite(basic_block bb, tree phi) argument 1133 tree phi; local 1297 tree phi; local 1410 tree phi; local 1626 tree phi; local 1860 tree phi; local 2225 tree phi; local [all...] |
H A D | tree-vectorizer.c | 222 tree phi; 243 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 244 rename_use_op (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e)); 287 step 1. For each loop-header-phi: 288 Add the first phi argument for the phi in NEW_LOOP 291 step 2. For each loop-header-phi 221 tree phi; local 835 tree phi, phi_arg; local 1400 tree phi; local 1460 tree phi; local 1812 vect_is_simple_reduction(struct loop *loop, tree phi) argument [all...] |
H A D | tree-ssa-dse.c | 105 static unsigned max_stmt_uid; /* Maximal uid of a statement. Uids to phi 371 tree phi; local 373 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 374 if (!is_gimple_reg (PHI_RESULT (phi))) 377 get_stmt_uid (phi));
|
H A D | tree-ssa-live.c | 356 tree phi, def; local 362 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 368 if (is_global_var (SSA_NAME_VAR (PHI_RESULT (phi)))) 371 def = PHI_RESULT (phi); 374 FOR_EACH_PHI_ARG (arg_p, phi, i, SSA_OP_ALL_USES) 434 tree phi, arg; local 436 for (phi 646 tree phi, var, stmt; local 820 tree t, phi; local 1425 tree phi; local [all...] |
H A D | tree-ssa-loop-manip.c | 129 tree phi, def_stmt = SSA_NAME_DEF_STMT (use); local 147 phi = create_phi_node (use, exit); 148 create_new_def_for (PHI_RESULT (phi), phi, PHI_RESULT_PTR (phi)); local 150 add_phi_arg (phi, use, e); 283 tree phi; local 286 for (phi = phi_nodes (e->dest); phi; phi 423 tree phi; local 451 tree phi, new_phi, new_name, name; local [all...] |
H A D | tree-vect-analyze.c | 238 tree phi; local 252 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 254 stmt_info = vinfo_for_stmt (phi); 257 fprintf (vect_dump, "examining phi: "); 258 print_generic_expr (vect_dump, phi, TDF_SLIM); 501 tree phi; local 509 for (phi 1621 tree phi; local 1791 tree phi; local [all...] |
H A D | tree-ssa-copy.c | 764 copy_prop_visit_phi_node (tree phi) argument 771 lhs = PHI_RESULT (phi); 776 print_generic_expr (dump_file, phi, dump_flags); 780 for (i = 0; i < PHI_NUM_ARGS (phi); i++) 783 tree arg = PHI_ARG_DEF (phi, i); 784 edge e = PHI_ARG_EDGE (phi, i); 894 tree phi, def; local 929 for (phi = phi_nodes (bb); phi; phi [all...] |
H A D | tree-ssa-loop-ivcanon.c | 403 tree phi, def; local 420 /* Values of all loop exit phi nodes must be invariants. */ 421 for (phi = phi_nodes (exit->dest); phi; phi = PHI_CHAIN (phi)) 423 if (!is_gimple_reg (PHI_RESULT (phi))) 426 def = PHI_ARG_DEF_FROM_EDGE (phi, exit);
|
H A D | tree-ssa-threadedge.c | 165 tree phi; local 170 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 172 tree src = PHI_ARG_DEF_FROM_EDGE (phi, e); 173 tree dst = PHI_RESULT (phi);
|
H A D | tree-ssa-dom.c | 724 tree phi; local 726 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 728 tree lhs = PHI_RESULT (phi); 732 for (i = 0; i < PHI_NUM_ARGS (phi); i++) 734 tree t = PHI_ARG_DEF (phi, i); 764 if (i == PHI_NUM_ARGS (phi) 1175 i_1 = phi ( 1181 tree lhs, rhs, preinc, phi; local 1226 tree phi; local 2056 degenerate_phi_result(tree phi) argument 2294 tree phi; local 2395 tree phi, next; local [all...] |
H A D | tree-scalar-evolution.c | 59 - When the definition is a condition-phi-node: determine the 60 evolution function for all the branches of the phi node, and 63 - When the definition is a loop-phi-node: determine its initial 67 another loop-phi-node of the same analyzed loop. If the reached 68 loop-phi-node is not the starting loop-phi-node, then we keep 70 loop-phi-node is the same as the starting one, then we compute a 80 | b = phi (a, c) 92 Following the SSA edge, we end on a loop-phi-node "b = phi ( 414 loop_phi_node_p(tree phi) argument 1220 backedge_phi_arg_p(tree phi, int i) argument 2103 tree phi; local 2676 tree phi, chrec; local 2890 tree name, phi, next_phi, type, ev; local [all...] |
H A D | tree-ssa-uncprop.c | 479 tree phi = phi_nodes (e->dest); local 483 if (!phi) 494 for ( ; phi; phi = PHI_CHAIN (phi)) 497 tree arg = PHI_ARG_DEF (phi, e->dest_idx); 505 && SSA_NAME_VAR (arg) != SSA_NAME_VAR (PHI_RESULT (phi))) 527 if (SSA_NAME_VAR (equiv) == SSA_NAME_VAR (PHI_RESULT (phi))) 529 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
|
H A D | tree-ssa-math-opts.c | 480 tree phi, def; local 482 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 484 def = PHI_RESULT (phi);
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 177 MachineBasicBlock::iterator phi = BB->begin(); local 178 while (phi != BB->end() && phi->isPHI()) { 179 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2) 180 if (!preds.count(phi->getOperand(i).getMBB())) { 181 phi->RemoveOperand(i); 182 phi->RemoveOperand(i-1); 186 if (phi->getNumOperands() == 3) { 187 unsigned Input = phi->getOperand(1).getReg(); 188 unsigned Output = phi [all...] |
/freebsd-9.3-release/contrib/groff/font/devps/generate/ |
H A D | lgreekmap | 19 phi *f
|