/external/chromium_org/third_party/openssl/openssl/crypto/lhash/ |
H A D | lh_stats.c | 76 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 D | lhash.c | 127 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/openssl/crypto/lhash/ |
H A D | lh_stats.c | 76 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 D | lhash.c | 127 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/libraries/nacl_io_test/ |
H A D | mount_test.cc | 30 int num_nodes() { return (int) inode_pool_.size(); } function in class:__anon8480::MountMemMock 39 int num_nodes() { return (int) inode_pool_.size(); } function in class:__anon8480::MountDevMock 58 EXPECT_EQ(1, mnt->num_nodes()); 64 EXPECT_EQ(1, mnt->num_nodes()); 74 EXPECT_EQ(2, mnt->num_nodes()); 84 EXPECT_EQ(2, mnt->num_nodes()); 88 EXPECT_EQ(2, mnt->num_nodes()); 101 EXPECT_EQ(2, mnt->num_nodes()); 105 EXPECT_EQ(2, mnt->num_nodes()); 116 EXPECT_EQ(2, mnt->num_nodes()); [all...] |
/external/freetype/src/cache/ |
H A D | ftcglyph.c | 37 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 D | ftcmru.c | 175 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 D | ftcglyph.h | 138 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 D | ftcmanag.h | 99 FT_UInt num_nodes; member in struct:FTC_ManagerRec_
|
H A D | ftccache.c | 57 manager->num_nodes++; 71 manager->num_nodes--; 311 if ( manager->num_nodes == 0 ) 313 manager->num_nodes ));
|
H A D | ftccache.h | 338 _try_count > _try_manager->num_nodes ) \ 339 _try_count = _try_manager->num_nodes; \
|
/external/chromium/base/ |
H A D | linked_list_unittest.cc | 36 // 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/chromium_org/base/containers/ |
H A D | linked_list_unittest.cc | 36 // 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 D | c47mulsp.c | 98 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 D | srec_context.c | 229 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 D | trie-test.cc | 60 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 D | trie.cc | 126 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 D | trie-test.cc | 60 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 D | trie.cc | 126 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 D | lts_seq_internal.h | 107 int num_nodes; member in struct:RT_LTREE
|
/external/chromium_org/net/spdy/ |
H A D | spdy_priority_forest_test.cc | 14 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());
|
/external/chromium_org/content/browser/indexed_db/leveldb/ |
H A D | avltree.h | 359 bool Build(fwd_iter p, size num_nodes) { 360 if (num_nodes == 0) { 377 size num_sub = num_nodes; 451 if (num_sub == num_nodes) {
|
/external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
H A D | cavl_if.h | 109 L_(avl) *tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes); variable
|
/external/marisa-trie/tools/ |
H A D | marisa-build.cc | 89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
|
/external/marisa-trie/v0_1_5/tools/ |
H A D | marisa_alpha-build.cc | 89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
|