/external/skqp/src/core/ |
D | SkRasterClipStack.h | 66 : fStack(fStorage, sizeof(fStorage)) in SkRasterClipStack() 69 Rec& rec = fStack.push(); in SkRasterClipStack() 72 SkASSERT(fStack.count() == 1); in SkRasterClipStack() 78 SkASSERT(fStack.count() == 1); in setNewSize() 79 Rec& rec = fStack.top(); in setNewSize() 84 const SkRasterClip& rc() const { return fStack.top().fRC; } in rc() 88 SkASSERT(fStack.top().fDeferredCount >= 0); in save() 89 fStack.top().fDeferredCount += 1; in save() 94 if (--fStack.top().fDeferredCount < 0) { in restore() 95 SkASSERT(fStack.top().fDeferredCount == -1); in restore() [all …]
|
D | SkClipStack.cpp | 876 SkClipStack::Iter::Iter() : fStack(nullptr) { in Iter() 880 : fStack(&stack) { in Iter() 894 if (nullptr == fStack) { in skipToTopmost() 898 fIter.reset(fStack->fDeque, SkDeque::Iter::kBack_IterStart); in skipToTopmost() 917 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost() 925 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost() 932 fStack = &stack; in reset()
|
D | SkClipStack.h | 431 const SkClipStack* fStack;
|
/external/skia/src/core/ |
D | SkRasterClipStack.h | 66 : fStack(fStorage, sizeof(fStorage)) in SkRasterClipStack() 69 Rec& rec = fStack.push(); in SkRasterClipStack() 72 SkASSERT(fStack.count() == 1); in SkRasterClipStack() 78 SkASSERT(fStack.count() == 1); in setNewSize() 79 Rec& rec = fStack.top(); in setNewSize() 84 const SkRasterClip& rc() const { return fStack.top().fRC; } in rc() 88 SkASSERT(fStack.top().fDeferredCount >= 0); in save() 89 fStack.top().fDeferredCount += 1; in save() 94 if (--fStack.top().fDeferredCount < 0) { in restore() 95 SkASSERT(fStack.top().fDeferredCount == -1); in restore() [all …]
|
D | SkClipStack.cpp | 876 SkClipStack::Iter::Iter() : fStack(nullptr) { in Iter() 880 : fStack(&stack) { in Iter() 894 if (nullptr == fStack) { in skipToTopmost() 898 fIter.reset(fStack->fDeque, SkDeque::Iter::kBack_IterStart); in skipToTopmost() 917 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost() 925 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost() 932 fStack = &stack; in reset()
|
D | SkClipStack.h | 431 const SkClipStack* fStack;
|
/external/skqp/src/sksl/lex/ |
D | RegexParser.cpp | 15 ASSERT(fStack.size() == 0); in parse() 17 ASSERT(fStack.size() == 1); in parse() 38 RegexNode result = fStack.top(); in pop() 39 fStack.pop(); in pop() 55 case '*': fStack.push(RegexNode(RegexNode::kStar_Kind, this->pop())); ++fIndex; break; in quantifiedTerm() 56 case '+': fStack.push(RegexNode(RegexNode::kPlus_Kind, this->pop())); ++fIndex; break; in quantifiedTerm() 57 case '?': fStack.push(RegexNode(RegexNode::kQuestion_Kind, this->pop())); ++fIndex; break; in quantifiedTerm() 73 fStack.emplace(RegexNode::kConcat_Kind, std::move(left), std::move(right)); in sequence() 92 fStack.push(this->escapeSequence(peek())); in literal() 96 fStack.push(RegexNode(RegexNode::kChar_Kind, c)); in literal() [all …]
|
D | RegexParser.h | 86 std::stack<RegexNode> fStack; variable
|
/external/skia/src/sksl/lex/ |
D | RegexParser.cpp | 15 ASSERT(fStack.size() == 0); in parse() 17 ASSERT(fStack.size() == 1); in parse() 38 RegexNode result = fStack.top(); in pop() 39 fStack.pop(); in pop() 55 case '*': fStack.push(RegexNode(RegexNode::kStar_Kind, this->pop())); ++fIndex; break; in quantifiedTerm() 56 case '+': fStack.push(RegexNode(RegexNode::kPlus_Kind, this->pop())); ++fIndex; break; in quantifiedTerm() 57 case '?': fStack.push(RegexNode(RegexNode::kQuestion_Kind, this->pop())); ++fIndex; break; in quantifiedTerm() 73 fStack.emplace(RegexNode::kConcat_Kind, std::move(left), std::move(right)); in sequence() 92 fStack.push(this->escapeSequence(peek())); in literal() 96 fStack.push(RegexNode(RegexNode::kChar_Kind, c)); in literal() [all …]
|
D | RegexParser.h | 86 std::stack<RegexNode> fStack; variable
|
/external/skqp/tools/bookmaker/ |
D | parserCommon.cpp | 286 SkASSERT(fStack.back().fObject.isArray()); in baseDir() 287 SkASSERT(fStack.size() > 2); in baseDir() 289 for (unsigned index = 2; index < fStack.size(); ++index) { in baseDir() 290 dir += fStack[index].fName; in baseDir() 291 if (index < fStack.size() - 1) { in baseDir() 304 if (fStack.empty()) { in next() 307 status = &fStack.back(); in next() 311 fStack.pop_back(); in next() 313 if (1 == fStack.size()) { in next() 338 fStack.emplace_back(block); in next() [all …]
|
D | bookmaker.h | 1160 bool empty() { return fStack.empty(); } in empty() 1166 vector<JsonStatus> fStack;
|
/external/skia/tools/bookmaker/ |
D | parserCommon.cpp | 286 SkASSERT(fStack.back().fObject.isArray()); in baseDir() 287 SkASSERT(fStack.size() > 2); in baseDir() 289 for (unsigned index = 2; index < fStack.size(); ++index) { in baseDir() 290 dir += fStack[index].fName; in baseDir() 291 if (index < fStack.size() - 1) { in baseDir() 304 if (fStack.empty()) { in next() 307 status = &fStack.back(); in next() 311 fStack.pop_back(); in next() 313 if (1 == fStack.size()) { in next() 338 fStack.emplace_back(block); in next() [all …]
|
/external/icu/icu4c/source/i18n/ |
D | rematch.cpp | 157 delete fStack; in ~RegexMatcher() 211 fStack = NULL; in init() 226 fStack = NULL; in init() 252 fStack = new UVector64(status); in init2() 253 if (fStack == NULL) { in init2() 2392 fStack->setMaxCapacity(0); in setStackLimit() 2401 fStack->setMaxCapacity(adjustedLimit); in setStackLimit() 2500 fStack->removeAllElements(); in resetStack() 2502 …REStackFrame *iFrame = (REStackFrame *)fStack->reserveBlock(fPattern->fFrameSize, fDeferredStatus); in resetStack() 2698 int64_t *newFP = fStack->reserveBlock(fFrameSize, status); in StateSave() [all …]
|
D | regexcmp.h | 163 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
D | regexcmp.cpp | 136 fStack[fStackPtr] = 0; in compile() 251 fStack[fStackPtr] = tableEl->fPushState; in compile() 267 state = fStack[fStackPtr]; in compile()
|
/external/skqp/src/gpu/ |
D | GrClipStackClip.cpp | 36 if (!fStack || fStack->isWideOpen()) { in quickContains() 39 return fStack->quickContains(rect); in quickContains() 43 if (!fStack || fStack->isWideOpen()) { in quickContains() 46 return fStack->quickContains(rrect); in quickContains() 50 if (!fStack) { in isRRect() 55 if (fStack->isRRect(*rtBounds, rr, &isAA)) { in isRRect() 64 if (!fStack) { in getConservativeBounds() 72 fStack->getConservativeBounds(0, 0, width, height, &devBounds, isIntersectionOfRects); in getConservativeBounds() 189 if (!fStack || fStack->isWideOpen()) { in apply() 208 GrReducedClip reducedClip(*fStack, devBounds, caps, maxWindowRectangles, maxAnalyticFPs, ccpr); in apply() [all …]
|
D | GrClipStackClip.h | 25 void reset(const SkClipStack* stack) { fStack = stack; } in reset() 65 const SkClipStack* fStack; variable
|
/external/skia/src/gpu/ |
D | GrClipStackClip.cpp | 36 if (!fStack || fStack->isWideOpen()) { in quickContains() 39 return fStack->quickContains(rect); in quickContains() 43 if (!fStack || fStack->isWideOpen()) { in quickContains() 46 return fStack->quickContains(rrect); in quickContains() 50 if (!fStack) { in isRRect() 55 if (fStack->isRRect(*rtBounds, rr, &isAA)) { in isRRect() 64 if (!fStack) { in getConservativeBounds() 72 fStack->getConservativeBounds(0, 0, width, height, &devBounds, isIntersectionOfRects); in getConservativeBounds() 189 if (!fStack || fStack->isWideOpen()) { in apply() 208 GrReducedClip reducedClip(*fStack, devBounds, caps, maxWindowRectangles, maxAnalyticFPs, ccpr); in apply() [all …]
|
D | GrClipStackClip.h | 25 void reset(const SkClipStack* stack) { fStack = stack; } in reset() 65 const SkClipStack* fStack; variable
|
/external/icu/icu4c/source/common/ |
D | rbbiscan.h | 117 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
D | rbbiscan.cpp | 101 fStack[0] = 0; in RBBIRuleScanner() 1090 fStack[fStackPtr] = tableEl->fPushState; in parse() 1102 state = fStack[fStackPtr]; in parse()
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | RBBIRuleScanner.java | 54 short fStack[] = new short[kStackSize]; // State stack, holds state pushes field in RBBIRuleScanner 944 fStack[fStackPtr] = tableEl.fPushState; in parse() 956 state = fStack[fStackPtr]; in parse()
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | RBBIRuleScanner.java | 53 short fStack[] = new short[kStackSize]; // State stack, holds state pushes field in RBBIRuleScanner 943 fStack[fStackPtr] = tableEl.fPushState; in parse() 955 state = fStack[fStackPtr]; in parse()
|
/external/icu/icu4c/source/i18n/unicode/ |
D | regex.h | 1844 UVector64 *fStack; variable
|