Lines Matching defs:node_count
33 unsigned node_count;
62 lcra_alloc_equations(unsigned node_count)
66 l->node_count = node_count;
68 l->linear = calloc(sizeof(l->linear[0]), node_count);
69 l->solutions = calloc(sizeof(l->solutions[0]), node_count);
70 l->affinity = calloc(sizeof(l->affinity[0]), node_count);
72 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count);
80 for (unsigned i = 0; i < l->node_count; ++i)
115 nodearray_orr(&l->linear[j], i, constraint_fw, 256, l->node_count);
116 nodearray_orr(&l->linear[i], j, constraint_bw, 256, l->node_count);
145 for (unsigned j = 0; j < l->node_count; ++j) {
163 for (unsigned step = 0; step < l->node_count; ++step) {
250 bi_mark_interference(bi_block *block, struct lcra_state *l, uint8_t *live, uint64_t preload_live, unsigned node_count, bool is_blend, bool split_file, bool aligned_sr)
259 if (node >= node_count)
277 for (unsigned i = 0; i < node_count; ++i) {
300 if (d == 1 && node_first < node_count) {
312 if (node < node_count)
322 for (unsigned i = 0; i < node_count; ++i) {
330 bi_liveness_ins_update(live, ins, node_count);
339 unsigned node_count = bi_max_temp(ctx);
345 uint8_t *live = mem_dup(blk->live_out, node_count);
348 node_count, ctx->inputs->is_blend, !full_regs,
358 unsigned node_count = bi_max_temp(ctx);
359 struct lcra_state *l = lcra_alloc_equations(node_count);
378 if (dest < node_count)
386 assert(node < node_count);
391 if (node < node_count)
397 assert(node < node_count);
407 assert(node < node_count);
418 assert(node < node_count);
434 assert(node < node_count);
468 unsigned node_count = bi_max_temp(ctx);
471 if (bi_get_node(index) >= node_count) {
543 BITSET_WORD *no_spill = calloc(sizeof(BITSET_WORD), BITSET_WORDS(l->node_count));
549 if (node >= l->node_count)
591 for (unsigned i = 0; i < l->node_count; ++i) {