Lines Matching refs:i
302 uint32_t i, *p, *q, n = 0; in ir_remove_predecessor() local
305 for (i = 0; i < bb->predecessors_count; i++, p++) { in ir_remove_predecessor()
320 ir_ref i, j, n, k, *p, use; in ir_remove_merge_input() local
328 i = 1; in ir_remove_merge_input()
334 if (i != j) { in ir_remove_merge_input()
335 ir_insn_set_op(insn, i, input); in ir_remove_merge_input()
338 i++; in ir_remove_merge_input()
341 i--; in ir_remove_merge_input()
342 if (i == 1) { in ir_remove_merge_input()
352 i = 2; in ir_remove_merge_input()
370 insn->inputs_count = i; in ir_remove_merge_input()
379 i = 2; in ir_remove_merge_input()
385 if (i != j) { in ir_remove_merge_input()
386 ir_insn_set_op(use_insn, i, input); in ir_remove_merge_input()
388 i++; in ir_remove_merge_input()
404 uint32_t b, *p, i; in ir_remove_unreachable_blocks() local
415 for (i = 0, p = &ctx->cfg_edges[bb->successors]; i < bb->successors_count; i++, p++) { in ir_remove_unreachable_blocks()
506 uint32_t i, *p;
516 i = bb->successors_count;
520 } while (--i);
878 uint32_t i, j, n, count; in ir_find_loops() local
903 i = ir_worklist_peek(&work); in ir_find_loops()
904 if (!entry_times[i]) { in ir_find_loops()
905 entry_times[i] = time++; in ir_find_loops()
909 bb = &blocks[i]; in ir_find_loops()
922 if (blocks[succ].idom == i) { in ir_find_loops()
929 exit_times[i] = time++; in ir_find_loops()
938 i = j; in ir_find_loops()
940 for (; i < j; i++) { in ir_find_loops()
942 …for (child = blocks[sorted_blocks[i]].dom_child; child > 0; child = blocks[child].dom_next_child) { in ir_find_loops()
951 i = sorted_blocks[--n]; in ir_find_loops()
952 ir_block *bb = &blocks[i]; in ir_find_loops()
967 if (ir_dominates(blocks, i, pred)) { in ir_find_loops()
976 if (entry_times[pred] > entry_times[i] && exit_times[pred] < exit_times[i]) { in ir_find_loops()
1000 if (j != i) { in ir_find_loops()
1006 bb->loop_header = i; in ir_find_loops()
1023 i = sorted_blocks[n]; in ir_find_loops()
1024 ir_block *bb = &blocks[i]; in ir_find_loops()
1164 uint32_t b, i; in ir_dump_cfg_freq_graph() local
1172 i = 0; in ir_dump_cfg_freq_graph()
1175 colors[b] = (i % max_colors) + 1; in ir_dump_cfg_freq_graph()
1176 i++; in ir_dump_cfg_freq_graph()
1204 for (i = 0; i < edges_count; i++) { in ir_dump_cfg_freq_graph()
1205 fprintf(stderr, "\tBB%d -> BB%d [label=\"%0.3f\"]\n", edges[i].from, edges[i].to, edges[i].freq); in ir_dump_cfg_freq_graph()
1214 uint32_t i; in ir_dump_edges() local
1217 for (i = 0; i < edges_count; i++) { in ir_dump_edges()
1218 fprintf(stderr, "\tBB%d -> BB%d %0.3f\n", edges[i].from, edges[i].to, edges[i].freq); in ir_dump_edges()
1224 uint32_t b, tail, i; in ir_dump_chains() local
1230 i = b; in ir_dump_chains()
1231 fprintf(stderr, "(BB%d", i); in ir_dump_chains()
1232 while (i != tail) { in ir_dump_chains()
1233 i = chains[i].next; in ir_dump_chains()
1234 fprintf(stderr, ", BB%d", i); in ir_dump_chains()
1246 uint32_t b, i, loop_depth; in ir_schedule_blocks_bottom_up() local
1512 for (e = edges, i = edges_count; i > 0; e++, i--) { in ir_schedule_blocks_bottom_up()
1570 for (i = 0; i < ctx->entries_count; i++) { in ir_schedule_blocks_bottom_up()
1571 b = ctx->entries[i]; in ir_schedule_blocks_bottom_up()
1610 for (e = edges, i = edges_count; i > 0; e++, i--) { in ir_schedule_blocks_bottom_up()
1636 uint32_t i = b; in ir_schedule_blocks_bottom_up() local
1639 ctx->cfg_schedule[count] = i; in ir_schedule_blocks_bottom_up()
1640 if (i == tail) break; in ir_schedule_blocks_bottom_up()
1641 i = chains[i].next; in ir_schedule_blocks_bottom_up()
