| /external/ltp/tools/pounder21/src/ramsnake/ |
| D | snake.c | 142 unsigned long long num_nodes, ram_size; in main() local
163 num_nodes = ram_size / sizeof(void *); in main()
174 num_nodes = ram_size / sizeof(void *); in main()
177 num_nodes = atoi(optarg); in main()
178 ram_size = num_nodes * sizeof(void *); in main()
201 ram_size / 1024, num_nodes); in main()
204 num_nodes = ram_size / sizeof(void *); in main()
206 ram_size / 1024, num_nodes); in main()
211 num_nodes); in main()
220 printf("mmap region: %p (%llu nodes)\n", shm, num_nodes); in main()
[all …]
|
| /external/ltp/testcases/kernel/lib/ |
| D | numa_helper.c | 163 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes) in get_allowed_nodes_arr() argument
170 *num_nodes = 0; in get_allowed_nodes_arr()
206 (*nodes)[*num_nodes] = i; in get_allowed_nodes_arr()
207 (*num_nodes)++; in get_allowed_nodes_arr()
231 int num_nodes = 0; in get_allowed_nodes() local
234 ret = get_allowed_nodes_arr(flag, &num_nodes, &nodes); in get_allowed_nodes()
241 if (i < num_nodes) { in get_allowed_nodes()
258 int i, ret, num_nodes; in print_node_info() local
260 ret = get_allowed_nodes_arr(flag, &num_nodes, &allowed_nodes); in print_node_info()
263 for (i = 0; i < num_nodes; i++) in print_node_info()
|
| /external/freetype/src/cache/ |
| D | ftcglyph.c | 37 family->num_nodes++; in FTC_GNode_Init()
49 if ( family && --family->num_nodes == 0 ) in FTC_GNode_UnselectFamily()
113 family->num_nodes = 0; in FTC_Family_Init()
206 family->num_nodes++; in FTC_GCache_Lookup()
210 if ( --family->num_nodes == 0 ) in FTC_GCache_Lookup()
|
| D | ftcmru.c | 175 list->num_nodes = 0; in FTC_MruList_Init()
190 FT_ASSERT( list->num_nodes == 0 ); in FTC_MruList_Reset()
245 if ( list->num_nodes >= list->max_nodes && list->max_nodes > 0 ) in FTC_MruList_New()
261 list->num_nodes--; in FTC_MruList_New()
274 list->num_nodes++; in FTC_MruList_New()
312 list->num_nodes--; in FTC_MruList_Remove()
|
| D | ftcglyph.h | 138 FT_UInt num_nodes; /* current number of nodes in this family */ member
299 _gqfamily->num_nodes++; \
303 if ( --_gqfamily->num_nodes == 0 ) \
|
| D | ftccache.c | 57 manager->num_nodes++; in ftc_node_mru_link()
71 manager->num_nodes--; in ftc_node_mru_unlink()
311 if ( manager->num_nodes == 0 ) in ftc_node_destroy()
313 manager->num_nodes )); in ftc_node_destroy()
|
| D | ftccache.h | 338 _try_count > _try_manager->num_nodes ) \
339 _try_count = _try_manager->num_nodes; \
|
| D | ftcmanag.h | 99 FT_UInt num_nodes; member
|
| /external/ltp/testcases/kernel/mem/lib/ |
| D | mem.c | 175 int num_nodes, *nodes; in set_global_mempolicy() local
179 ret = get_allowed_nodes_arr(NH_MEMS|NH_CPUS, &num_nodes, &nodes); in set_global_mempolicy()
183 if (num_nodes < 2) { in set_global_mempolicy()
195 if (num_nodes == 2) { in set_global_mempolicy()
578 int num_nodes, *nodes; in test_ksm_merge_across_nodes() local
587 ret = get_allowed_nodes_arr(NH_MEMS|NH_CPUS, &num_nodes, &nodes); in test_ksm_merge_across_nodes()
590 if (num_nodes < 2) { in test_ksm_merge_across_nodes()
599 memory = malloc(num_nodes * sizeof(char *)); in test_ksm_merge_across_nodes()
600 for (i = 0; i < num_nodes; i++) { in test_ksm_merge_across_nodes()
628 nr_pages * num_nodes); in test_ksm_merge_across_nodes()
[all …]
|
| /external/webp/src/utils/ |
| D | huffman_utils.c | 141 int num_nodes = 1; // number of Huffman tree nodes in BuildHuffmanTable() local
149 num_nodes += num_open; in BuildHuffmanTable()
167 num_nodes += num_open; in BuildHuffmanTable()
191 if (num_nodes != 2 * offset[MAX_ALLOWED_CODE_LENGTH] - 1) { in BuildHuffmanTable()
|
| /external/ltp/testcases/kernel/syscalls/migrate_pages/ |
| D | migrate_pages02.c | 72 static int num_nodes; variable
118 for (i = 0; i < num_nodes; i++) in migrate_to_node()
348 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in setup()
352 if (num_nodes < 2) in setup()
368 for (i = 0; i < num_nodes; i++) { in setup()
|
| D | migrate_pages01.c | 131 int num_nodes, ret, i; in test_invalid_nodes() local
136 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in test_invalid_nodes()
142 for (i = 0; i < num_nodes; i++, invalid_node++) in test_invalid_nodes()
|
| /external/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()
|
| /external/brotli/enc/ |
| D | hash_to_binary_tree_inc.h | 86 size_t num_nodes = (size_t)1 << params->lgwin; in FN() local
87 if (one_shot && input_size < num_nodes) { in FN()
88 num_nodes = input_size; in FN()
90 return sizeof(HashToBinaryTree) + 2 * sizeof(uint32_t) * num_nodes; in FN()
|
| /external/google-breakpad/src/processor/ |
| D | static_map-inl.h | 127 int32_t num_nodes = *(reinterpret_cast<const int32_t*>(raw_data_)); in ValidateInMemoryStructure() local
128 if (num_nodes < 0) { in ValidateInMemoryStructure()
|
| /external/v8/src/compiler/ |
| D | loop-analysis.h | 28 LoopTree(size_t num_nodes, Zone* zone) in LoopTree() argument
32 node_to_loop_num_(static_cast<int>(num_nodes), -1, zone), in LoopTree()
|
| D | loop-analysis.cc | 120 int num_nodes() { in num_nodes() function in v8::internal::compiler::LoopFinderImpl
275 int max = num_nodes(); in ResizeBackwardMarks()
290 int max = num_nodes(); in ResizeForwardMarks()
|
| /external/ltp/testcases/kernel/include/ |
| D | numa_helper.h | 34 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes);
|
| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| D | wpd_tree.h | 77 int num_nodes() const { return num_nodes_; } in num_nodes() function
|
| D | wpd_tree_unittest.cc | 40 ASSERT_EQ(kExpectedNumberOfNodes, tree.num_nodes()); in TEST()
|
| /external/stressapptest/src/ |
| D | os.h | 330 int num_nodes() const { return num_nodes_; } in num_nodes() function
|