Searched refs:kNumValues (Results 1 – 5 of 5) sorted by relevance
| /third_party/skia/third_party/externals/dawn/src/tests/end2end/ |
| D | ComputeStorageBufferBarrierTests.cpp | 21 static constexpr uint32_t kNumValues = 100; member in ComputeStorageBufferBarrierTests
27 std::vector<uint32_t> data(kNumValues, 0); in TEST_P()
28 std::vector<uint32_t> expected(kNumValues, 0x1234 * kIterations); in TEST_P()
60 pass.Dispatch(kNumValues); in TEST_P()
66 EXPECT_BUFFER_U32_RANGE_EQ(expected.data(), buffer, 0, kNumValues); in TEST_P()
72 std::vector<uint32_t> data(kNumValues, 0); in TEST_P()
73 std::vector<uint32_t> expectedA(kNumValues, 0x1234 * kIterations); in TEST_P()
74 std::vector<uint32_t> expectedB(kNumValues, 0x1234 * (kIterations - 1)); in TEST_P()
123 pass.Dispatch(kNumValues); in TEST_P()
125 pass.Dispatch(kNumValues); in TEST_P()
[all …]
|
| /third_party/skia/src/sksl/lex/ |
| D | TransitionTable.cpp | 30 constexpr int kNumValues = (1 << kNumBits) - 1; variable
43 std::array<int, kNumValues> v = {};
136 } else if (transitionSet.size() <= kNumValues) { in WriteTransitionTable()
149 int maxValue[kNumValues] = {}; in WriteTransitionTable()
151 for (int index=0; index < kNumValues; ++index) { in WriteTransitionTable()
167 for (int index=0; index < kNumValues; ++index) { in WriteTransitionTable()
192 for (int index=0; index < kNumValues; ++index) { in WriteTransitionTable()
228 << " value &= " << kNumValues << ";\n" in WriteTransitionTable()
231 for (int index=0; index < kNumValues; ++index) { in WriteTransitionTable()
|
| /third_party/skia/third_party/externals/dawn/src/tests/white_box/ |
| D | InternalStorageBufferBindingTests.cpp | 24 static constexpr uint32_t kNumValues = 4; member in InternalStorageBufferBindingTests
82 std::vector<uint32_t> data(kNumValues, 0); in TEST_P()
83 std::vector<uint32_t> expected(kNumValues, 0x1234u * kIterations); in TEST_P()
100 pass.Dispatch(kNumValues); in TEST_P()
106 EXPECT_BUFFER_U32_RANGE_EQ(expected.data(), buffer, 0, kNumValues); in TEST_P()
|
| /third_party/abseil-cpp/absl/hash/ |
| D | hash_test.cc | 146 constexpr size_t kNumValues = 1 << kLog2NumValues; in TEST() local
148 for (size_t align = 1; align < kTotalSize / kNumValues; in TEST()
151 ASSERT_LE(align * kNumValues, kTotalSize); in TEST()
156 for (size_t i = 0; i < kNumValues; ++i) { in TEST()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/hash/ |
| D | hash_test.cc | 146 constexpr size_t kNumValues = 1 << kLog2NumValues; in TEST() local
148 for (size_t align = 1; align < kTotalSize / kNumValues; in TEST()
151 ASSERT_LE(align * kNumValues, kTotalSize); in TEST()
156 for (size_t i = 0; i < kNumValues; ++i) { in TEST()
|