| /dragonfly/contrib/gcc-8.0/gcc/config/i386/ |
| HD | x86-tune-sched-atom.c | 48 rtx set, insn1, insn2; in do_reorder_for_imul() local 73 insn2 = PATTERN (insn); in do_reorder_for_imul() 74 if (GET_CODE (insn2) == PARALLEL) in do_reorder_for_imul() 75 insn2 = XVECEXP (insn2, 0, 0); in do_reorder_for_imul() 76 if (GET_CODE (insn2) == SET in do_reorder_for_imul() 77 && GET_CODE (SET_SRC (insn2)) == MULT in do_reorder_for_imul() 78 && GET_MODE (SET_SRC (insn2)) == SImode) in do_reorder_for_imul()
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| HD | sched-ebb.c | 229 rank (rtx_insn *insn1, rtx_insn *insn2) in rank() argument 232 basic_block bb2 = BLOCK_FOR_INSN (insn2); in rank() 343 rtx_insn *insn2 = DEP_CON (fore_dep); in earliest_block_with_similiar_load() local 344 basic_block insn2_block = BLOCK_FOR_INSN (insn2); in earliest_block_with_similiar_load() 353 if (haifa_classify_insn (insn2) != PFREE_CANDIDATE) in earliest_block_with_similiar_load()
|
| HD | lra-remat.c | 461 rtx_insn *insn2 = regno_potential_cand[src_regno].insn; in create_cands() local 463 if (insn2 != NULL in create_cands() 466 && BLOCK_FOR_INSN (insn2) == BLOCK_FOR_INSN (insn)) in create_cands() 468 create_cand (insn2, regno_potential_cand[src_regno].nop, in create_cands() 784 rtx_insn *insn2 = lra_insn_recog_data[uid]->insn; in calculate_gen_cands() local 786 cand = insn_to_cand[INSN_UID (insn2)]; in calculate_gen_cands() 793 || reg_overlap_for_remat_p (reg, insn2)) in calculate_gen_cands() 803 rtx_insn *insn2 = lra_insn_recog_data[uid]->insn; in calculate_gen_cands() local 805 cand = insn_to_cand[INSN_UID (insn2)]; in calculate_gen_cands() 807 if (call_used_input_regno_present_p (insn2)) in calculate_gen_cands()
|
| HD | sched-rgn.c | 1967 rtx_insn *insn2 = DEP_CON (fore_dep); in is_pfree() local 1972 if (haifa_classify_insn (insn2) != PFREE_CANDIDATE) in is_pfree() 1976 if (INSN_BB (insn2) == bb_trg) in is_pfree() 1980 if (*(candp->split_bbs.first_member) == BLOCK_FOR_INSN (insn2)) in is_pfree() 2281 rgn_rank (rtx_insn *insn1, rtx_insn *insn2) in rgn_rank() argument 2284 if (INSN_BB (insn1) != INSN_BB (insn2)) in rgn_rank() 2289 if ((INSN_BB (insn2) == target_bb) && (INSN_BB (insn1) != target_bb)) in rgn_rank() 2291 if ((INSN_BB (insn1) == target_bb) && (INSN_BB (insn2) != target_bb)) in rgn_rank() 2295 spec_val = IS_SPECULATIVE_INSN (insn1) - IS_SPECULATIVE_INSN (insn2); in rgn_rank() 2300 prob_val = INSN_PROBABILITY (insn2) - INSN_PROBABILITY (insn1); in rgn_rank()
|
| HD | haifa-sched.c | 3323 model_order_p (struct model_insn_info *insn1, struct model_insn_info *insn2) in model_order_p() argument 3329 if (insn1->model_priority != insn2->model_priority) in model_order_p() 3330 return insn1->model_priority > insn2->model_priority; in model_order_p() 3347 height2 = insn2->depth + insn2->alap; in model_order_p() 3350 if (insn1->depth != insn2->depth) in model_order_p() 3351 return insn1->depth > insn2->depth; in model_order_p() 3356 priority2 = INSN_PRIORITY (insn2->insn); in model_order_p() 3361 return insn1 < insn2; in model_order_p() 5632 autopref_rank_for_schedule (const rtx_insn *insn1, const rtx_insn *insn2) in autopref_rank_for_schedule() argument 5640 = &INSN_AUTOPREF_MULTIPASS_DATA (insn2)[write]; in autopref_rank_for_schedule() [all …]
|
| HD | reg-stack.c | 1531 rtx_insn *insn2 = emit_insn_before (pat2, insn); in subst_stack_regs_pat() local 1533 |= move_nan_for_stack_reg (insn2, regstack, u); in subst_stack_regs_pat() 1662 rtx_insn *insn2 = emit_insn_before (pat2, insn); in subst_stack_regs_pat() local 1664 |= move_nan_for_stack_reg (insn2, regstack, *src1); in subst_stack_regs_pat() 1669 rtx_insn *insn2 = emit_insn_before (pat2, insn); in subst_stack_regs_pat() local 1671 |= move_nan_for_stack_reg (insn2, regstack, *src2); in subst_stack_regs_pat()
|
| HD | loop-invariant.c | 349 invariant_expr_equal_p (rtx_insn *insn1, rtx e1, rtx_insn *insn2, rtx e2) in invariant_expr_equal_p() argument 374 use2 = df_find_use (insn2, e2); in invariant_expr_equal_p() 402 if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2)) in invariant_expr_equal_p() 416 if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2)) in invariant_expr_equal_p()
|
| HD | ddg.c | 390 insns_may_alias_p (rtx_insn *insn1, rtx_insn *insn2) in insns_may_alias_p() argument 398 FOR_EACH_SUBRTX (iter2, array2, PATTERN (insn2), NONCONST) in insns_may_alias_p()
|
| HD | cfgrtl.c | 621 rtx_insn *insn2; in can_fallthru() local 639 insn2 = BB_HEAD (target); in can_fallthru() 640 if (!active_insn_p (insn2)) in can_fallthru() 641 insn2 = next_active_insn (insn2); in can_fallthru() 643 return next_active_insn (insn) == insn2; in can_fallthru()
|
| HD | cfgexpand.c | 5359 rtx_insn *prev_insn, *insn2; in expand_debug_locations() local 5408 for (insn2 = insn; insn2 != prev_insn; insn2 = PREV_INSN (insn2)) in expand_debug_locations() 5409 avoid_complex_debug_insns (insn2, &INSN_VAR_LOCATION_LOC (insn2), 0); in expand_debug_locations()
|
| HD | sched-int.h | 1320 void (*note_mem_dep) (rtx mem1, rtx mem2, rtx_insn *insn2, ds_t ds);
|
| HD | sched-deps.c | 638 sched_insns_conditions_mutex_p (const rtx_insn *insn1, const rtx_insn *insn2) in sched_insns_conditions_mutex_p() argument 645 if (!CALL_P (insn1) && !CALL_P (insn2)) in sched_insns_conditions_mutex_p() 648 cond2 = sched_get_condition_with_rev (insn2, &rev2); in sched_insns_conditions_mutex_p() 653 && !modified_in_p (cond1, insn2) in sched_insns_conditions_mutex_p()
|
| /dragonfly/contrib/gcc-4.7/gcc/ |
| HD | sched-ebb.c | 239 rank (rtx insn1, rtx insn2) in rank() argument 242 basic_block bb2 = BLOCK_FOR_INSN (insn2); in rank() 355 rtx insn2 = DEP_CON (fore_dep); in earliest_block_with_similiar_load() local 356 basic_block insn2_block = BLOCK_FOR_INSN (insn2); in earliest_block_with_similiar_load() 365 if (haifa_classify_insn (insn2) != PFREE_CANDIDATE) in earliest_block_with_similiar_load()
|
| HD | cfganal.c | 112 rtx insn2; in can_fallthru() local 125 insn2 = BB_HEAD (target); in can_fallthru() 126 if (insn2 && !active_insn_p (insn2)) in can_fallthru() 127 insn2 = next_active_insn (insn2); in can_fallthru() 130 return next_active_insn (insn) == insn2; in can_fallthru()
|
| HD | sched-rgn.c | 1960 rtx insn2 = DEP_CON (fore_dep); in is_pfree() local 1965 if (haifa_classify_insn (insn2) != PFREE_CANDIDATE) in is_pfree() 1969 if (INSN_BB (insn2) == bb_trg) in is_pfree() 1973 if (*(candp->split_bbs.first_member) == BLOCK_FOR_INSN (insn2)) in is_pfree() 2260 rgn_rank (rtx insn1, rtx insn2) in rgn_rank() argument 2263 if (INSN_BB (insn1) != INSN_BB (insn2)) in rgn_rank() 2268 if ((INSN_BB (insn2) == target_bb) && (INSN_BB (insn1) != target_bb)) in rgn_rank() 2270 if ((INSN_BB (insn1) == target_bb) && (INSN_BB (insn2) != target_bb)) in rgn_rank() 2274 spec_val = IS_SPECULATIVE_INSN (insn1) - IS_SPECULATIVE_INSN (insn2); in rgn_rank() 2279 prob_val = INSN_PROBABILITY (insn2) - INSN_PROBABILITY (insn1); in rgn_rank()
|
| HD | loop-invariant.c | 349 invariant_expr_equal_p (rtx insn1, rtx e1, rtx insn2, rtx e2) in invariant_expr_equal_p() argument 376 use2 = df_find_use (insn2, e2); in invariant_expr_equal_p() 404 if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2)) in invariant_expr_equal_p() 418 if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2)) in invariant_expr_equal_p()
|
| HD | reg-stack.c | 1444 rtx insn2 = emit_insn_before (pat2, insn); in subst_stack_regs_pat() local 1446 |= move_nan_for_stack_reg (insn2, regstack, u); in subst_stack_regs_pat() 1580 rtx insn2 = emit_insn_before (pat2, insn); in subst_stack_regs_pat() local 1582 |= move_nan_for_stack_reg (insn2, regstack, *src1); in subst_stack_regs_pat() 1587 rtx insn2 = emit_insn_before (pat2, insn); in subst_stack_regs_pat() local 1589 |= move_nan_for_stack_reg (insn2, regstack, *src2); in subst_stack_regs_pat()
|
| HD | cfgexpand.c | 3712 rtx val, prev_insn, insn2; in expand_debug_locations() local 3743 for (insn2 = insn; insn2 != prev_insn; insn2 = PREV_INSN (insn2)) in expand_debug_locations() 3744 avoid_complex_debug_insns (insn2, &INSN_VAR_LOCATION_LOC (insn2), 0); in expand_debug_locations()
|
| HD | ddg.c | 434 insns_may_alias_p (rtx insn1, rtx insn2) in insns_may_alias_p() argument 438 &PATTERN (insn2)); in insns_may_alias_p()
|
| HD | sched-deps.c | 637 sched_insns_conditions_mutex_p (const_rtx insn1, const_rtx insn2) in sched_insns_conditions_mutex_p() argument 644 if (!CALL_P (insn1) && !CALL_P (insn2)) in sched_insns_conditions_mutex_p() 647 cond2 = sched_get_condition_with_rev (insn2, &rev2); in sched_insns_conditions_mutex_p() 652 && !modified_in_p (cond1, insn2) in sched_insns_conditions_mutex_p()
|
| HD | sched-int.h | 1204 void (*note_mem_dep) (rtx mem1, rtx mem2, rtx insn2, ds_t ds);
|
| /dragonfly/contrib/binutils-2.27/gold/ |
| HD | aarch64.cc | 3318 typename elfcpp::Swap<32,big_endian>::Valtype insn2, 7507 Insntype insn2 = elfcpp::Swap<32, big_endian>::readval(ip + 1); in tls_gd_to_le() local 7533 && insn2 == 0x91000000 // add x0, x0, #0x0 in tls_gd_to_le() 7547 insn2 = 0x91400000; // add x0, x0, #0x0, lsl #12 in tls_gd_to_le() 7550 elfcpp::Swap<32, big_endian>::writeval(ip + 1, insn2); in tls_gd_to_le() 7607 Insntype insn2 = elfcpp::Swap<32, big_endian>::readval(ip + 1); in tls_ld_to_le() local 7633 && insn2 == 0x91000000 // add x0, x0, #0x0 in tls_ld_to_le() 7647 insn2 = 0x91400000; // add x0, x0, #0x0, lsl #12 in tls_ld_to_le() 7650 elfcpp::Swap<32, big_endian>::writeval(ip + 1, insn2); in tls_ld_to_le() 8045 typename elfcpp::Swap<32,big_endian>::Valtype insn2, in is_erratum_843419_sequence() argument [all …]
|
| HD | powerpc.cc | 7137 Valtype insn2 = elfcpp::Swap<32, big_endian>::readval(wv + 1); in relocate() local 7139 && (insn2 == nop in relocate() 7140 || insn2 == cror_15_15_15 || insn2 == cror_31_31_31)) in relocate() 7683 Insn insn2 = elfcpp::Swap<32, big_endian>::readval(iview + 1); in relocate() local 7686 && insn2 == add_2_2_12) in relocate() 7690 insn2 = addi_2_2 + l(value); in relocate() 7691 elfcpp::Swap<32, big_endian>::writeval(iview + 1, insn2); in relocate() 7702 Insn insn2 = elfcpp::Swap<32, big_endian>::readval(iview + 1); in relocate() local 7705 && insn2 == add_2_2_12) in relocate() 7709 insn2 = addi_2_2 + l(value); in relocate() [all …]
|