phi.c (1258B)
1 bool 2 remove_phi_nodes(Ir_function fn) { 3 size_t i, j, k, last; 4 ssize_t label_id, temp_id; 5 Ir phi, tmp_ir; 6 Ir_block *block; 7 if (!fn.resolved_labels) { 8 fprintf(stderr, "Error: Running remove_phi_nodes() before resolving block labels\n"); 9 return false; 10 } 11 for (i = 0; i < fn.body.count; i++) { 12 block = &fn.body.items[i]; 13 for (j = 0; j < block->count; j++) { 14 if (block->items[j].kind != IR_PHI) { 15 continue; 16 } 17 phi = block->items[j]; 18 for (k = 0; k < phi.phi_list.count; k++) { 19 assert(phi.phi_list.items[k].label.resolved); 20 21 label_id = phi.phi_list.items[k].label.id; 22 last = fn.body.items[label_id].count; 23 temp_id = phi.phi_list.items[k].temp_id; 24 da_append(&fn.body.items[label_id], ((Ir) { .kind = IR_ASSIGN, .result = phi.result, .assign = { .kind = ARG_TEMP_STORAGE, .temp_id = temp_id }})); 25 tmp_ir = fn.body.items[label_id].items[last]; 26 fn.body.items[label_id].items[last] = fn.body.items[label_id].items[last - 1]; 27 fn.body.items[label_id].items[last - 1] = tmp_ir; 28 } 29 memmove(&block->items[j], &block->items[j + 1], sizeof(*block->items) * (block->count - j - 1)); 30 block->count--; 31 j--; 32 } 33 } 34 return true; 35 }