| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
| H A D | pr63568.c | 8 int tem1 = a & ~m; local
10 return tem1 | tem2;
16 int tem1 = a & ~m; local
18 return tem1 | tem2;
24 int tem1 = ~m & a; local
26 return tem1 | tem2;
32 int tem1 = ~m & a; local
34 return tem1 | tem2;
40 int tem1 = b & m; local
42 return tem1 | tem
48 int tem1 = m & b; local
56 int tem1 = m & b; local
64 int tem1 = b & m; local
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/vect/ |
| H A D | bb-slp-32.c | 9 int tem0, tem1, tem2, tem3; local
12 tem1 = p[1] + 2;
13 x[1] = tem1;
19 return tem0 + tem1 + tem2 + tem3;
|
| H A D | vect-outer-pr69720.c | 11 double tem1 = b[i]; local
13 tem1 += 1;
14 b[i] = tem1;
|
| /haiku-buildtools/gcc/gcc/lto/ |
| H A D | lto-symtab.c | 273 tree tem1 = TREE_TYPE (prevailing_type); local
275 while (TREE_CODE (tem1) == ARRAY_TYPE
278 tem1 = TREE_TYPE (tem1);
282 if (TREE_CODE (tem1) != TREE_CODE (tem2))
285 if (!types_compatible_p (tem1, tem2))
|
| /haiku-buildtools/gcc/gcc/ |
| H A D | tree-ssa-reassoc.c | 2348 tree tem1, tem2, mask; local
2350 tem1 = fold_binary (MINUS_EXPR, type, highi, lowi);
2351 if (tem1 == NULL_TREE || TREE_CODE (tem1) != INTEGER_CST)
2354 if (!tree_int_cst_equal (tem1, tem2))
2357 tem1 = fold_binary (MINUS_EXPR, type, lowj, lowi);
2358 if (tem1 == NULL_TREE || TREE_CODE (tem1) != INTEGER_CST)
2360 if (!integer_pow2p (tem1))
2364 tem1
[all...] |
| H A D | tree-ssa-sccvn.c | 736 vn_reference_op_s tem1, tem2; local
758 memset (&tem1, 0, sizeof (tem1));
759 tem1.op0 = TREE_OPERAND (vro1->op0, 0);
760 tem1.type = TREE_TYPE (tem1.op0);
761 tem1.opcode = TREE_CODE (tem1.op0);
762 vro1 = &tem1;
|
| H A D | reload1.c | 8658 rtx tem1, tem2;
8797 else if ((tem1 = replaced_subreg (in), tem2 = replaced_subreg (out),
8798 (REG_P (tem1) && REG_P (tem2)))
8799 && REGNO (tem1) < FIRST_PSEUDO_REGISTER
8801 && SECONDARY_MEMORY_NEEDED (REGNO_REG_CLASS (REGNO (tem1)),
8632 rtx tem1, tem2; local
|
| H A D | combine.c | 11380 rtx tem, tem1;
11905 tem = XEXP (XEXP (op0, 0), 0), tem1 = XEXP (XEXP (op0, 0), 1);
11907 tem = XEXP (op0, 0), tem1 = XEXP (op0, 1);
11925 op1 = tem1;
11339 rtx tem, tem1; local
|
| /haiku-buildtools/gcc/gcc/config/cris/ |
| H A D | cris.c | 2268 rtx tem1 = XEXP (x, 0); local
2273 if (!REG_P (tem1) && GET_CODE (tem1) != MULT)
2274 tem1 = tem2, tem2 = XEXP (x, 0);
2277 gcc_assert (REG_P (tem1) || GET_CODE (tem1) == MULT);
2280 recognize the typical MULT which is always in tem1 because of
2282 if ((GET_CODE (tem1) == MULT && cris_biap_index_p (tem1, false))
|
| /haiku-buildtools/legacy/gcc/gcc/ |
| H A D | function.c | 2074 register rtx tem, tem1;
2276 tem1 = gen_reg_rtx (GET_MODE (tem));
2277 emit_insn_before (gen_move_insn (tem1, tem), insn);
2278 XEXP (x, 0) = tem1;
2484 tem1 = gen_reg_rtx (GET_MODE (tem));
2485 emit_insn_before (gen_move_insn (tem1, tem), insn);
2486 emit_insn_after (gen_move_insn (tem, tem1), insn);
2487 XEXP (outerdest, 0) = tem1;
2062 register rtx tem, tem1; local
|
| H A D | jump.c | 1135 rtx tem1, tem2;
1137 tem1 = expand_and (uval, target, NULL_RTX);
1161 tem1, tem2, target,
1134 rtx tem1, tem2; local
|
| H A D | loop.c | 824 int tem1 = 0;
889 || (tem1
977 m->cond = ((tem | tem1 | tem2) > 1);
819 int tem1 = 0; local
|
| H A D | combine.c | 9555 rtx tem, tem1;
10222 tem = XEXP (XEXP (op0, 0), 0), tem1 = XEXP (XEXP (op0, 0), 1);
10224 tem = XEXP (op0, 0), tem1 = XEXP (op0, 1);
10240 op0 = tem, op1 = tem1;
9517 rtx tem, tem1; local
|
| H A D | fold-const.c | 4908 tree tem1 = TREE_OPERAND (tem, 1);
4910 TREE_OPERAND (tem, 0) = tem1;
4876 tree tem1 = TREE_OPERAND (tem, 1); local
|