Lines Matching refs:n
14 ir_ref *p, use, n = use_list->count; in _ir_add_successors() local
16 if (n < 2) { in _ir_add_successors()
17 if (n == 1) { in _ir_add_successors()
24 if (n == 2) { in _ir_add_successors()
32 for (; n > 0; p++, n--) { in _ir_add_successors()
43 ir_ref n, ref; in _ir_add_predecessors() local
47 n = insn->inputs_count; in _ir_add_predecessors()
48 for (p = insn->ops + 1; n > 0; p++, n--) { in _ir_add_predecessors()
62 ir_ref n, *p, ref, start, end, next; in ir_build_cfg() local
99 n = use_list->count; in ir_build_cfg()
100 if (n > 1) { in ir_build_cfg()
101 for (p = &ctx->use_edges[use_list->refs]; n > 0; p++, n--) { in ir_build_cfg()
149 n = use_list->count; in ir_build_cfg()
151 for (p = &ctx->use_edges[use_list->refs]; n > 0; p++, n--) { in ir_build_cfg()
211 n = insn->inputs_count; in ir_build_cfg()
212 bb->predecessors_count = n; in ir_build_cfg()
213 edges_count += n; in ir_build_cfg()
214 count += n; in ir_build_cfg()
242 n = insn->inputs_count; in ir_build_cfg()
243 for (p = insn->ops + 1; n > 0; p++, q++, n--) { in ir_build_cfg()
281 n = bb->successors_count; in ir_build_cfg()
282 if (n > 1) { in ir_build_cfg()
283 for (p = edges + bb->successors; n > 0; p++, n--) { in ir_build_cfg()
286 } else if (n == 1) { in ir_build_cfg()
302 uint32_t i, *p, *q, n = 0; in ir_remove_predecessor() local
311 n++; in ir_remove_predecessor()
314 IR_ASSERT(n != bb->predecessors_count); in ir_remove_predecessor()
315 bb->predecessors_count = n; in ir_remove_predecessor()
320 ir_ref i, j, n, k, *p, use; in ir_remove_merge_input() local
327 n = insn->inputs_count; in ir_remove_merge_input()
329 life_inputs = ir_bitset_malloc(n + 1); in ir_remove_merge_input()
330 for (j = 1; j <= n; j++) { in ir_remove_merge_input()
353 for (j = 2; j <= n; j++) { in ir_remove_merge_input()
372 n++; in ir_remove_merge_input()
380 for (j = 2; j <= n; j++) { in ir_remove_merge_input()
450 uint32_t n = 1; in ir_remove_unreachable_blocks() local
458 ctx->cfg_map[dst_bb->start] = n; in ir_remove_unreachable_blocks()
459 ctx->cfg_map[dst_bb->end] = n; in ir_remove_unreachable_blocks()
463 n++; in ir_remove_unreachable_blocks()
466 ctx->cfg_blocks_count = bb_count = n - 1; in ir_remove_unreachable_blocks()
475 n = bb->predecessors_count; in ir_remove_unreachable_blocks()
476 if (n > 1) { in ir_remove_unreachable_blocks()
479 IR_ASSERT(n == insn->inputs_count); in ir_remove_unreachable_blocks()
480 for (p = insn->ops + 1; n > 0; p++, q++, n--) { in ir_remove_unreachable_blocks()
488 } else if (n == 1) { in ir_remove_unreachable_blocks()
878 uint32_t i, j, n, count; in ir_find_loops() local
936 n = 2; in ir_find_loops()
937 while (j != n) { in ir_find_loops()
939 j = n; in ir_find_loops()
943 sorted_blocks[n++] = child; in ir_find_loops()
947 count = n; in ir_find_loops()
950 while (n > 1) { in ir_find_loops()
951 i = sorted_blocks[--n]; in ir_find_loops()
1022 for (n = 1; n < count; n++) { in ir_find_loops()
1023 i = sorted_blocks[n]; in ir_find_loops()
1280 uint32_t n = bb->predecessors_count; in ir_schedule_blocks_bottom_up() local
1282 for (; n > 0; p++, n--) { in ir_schedule_blocks_bottom_up()
1329 uint32_t n = bb->successors_count; in ir_schedule_blocks_bottom_up() local
1332 if (n == 1) { in ir_schedule_blocks_bottom_up()
1347 } else if (n == 2 && ctx->ir_base[bb->end].op == IR_IF) { in ir_schedule_blocks_bottom_up()
1459 for (; n > 0; p++, n--) { in ir_schedule_blocks_bottom_up()
1799 uint32_t n = bb->predecessors_count; in ir_schedule_blocks() local
1801 if (n == 1) { in ir_schedule_blocks()
1810 } else if (n > 1) { in ir_schedule_blocks()
1813 for (; n > 0; p++, n--) { in ir_schedule_blocks()
