| /external/bison/src/ |
| InadequacyList.c | 31 InadequacyListNodeCount *node_count)
34 result->id = (*node_count)++;
35 aver (*node_count != 0);
|
| InadequacyList.h | 93 * it is best if <tt>*node_count</t> is zero so that the node count
95 * currently empty, then <tt>*node_count</tt> has not been modified
115 InadequacyListNodeCount *node_count);
|
| /system/libufdt/tests/ |
| run_stress_test.sh | 38 local node_count="$3"
48 echo " Base DT: depth=$node_depth unused=$node_unused nodes=$node_count"
49 ufdt_gen_test_dts -n $node_count -d $node_depth -u $node_unused \
89 # node_count = 5000
|
| run_performance_test.sh | 53 local node_count="$3"
63 echo " Base DT: depth=$node_depth unused=$node_unused nodes=$node_count"
64 ufdt_gen_test_dts -n $node_count -d $node_depth -u $node_unused \
110 # <node_depth> <node_unused> <node_count> <append_count> <override_count>
|
| /external/v8/src/compiler/ |
| state-values-utils.cc | 126 int node_count = static_cast<int>(count); local
127 node = graph()->NewNode(common()->StateValues(node_count, mask), node_count,
139 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx,
146 size_t virtual_node_count = *node_count;
148 while (*values_idx < count && *node_count < kMaxInputCount &&
155 (*node_buffer)[(*node_count)++] = values[*values_idx];
162 DCHECK(*node_count <= StateValuesCache::kMaxInputCount);
175 size_t node_count = 0; local
179 input_mask = FillBufferWithValues(node_buffer, &node_count, values_idx
[all...] |
| state-values-utils.h | 54 // Fills {node_buffer}, starting from {node_count}, with {values}, starting
55 // at {values_idx}, sparsely encoding according to {liveness}. {node_count} is
59 size_t* node_count,
|
| instruction-selector.h | 59 Zone* zone, size_t node_count, Linkage* linkage,
|
| instruction-selector.cc | 24 Zone* zone, size_t node_count, Linkage* linkage,
39 defined_(node_count, false, zone),
40 used_(node_count, false, zone),
41 effect_level_(node_count, 0, zone),
42 virtual_registers_(node_count,
50 instructions_.reserve(node_count);
[all...] |
| wasm-compiler.cc | 4070 size_t node_count = 0; local
[all...] |
| /external/ltp/tools/pounder21/src/ramsnake/ |
| 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)
84 for (i = 0, ptr = graph; i < node_count; i++, ptr++) {
85 gunk = (node_count - 1) * (rand() / (RAND_MAX + 1.0));
|
| /external/freetype/src/cache/ |
| ftcsbits.c | 220 FT_UInt node_count; local
243 for ( node_count = 0; node_count < count; node_count++ )
245 snode->sbits[node_count].width = 255;
|
| /external/ltp/testcases/kernel/sched/pthreads/ |
| pth_str01.c | 49 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
186 my_index = node_count++;
227 printf("thread %d node_count = %d\n", my_index, node_count);
238 if (node_count == num_nodes(breadth, cdepth)) {
355 node_count = 1;
|
| pth_str03.c | 68 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
203 my_index = node_count++;
240 printf("thread %d node_count = %d\n", my_index, node_count);
249 if (node_count == num_nodes(breadth, cdepth)) {
353 node_count = 1;
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_vec4_reg_allocate.cpp | 206 int node_count = alloc.count; local
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);
|
| brw_fs_reg_allocate.cpp | 545 int node_count = this->alloc.count; local
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;
552 ra_alloc_interference_graph(compiler->fs_reg_sets[rsi].regs, node_count);
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_pair_regalloc.c | 518 unsigned int i, input_node, node_count, node_index; local
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(
|
| /external/syslinux/lzo/src/ |
| 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/ |
| nrv2b.c | 262 unsigned int node_count; member in struct:ucl_swd
350 s->node_count = s->n - len;
398 s->node_count = s->n;
427 if (s->rp >= s->node_count)
428 s->rp -= s->node_count;
430 s->rp += s->b_size - s->node_count;
482 if (s->node_count == 0)
509 --s->node_count;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| nb30.h | 115 WORD node_count; member in struct:_FIND_NAME_HEADER
|
| /external/opencv/cv/src/ |
| mycvHaarDetectObjects.cpp | 288 int node_count = classifier->count; local
289 float* alpha_ptr = (float*)(haar_node_ptr + node_count);
291 hid_classifier->count = node_count;
295 for( l = 0; l < node_count; l++ )
312 memcpy( alpha_ptr, classifier->alpha, (node_count+1)*sizeof(alpha_ptr[0]));
314 (MyCvHidHaarTreeNode*)cvAlignPtr(alpha_ptr+node_count+1, sizeof(void*));
316 out->is_stump_based &= node_count == 1;
[all...] |
| cvhaar.cpp | 306 int node_count = classifier->count; local
307 float* alpha_ptr = (float*)(haar_node_ptr + node_count);
309 hid_classifier->count = node_count;
313 for( l = 0; l < node_count; l++ )
330 memcpy( alpha_ptr, classifier->alpha, (node_count+1)*sizeof(alpha_ptr[0]));
332 (CvHidHaarTreeNode*)cvAlignPtr(alpha_ptr+node_count+1, sizeof(void*));
334 out->is_stump_based &= node_count == 1;
[all...] |
| /external/libdrm/ |
| xf86drm.c | 3938 int ret, i, node_count, device_count; local
[all...] |
| /external/v8/src/ast/ |
| ast.h | 170 int node_count() { return node_count_; } function in class:v8::internal::BASE_EMBEDDED
[all...] |
