Home
last modified time | relevance | path

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

12

/third_party/mesa3d/src/panfrost/util/
H A Dlcra.c44 unsigned node_count, unsigned class_count) in lcra_alloc_equations()
48 l->node_count = node_count; in lcra_alloc_equations()
51 l->alignment = calloc(sizeof(l->alignment[0]), node_count); in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
53 l->modulus = calloc(sizeof(l->modulus[0]), node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
58 l->spill_cost = calloc(sizeof(l->spill_cost[0]), node_count); in lcra_alloc_equations()
59 l->solutions = calloc(sizeof(l->solutions[0]), node_count); in lcra_alloc_equations()
43 lcra_alloc_equations( unsigned node_count, unsigned class_count) lcra_alloc_equations() argument
[all...]
H A Dlcra.h34 unsigned node_count; member
82 unsigned node_count, unsigned class_count);
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_ra.c33 unsigned node_count; member
62 lcra_alloc_equations(unsigned node_count) in lcra_alloc_equations() argument
66 l->node_count = node_count; in lcra_alloc_equations()
68 l->linear = calloc(sizeof(l->linear[0]), node_count); in lcra_alloc_equations()
69 l->solutions = calloc(sizeof(l->solutions[0]), node_count); in lcra_alloc_equations()
70 l->affinity = calloc(sizeof(l->affinity[0]), node_count); in lcra_alloc_equations()
72 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count); in lcra_alloc_equations()
80 for (unsigned i = 0; i < l->node_count; ++i) in lcra_free()
115 nodearray_orr(&l->linear[j], i, constraint_fw, 256, l->node_count); in lcra_add_node_interference()
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) bi_mark_interference() argument
339 unsigned node_count = bi_max_temp(ctx); bi_compute_interference() local
358 unsigned node_count = bi_max_temp(ctx); bi_allocate_registers() local
468 unsigned node_count = bi_max_temp(ctx); bi_reg_from_index() local
[all...]
H A Dbi_opt_push_ubo.c233 unsigned node_count = 0; in bi_create_fau_interference_graph() local
241 nodes[node_count++] = word; in bi_create_fau_interference_graph()
246 for (unsigned i = 0; i < node_count; ++i) { in bi_create_fau_interference_graph()
247 for (unsigned j = 0; j < node_count; ++j) { in bi_create_fau_interference_graph()
/third_party/node/deps/v8/src/compiler/
H A Dstate-values-utils.cc127 int node_count = static_cast<int>(count); in GetValuesNodeFromCache() local
128 node = graph()->NewNode(common()->StateValues(node_count, mask), node_count, in GetValuesNodeFromCache()
140 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx, in FillBufferWithValues()
146 size_t virtual_node_count = *node_count; in FillBufferWithValues()
148 while (*values_idx < count && *node_count < kMaxInputCount && in FillBufferWithValues()
155 (*node_buffer)[(*node_count)++] = values[*values_idx]; in FillBufferWithValues()
162 DCHECK_GE(StateValuesCache::kMaxInputCount, *node_count); in FillBufferWithValues()
176 size_t node_count = 0; in BuildTree() local
180 input_mask = FillBufferWithValues(node_buffer, &node_count, values_id in BuildTree()
139 FillBufferWithValues( WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx, Node** values, size_t count, const BytecodeLivenessState* liveness) FillBufferWithValues() argument
[all...]
H A Dstate-values-utils.h56 // Fills {node_buffer}, starting from {node_count}, with {values}, starting
57 // at {values_idx}, sparsely encoding according to {liveness}. {node_count} is
61 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx,
/third_party/ninja/src/
H A Ddeps_log.h75 bool RecordDeps(Node* node, TimeStamp mtime, int node_count, Node** nodes);
80 Deps(int64_t mtime, int node_count) in Deps()
81 : mtime(mtime), node_count(node_count), nodes(new Node*[node_count]) {} in Deps()
84 int node_count; member
H A Ddeps_log.cc67 int node_count, Node** nodes) { in RecordDeps()
77 for (int i = 0; i < node_count; ++i) { in RecordDeps()
90 deps->node_count != node_count) { in RecordDeps()
93 for (int i = 0; i < node_count; ++i) { in RecordDeps()
107 unsigned size = 4 * (1 + 2 + node_count); in RecordDeps()
128 for (int i = 0; i < node_count; ++i) { in RecordDeps()
137 Deps* deps = new Deps(mtime, node_count); in RecordDeps()
138 for (int i = 0; i < node_count; ++i) in RecordDeps()
303 for (int i = 0; i < deps->node_count;
66 RecordDeps(Node* node, TimeStamp mtime, int node_count, Node** nodes) RecordDeps() argument
[all...]
H A Ddeps_log_test.cc63 ASSERT_EQ(2, log_deps->node_count); in TEST_F()
87 ASSERT_EQ(2, log_deps->node_count); in TEST_F()
111 ASSERT_EQ(kNumDeps, log_deps->node_count); in TEST_F()
122 ASSERT_EQ(kNumDeps, log_deps->node_count); in TEST_F()
263 ASSERT_EQ(1, deps->node_count); in TEST_F()
270 ASSERT_EQ(2, deps->node_count); in TEST_F()
280 ASSERT_EQ(1, deps->node_count); in TEST_F()
287 ASSERT_EQ(2, deps->node_count); in TEST_F()
317 ASSERT_EQ(1, deps->node_count); in TEST_F()
324 ASSERT_EQ(2, deps->node_count); in TEST_F()
415 int node_count = 5; TEST_F() local
[all...]
H A Dmissing_deps.cc96 ProcessNodeDeps(node, deps->nodes, deps->node_count); in ProcessNode()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcordz_info_statistics_test.cc196 STATS_MATCHER_EXPECT_EQ(node_count); in MATCHER_P()
224 expected.node_count = 1; in TEST()
239 expected.node_count = 1; in TEST()
254 expected.node_count = 1; in TEST()
268 expected.node_count = 1; in TEST()
283 expected.node_count = 2; in TEST()
301 expected.node_count = 2; in TEST()
320 expected.node_count = 3; in TEST()
346 expected.node_count = 8; in TEST()
373 expected.node_count in TEST()
[all...]
H A Dcordz_info.cc145 statistics_.node_count++; in CountFlat()
169 statistics_.node_count++; in CountLinearReps()
185 statistics_.node_count++; in CountLinearReps()
204 statistics_.node_count++; in AnalyzeConcat()
225 statistics_.node_count++; in AnalyzeRing()
236 statistics_.node_count++; in AnalyzeBtree()
H A Dcordz_statistics.h68 int64_t node_count = 0; member
/third_party/skia/third_party/externals/freetype/src/cache/
H A Dftcsbits.c226 FT_UInt node_count; in FT_LOCAL_DEF() local
249 for ( node_count = 0; node_count < count; node_count++ ) in FT_LOCAL_DEF()
251 snode->sbits[node_count].width = 255; in FT_LOCAL_DEF()
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_fs_reg_allocate.cpp322 node_count = 0; in fs_reg_alloc()
380 int node_count; member in fs_reg_alloc
646 node_count = 0; in build_interference_graph()
647 first_payload_node = node_count; in build_interference_graph()
648 node_count += payload_node_count; in build_interference_graph()
650 first_mrf_hack_node = node_count; in build_interference_graph()
651 node_count += BRW_MAX_GRF - GFX7_MRF_HACK_START; in build_interference_graph()
656 grf127_send_hack_node = node_count; in build_interference_graph()
657 node_count ++; in build_interference_graph()
661 first_vgrf_node = node_count; in build_interference_graph()
[all...]
H A Dbrw_vec4_reg_allocate.cpp171 int node_count = alloc.count; in reg_allocate() local
172 int first_payload_node = node_count; in reg_allocate()
173 node_count += payload_reg_count; in reg_allocate()
175 ra_alloc_interference_graph(compiler->vec4_reg_set.regs, node_count); in reg_allocate()
202 setup_payload_interference(g, first_payload_node, node_count); in reg_allocate()
/third_party/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_pair_regalloc.c518 unsigned int i, input_node, node_count, node_index; in do_advanced_regalloc() local
528 node_count = rc_list_count(variables); in do_advanced_regalloc()
530 node_count * sizeof(struct ra_class *)); in do_advanced_regalloc()
570 node_count + s->NumInputs); in do_advanced_regalloc()
572 for (node_index = 0; node_index < node_count; node_index++) { in do_advanced_regalloc()
610 node_count + input_node); in do_advanced_regalloc()
614 ra_set_node_reg(graph, node_count + input_node, get_reg_id( in do_advanced_regalloc()
/third_party/ltp/testcases/kernel/sched/pthreads/
H A Dpth_str03.c68 int node_count; /* number of nodes created so far */ variable
69 pthread_mutex_t node_mutex; /* mutex for the node_count */
70 pthread_cond_t node_condvar; /* condition variable for node_count */
199 /* Lock the node_count mutex to we can safely increment it. We in synchronize_children()
203 my_index = node_count++; in synchronize_children()
240 printf("thread %d node_count = %d\n", my_index, node_count); in synchronize_children()
249 if (node_count == num_nodes(breadth, cdepth)) { in synchronize_children()
353 node_count = 1; in doit()
H A Dpth_str01.c49 int node_count; /* number of nodes created so far */ variable
50 pthread_mutex_t node_mutex; /* mutex for the node_count */
51 pthread_cond_t node_condvar; /* condition variable for node_count */
181 * Lock the node_count mutex to we can safely increment it. We in synchronize_children()
186 my_index = node_count++; in synchronize_children()
227 printf("thread %d node_count = %d\n", my_index, node_count); in synchronize_children()
238 if (node_count == num_nodes(breadth, cdepth)) { in synchronize_children()
355 node_count = 1; in doit()
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dpcy_node.c68 if (tree->node_maximum > 0 && tree->node_count >= tree->node_maximum) in ossl_policy_level_add_node()
111 tree->node_count++; in ossl_policy_level_add_node()
H A Dpcy_local.h115 size_t node_count; member
/third_party/openssl/crypto/x509/
H A Dpcy_node.c68 if (tree->node_maximum > 0 && tree->node_count >= tree->node_maximum) in ossl_policy_level_add_node()
111 tree->node_count++; in ossl_policy_level_add_node()
H A Dpcy_local.h115 size_t node_count; member
/third_party/mesa3d/src/panfrost/midgard/
H A Dmidgard_schedule.c99 mir_create_dependency_graph(midgard_instruction **instructions, unsigned count, unsigned node_count) in mir_create_dependency_graph() argument
101 size_t sz = node_count * BYTE_COUNT; in mir_create_dependency_graph()
132 if (src < node_count) { in mir_create_dependency_graph()
169 if (dest < node_count) { in mir_create_dependency_graph()
178 if (src < node_count) { in mir_create_dependency_graph()
1432 unsigned node_count = ctx->temp_count + 1; in schedule_block() local
1433 mir_create_dependency_graph(instructions, len, node_count); in schedule_block()
1438 uint16_t *liveness = calloc(node_count, 2); in schedule_block()
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_acceleration_structure.c579 optimize_bvh(const char *base_ptr, uint32_t *node_ids, uint32_t node_count) in optimize_bvh() argument
581 if (node_count == 0) in optimize_bvh()
590 for (uint32_t i = 0; i < node_count; ++i) { in optimize_bvh()
599 struct bvh_opt_entry *entries = calloc(node_count, sizeof(struct bvh_opt_entry)); in optimize_bvh()
603 for (uint32_t i = 0; i < node_count; ++i) { in optimize_bvh()
623 qsort(entries, node_count, sizeof(entries[0]), bvh_opt_compare); in optimize_bvh()
624 for (unsigned i = 0; i < node_count; ++i) in optimize_bvh()
2025 uint32_t node_count; member
2155 bvh_states[i].node_count = prim_consts.dst_scratch_offset / node_id_stride; in radv_CmdBuildAccelerationStructuresKHR()
2176 radv_unaligned_dispatch(cmd_buffer, bvh_states[i].node_count, in radv_CmdBuildAccelerationStructuresKHR()
[all...]

Completed in 19 milliseconds

12