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

12

/external/openssl/crypto/lhash/
H A Dlh_stats.c76 fprintf(out,"num_nodes = %u\n",lh->num_nodes);
104 for (i=0; i<lh->num_nodes; i++)
119 for (i=0; i<lh->num_nodes; i++)
129 fprintf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
133 (int)(total/lh->num_nodes),
134 (int)((total%lh->num_nodes)*100/lh->num_nodes),
183 BIO_printf(out,"num_nodes = %u\n",lh->num_nodes);
[all...]
H A Dlhash.c127 ret->num_nodes=MIN_NODES/2;
165 for (i=0; i<lh->num_nodes; i++)
186 if (lh->up_load <= (lh->num_items*LH_LOAD_MULT/lh->num_nodes))
241 if ((lh->num_nodes > MIN_NODES) &&
242 (lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)))
281 for (i=lh->num_nodes-1; i>=0; i--)
316 lh->num_nodes++;
391 lh->num_nodes--;
H A Dlhash.h143 unsigned int num_nodes; member in struct:lhash_st
/external/freetype/src/cache/
H A Dftcglyph.c37 family->num_nodes++;
49 if ( family && --family->num_nodes == 0 )
113 family->num_nodes = 0;
206 family->num_nodes++;
210 if ( --family->num_nodes == 0 )
H A Dftcmru.c175 list->num_nodes = 0;
190 FT_ASSERT( list->num_nodes == 0 );
245 if ( list->num_nodes >= list->max_nodes && list->max_nodes > 0 )
261 list->num_nodes--;
274 list->num_nodes++;
312 list->num_nodes--;
H A Dftcglyph.h138 FT_UInt num_nodes; /* current number of nodes in this family */ member in struct:FTC_FamilyRec_
299 _gqfamily->num_nodes++; \
303 if ( --_gqfamily->num_nodes == 0 ) \
H A Dftcmanag.h99 FT_UInt num_nodes; member in struct:FTC_ManagerRec_
H A Dftccache.c58 manager->num_nodes++;
72 manager->num_nodes--;
316 if ( manager->num_nodes == 0 )
318 manager->num_nodes ));
H A Dftccache.h345 _try_count > _try_manager->num_nodes ) \
346 _try_count = _try_manager->num_nodes; \
/external/chromium/base/
H A Dlinked_list_unittest.cc36 // which is an array of size |num_nodes|.
38 int num_nodes, const int* node_ids, bool forward) {
43 ASSERT_LT(i, num_nodes);
44 int index_of_id = forward ? i : num_nodes - i - 1;
48 EXPECT_EQ(num_nodes, i);
52 int num_nodes,
56 ExpectListContentsForDirection(list, num_nodes, node_ids, true);
60 ExpectListContentsForDirection(list, num_nodes, node_ids, false);
37 ExpectListContentsForDirection(const LinkedList<Node>& list, int num_nodes, const int* node_ids, bool forward) argument
51 ExpectListContents(const LinkedList<Node>& list, int num_nodes, const int* node_ids) argument
/external/srec/srec/crec/
H A Dc47mulsp.c98 if (context->max_searchable_nodes < context->num_nodes || context->max_searchable_arcs < context->num_arcs)
102 context->max_searchable_nodes, context->num_nodes);
H A Dsrec_context.c229 for (i = 0; i < context->num_nodes; i++)
232 if (i != context->num_nodes)
912 nodeID from_node, last_from_node, into_node, num_nodes, max_node_number = 0; local
996 fst->num_nodes = 0;
1087 num_nodes = (nodeID)(max_node_number + 1);
1088 if( max_num_FSMnodes > num_nodes) {
1089 fst->FSMnode_freelist = num_nodes;
1090 for (i = num_nodes; i < (max_num_FSMnodes - 1); i++)
1107 fst->num_base_nodes = fst->num_nodes = num_nodes;
3603 nodeID *nodes, num_nodes, num_alloc; member in struct:nodeID_list_t
[all...]
/external/marisa-trie/v0_1_5/tests/
H A Dtrie-test.cc60 ASSERT(trie.num_nodes() == 0);
67 ASSERT(trie.num_nodes() == 1);
81 ASSERT(trie.num_nodes() == 11);
105 ASSERT(trie.num_nodes() == 0);
113 ASSERT(trie.num_nodes() == 11);
199 ASSERT(trie.num_nodes() == 7);
230 ASSERT(trie.num_nodes() == 16);
259 ASSERT(trie.num_nodes() == 14);
278 ASSERT(trie.num_nodes() == 14);
296 ASSERT(trie.num_nodes()
[all...]
/external/marisa-trie/lib/marisa/
H A Dtrie.cc126 std::size_t Trie::num_nodes() const { function in class:marisa::Trie
130 std::size_t num_nodes = (louds_.size() / 2) - 1; local
132 num_nodes += trie_->num_nodes();
134 return num_nodes;
/external/marisa-trie/tests/
H A Dtrie-test.cc60 ASSERT(trie.num_nodes() == 0);
67 ASSERT(trie.num_nodes() == 1);
80 ASSERT(trie.num_nodes() == 11);
104 ASSERT(trie.num_nodes() == 0);
111 ASSERT(trie.num_nodes() == 11);
197 ASSERT(trie.num_nodes() == 7);
228 ASSERT(trie.num_nodes() == 16);
257 ASSERT(trie.num_nodes() == 14);
276 ASSERT(trie.num_nodes() == 14);
294 ASSERT(trie.num_nodes()
[all...]
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dtrie.cc126 std::size_t Trie::num_nodes() const { function in class:marisa_alpha::Trie
130 std::size_t num_nodes = (louds_.size() / 2) - 1; local
132 num_nodes += trie_->num_nodes();
134 return num_nodes;
/external/srec/seti/sltsEngine/include/
H A Dlts_seq_internal.h107 int num_nodes; member in struct:RT_LTREE
/external/libvpx/libvpx/vpx_mem/memory_manager/include/
H A Dcavl_if.h111 L_(avl) *tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes); variable
H A Dcavl_impl.h854 L_(avl) *l_tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes)
868 L_SIZE num_sub = num_nodes;
882 if (num_nodes == 0)
965 if (num_sub == num_nodes)
/external/marisa-trie/tools/
H A Dmarisa-build.cc89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
/external/marisa-trie/v0_1_5/tools/
H A Dmarisa_alpha-build.cc89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
/external/srec/srec/include/
H A Dsrec_context.h110 nodeID num_nodes; member in struct:srec_context
/external/webkit/Source/JavaScriptCore/wtf/
H A DAVLTree.h345 bool build(fwd_iter p, size num_nodes)
347 if (num_nodes == 0) {
364 size num_sub = num_nodes;
436 if (num_sub == num_nodes)
/external/srec/seti/sltsEngine/src/
H A Drun_seq_lts.c553 tree->num_nodes = load_int(fp);
555 tree->values_or_question1 = (short*) lts_alloc(tree->num_nodes, sizeof(short));
561 tree->question2 = (short*) lts_alloc(tree->num_nodes, sizeof(short));
567 tree->left_nodes = (short *) lts_alloc(tree->num_nodes, sizeof(short));
574 pfprintf(PSTDOUT,"LOAD_TREE: Tree for let %d num_nodes %d\n", let, tree->num_nodes);
577 for (i=0;i<tree->num_nodes;i++) {
/external/openssl/include/openssl/
H A Dlhash.h143 unsigned int num_nodes; member in struct:lhash_st

Completed in 771 milliseconds

12