Home
last modified time | relevance | path

Searched refs:kNumRRects (Results 1 – 6 of 6) sorted by relevance

/external/skqp/bench/
DShadowBench.cpp34 kNumRRects = ((kWidth - kRRSpace) / kRRStep)*((kHeight - kRRSpace) / kRRStep) enumerator
57 SkASSERT(i == kNumRRects); in genRRects()
86 canvas->private_draw_shadow_rec(fRRects[i % kNumRRects], fRec); in onDraw()
93 SkPath fRRects[kNumRRects];
/external/skia/bench/
DShadowBench.cpp34 kNumRRects = ((kWidth - kRRSpace) / kRRStep)*((kHeight - kRRSpace) / kRRStep) enumerator
57 SkASSERT(i == kNumRRects); in genRRects()
86 canvas->private_draw_shadow_rec(fRRects[i % kNumRRects], fRec); in onDraw()
93 SkPath fRRects[kNumRRects];
/external/skia/gm/
Drrects.cpp89 for (int curRRect = 0; curRRect < kNumRRects; ++curRRect) { in onDraw()
177 static constexpr int kNumRRects = kNumSimpleCases + kNumComplexCases; member in skiagm::RRectGM
178 SkRRect fRRects[kNumRRects];
/external/skqp/gm/
Drrects.cpp94 for (int curRRect = 0; curRRect < kNumRRects; ++curRRect) { in onDraw()
181 static constexpr int kNumRRects = kNumSimpleCases + kNumComplexCases; member in skiagm::RRectGM
182 SkRRect fRRects[kNumRRects];
/external/skia/tests/
DRoundRectTest.cpp401 static const int kNumRRects = 4; in test_round_rect_contains_rect() local
402 static const SkVector gRadii[kNumRRects][4] = { in test_round_rect_contains_rect()
409 SkRRect rrects[kNumRRects]; in test_round_rect_contains_rect()
410 for (int i = 0; i < kNumRRects; ++i) { in test_round_rect_contains_rect()
427 for (int i = 0; i < kNumRRects; ++i) { in test_round_rect_contains_rect()
437 bool answers[kNumRRects][8][kNumSteps] = { in test_round_rect_contains_rect()
501 for (int i = 0; i < kNumRRects; ++i) { in test_round_rect_contains_rect()
/external/skqp/tests/
DRoundRectTest.cpp401 static const int kNumRRects = 4; in test_round_rect_contains_rect() local
402 static const SkVector gRadii[kNumRRects][4] = { in test_round_rect_contains_rect()
409 SkRRect rrects[kNumRRects]; in test_round_rect_contains_rect()
410 for (int i = 0; i < kNumRRects; ++i) { in test_round_rect_contains_rect()
427 for (int i = 0; i < kNumRRects; ++i) { in test_round_rect_contains_rect()
437 bool answers[kNumRRects][8][kNumSteps] = { in test_round_rect_contains_rect()
501 for (int i = 0; i < kNumRRects; ++i) { in test_round_rect_contains_rect()