| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_benchmark.cc | 27 const int num_nodes = state.range(0); in BM_StressTest() local
28 while (state.KeepRunningBatch(num_nodes)) { in BM_StressTest()
30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
31 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
34 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
35 int end = std::min(num_nodes, i + 5); in BM_StressTest()
|
| /third_party/ltp/testcases/kernel/lib/ |
| D | numa_helper.c | 152 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes) in get_allowed_nodes_arr() argument
159 *num_nodes = 0; in get_allowed_nodes_arr()
195 (*nodes)[*num_nodes] = i; in get_allowed_nodes_arr()
196 (*num_nodes)++; in get_allowed_nodes_arr()
220 int num_nodes = 0; in get_allowed_nodes() local
223 ret = get_allowed_nodes_arr(flag, &num_nodes, &nodes); in get_allowed_nodes()
230 if (i < num_nodes) { in get_allowed_nodes()
247 int i, ret, num_nodes; in print_node_info() local
249 ret = get_allowed_nodes_arr(flag, &num_nodes, &allowed_nodes); in print_node_info()
252 for (i = 0; i < num_nodes; i++) in print_node_info()
|
| /third_party/node/deps/openssl/openssl/crypto/lhash/ |
| D | lh_stats.c | 65 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes); in OPENSSL_LH_stats_bio()
87 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_node_stats_bio()
101 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_node_usage_stats_bio()
109 BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes); in OPENSSL_LH_node_usage_stats_bio()
114 (int)(total / lh->num_nodes), in OPENSSL_LH_node_usage_stats_bio()
115 (int)((total % lh->num_nodes) * 100 / lh->num_nodes), in OPENSSL_LH_node_usage_stats_bio()
|
| D | lhash.c | 63 ret->num_nodes = MIN_NODES / 2; in OPENSSL_LH_new()
94 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_flush()
114 if ((lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) && !expand(lh)) in OPENSSL_LH_insert()
156 if ((lh->num_nodes > MIN_NODES) && in OPENSSL_LH_delete()
157 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) in OPENSSL_LH_delete()
190 for (i = lh->num_nodes - 1; i >= 0; i--) { in doall_util_fn()
238 lh->num_nodes++; in expand()
278 lh->num_nodes--; in contract()
|
| /third_party/openssl/crypto/lhash/ |
| D | lh_stats.c | 65 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes); in OPENSSL_LH_stats_bio()
87 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_node_stats_bio()
101 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_node_usage_stats_bio()
109 BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes); in OPENSSL_LH_node_usage_stats_bio()
114 (int)(total / lh->num_nodes), in OPENSSL_LH_node_usage_stats_bio()
115 (int)((total % lh->num_nodes) * 100 / lh->num_nodes), in OPENSSL_LH_node_usage_stats_bio()
|
| D | lhash.c | 63 ret->num_nodes = MIN_NODES / 2; in OPENSSL_LH_new()
94 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_flush()
114 if ((lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) && !expand(lh)) in OPENSSL_LH_insert()
156 if ((lh->num_nodes > MIN_NODES) && in OPENSSL_LH_delete()
157 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) in OPENSSL_LH_delete()
190 for (i = lh->num_nodes - 1; i >= 0; i--) { in doall_util_fn()
238 lh->num_nodes++; in expand()
278 lh->num_nodes--; in contract()
|
| /third_party/ltp/testcases/kernel/mem/lib/ |
| D | mem.c | 174 int num_nodes, *nodes; in set_global_mempolicy() local
178 ret = get_allowed_nodes_arr(NH_MEMS|NH_CPUS, &num_nodes, &nodes); in set_global_mempolicy()
181 if (num_nodes < 2) { in set_global_mempolicy()
193 if (num_nodes == 2) { in set_global_mempolicy()
526 int num_nodes, *nodes; in test_ksm_merge_across_nodes() local
534 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in test_ksm_merge_across_nodes()
537 if (num_nodes < 2) { in test_ksm_merge_across_nodes()
546 memory = SAFE_MALLOC(num_nodes * sizeof(char *)); in test_ksm_merge_across_nodes()
547 for (i = 0; i < num_nodes; i++) { in test_ksm_merge_across_nodes()
572 nr_pages * num_nodes); in test_ksm_merge_across_nodes()
[all …]
|
| /third_party/mesa3d/src/gallium/drivers/etnaviv/ |
| D | etnaviv_compiler_nir_ra.c | 140 unsigned num_nodes = etna_live_defs(impl, defs, live_map); in etna_ra_assign() local
141 struct ra_graph *g = ra_alloc_interference_graph(regs, num_nodes); in etna_ra_assign()
144 for (unsigned i = 0; i < num_nodes; i++) { in etna_ra_assign()
224 for (unsigned i = 0; i < num_nodes; i++) { in etna_ra_assign()
241 c->num_nodes = num_nodes; in etna_ra_assign()
249 for (unsigned i = 0; i < c->num_nodes; i++) { in etna_ra_finish()
|
| /third_party/mesa3d/src/util/tests/ |
| D | dag_test.cpp | 79 init_nodes(struct dag *dag, struct node *nodes, unsigned num_nodes) in init_nodes() argument
81 for (unsigned i = 0; i < num_nodes; i++) { in init_nodes()
87 #define INIT_NODES(num_nodes) \ argument
88 typedef struct { int order[num_nodes]; } result_type; \
89 struct node node[(num_nodes)]; \
90 init_nodes(dag, node, (num_nodes))
|
| /third_party/skia/third_party/externals/freetype/src/cache/ |
| D | ftcglyph.c | 36 family->num_nodes++; in FTC_GNode_Init()
48 if ( family && --family->num_nodes == 0 ) in FTC_GNode_UnselectFamily()
112 family->num_nodes = 0; in FTC_Family_Init()
205 family->num_nodes++; in FTC_GCache_Lookup()
209 if ( --family->num_nodes == 0 ) in FTC_GCache_Lookup()
|
| D | ftcmru.c | 174 list->num_nodes = 0; in FTC_MruList_Init()
189 FT_ASSERT( list->num_nodes == 0 ); in FTC_MruList_Reset()
244 if ( list->num_nodes >= list->max_nodes && list->max_nodes > 0 ) in FTC_MruList_New()
260 list->num_nodes--; in FTC_MruList_New()
273 list->num_nodes++; in FTC_MruList_New()
311 list->num_nodes--; in FTC_MruList_Remove()
|
| D | ftcglyph.h | 137 FT_UInt num_nodes; /* current number of nodes in this family */ member
298 _gqfamily->num_nodes++; \
302 if ( --_gqfamily->num_nodes == 0 ) \
|
| D | ftcmanag.c | 403 manager->num_nodes = 0; in FTC_Manager_New()
464 FTC_Manager_FlushN( manager, manager->num_nodes ); in FTC_Manager_Reset()
520 if ( count != manager->num_nodes ) in FTC_Manager_Check()
523 manager->num_nodes, count )); in FTC_Manager_Check()
552 manager->num_nodes )); in FTC_Manager_Compress()
|
| /third_party/mesa3d/src/imgui/ |
| D | imstb_rectpack.h | 128 …tbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
186 int num_nodes; member
256 context->align = (context->width + context->num_nodes-1) / context->num_nodes; in stbrp_setup_allow_out_of_mem()
260 … stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) in stbrp_init_target() argument
267 for (i=0; i < num_nodes-1; ++i) in stbrp_init_target()
276 context->num_nodes = num_nodes; in stbrp_init_target()
516 STBRP_ASSERT(count == context->num_nodes+2); in stbrp__skyline_pack_rectangle()
|
| /third_party/skia/third_party/externals/imgui/ |
| D | imstb_rectpack.h | 130 …tbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
188 int num_nodes; member
258 context->align = (context->width + context->num_nodes-1) / context->num_nodes; in stbrp_setup_allow_out_of_mem()
262 … stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) in stbrp_init_target() argument
269 for (i=0; i < num_nodes-1; ++i) in stbrp_init_target()
278 context->num_nodes = num_nodes; in stbrp_init_target()
525 STBRP_ASSERT(count == context->num_nodes+2); in stbrp__skyline_pack_rectangle()
|
| /third_party/ltp/testcases/kernel/syscalls/migrate_pages/ |
| D | migrate_pages02.c | 45 static int num_nodes; variable
84 for (i = 0; i < num_nodes; i++) in migrate_to_node()
269 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in setup()
273 if (num_nodes < 2) in setup()
290 for (i = 0; i < num_nodes; i++) { in setup()
|
| D | migrate_pages03.c | 41 static int num_nodes, max_node; variable
55 if (get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes) < 0) in setup()
58 if (num_nodes < TEST_NODES) { in setup()
|
| D | migrate_pages01.c | 125 int num_nodes, ret, i; in test_invalid_nodes() local
130 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in test_invalid_nodes()
136 for (i = 0; i < num_nodes; i++, invalid_node++) in test_invalid_nodes()
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | LinkedListTests.cpp | 62 int num_nodes, in ExpectListContentsForDirection() argument
68 ASSERT_LT(i, num_nodes); in ExpectListContentsForDirection()
69 int index_of_id = forward ? i : num_nodes - i - 1; in ExpectListContentsForDirection()
73 EXPECT_EQ(num_nodes, i); in ExpectListContentsForDirection()
76 void ExpectListContents(const LinkedList<Node>& list, int num_nodes, const int* node_ids) { in ExpectListContents() argument
79 ExpectListContentsForDirection(list, num_nodes, node_ids, true); in ExpectListContents()
83 ExpectListContentsForDirection(list, num_nodes, node_ids, false); in ExpectListContents()
|
| /third_party/gstreamer/gstplugins_good/ext/raw1394/ |
| D | gst1394probe.c | 38 int num_nodes = 0;
51 num_nodes = raw1394_get_nodecount (handle);
52 for (node = 0; node < num_nodes; node++) {
|
| /third_party/ltp/testcases/kernel/sched/pthreads/ |
| D | pth_str01.c | 54 int num_nodes(int, int);
144 int num_nodes(int b, int d) in num_nodes() function
228 printf("expecting %d nodes\n", num_nodes(breadth, cdepth)); in synchronize_children()
238 if (node_count == num_nodes(breadth, cdepth)) { in synchronize_children()
573 total = num_nodes(breadth, depth); in main()
|
| D | pth_str03.c | 73 int num_nodes(int, int);
163 int num_nodes(int b, int d) in num_nodes() function
241 printf("expecting %d nodes\n", num_nodes(breadth, cdepth)); in synchronize_children()
249 if (node_count == num_nodes(breadth, cdepth)) { in synchronize_children()
547 if ((total = num_nodes(breadth, depth)) > MAXTHREADS) { in main()
|
| /third_party/skia/third_party/externals/libwebp/src/utils/ |
| D | huffman_utils.c | 148 int num_nodes = 1; // number of Huffman tree nodes in BuildHuffmanTable() local
156 num_nodes += num_open; in BuildHuffmanTable()
175 num_nodes += num_open; in BuildHuffmanTable()
203 if (num_nodes != 2 * offset[MAX_ALLOWED_CODE_LENGTH] - 1) { in BuildHuffmanTable()
|
| /third_party/node/deps/brotli/c/enc/ |
| D | hash_to_binary_tree_inc.h | 84 size_t num_nodes = (size_t)1 << params->lgwin; in FN() local
85 if (one_shot && input_size < num_nodes) { in FN()
86 num_nodes = input_size; in FN()
88 return sizeof(uint32_t) * BUCKET_SIZE + 2 * sizeof(uint32_t) * num_nodes; in FN()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | hash_to_binary_tree_inc.h | 84 size_t num_nodes = (size_t)1 << params->lgwin; in FN() local
85 if (one_shot && input_size < num_nodes) { in FN()
86 num_nodes = input_size; in FN()
88 return sizeof(uint32_t) * BUCKET_SIZE + 2 * sizeof(uint32_t) * num_nodes; in FN()
|