Searched refs:kNumWraps (Results 1 – 3 of 3) sorted by relevance
140 const int kNumWraps = 4; in TEST() local141 for (int i = 0; i < kNumWraps * 2; ++i) { in TEST()148 for (int seq = 0; seq < kNumWraps * 0xFFFF; ++seq) { in TEST()158 const int kNumWraps = 4; in TEST() local159 int64_t seq = kNumWraps * 2 * kMaxDecrease; in TEST()161 for (int i = kNumWraps * 2; i >= 0; --i) { in TEST()167 seq = kNumWraps * 0xFFFF; in TEST()200 const int kNumWraps = 4; in TEST() local201 for (int i = 0; i < kNumWraps * 2; ++i) { in TEST()213 const int kNumWraps = 4; in TEST() local[all …]
101 constexpr int kNumWraps = static_cast<int>(WrapMode::kLast) + 1; in asIndex() local104 + static_cast<int>(fWrapModes[1])*kNumWraps in asIndex()105 + static_cast<int>(fFilter) *kNumWraps*kNumWraps in asIndex()106 + static_cast<int>(fMipmapMode) *kNumWraps*kNumWraps*kNumFilters; in asIndex()
279 const int kNumWraps = 100; in TEST() local284 for (int i = 0; i < kNumWraps * 2 + 1; ++i) { in TEST()294 const int kNumWraps = 100; in TEST() local299 for (uint16_t i = 0; i < kNumWraps * 2 + 1; ++i) { in TEST()