Searched refs:num_nodes (Results 1 - 25 of 39) sorted by last modified time

12

/external/webp/src/utils/
H A Dhuffman.c58 static int HuffmanTreeAllocate(HuffmanTree* const tree, int num_nodes) { argument
61 (HuffmanTreeNode*)WebPSafeMalloc(num_nodes, sizeof(*tree->root_));
/external/stressapptest/src/
H A Dos.h227 int num_nodes() const { return num_nodes_; } function in class:OsLayer
/external/srec/seti/sltsEngine/include/
H A Dlts_seq_internal.h107 int num_nodes; member in struct:RT_LTREE
/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/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.c1733 if (rec->context->num_nodes > rec->max_fsm_nodes)
1738 for (node_index = 0;node_index < rec->context->num_nodes;node_index++)
2271 for (inode = 0; inode < rec->context->num_nodes; inode++)
H A Dsrec_context.c230 for (i = 0; i < context->num_nodes; i++)
233 if (i != context->num_nodes)
913 nodeID from_node, last_from_node, into_node, num_nodes, max_node_number = 0; local
997 fst->num_nodes = 0;
1088 num_nodes = (nodeID)(max_node_number + 1);
1089 if( max_num_FSMnodes > num_nodes) {
1090 fst->FSMnode_freelist = num_nodes;
1091 for (i = num_nodes; i < (max_num_FSMnodes - 1); i++)
1108 fst->num_base_nodes = fst->num_nodes = num_nodes;
3604 nodeID *nodes, num_nodes, num_alloc; member in struct:nodeID_list_t
[all...]
/external/srec/srec/include/
H A Dsrec_context.h110 nodeID num_nodes; member in struct:srec_context
/external/srec/tools/test_g2g/
H A Dtest_g2g.c226 fst->num_nodes, fst->num_base_nodes, fst->FSMnode_list_len,
/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/openssl/include/openssl/
H A Dlhash.h143 unsigned int num_nodes; member in struct:lhash_st
/external/lldb/source/Expression/
H A DIRForTarget.cpp389 unsigned num_nodes = named_metadata->getNumOperands(); local
393 node_index < num_nodes;
/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.h770 L_(avl) *l_tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes) {
783 L_SIZE num_sub = num_nodes;
797 if (num_nodes == 0) {
873 if (num_sub == num_nodes)
/external/freetype/src/cache/
H A Dftccache.c57 manager->num_nodes++;
71 manager->num_nodes--;
311 if ( manager->num_nodes == 0 )
313 manager->num_nodes ));
H A Dftccache.h338 _try_count > _try_manager->num_nodes ) \
339 _try_count = _try_manager->num_nodes; \
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 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 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--;
/external/chromium_org/third_party/libvpx/source/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.h770 L_(avl) *l_tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes) {
783 L_SIZE num_sub = num_nodes;
797 if (num_nodes == 0) {
873 if (num_sub == num_nodes)
/external/chromium_org/third_party/freetype/src/cache/
H A Dftccache.c57 manager->num_nodes++;
71 manager->num_nodes--;
311 if ( manager->num_nodes == 0 )
313 manager->num_nodes ));

Completed in 5853 milliseconds

12