Searched refs:num_nodes (Results 1 - 25 of 39) 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--;
/external/chromium_org/native_client_sdk/src/tests/nacl_io_test/
H A Dfilesystem_test.cc40 int num_nodes() { return (int)inode_pool_.size(); } function in class:__anon8954::MemFsForTesting
58 EXPECT_EQ(1, fs.num_nodes());
63 EXPECT_EQ(1, fs.num_nodes());
71 ASSERT_EQ(2, fs.num_nodes());
82 EXPECT_EQ(2, fs.num_nodes());
86 EXPECT_EQ(2, fs.num_nodes());
98 EXPECT_EQ(2, fs.num_nodes());
102 EXPECT_EQ(2, fs.num_nodes());
115 EXPECT_EQ(2, fs.num_nodes());
122 EXPECT_EQ(2, fs.num_nodes());
[all...]
H A Ddev_fs_for_testing.h32 int num_nodes() { return (int)inode_pool_.size(); } function in class:DevFsForTesting
/external/chromium_org/third_party/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.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; \
/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.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; \
/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.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/chromium_org/base/containers/
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/seti/sltsEngine/include/
H A Dlts_seq_internal.h107 int num_nodes; member in struct:RT_LTREE
/external/chromium_org/net/spdy/
H A Dspdy_priority_forest_test.cc14 EXPECT_EQ(0, forest.num_nodes());
18 EXPECT_EQ(1, forest.num_nodes());
25 EXPECT_EQ(2, forest.num_nodes());
32 EXPECT_EQ(3, forest.num_nodes());
40 EXPECT_EQ(2, forest.num_nodes());
H A Dspdy_priority_tree_test.cc29 EXPECT_EQ(1, tree.num_nodes());
34 EXPECT_EQ(2, tree.num_nodes());
42 EXPECT_EQ(3, tree.num_nodes());
49 EXPECT_EQ(4, tree.num_nodes());
59 EXPECT_EQ(3, tree.num_nodes());
H A Dspdy_priority_tree.h83 int num_nodes() const;
197 int SpdyPriorityTree<NodeId>::num_nodes() const { function in class:net::SpdyPriorityTree
545 // Make sure num_nodes reflects the total number of nodes the map contains.
546 if (total_nodes != num_nodes()) {
552 DCHECK(nodes_visited == 2*num_nodes() - 1);
/external/chromium_org/third_party/libwebp/utils/
H A Dhuffman.c58 static int HuffmanTreeAllocate(HuffmanTree* const tree, int num_nodes) { argument
61 (HuffmanTreeNode*)WebPSafeMalloc(num_nodes, sizeof(*tree->root_));
/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_));

Completed in 4406 milliseconds

12