Searched refs:node_count (Results 1 - 14 of 14) sorted by relevance

/xsrc/external/mit/MesaLib/dist/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count)
48 l->node_count = node_count;
51 l->alignment = calloc(sizeof(l->alignment[0]), node_count);
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count);
53 l->modulus = calloc(sizeof(l->modulus[0]), node_count);
54 l->class = calloc(sizeof(l->class[0]), node_count);
58 l->spill_cost = calloc(sizeof(l->spill_cost[0]), node_count);
59 l->solutions = calloc(sizeof(l->solutions[0]), node_count);
43 lcra_alloc_equations(unsigned node_count,unsigned class_count) argument
[all...]
H A Dlcra.h34 unsigned node_count; member in struct:lcra_state
82 unsigned node_count, unsigned class_count);
/xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
H A Dbi_ra.c32 unsigned node_count; member in struct:lcra_state
60 lcra_alloc_equations(unsigned node_count) argument
64 l->node_count = node_count;
66 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count);
67 l->solutions = calloc(sizeof(l->solutions[0]), node_count);
68 l->affinity = calloc(sizeof(l->affinity[0]), node_count);
70 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count);
105 l->linear[j * l->node_count
215 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) argument
280 unsigned node_count = bi_max_temp(ctx); local in function:bi_compute_interference
299 unsigned node_count = bi_max_temp(ctx); local in function:bi_allocate_registers
344 unsigned node_count = bi_max_temp(ctx); local in function:bi_reg_from_index
[all...]
H A Dcompiler.h757 bi_node_to_index(unsigned node, unsigned node_count) argument
759 assert(node < node_count);
760 assert(node_count < ~0);
/xsrc/external/mit/freetype/dist/src/cache/
H A Dftcsbits.c221 FT_UInt node_count; local in function:FTC_SNode_New
244 for ( node_count = 0; node_count < count; node_count++ )
246 snode->sbits[node_count].width = 255;
/xsrc/external/mit/MesaLib/dist/src/intel/compiler/
H A Dbrw_fs_reg_allocate.cpp322 node_count = 0;
380 int node_count; member in class:fs_reg_alloc
641 node_count = 0;
642 first_payload_node = node_count;
643 node_count += payload_node_count;
645 first_mrf_hack_node = node_count;
646 node_count += BRW_MAX_GRF - GFX7_MRF_HACK_START;
651 grf127_send_hack_node = node_count;
652 node_count ++;
656 first_vgrf_node = node_count;
[all...]
H A Dbrw_vec4_reg_allocate.cpp167 int node_count = alloc.count; local in function:brw::vec4_visitor::reg_allocate
168 int first_payload_node = node_count;
169 node_count += payload_reg_count;
171 ra_alloc_interference_graph(compiler->vec4_reg_set.regs, node_count);
198 setup_payload_interference(g, first_payload_node, node_count);
/xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/
H A Dbrw_vec4_reg_allocate.cpp206 int node_count = alloc.count; local in function:brw::vec4_visitor::reg_allocate
207 int first_payload_node = node_count;
208 node_count += payload_reg_count;
210 ra_alloc_interference_graph(compiler->vec4_reg_set.regs, node_count);
237 setup_payload_interference(g, first_payload_node, node_count);
H A Dbrw_fs_reg_allocate.cpp545 int node_count = this->alloc.count; local in function:fs_visitor::assign_regs
546 int first_payload_node = node_count;
547 node_count += payload_node_count;
548 int first_mrf_hack_node = node_count;
550 node_count += BRW_MAX_GRF - GEN7_MRF_HACK_START;
551 int grf127_send_hack_node = node_count;
553 node_count ++;
555 ra_alloc_interference_graph(compiler->fs_reg_sets[rsi].regs, node_count);
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/
H A Dradeon_pair_regalloc.c518 unsigned int i, input_node, node_count, node_index; local in function:do_advanced_regalloc
528 node_count = rc_list_count(variables);
530 node_count * sizeof(unsigned int));
570 node_count + s->NumInputs);
572 for (node_index = 0; node_index < node_count; node_index++) {
610 node_count + input_node);
614 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/
H A Dradeon_pair_regalloc.c518 unsigned int i, input_node, node_count, node_index; local in function:do_advanced_regalloc
528 node_count = rc_list_count(variables);
530 node_count * sizeof(struct ra_class *));
570 node_count + s->NumInputs);
572 for (node_index = 0; node_index < node_count; node_index++) {
610 node_count + input_node);
614 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
/xsrc/external/mit/MesaLib/dist/src/panfrost/midgard/
H A Dmidgard_schedule.c99 mir_create_dependency_graph(midgard_instruction **instructions, unsigned count, unsigned node_count) argument
101 size_t sz = node_count * BYTE_COUNT;
132 if (src < node_count) {
169 if (dest < node_count) {
178 if (src < node_count) {
1432 unsigned node_count = ctx->temp_count + 1; local in function:schedule_block
1433 mir_create_dependency_graph(instructions, len, node_count);
1438 uint16_t *liveness = calloc(node_count, 2);
/xsrc/external/mit/MesaLib/dist/src/amd/vulkan/
H A Dradv_acceleration_structure.c474 optimize_bvh(const char *base_ptr, uint32_t *node_ids, uint32_t node_count) argument
482 for (uint32_t i = 0; i < node_count; ++i) {
491 struct bvh_opt_entry *entries = calloc(node_count, sizeof(struct bvh_opt_entry));
495 for (uint32_t i = 0; i < node_count; ++i) {
515 qsort(entries, node_count, sizeof(entries[0]), bvh_opt_compare);
516 for (unsigned i = 0; i < node_count; ++i)
1765 uint32_t node_count; member in struct:bvh_state
1857 bvh_states[i].node_count = prim_consts.dst_scratch_offset / 4;
1869 if (iter && bvh_states[i].node_count == 1)
1880 uint32_t dst_node_count = MAX2(1, DIV_ROUND_UP(bvh_states[i].node_count,
[all...]
/xsrc/external/mit/libdrm/dist/
H A Dxf86drm.c4806 int ret, i, node_count;
4843 node_count = i;
4845 drmFoldDuplicatedDevices(local_devices, node_count);
4849 for (i = 0; i < node_count; i++) {
4949 int ret, i, node_count, device_count; local in function:drmGetDevices2
4973 node_count = i;
4975 drmFoldDuplicatedDevices(local_devices, node_count);
4978 for (i = 0; i < node_count; i++) {

Completed in 32 milliseconds