| /external/openssl/crypto/lhash/ |
| D | lh_stats.c | 76 fprintf(out,"num_nodes = %u\n",lh->num_nodes); in lh_stats()
104 for (i=0; i<lh->num_nodes; i++) in lh_node_stats()
119 for (i=0; i<lh->num_nodes; i++) in lh_node_usage_stats()
129 fprintf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes); in lh_node_usage_stats()
133 (int)(total/lh->num_nodes), in lh_node_usage_stats()
134 (int)((total%lh->num_nodes)*100/lh->num_nodes), in lh_node_usage_stats()
183 BIO_printf(out,"num_nodes = %u\n",lh->num_nodes); in lh_stats_bio()
213 for (i=0; i<lh->num_nodes; i++) in lh_node_stats_bio()
228 for (i=0; i<lh->num_nodes; i++) in lh_node_usage_stats_bio()
238 BIO_printf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes); in lh_node_usage_stats_bio()
[all …]
|
| D | lhash.c | 127 ret->num_nodes=MIN_NODES/2; in lh_new()
165 for (i=0; i<lh->num_nodes; i++) in lh_free()
186 if (lh->up_load <= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)) in lh_insert()
241 if ((lh->num_nodes > MIN_NODES) && in lh_delete()
242 (lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes))) in lh_delete()
281 for (i=lh->num_nodes-1; i>=0; i--) in doall_util_fn()
316 lh->num_nodes++; in expand()
391 lh->num_nodes--; in contract()
|
| D | lhash.h | 143 unsigned int num_nodes; member
|
| /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 | 58 manager->num_nodes++; in ftc_node_mru_link()
72 manager->num_nodes--; in ftc_node_mru_unlink()
316 if ( manager->num_nodes == 0 ) in ftc_node_destroy()
318 manager->num_nodes )); in ftc_node_destroy()
|
| D | ftccache.h | 345 _try_count > _try_manager->num_nodes ) \
346 _try_count = _try_manager->num_nodes; \
|
| D | ftcmanag.h | 99 FT_UInt num_nodes; member
|
| /external/chromium/base/ |
| D | linked_list_unittest.cc | 38 int num_nodes, const int* node_ids, bool forward) { in ExpectListContentsForDirection() argument
43 ASSERT_LT(i, num_nodes); in ExpectListContentsForDirection()
44 int index_of_id = forward ? i : num_nodes - i - 1; in ExpectListContentsForDirection()
48 EXPECT_EQ(num_nodes, i); in ExpectListContentsForDirection()
52 int num_nodes, in ExpectListContents() argument
56 ExpectListContentsForDirection(list, num_nodes, node_ids, true); in ExpectListContents()
60 ExpectListContentsForDirection(list, num_nodes, node_ids, false); in ExpectListContents()
|
| /external/srec/srec/crec/ |
| D | srec_context.c | 229 for (i = 0; i < context->num_nodes; i++) in FST_PrepareContext()
232 if (i != context->num_nodes) in FST_PrepareContext()
912 nodeID from_node, last_from_node, into_node, num_nodes, max_node_number = 0; in FST_LoadGraph() local
996 fst->num_nodes = 0; in FST_LoadGraph()
1087 num_nodes = (nodeID)(max_node_number + 1); in FST_LoadGraph()
1088 if( max_num_FSMnodes > num_nodes) { in FST_LoadGraph()
1089 fst->FSMnode_freelist = num_nodes; in FST_LoadGraph()
1090 for (i = num_nodes; i < (max_num_FSMnodes - 1); i++) in FST_LoadGraph()
1107 fst->num_base_nodes = fst->num_nodes = num_nodes; in FST_LoadGraph()
1147 for (i = 0; i < fst->num_nodes; i++) in FST_DumpGraph()
[all …]
|
| D | c47mulsp.c | 98 …if (context->max_searchable_nodes < context->num_nodes || context->max_searchable_arcs < context->… in activate_grammar_for_recognition()
102 context->max_searchable_nodes, context->num_nodes); in activate_grammar_for_recognition()
|
| D | srec.c | 1733 if (rec->context->num_nodes > rec->max_fsm_nodes) in srec_begin()
1738 for (node_index = 0;node_index < rec->context->num_nodes;node_index++) in srec_begin()
2271 for (inode = 0; inode < rec->context->num_nodes; inode++) in srec_viterbi_part2()
|
| /external/srec/seti/sltsEngine/include/ |
| D | lts_seq_internal.h | 107 int num_nodes; member
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| D | AVLTree.h | 345 bool build(fwd_iter p, size num_nodes) in build() argument
347 if (num_nodes == 0) { in build()
364 size num_sub = num_nodes; in build()
436 if (num_sub == num_nodes) in build()
|
| /external/libvpx/vpx_mem/memory_manager/include/ |
| D | cavl_impl.h | 854 L_(avl) *l_tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes) in L_()
868 L_SIZE num_sub = num_nodes; in L_()
882 if (num_nodes == 0) in L_()
965 if (num_sub == num_nodes) in L_()
|
| D | cavl_if.h | 111 L_(avl) *tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes);
|
| /external/srec/seti/sltsEngine/src/ |
| D | run_seq_lts.c | 553 tree->num_nodes = load_int(fp); in load_trees()
555 tree->values_or_question1 = (short*) lts_alloc(tree->num_nodes, sizeof(short)); in load_trees()
561 tree->question2 = (short*) lts_alloc(tree->num_nodes, sizeof(short)); in load_trees()
567 tree->left_nodes = (short *) lts_alloc(tree->num_nodes, sizeof(short)); in load_trees()
574 pfprintf(PSTDOUT,"LOAD_TREE: Tree for let %d num_nodes %d\n", let, tree->num_nodes); in load_trees()
577 for (i=0;i<tree->num_nodes;i++) { in load_trees()
|
| /external/srec/srec/include/ |
| D | srec_context.h | 110 nodeID num_nodes; member
|
| /external/openssl/include/openssl/ |
| D | lhash.h | 143 unsigned int num_nodes; member
|
| /external/srec/tools/test_g2g/ |
| D | test_g2g.c | 226 fst->num_nodes, fst->num_base_nodes, fst->FSMnode_list_len, in CheckG2G()
|