Home
last modified time | relevance | path

Searched refs:kNumberOfObjects (Results 1 – 5 of 5) sorted by relevance

/dports/textproc/multimarkdown/MultiMarkdown-6-6.6.0/src/
H A Dobject_pool.c61 #define kNumberOfObjects 1024 macro
65 void * slab = malloc(p->object_size * kNumberOfObjects); in pool_add_slab()
74 p->last = slab + (p->object_size * (kNumberOfObjects)); in pool_add_slab()
/dports/lang/v8/v8-9.6.180.12/test/unittests/heap/cppgc/
H A Dheap-page-unittest.cc98 static const size_t kNumberOfObjects = in TEST_F() local
103 std::vector<Persistent<Type>> persistents(kNumberOfObjects); in TEST_F()
126 const size_t kNumberOfObjects = kExpectedNumberOfPages; in TEST_F() local
128 std::vector<Persistent<Type>> persistents(kNumberOfObjects); in TEST_F()
148 const size_t kNumberOfObjects = in TEST_F() local
153 std::vector<Persistent<Type>> persistents(kNumberOfObjects); in TEST_F()
H A Dconcurrent-sweeper-unittest.cc223 static constexpr size_t kNumberOfObjects = 10; in TEST_F() local
231 for (size_t i = 0; i < kNumberOfObjects; ++i) { in TEST_F()
260 EXPECT_EQ(kNumberOfObjects, g_destructor_callcount); in TEST_F()
H A Dsweeper-unittest.cc143 const size_t kNumberOfObjects = in TEST_F() local
146 for (size_t i = 0; i < kNumberOfObjects; ++i) { in TEST_F()
154 EXPECT_EQ(kNumberOfObjects, g_destructor_callcount); in TEST_F()
/dports/lang/v8/v8-9.6.180.12/test/cctest/heap/
H A Dtest-heap.cc5617 const int kNumberOfObjects = in TEST() local
5645 } arr(isolate, kNumberOfObjects); in TEST()
5647 CHECK_EQ(arr.get().length(), kNumberOfObjects); in TEST()