| /external/skia/src/sksl/tracing/ |
| D | SkVMDebugTracePlayer.cpp | 26 fStack.clear(); in reset()
27 fStack.push_back({/*fFunction=*/-1, in reset()
59 size_t initialStackDepth = fStack.size(); in stepOver()
61 bool canEscapeFromThisStackDepth = (fStack.size() <= initialStackDepth); in stepOver()
72 size_t initialStackDepth = fStack.size(); in stepOut()
75 bool hasEscapedFromInitialStackDepth = (fStack.size() < initialStackDepth); in stepOut()
100 fStack.back().fDisplayMask.reset(slot); in tidyState()
109 SkASSERT(!fStack.empty()); in getCurrentLine()
110 return fStack.back().fLine; in getCurrentLine()
118 SkASSERT((size_t)stackFrameIndex < fStack.size()); in getCurrentLineInStackFrame()
[all …]
|
| D | SkVMDebugTracePlayer.h | 127 std::vector<StackFrame> fStack; // the execution stack variable
|
| /external/skia/src/core/ |
| D | SkRasterClipStack.h | 21 fStack.emplace_back(SkRasterClip(fRootBounds)); in SkRasterClipStack()
22 SkASSERT(fStack.count() == 1); in SkRasterClipStack()
28 SkASSERT(fStack.count() == 1); in setNewSize()
29 Rec& rec = fStack.back(); in setNewSize()
34 const SkRasterClip& rc() const { return fStack.back().fRC; } in rc()
38 SkASSERT(fStack.back().fDeferredCount >= 0); in save()
39 fStack.back().fDeferredCount += 1; in save()
46 if (--fStack.back().fDeferredCount < 0) { in restore()
47 SkASSERT(fStack.back().fDeferredCount == -1); in restore()
48 SkASSERT(fStack.count() > 1); in restore()
[all …]
|
| D | SkClipStack.cpp | 781 SkClipStack::Iter::Iter() : fStack(nullptr) { in Iter()
785 : fStack(&stack) { in Iter()
798 if (nullptr == fStack) { in skipToTopmost()
802 fIter.reset(fStack->fDeque, SkDeque::Iter::kBack_IterStart); in skipToTopmost()
821 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
829 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
836 fStack = &stack; in reset()
|
| D | SkRegion.cpp | 47 RunArray() { fPtr = fStack; } in RunArray()
61 if (fPtr == fStack) { in resizeToAtLeast()
62 memcpy(fMalloc.get(), fStack, fCount * sizeof(SkRegionPriv::RunType)); in resizeToAtLeast()
69 SkRegionPriv::RunType fStack[kRunArrayStackCount]; member in RunArray
|
| D | SkClipStack.h | 428 const SkClipStack* fStack;
|
| /external/skia/src/sksl/lex/ |
| D | RegexParser.cpp | 20 SkASSERT(fStack.size() == 0); in parse()
22 SkASSERT(fStack.size() == 1); in parse()
43 RegexNode result = fStack.top(); in pop()
44 fStack.pop(); in pop()
60 case '*': fStack.push(RegexNode(RegexNode::kStar_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
61 case '+': fStack.push(RegexNode(RegexNode::kPlus_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
62 case '?': fStack.push(RegexNode(RegexNode::kQuestion_Kind, this->pop())); ++fIndex; break; in quantifiedTerm()
78 fStack.emplace(RegexNode::kConcat_Kind, std::move(left), std::move(right)); in sequence()
98 fStack.push(this->escapeSequence(peek())); in literal()
102 fStack.push(RegexNode(RegexNode::kChar_Kind, c)); in literal()
[all …]
|
| D | RegexParser.h | 86 std::stack<RegexNode> fStack; variable
|
| /external/skia/src/gpu/graphite/ |
| D | PaintParamsKey.cpp | 40 SkASSERT(fStack.empty()); in checkReset()
61 if (!fStack.empty()) { in beginBlock()
63 SkASSERT(fStack.back().fCurDataPayloadEntry == 0); in beginBlock()
64 fStack.back().fNumActualChildren++; in beginBlock()
77 fStack.push_back({ codeSnippetID, this->sizeInBytes(), in beginBlock()
86 fStack.back().fDataPayloadExpectations = snippet->fDataPayloadExpectations; in beginBlock()
87 fStack.back().fCurDataPayloadEntry = 0; in beginBlock()
88 fStack.back().fNumExpectedChildren = snippet->fNumChildren; in beginBlock()
89 fStack.back().fNumActualChildren = 0; in beginBlock()
99 if (fStack.empty()) { in endBlock()
[all …]
|
| D | PaintParamsKey.h | 255 SkTDArray<StackFrame> fStack;
|
| /external/cronet/third_party/icu/source/i18n/ |
| D | rematch.cpp | 157 delete fStack; in ~RegexMatcher()
212 fStack = NULL; in init()
228 fStack = NULL; in init()
254 fStack = new UVector64(status); in init2()
255 if (fStack == NULL) { in init2()
2407 fStack->setMaxCapacity(0); in setStackLimit()
2416 fStack->setMaxCapacity(adjustedLimit); in setStackLimit()
2515 fStack->removeAllElements(); in resetStack()
2517 …REStackFrame *iFrame = (REStackFrame *)fStack->reserveBlock(fPattern->fFrameSize, fDeferredStatus); in resetStack()
2736 int64_t *newFP = fStack->reserveBlock(fFrameSize, status); in StateSave()
[all …]
|
| D | regexcmp.h | 153 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
| /external/icu/icu4c/source/i18n/ |
| D | rematch.cpp | 157 delete fStack; in ~RegexMatcher()
212 fStack = NULL; in init()
228 fStack = NULL; in init()
254 fStack = new UVector64(status); in init2()
255 if (fStack == NULL) { in init2()
2407 fStack->setMaxCapacity(0); in setStackLimit()
2416 fStack->setMaxCapacity(adjustedLimit); in setStackLimit()
2515 fStack->removeAllElements(); in resetStack()
2517 …REStackFrame *iFrame = (REStackFrame *)fStack->reserveBlock(fPattern->fFrameSize, fDeferredStatus); in resetStack()
2736 int64_t *newFP = fStack->reserveBlock(fFrameSize, status); in StateSave()
[all …]
|
| D | regexcmp.h | 153 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
| /external/skia/tests/ |
| D | IncrTopoSortTest.cpp | 207 for (int i = 0; i < fStack.size(); ++i) { in print()
208 SkDebugf("%c/%c ", fStack[i].fNode->id(), fStack[i].fDest->id()); in print()
216 REPORTER_ASSERT(fReporter, fStack.empty()); in validate()
225 for (int i = 0; i < fStack.size(); ++i) { in validate()
226 SkASSERT(fStack[i].fNode->visited()); in validate()
245 fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() }); in dfs()
260 for (int i = 0; i < fStack.size(); ++i) { in stackContains()
261 if (node == fStack[i].fNode.get()) { in stackContains()
275 while (!fStack.empty()) { in shift()
296 while (!fStack.empty() && node.get() == fStack.back().fDest) { in shift()
[all …]
|
| /external/skia/src/sksl/analysis/ |
| D | SkSLCheckProgramStructure.cpp | 71 for (auto unwind = fStack.rbegin(); unwind != fStack.rend(); ++unwind) { in CheckProgramStructure()
89 if (fStack.size() >= kProgramStackDepthLimit) { in CheckProgramStructure()
91 for (auto unwind = fStack.begin(); unwind != fStack.end(); ++unwind) { in CheckProgramStructure()
103 fStack.push_back(decl); in CheckProgramStructure()
107 fStack.pop_back(); in CheckProgramStructure()
201 std::vector<const FunctionDeclaration*> fStack; in CheckProgramStructure() member in SkSL::Analysis::CheckProgramStructure::ProgramSizeVisitor
|
| /external/icu/icu4c/source/common/ |
| D | rbbiscan.h | 119 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
| D | rbbiscan.cpp | 101 fStack[0] = 0; in RBBIRuleScanner()
1093 fStack[fStackPtr] = tableEl->fPushState; in parse()
1105 state = fStack[fStackPtr]; in parse()
|
| /external/icu/libicu/cts_headers/ |
| D | rbbiscan.h | 119 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
| D | regexcmp.h | 153 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
| /external/cronet/third_party/icu/source/common/ |
| D | rbbiscan.h | 119 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
|
| D | rbbiscan.cpp | 101 fStack[0] = 0; in RBBIRuleScanner()
1093 fStack[fStackPtr] = tableEl->fPushState; in parse()
1105 state = fStack[fStackPtr]; in parse()
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | RBBIRuleScanner.java | 55 short fStack[] = new short[kStackSize]; // State stack, holds state pushes field in RBBIRuleScanner
948 fStack[fStackPtr] = tableEl.fPushState; in parse()
960 state = fStack[fStackPtr]; in parse()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | RBBIRuleScanner.java | 54 short fStack[] = new short[kStackSize]; // State stack, holds state pushes field in RBBIRuleScanner
947 fStack[fStackPtr] = tableEl.fPushState; in parse()
959 state = fStack[fStackPtr]; in parse()
|
| /external/icu/icu4c/source/i18n/unicode/ |
| D | regex.h | 1837 UVector64 *fStack; variable
|