| /external/chromium_org/ui/accessibility/ |
| H A D | tree_generator.h | 37 TreeGenerator(int node_count);
|
| H A D | tree_generator.cc | 12 TreeGenerator::TreeGenerator(int node_count) argument
13 : node_count_(node_count), unique_tree_count_(1) {
|
| /external/bison/src/ |
| H A D | InadequacyList.c | 31 InadequacyListNodeCount *node_count)
34 result->id = (*node_count)++;
35 aver (*node_count != 0);
29 InadequacyList__new_conflict(state *manifesting_state, symbol *token, bitset actions, InadequacyListNodeCount *node_count) argument
|
| H A D | 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);
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| H A D | 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/freetype/src/cache/ |
| H A D | 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/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| H A D | radeon_pair_regalloc.c | 540 unsigned int i, j, index, input_node, node_count, node_index; local
554 node_count = rc_list_count(variables);
556 node_count * sizeof(unsigned int));
634 graph = ra_alloc_interference_graph(regs, node_count + s->NumInputs);
666 ra_set_node_class(graph, node_count + input_node,
674 node_count + input_node);
678 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| H A D | radeon_pair_regalloc.c | 540 unsigned int i, j, index, input_node, node_count, node_index; local
554 node_count = rc_list_count(variables);
556 node_count * sizeof(unsigned int));
634 graph = ra_alloc_interference_graph(regs, node_count + s->NumInputs);
666 ra_set_node_class(graph, node_count + input_node,
674 node_count + input_node);
678 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
|
| /external/chromium_org/v8/src/compiler/ |
| H A D | pipeline.cc | 387 int node_count = graph->NodeCount(); local
388 if (node_count > UnallocatedOperand::kMaxVirtualRegisters) {
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/heap_snapshot_worker/ |
| H A D | HeapSnapshotLoader.js | 157 var nodes_length = this._snapshot.snapshot.node_count * node_fields_count;
|
| H A D | HeapSnapshot.js | 888 this.node_count = 0;
|
| /external/opencv/cv/src/ |
| H A D | 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;
|
| H A D | 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;
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| H A D | test-scheduler.cc | 71 int node_count = 0; local
77 ++node_count;
81 ++node_count;
84 return node_count;
|
| /external/chromium_org/v8/src/ |
| H A D | ast.h | 169 int node_count() { return node_count_; } function in class:v8::internal::BASE_EMBEDDED
2432 int ast_node_count() { return ast_properties_.node_count(); }
|