Searched refs:n_insns (Results 1 - 14 of 14) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A D20040211-1.c19 can_move_up (rtx insn, int n_insns) argument
21 while (n_insns > 0)
25 n_insns--;
27 return n_insns <= 0;
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D920625-1.c41 int n_insns,
64 sequence[n_insns] = insn;
66 synth(sequence, n_insns + 1, values, n_values,
77 sequence[n_insns] = insn;
78 test_sequence(sequence, n_insns + 1);
83 int n_insns,
96 if (n_insns > 0)
97 last_dest = sequence[n_insns - 1].d;
115 recurse(ADD_CIO, n_values, s1, s2, v, 1, sequence, n_insns, values, n_values + 1, goal_value, allowed_cost, co, CY_JUST_SET);
117 recurse(ADD_CI, n_values, s1, s2, v, 1, sequence, n_insns, value
34 recurse(opcode_t opcode, int d, int s1, int s2, word v, int cost, insn_t *sequence, int n_insns, word *values, int n_values, const word goal_value, int allowed_cost, int cy, int prune_flags) argument
82 synth(insn_t *sequence, int n_insns, word *values, int n_values, word goal_value, int allowed_cost, int ci, int prune_hint) argument
[all...]
/haiku-buildtools/gcc/gcc/
H A Difcvt.c519 int then_n_insns, else_n_insns, n_insns;
554 n_insns = then_n_insns;
565 n_insns += else_n_insns;
583 n_insns -= 2 * n_matching;
626 n_insns -= 2 * n_matching;
631 if (n_insns > max)
773 n_insns, (n_insns == 1) ? " was" : "s were");
3504 int n_insns = 0;
3550 n_insns
517 int then_n_insns, else_n_insns, n_insns; local
3498 int n_insns = 0; local
3585 int n_insns; local
[all...]
H A Dbt-load.c1252 can_move_up (const_basic_block bb, const rtx_insn *insn, int n_insns)
1254 while (insn != BB_HEAD (bb) && n_insns > 0)
1261 n_insns--;
1263 return n_insns <= 0;
1251 can_move_up(const_basic_block bb, const rtx_insn *insn, int n_insns) argument
H A Dtree-ssa-threadedge.c1149 int n_insns = 0; local
1176 ++n_insns;
1189 if (n_insns >= PARAM_VALUE (PARAM_MAX_FSM_THREAD_PATH_INSNS))
H A Dexpr.c1001 unsigned HOST_WIDE_INT n_insns = 0;
1017 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1023 return n_insns;
998 unsigned HOST_WIDE_INT n_insns = 0; local
/haiku-buildtools/legacy/gcc/gcc/
H A Dgcse.c2179 alloc_set_hash_table (n_insns)
2180 int n_insns;
2184 set_hash_table_size = n_insns / 4;
2220 alloc_expr_hash_table (n_insns)
2221 int n_insns;
2225 expr_hash_table_size = n_insns / 2;
2506 alloc_rd_mem (n_blocks, n_insns)
2507 int n_blocks, n_insns;
2509 rd_kill = (sbitmap *) sbitmap_vector_alloc (n_blocks, n_insns);
2512 rd_gen = (sbitmap *) sbitmap_vector_alloc (n_blocks, n_insns);
[all...]
H A Dsched.c1620 register int n_insns = 0;
1633 n_insns += 1;
1714 n_insns += 1;
1738 return n_insns;
2620 int i, j, n_ready = 0, new_ready, n_insns;
2746 n_insns = sched_analyze (head, tail);
2747 if (n_insns == 0)
2757 ready = (rtx *) alloca ((n_insns+1) * sizeof (rtx));
2875 regs_sometimes_live[i].live_length += n_insns;
3160 while (sched_n_insns < n_insns)
1614 register int n_insns = 0; local
2612 int i, j, n_ready = 0, new_ready, n_insns; local
[all...]
H A Dexpr.c1548 register int n_insns = 0;
1572 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1577 return n_insns;
1544 register int n_insns = 0; local
/haiku-buildtools/gcc/gcc/config/m68k/
H A Dm68k.c6042 int n_insns;
6103 if (sched_ib.records.adjust_index == sched_ib.records.n_insns)
6156 int n_insns ATTRIBUTE_UNUSED)
6198 sched_ib.records.n_insns = 0;
6204 sched_ib.records.n_insns = 8;
6205 sched_ib.records.adjust = XNEWVEC (int, sched_ib.records.n_insns);
6237 sched_ib.records.n_insns = 0;
6247 int n_insns ATTRIBUTE_UNUSED)
6257 sched_ib.size = sched_ib.records.n_insns * max_insn_size;
6260 sched_ib.records.n_insns * sizeo
6028 int n_insns; member in struct:_sched_ib::_sched_ib_records
[all...]
/haiku-buildtools/gcc/gcc/config/c6x/
H A Dc6x.c5586 int i, sp_ii, min_ii, max_ii, max_parallel, n_insns, n_real_insns, stages;
5647 n_insns = n_real_insns = 0;
5650 n_insns++;
5654 orig_vec = XNEWVEC (rtx_insn *, n_insns);
5655 n_insns = 0;
5657 orig_vec[n_insns++] = insn;
5890 for (i = 1; i < n_insns; i++)
5897 SET_NEXT_INSN (orig_vec[n_insns - 1]) = NEXT_INSN (BB_END (bb));
5898 SET_PREV_INSN (NEXT_INSN (BB_END (bb))) = orig_vec[n_insns - 1];
5900 BB_END (bb) = orig_vec[n_insns
5567 int i, sp_ii, min_ii, max_ii, max_parallel, n_insns, n_real_insns, stages; local
[all...]
/haiku-buildtools/gcc/gcc/config/pa/
H A Dpa.c2976 unsigned int n_insns = 0;
2984 n_insns = 6;
2990 n_insns += 2;
2993 n_insns += 2;
2997 return n_insns * 4;
3118 unsigned int n_insns = 0;
3126 n_insns = 4;
3132 n_insns++;
3135 n_insns++;
3139 return n_insns *
2968 unsigned int n_insns = 0; local
3110 unsigned int n_insns = 0; local
[all...]
/haiku-buildtools/legacy/gcc/gcc/config/pa/
H A Dpa.c2100 unsigned int n_insns = 0;
2108 n_insns = 6;
2114 n_insns += 2;
2117 n_insns += 2;
2121 return n_insns * 4;
2094 unsigned int n_insns = 0; local
/haiku-buildtools/gcc/gcc/config/sparc/
H A Dsparc.c1042 const int n_insns = 4;
1066 for (after = next, i = 0; i < n_insns; i++)
1077 if (++i == n_insns)
1086 if (++i == n_insns)
1126 if (branch_p && i <= (n_insns - 2))
1040 const int n_insns = 4; local

Completed in 418 milliseconds