Lines Matching refs:n
22 ir_ref n, *p, input; in ir_gcm_schedule_early() local
35 n = insn->inputs_count; in ir_gcm_schedule_early()
36 for (p = insn->ops + 1; n > 0; p++, n--) { in ir_gcm_schedule_early()
145 uint32_t *p, i, n = bb->predecessors_count; in _push_predecessors() local
147 IR_ASSERT(n > 0); in _push_predecessors()
155 n--; in _push_predecessors()
156 } while (n > 0); in _push_predecessors()
161 uint32_t *p, i, n = bb->successors_count; in _check_successors() local
163 if (n <= 1) { in _check_successors()
175 n--; in _check_successors()
176 } while (n > 0); in _check_successors()
185 ir_ref n, *p, use; in ir_split_partially_dead_node() local
197 n = use_list->count; in ir_split_partially_dead_node()
198 for (p = &ctx->use_edges[use_list->refs]; n > 0; p++, n--) { in ir_split_partially_dead_node()
204 ir_ref n = insn->inputs_count - 1; in ir_split_partially_dead_node() local
206 for (;n > 0; p++, q++, n--) { in ir_split_partially_dead_node()
303 n = use_list->count; in ir_split_partially_dead_node()
304 for (p = &ctx->use_edges[use_list->refs]; n > 0; p++, n--) { in ir_split_partially_dead_node()
310 ir_ref n = insn->inputs_count - 1; in ir_split_partially_dead_node() local
317 for (;n > 0; p++, q++, n--) { in ir_split_partially_dead_node()
391 n = ctx->use_lists[ref].refs; in ir_split_partially_dead_node()
396 ctx->use_lists[clone].refs = n; in ir_split_partially_dead_node()
401 ctx->use_edges[n++] = use; in ir_split_partially_dead_node()
443 ir_ref n, use; in ir_gcm_schedule_late() local
453 for (n = 0; n < ctx->use_lists[ref].count; n++) { in ir_gcm_schedule_late()
454 use = ctx->use_edges[ctx->use_lists[ref].refs + n]; in ir_gcm_schedule_late()
466 ir_ref n = insn->inputs_count - 1; in ir_gcm_schedule_late() local
468 for (;n > 0; p++, q++, n--) { in ir_gcm_schedule_late()
496 ir_ref n, *p, use; in ir_gcm_schedule_late() local
498 for (n = use_list->count, p = &ctx->use_edges[use_list->refs]; n < 0; p++, n--) { in ir_gcm_schedule_late()
511 ir_ref k, n, *p, ref; in ir_gcm() local
538 n = use_list->count; in ir_gcm()
539 for (p = &ctx->use_edges[use_list->refs]; n > 0; n--, p++) { in ir_gcm()
552 n = insn->inputs_count; in ir_gcm()
553 for (p = insn->ops + 1; n > 0; p++, n--) { in ir_gcm()
601 n = use_list->count; in ir_gcm()
602 if (n > 1) { in ir_gcm()
603 for (p = &ctx->use_edges[use_list->refs]; n > 0; n--, p++) { in ir_gcm()
623 n = ir_list_len(&queue_early); in ir_gcm()
624 while (n > 0) { in ir_gcm()
625 n--; in ir_gcm()
626 ref = ir_list_at(&queue_early, n); in ir_gcm()
640 for (n = 1; n < ctx->insns_count; n++) { in ir_gcm()
641 fprintf(stderr, "%d -> %d\n", n, ctx->cfg_map[n]); in ir_gcm()
654 n = ir_list_len(&queue_late); in ir_gcm()
655 while (n > 0) { in ir_gcm()
656 n--; in ir_gcm()
657 ref = ir_list_at(&queue_late, n); in ir_gcm()
676 for (n = 1; n < ctx->insns_count; n++) { in ir_gcm()
677 fprintf(stderr, "%d -> %d\n", n, ctx->cfg_map[n]); in ir_gcm()
736 ir_ref i, j, k, n, *p, *q, ref, new_ref, prev_ref, insns_count, consts_count, use_edges_count; in ir_schedule() local
851 n = insn->inputs_count; in ir_schedule()
852 insns_count += ir_insn_inputs_to_len(n); in ir_schedule()
869 insns_count += ir_insn_inputs_to_len(n + 1); in ir_schedule()
870 for (j = n, p = insn->ops + 2; j > 0; p++, j--) { in ir_schedule()
904 ir_ref n, j, *p, input; in ir_schedule() local
907 n = insn->inputs_count; in ir_schedule()
908 for (j = n, p = insn->ops + 1; j > 0; p++, j--) { in ir_schedule()
939 insns_count += ir_insn_inputs_to_len(n); in ir_schedule()
1093 n = use_list->count; in ir_schedule()
1095 if (n == 1) { in ir_schedule()
1104 while (n--) { in ir_schedule()
1123 n = new_insn->inputs_count; in ir_schedule()
1124 switch (n) { in ir_schedule()
1185 for (j = n, p = insn->ops + 1, q = new_insn->ops + 1; j > 0; p++, q++, j--) { in ir_schedule()
1242 ir_ref i, n, prev; in ir_build_prev_refs() local
1251 n = ir_insn_len(insn); in ir_build_prev_refs()
1253 i += n; in ir_build_prev_refs()
1254 insn += n; in ir_build_prev_refs()
