Home
last modified time | relevance | path

Searched refs:GB (Results 1 - 25 of 47) sorted by relevance

12

/third_party/ltp/testcases/kernel/syscalls/fork/
H A Dfork14.c43 #define GB (1024 * 1024 * 1024L) macro
99 addr = mmap(NULL, 1 * GB, PROT_READ | PROT_WRITE, in fork_test()
139 SAFE_MUNMAP(cleanup, pointer_vec[j], 1 * GB); in fork_test()
/third_party/node/deps/v8/src/logging/
H A Dcounters-definitions.h50 100 * KB, GB, 51) \
52 100 * KB, GB, 51) \
53 HR(wasm_asm_module_size_bytes, V8.WasmModuleSizeBytes.asm, 1, GB, 51) \
54 HR(wasm_wasm_module_size_bytes, V8.WasmModuleSizeBytes.wasm, 1, GB, 51) \
62 V8.WasmCompileFunctionPeakMemoryBytes, 1, GB, 51) \
64 V8.WasmCompileHugeFunctionPeakMemoryBytes, 1, GB, 51) \
65 HR(asm_module_size_bytes, V8.AsmModuleSizeBytes, 1, GB, 51) \
/third_party/node/deps/v8/src/zone/
H A Dzone-compression.h31 static const size_t kReservationSize = size_t{2} * GB;
33 COMPRESS_ZONES_BOOL ? size_t{4} * GB : 1;
/third_party/node/deps/v8/include/
H A Dv8-internal.h34 constexpr int GB = MB * 1024; member
36 constexpr size_t TB = size_t{GB} * 1024;
210 constexpr size_t kSandboxGuardRegionSize = 32ULL * GB;
219 // A minimum of 32GB allows the 4GB pointer compression region as well as the
220 // ArrayBuffer partition and two 10GB Wasm memory cages to fit into the
221 // sandbox. 32GB should also be the minimum possible size of the userspace
224 constexpr size_t kSandboxMinimumSize = 32ULL * GB;
240 constexpr size_t kSandboxMinimumReservationSize = 8ULL * GB;
/third_party/libphonenumber/cpp/test/phonenumbers/
H A Dphonenumberutil_test.cc149 phone_util_.Parse(input, RegionCode::GB(), &phone_number)); in TEST_F()
161 phone_util_.Parse(input, RegionCode::GB(), &phone_number)); in TEST_F()
256 EXPECT_TRUE(find(regions.begin(), regions.end(), RegionCode::GB()) in TEST_F()
803 phone_util_.FormatOutOfCountryCallingNumber(test_number, RegionCode::GB(), in TEST_F()
1778 EXPECT_EQ(RegionCode::GB(), region_code); in TEST_F()
1805 EXPECT_EQ(RegionCode::GB(), region_code); in TEST_F()
1847 RegionCode::GB())); in TEST_F()
1849 RegionCode::GB())); in TEST_F()
1851 RegionCode::GB())); in TEST_F()
1853 phone_util_.IsPossibleNumberForString("7031 3000", RegionCode::GB())); in TEST_F()
[all...]
H A Dphonenumbermatcher_test.cc519 DoTestFindInContext("+44 2034567890x456", RegionCode::GB()); in TEST_F()
520 DoTestFindInContext("+44 2034567890 x456", RegionCode::GB()); in TEST_F()
521 DoTestFindInContext("+44 2034567890 X456", RegionCode::GB()); in TEST_F()
522 DoTestFindInContext("+44 2034567890 X 456", RegionCode::GB()); in TEST_F()
523 DoTestFindInContext("+44 2034567890 X 456", RegionCode::GB()); in TEST_F()
524 DoTestFindInContext("+44 2034567890 X 456", RegionCode::GB()); in TEST_F()
830 NumberTest("(20) 3346 1234", RegionCode::GB()), // Non-optional NP omitted
H A Dtest_util.h132 static const char* GB() { in GB() function in i18n::phonenumbers::RegionCode
133 return "GB"; in GB()
/third_party/libphonenumber/java/libphonenumber/test/com/google/i18n/phonenumbers/
H A DPhoneNumberUtilTest.java624 phoneUtil.formatOutOfCountryCallingNumber(DE_SHORT_NUMBER, RegionCode.GB)); in testFormatOutOfCountryCallingNumber()
1006 PhoneNumber number1 = phoneUtil.parseAndKeepRawInput("+442087654321", RegionCode.GB); in testFormatInOriginalFormat()
1007 assertEquals("+44 20 8765 4321", phoneUtil.formatInOriginalFormat(number1, RegionCode.GB)); in testFormatInOriginalFormat()
1009 PhoneNumber number2 = phoneUtil.parseAndKeepRawInput("02087654321", RegionCode.GB); in testFormatInOriginalFormat()
1010 assertEquals("(020) 8765 4321", phoneUtil.formatInOriginalFormat(number2, RegionCode.GB)); in testFormatInOriginalFormat()
1015 PhoneNumber number4 = phoneUtil.parseAndKeepRawInput("442087654321", RegionCode.GB); in testFormatInOriginalFormat()
1016 assertEquals("44 20 8765 4321", phoneUtil.formatInOriginalFormat(number4, RegionCode.GB)); in testFormatInOriginalFormat()
1018 PhoneNumber number5 = phoneUtil.parse("+442087654321", RegionCode.GB); in testFormatInOriginalFormat()
1019 assertEquals("(020) 8765 4321", phoneUtil.formatInOriginalFormat(number5, RegionCode.GB)); in testFormatInOriginalFormat()
1052 phoneUtil.parseAndKeepRawInput("2087654321", RegionCode.GB); in testFormatInOriginalFormat()
[all...]
H A DRegionCode.java45 static final String GB = "GB"; field in RegionCode
H A DPhoneNumberMatcherTest.java202 doTestFindInContext("+44 2034567890x456", RegionCode.GB); in testFindExtensions()
203 doTestFindInContext("+44 2034567890 x456", RegionCode.GB); in testFindExtensions()
204 doTestFindInContext("+44 2034567890 X456", RegionCode.GB); in testFindExtensions()
205 doTestFindInContext("+44 2034567890 X 456", RegionCode.GB); in testFindExtensions()
206 doTestFindInContext("+44 2034567890 X 456", RegionCode.GB); in testFindExtensions()
207 doTestFindInContext("+44 2034567890 X 456", RegionCode.GB); in testFindExtensions()
460 new NumberTest("(20) 3346 1234", RegionCode.GB), // Non-optional NP omitted
/third_party/libphonenumber/javascript/i18n/phonenumbers/
H A Dphonenumberutil_test.js831 DE_SHORT_NUMBER, RegionCode.GB));
1385 var number1 = phoneUtil.parseAndKeepRawInput('+442087654321', RegionCode.GB);
1388 phoneUtil.formatInOriginalFormat(number1, RegionCode.GB));
1391 var number2 = phoneUtil.parseAndKeepRawInput('02087654321', RegionCode.GB);
1394 phoneUtil.formatInOriginalFormat(number2, RegionCode.GB));
1404 var number4 = phoneUtil.parseAndKeepRawInput('442087654321', RegionCode.GB);
1407 phoneUtil.formatInOriginalFormat(number4, RegionCode.GB));
1410 var number5 = phoneUtil.parse('+442087654321', RegionCode.GB);
1413 phoneUtil.formatInOriginalFormat(number5, RegionCode.GB));
1467 phoneUtil.parseAndKeepRawInput('2087654321', RegionCode.GB);
[all...]
H A Dregioncodefortesting.js54 GB: 'GB',
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-ot-shape-complex-use-table.hh53 #define GB USE(GB) /* BASE_OTHER */ macro
97 O, O, O, O, O, GB, O, O,
105 /* 00A0 */ GB, O, O, O, O, O, O, O, O, O, O, O, O, O, O, O,
108 /* 00D0 */ O, O, O, O, O, O, O, GB,
156 /* 0980 */ GB, VMAbv, VMPst, VMPst, O, B, B, B, B, B, B, B, B, O, O, B,
174 /* 0A70 */ VMAbv, CMAbv, GB, GB, O, MBlw, O, O, O, O, O, O, O, O, O, O,
281 /* 1040 */ B, B, B, B, B, B, B, B, B, B, O, GB, O, O, GB,
1245 #undef GB global() macro
[all...]
/third_party/node/deps/v8/include/v8-include/
H A Dv8-internal.h34 constexpr int GB = MB * 1024; member
36 constexpr size_t TB = size_t{GB} * 1024;
178 // virtual address space for userspace. As such, limit the sandbox to 128GB (a
180 constexpr size_t kSandboxSizeLog2 = 37; // 128 GB
203 constexpr size_t kSandboxGuardRegionSize = 32ULL * GB;
219 constexpr size_t kSandboxMinimumReservationSize = 8ULL * GB;
229 constexpr size_t kMaxSafeBufferSizeForSandbox = 32ULL * GB - 1;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp216 auto *GB = IAI.getInterleaveGroup(B); in areConsecutiveOrMatch() local
218 return GA && GB && GA == GB && GA->getIndex(A) + 1 == GB->getIndex(B); in areConsecutiveOrMatch()
/third_party/skia/third_party/externals/libwebp/src/dsp/
H A Dupsampling_msa.c239 GB = tmp0 | tmp1; \
501 v16u8 R, G, B, RG, GB, tmp0, tmp1; in YuvToRgb565Line() local
504 CALC_RGB565(y, u, v, GB, RG, 16, dst); in YuvToRgb565Line()
506 CALC_RGB565(y, u, v, RG, GB, 16, dst); in YuvToRgb565Line()
518 CALC_RGB565(temp, u, v, GB, RG, 16, temp); in YuvToRgb565Line()
520 CALC_RGB565(temp, u, v, RG, GB, 16, temp); in YuvToRgb565Line()
527 CALC_RGB565(temp, u, v, GB, RG, 8, temp); in YuvToRgb565Line()
529 CALC_RGB565(temp, u, v, RG, GB, 8, temp); in YuvToRgb565Line()
/third_party/node/deps/v8/tools/heap-stats/
H A Dhelper.js7 const GB = MB * KB;
/third_party/node/deps/v8/tools/zone-stats/
H A Dhelper.js7 const GB = MB * KB;
11 const units = [' B', ' KB', ' MB', ' GB'];
/third_party/lz4/tests/
H A Ddatagencli.c49 #define GB *(1U<<30) macro
H A DcheckFrame.c50 #define GB *(1U<<30) macro
/third_party/exfatprogs/include/
H A Dlibexfat.h17 #define GB (1024UL*1024UL*1024UL) macro
/third_party/node/deps/v8/src/sandbox/
H A Dsandbox.cc88 // 256GB and so we use a quarter of that, 64GB, as maximum size. in Initialize()
97 // which case the sandbox size would end up being only 8GB. in Initialize()
101 (8ULL * GB) >= kSandboxMinimumReservationSize, in Initialize()
103 "most 8GB to support CPUs with only 36 virtual address bits"); in Initialize()
114 // memory usage by 2GB. As such, it is not possible to create a proper in Initialize()
/third_party/ltp/testcases/kernel/device-drivers/agp/kernel_space/
H A Dstr_agp.h165 #define GB(x) (MB (KB (x))) macro
/third_party/json/tests/src/
H A Dunit-json_patch.cpp623 [{"op": "add", "path": "/GB", "value": "London"}]
633 // target = { "D": "Berlin", "F": "Paris", "GB": "London" }
634 CHECK(target == R"({ "D": "Berlin", "F": "Paris", "GB": "London" })"_json);
638 // p2 = [{"op": "delete", "path": "/GB"}]
639 CHECK(p2 == R"([{"op":"remove","path":"/GB"}])"_json);
/third_party/lz4/programs/
H A Dbench.c75 #define GB *(1U<<30) macro
79 static const size_t maxMemory = (sizeof(size_t)==4) ? (2 GB - 64 MB) : (size_t)(1ULL << ((sizeof(size_t)*8)-31));

Completed in 25 milliseconds

12