Home
last modified time | relevance | path

Searched refs:phi (Results 1 – 25 of 72) sorted by relevance

123

/freebsd-12.1/contrib/gcc/
H A Dtree-phinodes.c133 tree phi; in allocate_phi_node() local
164 return phi; in allocate_phi_node()
206 tree phi; in make_phi_node() local
225 SET_PHI_RESULT (phi, make_ssa_name (var, phi)); in make_phi_node()
236 return phi; in make_phi_node()
351 tree phi; in create_phi_node() local
362 return phi; in create_phi_node()
380 gcc_assert (PHI_NUM_ARGS (phi) <= PHI_ARG_CAPACITY (phi)); in add_phi_arg()
436 tree phi; in remove_phi_args() local
438 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in remove_phi_args()
[all …]
H A Dtree-cfgcleanup.c359 tree phi; in phi_alternatives_equal() local
361 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in phi_alternatives_equal()
386 tree phi; in remove_forwarder_block() local
457 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in remove_forwarder_block()
458 add_phi_arg (phi, PHI_ARG_DEF (phi, succ->dest_idx), s); in remove_forwarder_block()
657 tree phi; in remove_forwarder_block_with_phi() local
685 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in remove_forwarder_block_with_phi()
709 add_phi_arg (phi, def, s); in remove_forwarder_block_with_phi()
796 tree phi; in merge_phi_nodes() local
804 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in merge_phi_nodes()
[all …]
H A Dtree-tailcall.c362 tree phi; in propagate_through_phis() local
364 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in propagate_through_phis()
549 tree stmt, var, phi, tmp; in adjust_accumulator_values() local
595 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) in adjust_accumulator_values()
604 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) in adjust_accumulator_values()
721 tree phi; in eliminate_tail_call() local
784 phi = PHI_CHAIN (phi); in eliminate_tail_call()
916 tree phi; in tree_optimize_tail_calls_1() local
934 add_phi_arg (phi, in tree_optimize_tail_calls_1()
939 a_acc = PHI_RESULT (phi); in tree_optimize_tail_calls_1()
[all …]
H A Dtree-ssa-dce.c394 tree phi; in find_obviously_necessary_stmts() local
397 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in find_obviously_necessary_stmts()
399 NECESSARY (phi) = 0; in find_obviously_necessary_stmts()
578 tree phi; in mark_really_necessary_kill_operand_phis() local
580 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in mark_really_necessary_kill_operand_phis()
582 if (!is_gimple_reg (PHI_RESULT (phi)) && NECESSARY (phi)) in mark_really_necessary_kill_operand_phis()
668 tree prev, phi; in remove_dead_phis() local
672 while (phi) in remove_dead_phis()
689 phi = next; in remove_dead_phis()
693 prev = phi; in remove_dead_phis()
[all …]
H A Dtree-ssa.c56 tree phi; in ssa_redirect_edge() local
61 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in ssa_redirect_edge()
67 dst = PHI_RESULT (phi); in ssa_redirect_edge()
85 tree phi, arg; in flush_pending_stmts() local
91 phi; in flush_pending_stmts()
92 phi = PHI_CHAIN (phi), arg = TREE_CHAIN (arg)) in flush_pending_stmts()
95 add_phi_arg (phi, def, e); in flush_pending_stmts()
715 tree phi; in verify_ssa() local
731 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in verify_ssa()
1266 tree phi; in execute_late_warn_uninitialized() local
[all …]
H A Dtree-if-conv.c498 tree phi; in if_convertible_loop_p() local
567 phi = phi_nodes (bb); in if_convertible_loop_p()
570 if (phi) in if_convertible_loop_p()
575 for (; phi; phi = PHI_CHAIN (phi)) in if_convertible_loop_p()
812 bb = bb_for_stmt (phi); in replace_phi_with_cond_modify_expr()
862 tree phi, cond; in process_phi_nodes() local
870 phi = phi_nodes (bb); in process_phi_nodes()
875 if (phi) in process_phi_nodes()
878 while (phi) in process_phi_nodes()
882 release_phi_node (phi); in process_phi_nodes()
[all …]
H A Dtree-outof-ssa.c364 tree phi; in eliminate_build() local
370 for (phi = phi_nodes (B); phi; phi = PHI_CHAIN (phi)) in eliminate_build()
594 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in coalesce_abnormal_edges()
683 tree phi; in coalesce_phi_operands() local
687 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in coalesce_phi_operands()
1099 for (phi = phi_nodes (bb); phi; phi = next) in eliminate_virtual_phis()
1163 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in coalesce_vars()
1867 tree phi; in rewrite_trees() local
1878 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rewrite_trees()
2407 for (phi = phi_nodes (bb); phi; phi = next) in remove_ssa_form()
[all …]
H A Dtree-ssa-phiopt.c157 tree phi; in tree_ssa_phiopt() local
214 phi = phi_nodes (bb2); in tree_ssa_phiopt()
219 if (!phi || PHI_CHAIN (phi) != NULL) in tree_ssa_phiopt()
325 edge e, tree phi, tree new) in replace_phi_edge_with_variable() argument
375 edge e0, edge e1, tree phi, in conditional_replacement() argument
403 result = PHI_RESULT (phi); in conditional_replacement()
545 edge e0, edge e1, tree phi, in value_replacement() argument
623 edge e0, edge e1, tree phi, in minmax_replacement() argument
641 result = PHI_RESULT (phi); in minmax_replacement()
875 tree phi, tree arg0, tree arg1) in abs_replacement() argument
[all …]
H A Dtree-ssa-loop-manip.c129 tree phi, def_stmt = SSA_NAME_DEF_STMT (use); in add_exit_phis_edge() local
147 phi = create_phi_node (use, exit); in add_exit_phis_edge()
148 create_new_def_for (PHI_RESULT (phi), phi, PHI_RESULT_PTR (phi)); in add_exit_phis_edge()
150 add_phi_arg (phi, use, e); in add_exit_phis_edge()
283 tree phi; in find_uses_to_rename_bb() local
286 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in find_uses_to_rename_bb()
423 tree phi; in verify_loop_closed_ssa() local
433 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in verify_loop_closed_ssa()
436 PHI_ARG_DEF (phi, i)); in verify_loop_closed_ssa()
451 tree phi, new_phi, new_name, name; in split_loop_exit_edge() local
[all …]
H A Dtree-vectorizer.c221 tree phi; in rename_variables_in_bb() local
242 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in rename_variables_in_bb()
835 tree phi, phi_arg; in slpeel_tree_duplicate_loop_to_edge_cfg() local
871 for (phi = phi_nodes (exit_dest); phi; phi = PHI_CHAIN (phi)) in slpeel_tree_duplicate_loop_to_edge_cfg()
912 for (phi = phi_nodes (loop->header); phi; phi = PHI_CHAIN (phi)) in slpeel_tree_duplicate_loop_to_edge_cfg()
1400 tree phi; in new_loop_vec_info() local
1402 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in new_loop_vec_info()
1460 tree phi; in destroy_loop_vec_info() local
1463 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in destroy_loop_vec_info()
1941 && def2 == phi) in vect_is_simple_reduction()
[all …]
H A Dtree-ssa-live.c356 tree phi, def; in remove_unused_locals() local
362 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in remove_unused_locals()
436 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in create_ssa_var_map()
666 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in calculate_live_on_entry()
691 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in calculate_live_on_entry()
781 phi && !ok; in calculate_live_on_entry()
782 phi = PHI_CHAIN (phi)) in calculate_live_on_entry()
820 tree t, phi; in calculate_live_on_exit() local
831 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in calculate_live_on_exit()
1425 tree phi; in build_tree_conflict_graph() local
[all …]
H A Dtree-into-ssa.c416 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in initialize_flags_in_bb()
1133 tree phi; in insert_phi_nodes_for() local
1297 tree phi; in rewrite_initialize_block() local
1308 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rewrite_initialize_block()
1410 tree phi; in rewrite_add_phi_arguments() local
1412 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in rewrite_add_phi_arguments()
1626 tree phi; in rewrite_update_init_block() local
1655 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rewrite_update_init_block()
1860 tree phi; in rewrite_update_phi_arguments() local
2225 tree phi; in prepare_block_for_update() local
[all …]
H A Dtree-vect-analyze.c238 tree phi; in vect_analyze_operations() local
252 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_analyze_operations()
254 stmt_info = vinfo_for_stmt (phi); in vect_analyze_operations()
258 print_generic_expr (vect_dump, phi, TDF_SLIM); in vect_analyze_operations()
501 tree phi; in vect_analyze_scalar_cycles() local
509 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_analyze_scalar_cycles()
512 tree def = PHI_RESULT (phi); in vect_analyze_scalar_cycles()
1621 tree phi; in vect_mark_stmts_to_be_vectorized() local
1634 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_mark_stmts_to_be_vectorized()
1791 tree phi; in vect_can_advance_ivs_p() local
[all …]
H A Dtree-ssa-propagate.c407 tree phi; in simulate_block() local
418 for (phi = phi_nodes (block); phi; phi = PHI_CHAIN (phi)) in simulate_block()
419 simulate_stmt (phi); in simulate_block()
1006 prev_phi = unshare_expr (phi); in replace_phi_args_in()
1008 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in replace_phi_args_in()
1010 tree arg = PHI_ARG_DEF (phi, i); in replace_phi_args_in()
1030 && PHI_ARG_EDGE (phi, i)->flags & EDGE_ABNORMAL) in replace_phi_args_in()
1041 print_generic_stmt (dump_file, phi, TDF_SLIM); in replace_phi_args_in()
1122 tree phi; in substitute_and_fold() local
1126 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in substitute_and_fold()
[all …]
H A Dtree-ssa-dom.c724 tree phi; in record_equivalences_from_phis() local
726 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in record_equivalences_from_phis()
1181 tree lhs, rhs, preinc, phi; in simple_iv_increment_p() local
1226 tree phi; in cprop_into_successor_phis() local
1235 if (! phi) in cprop_into_successor_phis()
1239 for ( ; phi; phi = PHI_CHAIN (phi)) in cprop_into_successor_phis()
2294 tree phi; in propagate_rhs_into_lhs() local
2299 phi; in propagate_rhs_into_lhs()
2300 phi = PHI_CHAIN (phi)) in propagate_rhs_into_lhs()
2395 tree phi, next; in eliminate_degenerate_phis_1() local
[all …]
H A Dtree-ssa-copyrename.c301 tree phi, stmt, var, part_var; in rename_ssa_copies() local
332 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rename_ssa_copies()
335 tree res = PHI_RESULT (phi); in rename_ssa_copies()
341 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in rename_ssa_copies()
343 tree arg = PHI_ARG_DEF (phi, i); in rename_ssa_copies()
H A Dtree-ssa-copy.c764 copy_prop_visit_phi_node (tree phi) in copy_prop_visit_phi_node() argument
771 lhs = PHI_RESULT (phi); in copy_prop_visit_phi_node()
780 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in copy_prop_visit_phi_node()
783 tree arg = PHI_ARG_DEF (phi, i); in copy_prop_visit_phi_node()
784 edge e = PHI_ARG_EDGE (phi, i); in copy_prop_visit_phi_node()
894 tree phi, def; in init_copy_prop() local
929 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in init_copy_prop()
931 def = PHI_RESULT (phi); in init_copy_prop()
933 DONT_SIMULATE_AGAIN (phi) = true; in init_copy_prop()
935 DONT_SIMULATE_AGAIN (phi) = false; in init_copy_prop()
[all …]
H A Dtree-scalar-evolution.c414 loop_phi_node_p (tree phi) in loop_phi_node_p() argument
420 return loop_containing_stmt (phi)->header == bb_for_stmt (phi); in loop_phi_node_p()
2103 tree phi; in loop_closed_phi_def() local
2114 for (phi = phi_nodes (exit->dest); phi; phi = PHI_CHAIN (phi)) in loop_closed_phi_def()
2116 return PHI_RESULT (phi); in loop_closed_phi_def()
2676 tree phi, chrec; in analyze_scalar_evolution_for_all_loop_phi_nodes() local
2681 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in analyze_scalar_evolution_for_all_loop_phi_nodes()
2902 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in scev_const_prop()
2904 name = PHI_RESULT (phi); in scev_const_prop()
2982 for (phi = phi_nodes (exit->dest); phi; phi = next_phi) in scev_const_prop()
[all …]
H A Dtree-ssa-uncprop.c479 tree phi = phi_nodes (e->dest); in uncprop_into_successor_phis() local
483 if (!phi) in uncprop_into_successor_phis()
494 for ( ; phi; phi = PHI_CHAIN (phi)) in uncprop_into_successor_phis()
497 tree arg = PHI_ARG_DEF (phi, e->dest_idx); in uncprop_into_successor_phis()
505 && SSA_NAME_VAR (arg) != SSA_NAME_VAR (PHI_RESULT (phi))) in uncprop_into_successor_phis()
527 if (SSA_NAME_VAR (equiv) == SSA_NAME_VAR (PHI_RESULT (phi))) in uncprop_into_successor_phis()
529 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv); in uncprop_into_successor_phis()
H A Dtree-flow-inline.h515 get_phi_result_ptr (tree phi) in get_phi_result_ptr() argument
517 return &(PHI_RESULT_TREE (phi)); in get_phi_result_ptr()
550 tree phi; in set_phi_nodes() local
553 for (phi = l; phi; phi = PHI_CHAIN (phi)) in set_phi_nodes()
554 set_bb_for_stmt (phi, bb); in set_phi_nodes()
564 tree phi; in phi_arg_index_from_use() local
570 phi = USE_STMT (use); in phi_arg_index_from_use()
574 root = &(PHI_ARG_ELT (phi, 0)); in phi_arg_index_from_use()
1251 tree phi_def = PHI_RESULT (phi); in op_iter_init_phiuse()
1268 ptr->phi_stmt = phi; in op_iter_init_phiuse()
[all …]
H A Dtree-ssa-dse.c371 tree phi; in dse_record_phis() local
373 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in dse_record_phis()
374 if (!is_gimple_reg (PHI_RESULT (phi))) in dse_record_phis()
377 get_stmt_uid (phi)); in dse_record_phis()
H A Dlambda-code.c1218 tree phi; in gcc_loop_to_lambda_loop() local
1254 if (TREE_CODE (phi) != PHI_NODE) in gcc_loop_to_lambda_loop()
1256 phi = SINGLE_SSA_TREE_OPERAND (phi, SSA_OP_USE); in gcc_loop_to_lambda_loop()
1257 if (!phi) in gcc_loop_to_lambda_loop()
1267 phi = SSA_NAME_DEF_STMT (phi); in gcc_loop_to_lambda_loop()
1315 if (PHI_NUM_ARGS (phi) != 2) in gcc_loop_to_lambda_loop()
2283 tree exit_condition, phi; in can_convert_to_perfect_nest() local
2392 for (phi = phi_nodes (exitdest); phi; phi = PHI_CHAIN (phi)) in can_convert_to_perfect_nest()
2393 if (PHI_NUM_ARGS (phi) != 1) in can_convert_to_perfect_nest()
2458 tree phi; in perfect_nestify() local
[all …]
/freebsd-12.1/contrib/bearssl/src/rsa/
H A Drsa_i31_privexp.c62 uint32_t *p, *q, *k, *m, *z, *phi; in br_rsa_i31_compute_privexp() local
125 phi = q + 1 + qlen; in br_rsa_i31_compute_privexp()
126 br_i31_zero(phi, p[0]); in br_rsa_i31_compute_privexp()
127 br_i31_mulacc(phi, p, q); in br_rsa_i31_compute_privexp()
128 len = (phi[0] + 31) >> 5; in br_rsa_i31_compute_privexp()
129 memmove(tmp, phi, (1 + len) * sizeof *phi); in br_rsa_i31_compute_privexp()
130 phi = tmp; in br_rsa_i31_compute_privexp()
131 phi[0] = br_i31_bit_length(phi + 1, len); in br_rsa_i31_compute_privexp()
132 len = (phi[0] + 31) >> 5; in br_rsa_i31_compute_privexp()
150 lo = (r << 31) + phi[u]; in br_rsa_i31_compute_privexp()
[all …]
H A Drsa_i15_privexp.c62 uint16_t *p, *q, *k, *m, *z, *phi; in br_rsa_i15_compute_privexp() local
125 phi = q + 1 + qlen; in br_rsa_i15_compute_privexp()
126 br_i15_zero(phi, p[0]); in br_rsa_i15_compute_privexp()
127 br_i15_mulacc(phi, p, q); in br_rsa_i15_compute_privexp()
128 len = (phi[0] + 15) >> 4; in br_rsa_i15_compute_privexp()
129 memmove(tmp, phi, (1 + len) * sizeof *phi); in br_rsa_i15_compute_privexp()
130 phi = tmp; in br_rsa_i15_compute_privexp()
131 phi[0] = br_i15_bit_length(phi + 1, len); in br_rsa_i15_compute_privexp()
132 len = (phi[0] + 15) >> 4; in br_rsa_i15_compute_privexp()
150 lo = (r << 15) + phi[u]; in br_rsa_i15_compute_privexp()
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp189 MachineBasicBlock::iterator phi = BB->begin(); in runOnMachineFunction() local
190 while (phi != BB->end() && phi->isPHI()) { in runOnMachineFunction()
191 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2) in runOnMachineFunction()
192 if (!preds.count(phi->getOperand(i).getMBB())) { in runOnMachineFunction()
193 phi->RemoveOperand(i); in runOnMachineFunction()
194 phi->RemoveOperand(i-1); in runOnMachineFunction()
198 if (phi->getNumOperands() == 3) { in runOnMachineFunction()
199 const MachineOperand &Input = phi->getOperand(1); in runOnMachineFunction()
200 const MachineOperand &Output = phi->getOperand(0); in runOnMachineFunction()
223 phi++->eraseFromParent(); in runOnMachineFunction()
[all …]

123