| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
| H A D | vrp23.c | 12 int n_sets; local
14 n_sets = (int) (code1 == 32);
21 if (n_sets > 1) goto L4; else goto L10;
29 if (n_sets > 0) goto L25; else goto L8;
37 if (i < n_sets) goto L24; else goto L8;
45 /* The n_sets > 0 test can be simplified into n_sets == 1 since the
46 only way to reach the test is when n_sets <= 1, and the only value
47 which satisfies both conditions is n_sets == 1. */
|
| H A D | vrp24.c | 31 int n_sets; local
36 n_sets = 1;
40 n_sets = 0;
45 n_sets = (int) D1562;
46 if (n_sets > 0) goto L7; else goto L11;
56 if (i < n_sets) goto L37; else goto L32;
61 if (n_sets > 1) goto L12; else goto L15;
71 if (n_sets > 0) goto L14; else goto L16;
76 if (n_sets > i) goto L38; else goto L16;
87 /* The first n_sets >
[all...] |
| /haiku-buildtools/gcc/gcc/ |
| H A D | cselib.h | 72 int n_sets);
|
| H A D | cselib.c | 270 represented in the array sets[n_sets]. new_val_min can be used to
274 int n_sets);
2459 int n_sets;
2472 data->sets[data->n_sets].dest = dest;
2475 data->sets[data->n_sets].src = gen_rtx_PLUS (GET_MODE (src), src, srcoff);
2477 data->sets[data->n_sets].src = src;
2479 data->n_sets++;
2488 int n_sets = 0;
2508 n_sets = 1;
2520 sets[n_sets]
2457 int n_sets; member in struct:cselib_record_autoinc_data
2486 int n_sets = 0; local
[all...] |
| H A D | cse.c | 4292 int n_sets = 0;
4313 sets[n_sets++].rtl = x;
4334 sets[n_sets++].rtl = y;
4339 return n_sets;
4372 canonicalize_insn (rtx_insn *insn, struct set **psets, int n_sets)
4454 if (n_sets == 1 && REG_NOTES (insn) != 0
4485 for (i = 0; i < n_sets; i++)
4534 int n_sets = 0;
4562 n_sets = find_sets_in_insn (insn, &sets);
4565 canonicalize_insn (insn, &sets, n_sets);
4269 int n_sets = 0; local
4348 canonicalize_insn(rtx_insn *insn, struct set **psets, int n_sets) argument
4509 int n_sets = 0; local
[all...] |
| H A D | cprop.c | 585 alloc_cprop_mem (int n_blocks, int n_sets)
587 cprop_avloc = sbitmap_vector_alloc (n_blocks, n_sets);
588 cprop_kill = sbitmap_vector_alloc (n_blocks, n_sets);
590 cprop_avin = sbitmap_vector_alloc (n_blocks, n_sets);
591 cprop_avout = sbitmap_vector_alloc (n_blocks, n_sets);
581 alloc_cprop_mem(int n_blocks, int n_sets) argument
|
| H A D | recog.c | 1536 int n_sets = 0;
1542 n_sets = 1;
1561 n_sets = i;
1566 for (i = 0; i < n_sets; i++)
1592 + ASM_OPERANDS_LABEL_LENGTH (asm_op) + n_sets);
1530 int n_sets = 0; local
|
| H A D | var-tracking.c | 5315 /* The array of n_sets sets in the insn, as determined by cselib. */
5317 int n_sets; member in struct:count_use_info
5346 for (i = 0; i < cui->n_sets; i++)
6477 first place, in which case sets and n_sets will be 0). */
6480 add_with_sets (rtx_insn *insn, struct cselib_set *sets, int n_sets) argument
6492 cui.n_sets = n_sets;
|
| /haiku-buildtools/legacy/gcc/gcc/ |
| H A D | gcse.c | 408 static int n_sets;
1800 cur_expr->bitmap_index = n_sets++;
2209 n_sets = 0;
3366 alloc_cprop_mem (n_blocks, n_sets)
3367 int n_blocks, n_sets;
3369 cprop_pavloc = sbitmap_vector_alloc (n_blocks, n_sets);
3370 cprop_absaltered = sbitmap_vector_alloc (n_blocks, n_sets);
3372 cprop_avin = sbitmap_vector_alloc (n_blocks, n_sets);
3373 cprop_avout = sbitmap_vector_alloc (n_blocks, n_sets);
3937 n_sets);
407 static int n_sets; variable
[all...] |
| H A D | cse.c | 6466 register int n_sets = 0;
6528 n_sets = 1;
6581 sets[n_sets++].rtl = y;
6628 if (n_sets == 1 && REG_NOTES (insn) != 0
6644 for (i = 0; i < n_sets; i++)
6694 for (i = 0; i < n_sets; i++)
7224 if (n_sets == 1 && dest == pc_rtx
7354 if (n_sets == 1 && src_const && GET_CODE (dest) == REG
7473 else if (n_sets == 1 && dest == pc_rtx && src == pc_rtx)
7495 if (! simplejump_p (insn) && n_sets
6440 register int n_sets = 0; local
[all...] |
| H A D | recog.c | 1370 int n_sets;
1382 n_sets = i;
1387 for (i = 0; i < n_sets; i++)
1401 + n_sets);
1362 int n_sets; local
|
| H A D | loop.c | 3378 consec_sets_invariant_p (reg, n_sets, insn)
3379 int n_sets;
3386 int count = n_sets - 1;
3392 if (n_sets == 127)
|
| /haiku-buildtools/gcc/gcc/lto/ |
| H A D | lto-partition.c | 1062 unsigned i, n_sets; local
1070 n_sets = ltrans_partitions.length ();
1071 for (i = 0; i < n_sets; i++)
1079 for (i = 0; i < n_sets; i++)
|
| H A D | lto.c | 2593 unsigned i, n_sets; local
2623 n_sets = ltrans_partitions.length ();
2634 for (i = 0; i < n_sets; i++)
2681 stream_out (temp_filename, part->encoder, i == n_sets - 1);
2691 for (i = 0; i < n_sets; i++)
2702 lto_stats.num_output_files += n_sets;
|