| /external/bison/src/ |
| D | InadequacyList.c | 31 InadequacyListNodeCount *node_count) in InadequacyList__new_conflict() argument
34 result->id = (*node_count)++; in InadequacyList__new_conflict()
35 aver (*node_count != 0); in InadequacyList__new_conflict()
|
| D | InadequacyList.h | 115 InadequacyListNodeCount *node_count);
|
| /external/ltp/tools/pounder21/src/ramsnake/ |
| D | snake.c | 43 static void populate_graph(void *region, unsigned long long node_count);
75 static void populate_graph(void *graph, unsigned long long node_count) in populate_graph() argument
84 for (i = 0, ptr = graph; i < node_count; i++, ptr++) { in populate_graph()
85 gunk = (node_count - 1) * (rand() / (RAND_MAX + 1.0)); in populate_graph()
|
| /external/freetype/src/cache/ |
| D | ftcsbits.c | 220 FT_UInt node_count; in FTC_SNode_New() local
243 for ( node_count = 0; node_count < count; node_count++ ) in FTC_SNode_New()
245 snode->sbits[node_count].width = 255; in FTC_SNode_New()
|
| /external/ltp/testcases/kernel/sched/pthreads/ |
| D | pth_str01.c | 49 int node_count; /* number of nodes created so far */ variable
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()
|
| D | pth_str03.c | 68 int node_count; /* number of nodes created so far */ variable
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()
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| D | radeon_pair_regalloc.c | 540 unsigned int i, j, index, input_node, node_count, node_index; in do_advanced_regalloc() local
554 node_count = rc_list_count(variables); in do_advanced_regalloc()
556 node_count * sizeof(unsigned int)); in do_advanced_regalloc()
634 graph = ra_alloc_interference_graph(regs, node_count + s->NumInputs); in do_advanced_regalloc()
666 ra_set_node_class(graph, node_count + input_node, in do_advanced_regalloc()
674 node_count + input_node); in do_advanced_regalloc()
678 ra_set_node_reg(graph, node_count + input_node, get_reg_id( in do_advanced_regalloc()
|
| /external/syslinux/lzo/src/ |
| D | lzo_swd.ch | 128 lzo_uint node_count;
211 s->node_count = s->swd_n - len;
285 s->node_count = s->swd_n;
336 if (s->rp >= s->node_count)
337 s->rp -= s->node_count;
339 s->rp += s->b_size - s->node_count;
419 if (s->node_count == 0)
450 --s->node_count;
|
| /external/syslinux/gpxe/src/util/ |
| D | nrv2b.c | 262 unsigned int node_count; member
350 s->node_count = s->n - len; in swd_insertdict()
398 s->node_count = s->n; in swd_init()
427 if (s->rp >= s->node_count) in swd_init()
428 s->rp -= s->node_count; in swd_init()
430 s->rp += s->b_size - s->node_count; in swd_init()
482 if (s->node_count == 0) in swd_remove_node()
509 --s->node_count; in swd_remove_node()
|
| /external/opencv/cv/src/ |
| D | mycvHaarDetectObjects.cpp | 288 int node_count = classifier->count; in myicvCreateHidHaarClassifierCascade() local
289 float* alpha_ptr = (float*)(haar_node_ptr + node_count); in myicvCreateHidHaarClassifierCascade()
291 hid_classifier->count = node_count; in myicvCreateHidHaarClassifierCascade()
295 for( l = 0; l < node_count; l++ ) in myicvCreateHidHaarClassifierCascade()
312 memcpy( alpha_ptr, classifier->alpha, (node_count+1)*sizeof(alpha_ptr[0])); in myicvCreateHidHaarClassifierCascade()
314 (MyCvHidHaarTreeNode*)cvAlignPtr(alpha_ptr+node_count+1, sizeof(void*)); in myicvCreateHidHaarClassifierCascade()
316 out->is_stump_based &= node_count == 1; in myicvCreateHidHaarClassifierCascade()
|
| D | cvhaar.cpp | 306 int node_count = classifier->count; in icvCreateHidHaarClassifierCascade() local
307 float* alpha_ptr = (float*)(haar_node_ptr + node_count); in icvCreateHidHaarClassifierCascade()
309 hid_classifier->count = node_count; in icvCreateHidHaarClassifierCascade()
313 for( l = 0; l < node_count; l++ ) in icvCreateHidHaarClassifierCascade()
330 memcpy( alpha_ptr, classifier->alpha, (node_count+1)*sizeof(alpha_ptr[0])); in icvCreateHidHaarClassifierCascade()
332 (CvHidHaarTreeNode*)cvAlignPtr(alpha_ptr+node_count+1, sizeof(void*)); in icvCreateHidHaarClassifierCascade()
334 out->is_stump_based &= node_count == 1; in icvCreateHidHaarClassifierCascade()
|
| /external/libdrm/ |
| D | xf86drm.c | 3087 int ret, i, node_count; in drmGetDevice() local
3159 node_count = i; in drmGetDevice()
3162 drmFoldDuplicatedDevices(local_devices, node_count); in drmGetDevice()
3165 for (i = 1; i < node_count && local_devices[i]; i++) in drmGetDevice()
3203 int ret, i, node_count, device_count; in drmGetDevices() local
3263 node_count = i; in drmGetDevices()
3266 drmFoldDuplicatedDevices(local_devices, node_count); in drmGetDevices()
3269 for (i = 0; i < node_count && local_devices[i]; i++) { in drmGetDevices()
|
| /external/v8/src/compiler/ |
| D | instruction-selector.cc | 23 Zone* zone, size_t node_count, Linkage* linkage, in InstructionSelector() argument
38 defined_(node_count, false, zone), in InstructionSelector()
39 used_(node_count, false, zone), in InstructionSelector()
40 effect_level_(node_count, 0, zone), in InstructionSelector()
41 virtual_registers_(node_count, in InstructionSelector()
49 instructions_.reserve(node_count); in InstructionSelector()
|
| D | instruction-selector.h | 56 Zone* zone, size_t node_count, Linkage* linkage,
|
| D | wasm-compiler.cc | 3406 size_t node_count = 0; in ExecuteCompilation() local
3418 node_count = jsgraph_->graph()->NodeCount(); in ExecuteCompilation()
3445 decode_ms, node_count, pipeline_ms); in ExecuteCompilation()
|
| /external/v8/src/ast/ |
| D | ast.h | 166 int node_count() { return node_count_; } in node_count() function
2671 int ast_node_count() { return ast_properties_.node_count(); } in ast_node_count()
|
| /external/bison/ |
| D | ChangeLog-2012 | 1556 node_count argument and use it to assign a unique ID.
|