Searched refs:cheap (Results 1 - 6 of 6) sorted by relevance
| /haiku-buildtools/gcc/gcc/ |
| H A D | caller-save.c | 464 rtx cheap;
499 cheap = find_reg_note (insn, REG_RETURNED, NULL);
500 if (cheap)
501 cheap = XEXP (cheap, 0);
509 if (r < 0 || regno_reg_rtx[regno] == cheap)
544 rtx cheap;
552 cheap = find_reg_note (insn, REG_RETURNED, NULL);
553 if (cheap)
554 cheap
461 rtx cheap; local
541 rtx cheap; local
836 rtx cheap; local
[all...] |
| H A D | 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
306 set_smod_pow2_cheap (bool speed, machine_mode mode, bool cheap) argument
308 *smod_pow2_cheap_ptr (speed, mode) = cheap;
311 /* Return whether a signed modulo by a power of 2 is cheap in MODE
|
| H A D | lra-constraints.c | 5527 rtx cheap, pat, dest;
5532 if ((cheap = find_reg_note (curr_insn,
5534 && ((cheap = XEXP (cheap, 0)), true)
5535 && (regno = REGNO (cheap)) >= FIRST_PSEUDO_REGISTER
5555 emit_move_insn (cheap, copy_rtx (dest));
5522 rtx cheap, pat, dest; local
|
| H A D | optabs.c | 8753 /* Determine whether "1 << x" is relatively cheap in word_mode. */
8761 static bool cheap[2] = { true, true };
8764 probably not be cheap. ??? Does GCC even work for such targets? */
8773 cheap[speed_p] = cost < COSTS_N_INSNS (3);
8777 return cheap[speed_p];
8731 static bool cheap[2] = { true, true }; local
|
| /haiku-buildtools/gcc/gcc/testsuite/lib/ |
| H A D | target-supports.exp | 1034 /* A cheap way of testing for -mflip-mips16. */
|
| /haiku-buildtools/isl/doc/ |
| H A D | implementation.tex | 123 This means that the simple hull is relatively cheap to compute
|
Completed in 100 milliseconds