| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/tree-ssa/ |
| H A D | vrp23.c | 7 int n_sets; local
9 n_sets = (int) (code1 == 32);
16 if (n_sets > 1) goto L4; else goto L10;
24 if (n_sets > 0) goto L25; else goto L8;
32 if (i < n_sets) goto L24; else goto L8;
40 /* The n_sets > 0 test can be simplified into n_sets == 1 since the
41 only way to reach the test is when n_sets <= 1, and the only value
42 which satisfies both conditions is n_sets == 1. */
|
| H A D | vrp24.c | 26 int n_sets; local
31 n_sets = 1;
35 n_sets = 0;
40 n_sets = (int) D1562;
41 if (n_sets > 0) goto L7; else goto L11;
51 if (i < n_sets) goto L37; else goto L32;
56 if (n_sets > 1) goto L12; else goto L15;
66 if (n_sets > 0) goto L14; else goto L16;
71 if (n_sets > i) goto L38; else goto L16;
82 /* The first n_sets >
[all...] |
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
| H A D | cselib.h | 77 int n_sets);
|
| H A D | cselib.c | 195 represented in the array sets[n_sets]. new_val_min can be used to
199 int n_sets);
2026 int n_sets = 0;
2044 n_sets = 1;
2056 sets[n_sets].src = SET_SRC (x);
2057 sets[n_sets].dest = SET_DEST (x);
2058 n_sets++;
2063 if (n_sets == 1
2076 for (i = 0; i < n_sets; i++)
2107 cselib_record_sets_hook (insn, sets, n_sets);
2024 int n_sets = 0; local
[all...] |
| H A D | cse.c | 4229 int n_sets = 0;
4292 n_sets = 1;
4345 sets[n_sets++].rtl = y;
4394 if (n_sets == 1 && REG_NOTES (insn) != 0
4417 for (i = 0; i < n_sets; i++)
4459 for (i = 0; i < n_sets; i++)
5135 if (n_sets == 1 && dest == pc_rtx
5279 if (n_sets == 1 && src_const && REG_P (dest)
5359 else if (n_sets == 1 && dest == pc_rtx && src == pc_rtx)
5380 if (n_sets
4207 int n_sets = 0; local
[all...] |
| H A D | recog.c | 1437 int n_sets = 0;
1443 n_sets = 1;
1462 n_sets = i;
1467 for (i = 0; i < n_sets; i++)
1493 + ASM_OPERANDS_LABEL_LENGTH (asm_op) + n_sets);
1431 int n_sets = 0; local
|
| H A D | gcse.c | 2010 alloc_cprop_mem (int n_blocks, int n_sets)
2012 cprop_pavloc = sbitmap_vector_alloc (n_blocks, n_sets);
2013 cprop_absaltered = sbitmap_vector_alloc (n_blocks, n_sets);
2015 cprop_avin = sbitmap_vector_alloc (n_blocks, n_sets);
2016 cprop_avout = sbitmap_vector_alloc (n_blocks, n_sets);
2001 alloc_cprop_mem(int n_blocks, int n_sets) argument
|
| H A D | var-tracking.c | 4781 /* The array of n_sets sets in the insn, as determined by cselib. */
4783 int n_sets; member in struct:count_use_info
4805 for (i = 0; i < cui->n_sets; i++)
5543 first place, in which case sets and n_sets will be 0). */
5546 add_with_sets (rtx insn, struct cselib_set *sets, int n_sets) argument
5558 cui.n_sets = n_sets;
|
| /netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
| H A D | cselib.c | 1283 int n_sets = 0;
1301 n_sets = 1;
1313 sets[n_sets].src = SET_SRC (x);
1314 sets[n_sets].dest = SET_DEST (x);
1315 n_sets++;
1322 for (i = 0; i < n_sets; i++)
1356 if (n_sets >= 2 && asm_noperands (body) >= 0)
1358 for (i = 0; i < n_sets; i++)
1364 for (j = i + 1; j < n_sets; j++)
1375 for (i = 0; i < n_sets;
1281 int n_sets = 0; local
[all...] |
| H A D | cse.c | 4799 int n_sets = 0;
4863 n_sets = 1;
4916 sets[n_sets++].rtl = y;
4963 if (n_sets == 1 && REG_NOTES (insn) != 0
4982 for (i = 0; i < n_sets; i++)
5033 for (i = 0; i < n_sets; i++)
5595 if (n_sets == 1 && dest == pc_rtx
5746 if (n_sets == 1 && src_const && REG_P (dest)
5825 else if (n_sets == 1 && dest == pc_rtx && src == pc_rtx)
5851 if (n_sets
4777 int n_sets = 0; local
[all...] |
| H A D | recog.c | 1425 int n_sets;
1437 n_sets = i;
1442 for (i = 0; i < n_sets; i++)
1456 + n_sets);
1417 int n_sets; local
|
| H A D | gcse.c | 2408 alloc_cprop_mem (int n_blocks, int n_sets)
2410 cprop_pavloc = sbitmap_vector_alloc (n_blocks, n_sets);
2411 cprop_absaltered = sbitmap_vector_alloc (n_blocks, n_sets);
2413 cprop_avin = sbitmap_vector_alloc (n_blocks, n_sets);
2414 cprop_avout = sbitmap_vector_alloc (n_blocks, n_sets);
2397 alloc_cprop_mem(int n_blocks, int n_sets) argument
|
| H A D | loop.c | 3756 consec_sets_invariant_p (const struct loop *loop, rtx reg, int n_sets,
3764 int count = n_sets - 1;
3770 if (n_sets == 127)
3735 consec_sets_invariant_p(const struct loop *loop, rtx reg, int n_sets, rtx insn) argument
|
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/lto/ |
| H A D | lto.c | 851 unsigned i, n_sets; local
860 n_sets = VEC_length (cgraph_node_set, lto_cgraph_node_sets);
861 for (i = 0; i < n_sets; i++)
872 if (i == n_sets - 1)
1000 unsigned i, n_sets, last_out_file_ix, num_out_files; local
1035 n_sets = VEC_length (cgraph_node_set, lto_cgraph_node_sets);
1036 for (i = 0; i < n_sets; i++)
1065 last_out_file_ix = n_sets;
1067 lto_stats.num_output_files += n_sets;
|