| /src/external/gpl3/gcc.old/dist/gcc/ |
| caller-save.cc | 423 rtx cheap;
457 cheap = find_reg_note (insn, REG_RETURNED, NULL);
458 if (cheap)
459 cheap = XEXP (cheap, 0);
467 if (r < 0 || regno_reg_rtx[regno] == cheap)
502 rtx cheap;
510 cheap = find_reg_note (insn, REG_RETURNED, NULL);
511 if (cheap)
512 cheap = XEXP (cheap, 0)
[all...] |
| expmed.h | 140 bool cheap[2][NUM_MODE_IPV_INT]; member in struct:expmed_op_cheap
157 /* Nonzero means divides or modulus operations are relatively cheap for
244 a particular operation performed in MODE is cheap when optimizing
252 return &eoc->cheap[speed][idx];
275 /* Set whether a signed division by a power of 2 is cheap in MODE
284 /* Return whether a signed division by a power of 2 is cheap in MODE
302 /* Set whether a signed modulo by a power of 2 is CHEAP in MODE when
306 set_smod_pow2_cheap (bool speed, machine_mode mode, bool cheap)
308 *smod_pow2_cheap_ptr (speed, mode) = cheap;
311 /* Return whether a signed modulo by a power of 2 is cheap in MOD
[all...] |
| optabs-query.cc | 688 /* Determine whether "1 << x" is relatively cheap in word_mode. */
696 static bool cheap[2] = { true, true };
699 probably not be cheap. ??? Does GCC even work for such targets? */
708 cheap[speed_p] = cost < COSTS_N_INSNS (3);
712 return cheap[speed_p];
|
| lra-constraints.cc | 6205 cheap. */
6693 rtx cheap, pat, dest;
6702 if ((cheap = find_reg_note (curr_insn,
6704 && ((cheap = XEXP (cheap, 0)), true)
6705 && (regno = REGNO (cheap)) >= FIRST_PSEUDO_REGISTER
6711 && callee_abi.clobbers_reg_p (GET_MODE (cheap), hard_regno))
6726 emit_move_insn (cheap, copy_rtx (dest));
6736 GET_MODE (cheap), hard_regno);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| caller-save.cc | 423 rtx cheap;
457 cheap = find_reg_note (insn, REG_RETURNED, NULL);
458 if (cheap)
459 cheap = XEXP (cheap, 0);
467 if (r < 0 || regno_reg_rtx[regno] == cheap)
502 rtx cheap;
510 cheap = find_reg_note (insn, REG_RETURNED, NULL);
511 if (cheap)
512 cheap = XEXP (cheap, 0)
[all...] |
| expmed.h | 140 bool cheap[2][NUM_MODE_IPV_INT]; member in struct:expmed_op_cheap
157 /* Nonzero means divides or modulus operations are relatively cheap for
243 a particular operation performed in MODE is cheap when optimizing
251 return &eoc->cheap[speed][idx];
274 /* Set whether a signed division by a power of 2 is cheap in MODE
283 /* Return whether a signed division by a power of 2 is cheap in MODE
301 /* Set whether a signed modulo by a power of 2 is CHEAP in MODE when
305 set_smod_pow2_cheap (bool speed, machine_mode mode, bool cheap)
307 *smod_pow2_cheap_ptr (speed, mode) = cheap;
310 /* Return whether a signed modulo by a power of 2 is cheap in MOD
[all...] |
| optabs-query.cc | 622 /* Determine whether "1 << x" is relatively cheap in word_mode. */
630 static bool cheap[2] = { true, true };
633 probably not be cheap. ??? Does GCC even work for such targets? */
642 cheap[speed_p] = cost < COSTS_N_INSNS (3);
646 return cheap[speed_p];
|
| lra-constraints.cc | 6457 cheap. */
6945 rtx cheap, pat, dest;
6954 if ((cheap = find_reg_note (curr_insn,
6956 && ((cheap = XEXP (cheap, 0)), true)
6957 && (regno = REGNO (cheap)) >= FIRST_PSEUDO_REGISTER
6963 && callee_abi.clobbers_reg_p (GET_MODE (cheap), hard_regno))
6978 emit_move_insn (cheap, copy_rtx (dest));
6988 GET_MODE (cheap), hard_regno);
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
| array.d | 2103 compute the resultant length. If iteration is not cheap then precomputing
2106 For now, we only assume arrays are cheap to iterate.
|
| /src/external/mit/isl/dist/doc/ |
| implementation.tex | 123 This means that the simple hull is relatively cheap to compute
|
