Searched refs:kMaxEdges (Results 1 - 5 of 5) sorted by relevance

/external/skia/src/gpu/effects/
H A DGrConvexPolyEffect.h27 kMaxEdges = 8, enumerator in enum:GrConvexPolyEffect::__anon17050
31 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values.
43 if (n <= 0 || n > kMaxEdges || kHairlineAA_GrProcessorEdgeType == edgeType) {
81 SkScalar fEdges[3 * kMaxEdges];
H A DGrConvexPolyEffect.cpp183 SkScalar fPrevEdges[3 * GrConvexPolyEffect::kMaxEdges];
265 SkScalar edges[3 * kMaxEdges];
282 if (n >= kMaxEdges) {
334 SkASSERT(n <= kMaxEdges);
356 int count = d->fRandom->nextULessThan(kMaxEdges) + 1;
357 SkScalar edges[kMaxEdges * 3];
/external/skia/bench/
H A DTopoSortBench.cpp37 int numEdges = fRand.nextU() % (kMaxEdges+1);
68 static const int kMaxEdges = 5; member in class:TopoSortBench
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_bvgraph_test.cc309 const int kMaxEdges = 10; local
310 uptr added_edges[kMaxEdges];
313 EXPECT_EQ(0U, g.addEdges(from, 0, added_edges, kMaxEdges));
314 EXPECT_EQ(0U, g.addEdges(from, 1, added_edges, kMaxEdges));
316 EXPECT_EQ(1U, g.addEdges(from, 1, added_edges, kMaxEdges));
318 EXPECT_EQ(0U, g.addEdges(from, 1, added_edges, kMaxEdges));
322 EXPECT_EQ(1U, g.addEdges(from, 4, added_edges, kMaxEdges));
328 EXPECT_EQ(2U, g.addEdges(from, 4, added_edges, kMaxEdges));
/external/skia/gm/
H A Dconvexpolyeffect.cpp115 for (int i = 0; i < GrConvexPolyEffect::kMaxEdges; ++i) {
116 SkScalar angle = 2 * SK_ScalarPI * i / GrConvexPolyEffect::kMaxEdges;

Completed in 137 milliseconds