/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/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 404 remove_phi_arg_num(tree phi, int i) argument 433 tree phi; local 443 remove_phi_node(tree phi, tree prev) argument 473 phi_reverse(tree phi) argument [all...] |
H A D | tree-tailcall.c | 363 tree phi; local 365 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 366 if (PHI_ARG_DEF_FROM_EDGE (phi, e) == var) 367 return PHI_RESULT (phi); 453 /* The parameter should be a real operand, so that phi node 545 the phi nodes on edge BACK. */ 550 tree stmt, var, phi, tm local 703 tree phi; local 873 tree stmt, param, ret_type, tmp, phi; local 918 tree phi; local [all...] |
H A D | tree-ssa-loop-manip.c | 126 tree phi, def_stmt = SSA_NAME_DEF_STMT (use); local 144 phi = create_phi_node (use, exit); 145 create_new_def_for (PHI_RESULT (phi), phi, PHI_RESULT_PTR (phi)); local 147 add_phi_arg (phi, use, e); 280 tree phi; local 283 for (phi = phi_nodes (e->dest); phi; phi 420 tree phi; local 448 tree phi, new_phi, new_name, name; local [all...] |
H A D | tree-cfgcleanup.c | 339 tree phi; local 341 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 343 tree val1 = PHI_ARG_DEF (phi, n1); 344 tree val2 = PHI_ARG_DEF (phi, n2); 366 tree phi; local 386 dest, problems might occur during removal of the phi node at out 395 no abnormal edge to DEST and there are no phi node 637 tree phi; local [all...] |
H A D | tree-ssa-dce.c | 253 if we should only mark it necessary if it is a phi node. */ 413 tree phi; 416 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 418 NECESSARY (phi) = 0; 426 if (is_gimple_reg (PHI_RESULT (phi)) 427 && is_global_var (SSA_NAME_VAR (PHI_RESULT (phi)))) 428 mark_stmt_necessary (phi, tru 408 tree phi; local 591 tree phi; local 681 tree prev, phi; local [all...] |
H A D | tree-ssa-phiopt.c | 156 tree phi; local 213 phi = phi_nodes (bb2); 218 if (!phi || PHI_CHAIN (phi) != NULL) 221 arg0 = PHI_ARG_DEF_TREE (phi, e1->dest_idx); 222 arg1 = PHI_ARG_DEF_TREE (phi, e2->dest_idx); 229 if (conditional_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) 231 else if (value_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) 233 else if (abs_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) 236 minmax_replacement (bb, bb1, e1, e2, phi, arg 319 replace_phi_edge_with_variable(basic_block cond_block, edge e, tree phi, tree new) argument 369 conditional_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument 539 value_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument 617 minmax_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument 868 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 | 365 tree phi; local 371 for (phi = phi_nodes (B); phi; phi = PHI_CHAIN (phi)) 373 T0 = var_to_partition_to_var (g->map, PHI_RESULT (phi)); 379 Ti = PHI_ARG_DEF (phi, g->e->dest_idx); 494 /* Eliminate all the phi nodes on edge E in graph G. */ 585 tree phi, var, tmp; local 596 for (phi 685 tree phi; local 1097 tree phi, next; local 1162 tree phi, arg; local 1842 tree phi; local 1851 tree phi; local 2322 tree phi, next; local 2420 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 676 tree phi; local 1189 warn_uninitialized_phi(tree phi) argument 1225 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 | 300 tree phi, stmt, var, part_var; local 331 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 334 tree res = PHI_RESULT (phi); 340 for (i = 0; i < PHI_NUM_ARGS (phi); i++) 342 tree arg = PHI_ARG_DEF (phi, i);
|
H A D | tree-ssa-propagate.c | 386 tree phi; local 397 for (phi = phi_nodes (block); phi; phi = PHI_CHAIN (phi)) 398 simulate_stmt (phi); 968 replace_phi_args_in (tree phi, prop_value_t *prop_value) argument 975 prev_phi = unshare_expr (phi); 977 for (i = 0; i < PHI_NUM_ARGS (phi); i++) 979 tree arg = PHI_ARG_DEF (phi, 1091 tree phi; local [all...] |
H A D | tree-into-ssa.c | 796 tree phi; local 826 phi = create_phi_node (var, bb); 827 new_lhs = duplicate_ssa_name (var, phi); 828 SET_PHI_RESULT (phi, new_lhs); 838 add_phi_arg (phi, var, e); 843 phi = create_phi_node (sym, bb); 847 REGISTER_DEFS_IN_THIS_STMT (phi) = 1; 848 REWRITE_THIS_STMT (phi) = 1; 959 tree phi; local 970 for (phi 1071 tree phi; local 1287 tree phi; local 1514 tree phi; local 1868 tree phi; local 2675 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 1396 tree phi; local 1456 tree phi; local 1790 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 373 tree phi; local 375 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 376 if (!is_gimple_reg (PHI_RESULT (phi))) 379 get_stmt_uid (phi));
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | tree-phinodes.c | 132 gimple phi; local 148 phi = VEC_pop (gimple, free_phinodes[bucket]); 157 phi = (gimple) ggc_alloc (size); 168 return phi; 210 gimple phi; local 215 phi = allocate_phi_node (capacity); 220 memset (phi, 0, (sizeof (struct gimple_statement_phi) 223 phi->gsbase.code = GIMPLE_PHI; 224 phi->gimple_phi.nargs = len; 225 phi 249 release_phi_node(gimple phi) argument 273 resize_phi_node(gimple *phi, size_t len) argument 357 add_phi_node_to_bb(gimple phi, basic_block bb) argument 377 gimple phi = make_phi_node (var, EDGE_COUNT (bb->preds)); local 391 add_phi_arg(gimple phi, tree def, edge e, source_location locus) argument 424 remove_phi_arg_num(gimple phi, int i) argument 475 gimple phi = gsi_stmt (*gsi); local [all...] |
H A D | tree-ssa-phiprop.c | 130 /* Insert a new phi node for the dereference of PHI at basic_block 134 phiprop_insert_phi (basic_block bb, gimple phi, gimple use_stmt, argument 164 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e); 165 locus = gimple_phi_arg_location_from_edge (phi, e); 180 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e), 0); 210 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e), 0); 227 /* Propagate between the phi node arguments of PHI in BB and phi result 242 propagate_with_phi (basic_block bb, gimple phi, struct phiprop_d *phivn, argument 245 tree ptr = PHI_RESULT (phi); [all...] |
H A D | tree-outof-ssa.c | 505 gimple phi = gsi_stmt (gsi); local 508 p0 = var_to_partition (g->map, gimple_phi_result (phi)); 513 Ti = PHI_ARG_DEF (phi, g->e->dest_idx); 514 locus = gimple_phi_arg_location_from_edge (phi, g->e); 649 /* Eliminate all the phi nodes on edge E in graph G. */ 708 remove_gimple_phi_args (gimple phi) argument 716 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); 719 FOR_EACH_PHI_ARG (arg_p, phi, iter, SSA_OP_USE) 759 gimple phi = gsi_stmt (gsi); local 760 result = gimple_phi_result (phi); 818 gimple phi = gsi_stmt (gsi); local 1025 gimple phi = gsi_stmt (gsi); local [all...] |
H A D | tree-ssa-dce.c | 418 gimple phi, stmt; local 425 phi = gsi_stmt (gsi); 426 gimple_set_plf (phi, STMT_NECESSARY, false); 610 degenerate_phi_p (gimple phi) argument 613 tree op = gimple_phi_arg_def (phi, 0); 614 for (i = 1; i < gimple_phi_num_args (phi); i++) 615 if (gimple_phi_arg_def (phi, i) != op) 831 mark_virtual_phi_result_for_renaming (gimple phi) argument 842 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); 846 result_ssa = gimple_phi_result (phi); 866 gimple phi; local 949 gimple phi = gsi_stmt (gsi); local [all...] |
H A D | sese.c | 361 gimple phi = create_phi_node (use, exit); local 363 create_new_def_for (gimple_phi_result (phi), phi, 364 gimple_phi_result_ptr (phi)); 365 add_phi_arg (phi, use, false_e, UNKNOWN_LOCATION); 366 add_phi_arg (phi, use, true_e, UNKNOWN_LOCATION); 369 /* Insert in the block BB phi nodes for variables defined in REGION 451 /* Adjust a virtual phi node PHI that is placed at the end of the 463 sese_adjust_vphi (sese region, gimple phi, edge true_e) 467 gcc_assert (gimple_phi_num_args (phi) 359 gimple phi = create_phi_node (use, exit); local 461 sese_adjust_vphi(sese region, gimple phi, edge true_e) argument 610 gimple phi = gsi_stmt (si); local 1232 gimple phi = create_phi_node (new_name, bb); local 1335 gimple phi; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/opt/ |
H A D | reg-stack4.C | 24 double phi = vecdca.data; local 26 ext1 (phi*2);
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/g++.dg/opt/ |
H A D | reg-stack4.C | 24 double phi = vecdca.data; local 26 ext1 (phi*2);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | loadpre8.c | 91 tree phi; local 92 for (phi = phi_nodes (e->dest); phi; phi = (((phi))->common.chain)) 93 get_reaching_def ((get_def_from_ptr (get_phi_result_ptr (phi)))->ssa_name.var);
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/s390/ |
H A D | addmul_1.asm | 39 alr 0,6 # add vlimb to phi 42 alr 0,6 # conditionally add vlimb to phi 45 ahi 0,1 # increment phi 49 ahi 0,1 # increment phi 65 alr 0,6 # conditionally add vlimb to phi 68 ahi 0,1 # increment phi 72 ahi 0,1 # increment phi
|
H A D | submul_1.asm | 39 alr 0,6 # add vlimb to phi 42 alr 0,6 # conditionally add vlimb to phi 45 ahi 0,1 # increment phi 49 ahi 0,1 # increment phi 65 alr 0,6 # conditionally add vlimb to phi 68 ahi 0,1 # increment phi 72 ahi 0,1 # increment phi
|
H A D | mul_1.asm | 39 alr 0,6 # add vlimb to phi 42 alr 0,6 # conditionally add vlimb to phi 45 ahi 0,1 # increment phi 61 alr 0,6 # conditionally add vlimb to phi 64 ahi 0,1 # increment phi
|