HomeSort by relevance Sort by last modified time
    Searched refs:kMaxEdges (Results 1 - 5 of 5) sorted by null

  /external/skia/src/gpu/effects/
GrConvexPolyEffect.h 27 kMaxEdges = 8,
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) {
85 SkScalar fEdges[3 * kMaxEdges];
GrConvexPolyEffect.cpp 183 SkScalar fPrevEdges[3 * GrConvexPolyEffect::kMaxEdges];
249 if (path.countPoints() > kMaxEdges) {
253 SkPoint pts[kMaxEdges];
254 SkScalar edges[3 * kMaxEdges];
266 int count = path.getPoints(pts, kMaxEdges);
317 SkASSERT(n <= kMaxEdges);
339 int count = d->fRandom->nextULessThan(kMaxEdges) + 1;
340 SkScalar edges[kMaxEdges * 3];
  /external/skia/bench/
TopoSortBench.cpp 37 int numEdges = fRand.nextU() % (kMaxEdges+1);
68 static const int kMaxEdges = 5;
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_bvgraph_test.cc 309 const int kMaxEdges = 10;
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/
convexpolyeffect.cpp 119 for (int i = 0; i < GrConvexPolyEffect::kMaxEdges; ++i) {
120 SkScalar angle = 2 * SK_ScalarPI * i / GrConvexPolyEffect::kMaxEdges;

Completed in 112 milliseconds