Home
last modified time | relevance | path

Searched refs:num_nodes (Results 1 – 25 of 34) sorted by relevance

12

/external/openssl/crypto/lhash/
Dlh_stats.c76 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 …]
Dlhash.c127 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()
/external/marisa-trie/tests/
Dtrie-test.cc60 ASSERT(trie.num_nodes() == 0); in TestTrie()
67 ASSERT(trie.num_nodes() == 1); in TestTrie()
80 ASSERT(trie.num_nodes() == 11); in TestTrie()
104 ASSERT(trie.num_nodes() == 0); in TestTrie()
111 ASSERT(trie.num_nodes() == 11); in TestTrie()
197 ASSERT(trie.num_nodes() == 7); in TestPrefixTrie()
228 ASSERT(trie.num_nodes() == 16); in TestPrefixTrie()
257 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
276 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
294 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
[all …]
/external/freetype/src/cache/
Dftcglyph.c37 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()
Dftcmru.c175 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()
Dftcglyph.h138 FT_UInt num_nodes; /* current number of nodes in this family */ member
299 _gqfamily->num_nodes++; \
303 if ( --_gqfamily->num_nodes == 0 ) \
Dftccache.c58 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()
Dftccache.h345 _try_count > _try_manager->num_nodes ) \
346 _try_count = _try_manager->num_nodes; \
Dftcmanag.h99 FT_UInt num_nodes; member
/external/marisa-trie/v0_1_5/tests/
Dtrie-test.cc60 ASSERT(trie.num_nodes() == 0); in TestTrie()
67 ASSERT(trie.num_nodes() == 1); in TestTrie()
81 ASSERT(trie.num_nodes() == 11); in TestTrie()
105 ASSERT(trie.num_nodes() == 0); in TestTrie()
113 ASSERT(trie.num_nodes() == 11); in TestTrie()
199 ASSERT(trie.num_nodes() == 7); in TestPrefixTrie()
230 ASSERT(trie.num_nodes() == 16); in TestPrefixTrie()
259 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
278 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
296 ASSERT(trie.num_nodes() == 14); in TestPrefixTrie()
[all …]
/external/chromium/base/
Dlinked_list_unittest.cc38 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/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie.cc126 std::size_t Trie::num_nodes() const { in num_nodes() function in marisa_alpha::Trie
130 std::size_t num_nodes = (louds_.size() / 2) - 1; in num_nodes() local
132 num_nodes += trie_->num_nodes(); in num_nodes()
134 return num_nodes; in num_nodes()
/external/marisa-trie/lib/marisa/
Dtrie.cc126 std::size_t Trie::num_nodes() const { in num_nodes() function in marisa::Trie
130 std::size_t num_nodes = (louds_.size() / 2) - 1; in num_nodes() local
132 num_nodes += trie_->num_nodes(); in num_nodes()
134 return num_nodes; in num_nodes()
/external/srec/srec/crec/
Dsrec_context.c229 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 …]
Dc47mulsp.c98 …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()
/external/srec/seti/sltsEngine/include/
Dlts_seq_internal.h107 int num_nodes; member
/external/webkit/Source/JavaScriptCore/wtf/
DAVLTree.h345 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/libvpx/vpx_mem/memory_manager/include/
Dcavl_impl.h854 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_()
Dcavl_if.h111 L_(avl) *tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes);
/external/marisa-trie/v0_1_5/tools/
Dmarisa_alpha-build.cc89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl; in build()
/external/marisa-trie/tools/
Dmarisa-build.cc89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl; in build()
/external/srec/seti/sltsEngine/src/
Drun_seq_lts.c553 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/stressapptest/src/
Dos.h227 int num_nodes() const { return num_nodes_; } in num_nodes() function
/external/srec/srec/include/
Dsrec_context.h110 nodeID num_nodes; member
/external/openssl/include/openssl/
Dlhash.h143 unsigned int num_nodes; member

12