Home
last modified time | relevance | path

Searched refs:kCount (Results 1 - 25 of 32) sorted by relevance

12

/third_party/skia/third_party/externals/dawn/src/tests/end2end/
H A DShaderTests.cpp397 uint32_t const kCount = 11; in TEST_P() local
398 std::vector<uint32_t> expected(kCount); in TEST_P()
400 wgpu::Buffer buffer = CreateBuffer(kCount); in TEST_P()
467 EXPECT_BUFFER_U32_RANGE_EQ(expected.data(), buffer, 0, kCount); in TEST_P()
475 uint32_t const kCount = 4; in TEST_P() local
477 wgpu::Buffer buffer = CreateBuffer(kCount); in TEST_P()
523 EXPECT_BUFFER_U32_RANGE_EQ(expected.data(), buffer, 0, kCount); in TEST_P()
532 uint32_t const kCount = 2; in TEST_P() local
536 wgpu::Buffer buffer = CreateBuffer(kCount); in TEST_P()
575 EXPECT_BUFFER_FLOAT_RANGE_EQ(expected.data(), buffer, 0, kCount); in TEST_P()
583 uint32_t const kCount = 1; TEST_P() local
[all...]
H A DQueryTests.cpp411 constexpr uint64_t kCount = kQueryCount + kMinCount; in TEST_P() local
417 std::vector<uint64_t> sentinelValues(kCount, kSentinelValue); in TEST_P()
428 kCount - 1); in TEST_P()
435 std::vector<uint64_t> sentinelValues(kCount, kSentinelValue); in TEST_P()
779 constexpr uint64_t kCount = kQueryCount + kMinCount; in TEST_P() local
793 std::vector<uint64_t> zeros(kCount - 1, kZero); in TEST_P()
795 EXPECT_BUFFER_U64_RANGE_EQ(zeros.data(), destination, sizeof(uint64_t), kCount - 1); in TEST_P()
803 std::vector<uint64_t> sentinelValues(kCount, kZero); in TEST_P()
/third_party/skia/include/private/
H A DSkTemplates.h165 if (fCount > kCount) { in reset()
171 if (count > kCount) { in reset()
222 static const int kCount = kCountRequested * sizeof(T) > kMaxBytes
226 static const int kCount = kCountRequested;
232 char fStorage[kCount * sizeof(T)];
298 if (count > kCount) {
323 if (count > kCount) {
357 if (count > kCount) {
360 memcpy((void*)fPtr, fTStorage, kCount * sizeof(T));
380 static const size_t kCount
[all...]
/third_party/node/deps/v8/src/snapshot/embedded/
H A Dembedded-data.cc437 constexpr int kCount = Builtins::kBuiltinCount; in PrintStatistics() local
438 int sizes[kCount]; in PrintStatistics()
440 for (int i = 0; i < kCount; i++) { in PrintStatistics()
445 std::sort(&sizes[0], &sizes[kCount]); in PrintStatistics()
447 const int k50th = kCount * 0.5; in PrintStatistics()
448 const int k75th = kCount * 0.75; in PrintStatistics()
449 const int k90th = kCount * 0.90; in PrintStatistics()
450 const int k99th = kCount * 0.99; in PrintStatistics()
/third_party/skia/third_party/externals/abseil-cpp/absl/random/
H A Dbeta_distribution_test.cc69 constexpr int kCount = 1000; in TYPED_TEST() local
115 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
152 constexpr int kCount = 1000; in TYPED_TEST() local
176 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
184 EXPECT_EQ(ones + zeros, kCount); in TYPED_TEST()
202 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
217 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
227 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
236 for (int i = 0; i < kCount; ++i) { in TYPED_TEST()
H A Dlog_uniform_int_distribution_test.cc52 constexpr int kCount = 1000; in TYPED_TEST() local
104 for (int i = 0; i < kCount; i++) { in TYPED_TEST()
H A Duniform_real_distribution_test.cc87 constexpr int kCount = 1000; in TYPED_TEST() local
153 for (int i = 0; i < kCount; i++) { in TYPED_TEST()
H A Duniform_int_distribution_test.cc52 constexpr int kCount = 1000; in TYPED_TEST() local
98 for (int i = 0; i < kCount; i++) { in TYPED_TEST()
H A Dgaussian_distribution_test.cc85 constexpr int kCount = 1000; in TYPED_TEST() local
111 for (int i = 0; i < kCount; i++) { in TYPED_TEST()
H A Dexponential_distribution_test.cc88 constexpr int kCount = 1000; in TYPED_TEST() local
110 for (int i = 0; i < kCount; i++) { in TYPED_TEST()
H A Dzipf_distribution_test.cc52 constexpr int kCount = 1000; in TYPED_TEST() local
98 for (int i = 0; i < kCount; i++) { in TYPED_TEST()
H A Dpoisson_distribution_test.cc110 constexpr int kCount = 1000; in TYPED_TEST() local
129 for (int i = 0; i < kCount; i++) { in TYPED_TEST()
/third_party/node/lib/internal/
H A Dtimers.js129 const kCount = 0;
463 immediateInfo[kCount]--;
623 immediateInfo[kCount]++;
666 kCount,
/third_party/node/lib/
H A Dtimers.js43 kCount,
329 immediateInfo[kCount]--;
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dranden_engine_test.cc637 // `kCount` is chosen below so that, in debug builds and without hardware in TEST()
639 static constexpr size_t kCount = 100000; in TEST() local
643 for (int i = 0; i < kCount; i++) { in TEST()
649 static_cast<double>(kCount), in TEST()
653 EXPECT_GE(duration, kCount); // Should be slower than 1ns per call. in TEST()
/third_party/node/deps/v8/src/inspector/
H A Dv8-console-message.h44 kCount
H A Dv8-console-message.cc60 case ConsoleAPIType::kCount: in consoleAPITypeValue()
231 if (m_type == ConsoleAPIType::kDebug || m_type == ConsoleAPIType::kCount || in reportToFrontend()
462 if (type == ConsoleAPIType::kDebug || type == ConsoleAPIType::kCount || in createForConsoleAPI()
/third_party/skia/tests/
H A DResourceCacheTest.cpp1161 static const int kCount = 50; in test_timestamp_wrap() local
1167 // Run the test 2*kCount times; in test_timestamp_wrap()
1168 for (int i = 0; i < 2 * kCount; ++i ) { in test_timestamp_wrap()
1174 cache->changeTimestamp(UINT32_MAX - random.nextULessThan(kCount + 1)); in test_timestamp_wrap()
1176 static const int kNumToPurge = kCount; in test_timestamp_wrap()
1182 // Add kCount resources, holding onto resources at random so we have a mix of purgeable and in test_timestamp_wrap()
1184 for (int j = 0; j < kCount; ++j) { in test_timestamp_wrap()
1204 for (int j = 0; j < kCount; ++j) { in test_timestamp_wrap()
/third_party/skia/third_party/externals/sfntly/cpp/src/sfntly/table/core/
H A Dname_table.cc374 new_data->WriteUShort(NameTable::Offset::kCount, name_entry_map_.size()); in SubSerialize()
447 return data_->ReadUShort(Offset::kCount); in NameCount()
H A Dname_table.h686 kCount = 2, enumerator
/third_party/node/deps/v8/src/regexp/
H A Dregexp-compiler-tonode.cc177 static constexpr int kCount = arraysize(kStarts); in AddRange()
178 STATIC_ASSERT(kCount == arraysize(kEnds)); in AddRange()
179 STATIC_ASSERT(kCount == arraysize(kTargets)); in AddRange()
181 for (int i = 0; i < kCount; i++) { in AddRange()
/third_party/skia/samplecode/
H A DSampleQuadStroker.cpp115 kCount = 18 enumerator
117 SkPoint fPts[kCount];
/third_party/skia/third_party/externals/angle2/src/tests/gl_tests/
H A DVulkanPerformanceCounterTest.cpp2929 constexpr GLsizei kCount = 64; in TEST_P() local
2930 std::vector<GLint> data1(kCount, 1); in TEST_P()
2931 std::vector<GLint> data2(kCount, 2); in TEST_P()
2935 glBufferData(GL_UNIFORM_BUFFER, kCount * sizeof(data1[0]), data1.data(), GL_STATIC_DRAW); in TEST_P()
2939 glBufferData(GL_UNIFORM_BUFFER, kCount * sizeof(data2[0]), data2.data(), GL_STATIC_DRAW); in TEST_P()
/third_party/vk-gl-cts/external/openglcts/modules/gles31/
H A Des31cShaderStorageBufferObjectTests.cpp904 const int kCount = 8; in Run() local
905 const char* const glsl_vs[kCount] = { in Run()
947 for (int i = 0; i < kCount; ++i) in Run()
1008 const int kCount = 8; in Run() local
1009 const char* const glsl_cs[kCount] = { in Run()
1066 for (int i = 0; i < kCount; ++i) in Run()
1121 const int kCount = 8; in Run() local
1122 const char* const glsl_vs[kCount] = { in Run()
1173 for (int i = 0; i < kCount; ++i) in Run()
/third_party/vk-gl-cts/external/openglcts/modules/gl/
H A Dgl4cES31CompatibilityShaderStorageBufferObjectTests.cpp903 const int kCount = 8; in Run() local
904 const char* const glsl_vs[kCount] = { in Run()
946 for (int i = 0; i < kCount; ++i) in Run()
1007 const int kCount = 8; in Run() local
1008 const char* const glsl_cs[kCount] = { in Run()
1065 for (int i = 0; i < kCount; ++i) in Run()
1120 const int kCount = 8; in Run() local
1122 const char* const glsl_vs[kCount] = { in Run()
1172 for (int i = 0; i < kCount; ++i) in Run()

Completed in 50 milliseconds

12