Searched refs:GB (Results 1 - 11 of 11) sorted by relevance
| /art/runtime/ |
| H A D | globals.h | 29 static constexpr size_t GB = KB * KB * KB; member in namespace:art
|
| H A D | utils_test.cc | 159 EXPECT_EQ("1GB", PrettySize(1 * GB));
160 EXPECT_EQ("2GB", PrettySize(2 * GB));
162 EXPECT_EQ("100GB", PrettySize(100 * GB));
|
| H A D | mem_map_test.cc | 268 // cannot allocate in the 2GB-4GB region.
275 // Try all addresses starting from 2GB to 4GB.
276 size_t start_addr = 2 * GB;
292 ASSERT_GE(reinterpret_cast<uintptr_t>(map->End()), 2u * GB); local
|
| H A D | mem_map.cc | 268 // 4GB. If this is the case, unmap and retry.
269 if (reinterpret_cast<uintptr_t>(actual) + page_aligned_byte_count >= 4 * GB) {
779 // 4GB.
807 for (uintptr_t ptr = next_mem_pos_; ptr < 4 * GB; ptr += kPageSize) {
838 if (4U * GB - ptr < length) {
839 // Not enough memory until 4GB.
|
| H A D | monitor_test.cc | 65 Runtime::Current()->GetHeap()->SetIdealFootprint(1 * GB);
|
| H A D | utils.cc | 113 // glibc will have reported a 2GB stack for our 32-bit process, and our stack overflow detection
114 // will be broken because we'll die long before we get close to 2GB.
472 1024*1024*1024 // GB from here.
474 static const int64_t kBytesPerUnit[] = { 1, KB, MB, GB };
475 static const char* const kUnitStrings[] = { "B", "KB", "MB", "GB" };
|
| /art/runtime/gc/accounting/ |
| H A D | read_barrier_table.h | 86 static constexpr uint64_t kHeapCapacity = 4ULL * GB; // low 4gb.
|
| /art/cmdline/ |
| H A D | cmdline_types.h | 236 mul = GB;
|
| /art/runtime/jit/ |
| H A D | jit_code_cache.cc | 71 // Ensure we're below 1 GB to be safe.
72 if (max_capacity > 1 * GB) {
74 oss << "Maxium code cache capacity is limited to 1 GB, "
|
| /art/runtime/arch/ |
| H A D | stub_test.cc | 1063 Runtime::Current()->GetHeap()->SetIdealFootprint(1 * GB);
1188 GB, // that should fail...
|
| /art/runtime/gc/ |
| H A D | heap.cc | 528 4 * GB - kMinHeapAddress));
|
Completed in 225 milliseconds