| /external/chromium_org/native_client_sdk/src/tests/nacl_io_test/ |
| mount_dev_mock.h | 20 int num_nodes() { return (int) inode_pool_.size(); } function in class:MountDevMock
|
| mount_test.cc | 31 int num_nodes() { return (int) inode_pool_.size(); } function in class:__anon11559::MountMemMock
48 EXPECT_EQ(1, mnt.num_nodes());
54 EXPECT_EQ(1, mnt.num_nodes());
62 EXPECT_EQ(2, mnt.num_nodes());
71 EXPECT_EQ(2, mnt.num_nodes());
75 EXPECT_EQ(2, mnt.num_nodes());
87 EXPECT_EQ(2, mnt.num_nodes());
91 EXPECT_EQ(2, mnt.num_nodes());
104 EXPECT_EQ(2, mnt.num_nodes());
111 EXPECT_EQ(2, mnt.num_nodes());
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/lhash/ |
| 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...] |
| lhash.c | 162 * (num_items // num_nodes) >= (up_load // LOAD_MULT) or
163 * (num_items * LOAD_MULT // num_nodes) >= up_load.
169 * (num_items * LOAD_MULT / num_nodes) + epsilon >= up_load
170 * (num_items * LOAD_MULT / num_nodes) - up_load >= - epsilon
178 * (num_items * LOAD_MULT / num_nodes) >= up_load
182 (((lh)->num_items*LH_LOAD_MULT/(lh)->num_nodes) >= (lh)->up_load))
187 * (num_items // num_nodes) <= (down_load // LOAD_MULT)
188 * (num_items * LOAD_MULT // num_nodes) <= down_load
189 * (num_items * LOAD_MULT / num_nodes) + epsilon <= down_load
190 * (num_items * LOAD_MULT / num_nodes) - down_load <= -epsilo
[all...] |
| /external/openssl/crypto/lhash/ |
| 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...] |
| 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/third_party/freetype/src/cache/ |
| 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 )
|
| 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--;
|
| 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 ) \
|
| ftcmanag.h | 99 FT_UInt num_nodes; member in struct:FTC_ManagerRec_
|
| ftccache.c | 57 manager->num_nodes++;
71 manager->num_nodes--;
311 if ( manager->num_nodes == 0 )
313 manager->num_nodes ));
|
| /external/freetype/src/cache/ |
| 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 )
|
| 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--;
|
| 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 ) \
|
| ftcmanag.h | 99 FT_UInt num_nodes; member in struct:FTC_ManagerRec_
|
| /external/chromium/base/ |
| 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);
|
| /external/chromium_org/base/containers/ |
| 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);
|
| /external/srec/srec/crec/ |
| 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);
|
| 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
3603 nodeID *nodes, num_nodes, num_alloc; member in struct:nodeID_list_t
[all...] |
| /external/marisa-trie/v0_1_5/tests/ |
| 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() == 14)
[all...] |
| /external/marisa-trie/lib/marisa/ |
| 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/ |
| 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() == 14)
[all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| 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/ |
| lts_seq_internal.h | 107 int num_nodes; member in struct:RT_LTREE
|
| /external/chromium_org/net/spdy/ |
| 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());
|
