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

  /external/chromium_org/third_party/skia/src/core/
SkEdgeClipper.h 34 SkPath::Verb fVerbs[kMaxVerbs];
SkQuadClipper.h 53 SkPath::Verb fVerbs[kMaxVerbs];
SkPathRef.cpp 191 // since it is only a cache of info in the fVerbs, but its a fast way to
341 uint8_t* vb = fVerbs - fVerbCnt;
409 this->fVerbs[~fVerbCnt] = verb;
449 SkASSERT(reinterpret_cast<intptr_t>(fVerbs) - reinterpret_cast<intptr_t>(fPoints) >= 0);
450 SkASSERT((NULL == fPoints) == (NULL == fVerbs));
454 SkASSERT(!(NULL == fVerbs && fVerbCnt));
476 switch (fVerbs[~i]) {
SkEdgeClipper.cpp 199 fCurrVerb = fVerbs;
212 SkASSERT(fCurrVerb - fVerbs < kMaxVerbs);
220 fCurrVerb = fVerbs;
221 return SkPath::kDone_Verb != fVerbs[0];
407 fCurrVerb = fVerbs;
420 SkASSERT(fCurrVerb - fVerbs < kMaxVerbs);
428 fCurrVerb = fVerbs;
429 return SkPath::kDone_Verb != fVerbs[0];
SkPath.cpp     [all...]
  /external/skia/src/core/
SkEdgeClipper.h 34 SkPath::Verb fVerbs[kMaxVerbs];
SkQuadClipper.h 53 SkPath::Verb fVerbs[kMaxVerbs];
SkPathRef.cpp 191 // since it is only a cache of info in the fVerbs, but its a fast way to
341 uint8_t* vb = fVerbs - fVerbCnt;
409 this->fVerbs[~fVerbCnt] = verb;
449 SkASSERT(reinterpret_cast<intptr_t>(fVerbs) - reinterpret_cast<intptr_t>(fPoints) >= 0);
450 SkASSERT((NULL == fPoints) == (NULL == fVerbs));
454 SkASSERT(!(NULL == fVerbs && fVerbCnt));
476 switch (fVerbs[~i]) {
SkEdgeClipper.cpp 199 fCurrVerb = fVerbs;
212 SkASSERT(fCurrVerb - fVerbs < kMaxVerbs);
220 fCurrVerb = fVerbs;
221 return SkPath::kDone_Verb != fVerbs[0];
407 fCurrVerb = fVerbs;
420 SkASSERT(fCurrVerb - fVerbs < kMaxVerbs);
428 fCurrVerb = fVerbs;
429 return SkPath::kDone_Verb != fVerbs[0];
SkPath.cpp     [all...]
  /external/chromium_org/third_party/skia/include/core/
SkPathRef.h 194 SkDEBUGCODE(fVerbs = NULL;)
209 const uint8_t* verbs() const { SkDEBUGCODE(this->validate();) return fVerbs; }
271 fVerbs = NULL;
338 fVerbs = NULL;
400 fVerbs = reinterpret_cast<uint8_t*>(reinterpret_cast<intptr_t>(fPoints) + newSize);
410 return fVerbs - fVerbCnt;
417 return reinterpret_cast<intptr_t>(fVerbs) - reinterpret_cast<intptr_t>(fPoints);
446 uint8_t* fVerbs; // points just past the end of the allocation (verbs grow backwards)
SkPath.h     [all...]
  /external/skia/include/core/
SkPathRef.h 194 SkDEBUGCODE(fVerbs = NULL;)
209 const uint8_t* verbs() const { SkDEBUGCODE(this->validate();) return fVerbs; }
271 fVerbs = NULL;
338 fVerbs = NULL;
400 fVerbs = reinterpret_cast<uint8_t*>(reinterpret_cast<intptr_t>(fPoints) + newSize);
410 return fVerbs - fVerbCnt;
417 return reinterpret_cast<intptr_t>(fVerbs) - reinterpret_cast<intptr_t>(fPoints);
446 uint8_t* fVerbs; // points just past the end of the allocation (verbs grow backwards)
SkPath.h     [all...]
  /external/skia/bench/
PathBench.cpp 237 fVerbs.reset(kNumVerbs);
240 fVerbs[i] = static_cast<SkPath::Verb>(fRandom.nextULessThan(SkPath::kDone_Verb));
241 } while (!allowMoves && SkPath::kMove_Verb == fVerbs[i]);
260 int verb = fVerbs[(fCurrVerb++) & (kNumVerbs - 1)];
297 fVerbs.reset(0);
309 SkAutoTArray<SkPath::Verb> fVerbs;

Completed in 636 milliseconds