Home
last modified time | relevance | path

Searched refs:fStack (Results 1 - 25 of 37) sorted by relevance

12

/third_party/skia/src/core/
H A DSkRasterClipStack.h21 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 in restore()
106 SkTBlockList<Rec, 16> fStack; global() member in SkRasterClipStack
[all...]
H A DSkMarkerStack.cpp18 for (auto it = fStack.rbegin(); it != fStack.rend(); ++it) { in setMarker()
29 fStack.push_back({boundary, mx, inv, id}); in setMarker()
34 for (auto it = fStack.rbegin(); it != fStack.rend(); ++it) { in findMarker()
47 for (auto it = fStack.rbegin(); it != fStack.rend(); ++it) { in findMarkerInverse()
59 while (!fStack.empty() && fStack.back().fBoundary == boundary) { in restore()
60 fStack in restore()
[all...]
H A DSkClipStack.cpp792 SkClipStack::Iter::Iter() : fStack(nullptr) { in Iter()
796 : fStack(&stack) { in Iter()
809 if (nullptr == fStack) { in skipToTopmost()
813 fIter.reset(fStack->fDeque, SkDeque::Iter::kBack_IterStart); in skipToTopmost()
832 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
840 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
847 fStack = &stack; in reset()
H A DSkMarkerStack.h32 std::vector<Rec> fStack; member in SkMarkerStack
/third_party/skia/src/sksl/lex/
H A DRegexParser.cpp15 SkASSERT(fStack.size() == 0); in parse()
17 SkASSERT(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()
93 fStack.push(this->escapeSequence(peek())); in literal()
97 fStack in literal()
[all...]
H A DRegexParser.h86 std::stack<RegexNode> fStack; member in RegexParser
/third_party/skia/experimental/xform/
H A DXContext.cpp99 int prevCount = fStack.count();
101 Xform** ptr = fStack.append(n) + n;
109 RasterXformResolver res(fStack[prevCount - 1]);
110 for (int i = prevCount; i < fStack.count(); ++i) {
111 fStack[i]->visit(&res);
112 fStack[i]->setCache(res.ctm(), res.snapCache());
116 for (int i = 0; i < fStack.count(); ++i) {
117 fStack[i]->visit(&res);
118 fStack[i]->setCache(res.ctm(), res.snapCache());
129 fStack
159 SkTDArray<Xform*> fStack; global() member in CanvasXContext
[all...]
/third_party/skia/experimental/sorttoy/
H A DFake.h60 // MCState (i.e., in the coordinate frame of the MCState prior to this one in 'fStack').
68 int count() const { return fStack.size(); } in count()
71 const std::vector<MCState>& mcStates() const { return fStack; } in mcStates()
72 const MCState& operator[](int index) const { return fStack[index]; } in operator []()
84 std::vector<MCState> fStack; member in FakeMCBlob
90 fStack.push_back(FakeMCBlob::MCState()); in FakeStateTracker()
94 sk_sp<FakeMCBlob> tmp = fStack.back().getCached(); in snapState()
99 tmp = sk_make_sp<FakeMCBlob>(fStack); in snapState()
100 fStack.back().setCached(tmp); in snapState()
105 fStack in push()
126 std::vector<FakeMCBlob::MCState> fStack; global() member in FakeStateTracker
[all...]
H A DFake.cpp40 FakeMCBlob::FakeMCBlob(const std::vector<MCState>& stack) : fID(NextID()), fStack(stack) { in FakeMCBlob()
43 for (MCState& s : fStack) { in FakeMCBlob()
/third_party/skia/src/sksl/analysis/
H A DSkSLCheckProgramUnrolledSize.cpp66 for (auto unwind = fStack.rbegin(); unwind != fStack.rend(); ++unwind) { in CheckProgramUnrolledSize()
83 if (fStack.size() >= kProgramStackDepthLimit) { in CheckProgramUnrolledSize()
85 for (auto unwind = fStack.begin(); unwind != fStack.end(); ++unwind) { in CheckProgramUnrolledSize()
95 fStack.push_back(decl); in CheckProgramUnrolledSize()
99 fStack.pop_back(); in CheckProgramUnrolledSize()
188 std::vector<const FunctionDeclaration*> fStack; in CheckProgramUnrolledSize() member in SkSL::ProgramSizeVisitor
/third_party/icu/icu4c/source/i18n/
H A Drematch.cpp157 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 in StateSave()
[all...]
H A Dregexcmp.h153 uint16_t fStack[kStackSize]; // State stack, holds state pushes member in RegexCompile
/third_party/node/deps/icu-small/source/i18n/
H A Drematch.cpp157 delete fStack; in ~RegexMatcher()
212 fStack = nullptr; in init()
228 fStack = nullptr; in init()
254 fStack = new UVector64(status); in init2()
255 if (fStack == nullptr) { 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 in StateSave()
[all...]
H A Dregexcmp.h153 uint16_t fStack[kStackSize]; // State stack, holds state pushes member in RegexCompile
/third_party/skia/third_party/externals/icu/source/i18n/
H A Drematch.cpp157 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()
2397 fStack->setMaxCapacity(0); in setStackLimit()
2406 fStack->setMaxCapacity(adjustedLimit); in setStackLimit()
2505 fStack->removeAllElements(); in resetStack()
2507 REStackFrame *iFrame = (REStackFrame *)fStack->reserveBlock(fPattern->fFrameSize, fDeferredStatus); in resetStack()
2726 int64_t *newFP = fStack in StateSave()
[all...]
H A Dregexcmp.h163 uint16_t fStack[kStackSize]; // State stack, holds state pushes member in RegexCompile
/third_party/skia/tests/
H A DIncrTopoSortTest.cpp201 for (int i = 0; i < fStack.count(); ++i) { in print()
202 SkDebugf("%c/%c ", fStack[i].fNode->id(), fStack[i].fDest->id()); in print()
210 REPORTER_ASSERT(fReporter, fStack.empty()); in validate()
219 for (int i = 0; i < fStack.count(); ++i) { in validate()
220 SkASSERT(fStack[i].fNode->visited()); in validate()
225 // to be in violation of the topological constraints are placed in 'fStack'.
239 fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() }); in dfs()
251 // Does 'fStack' have 'node'? That is, was 'node' discovered to be in violation of the
254 for (int i = 0; i < fStack in stackContains()
313 SkTArray<StackInfo> fStack; // only used in addEdges() global() member in Graph
[all...]
/third_party/skia/src/sksl/
H A DSkSLThreadContext.h132 SkASSERTF(!Instance().fStack.empty(), "This feature requires a FragmentProcessor"); in CurrentProcessor()
133 return Instance().fStack.top().fProcessor; in CurrentProcessor()
140 SkASSERTF(!Instance().fStack.empty(), "This feature requires a FragmentProcessor"); in CurrentEmitArgs()
141 return Instance().fStack.top().fEmitArgs; in CurrentEmitArgs()
145 return !Instance().fStack.empty(); in InFragmentProcessor()
217 std::stack<StackFrame, std::list<StackFrame>> fStack; member in SkSL::ThreadContext
H A DSkSLThreadContext.cpp150 instance.fStack.push({processor, emitArgs, StatementArray{}}); in StartFragmentProcessor()
151 CurrentEmitArgs()->fFragBuilder->fDeclarations.swap(instance.fStack.top().fSavedDeclarations); in StartFragmentProcessor()
157 SkASSERT(!instance.fStack.empty()); in EndFragmentProcessor()
158 CurrentEmitArgs()->fFragBuilder->fDeclarations.swap(instance.fStack.top().fSavedDeclarations); in EndFragmentProcessor()
159 instance.fStack.pop(); in EndFragmentProcessor()
/third_party/skia/modules/particles/include/
H A DSkParticleSerialization.h70 fStack.push_back(&fRoot); in SkFromJsonVisitor()
107 fStack.push_back((const skjson::ObjectValue*)get(name));
110 fStack.pop_back();
115 fStack.push_back(arrVal);
120 fStack.pop_back();
127 if (const skjson::Value* cur = fStack.back()) { in get()
182 SkSTArray<16, const skjson::Value*, true> fStack; member in SkFromJsonVisitor
/third_party/icu/icu4c/source/common/
H A Drbbiscan.h119 uint16_t fStack[kStackSize]; // State stack, holds state pushes member in RBBIRuleScanner
/third_party/node/deps/icu-small/source/common/
H A Drbbiscan.h119 uint16_t fStack[kStackSize]; // State stack, holds state pushes member in RBBIRuleScanner
/third_party/skia/third_party/externals/icu/source/common/
H A Drbbiscan.h119 uint16_t fStack[kStackSize]; // State stack, holds state pushes member in RBBIRuleScanner
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DRBBIRuleScanner.java54 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()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DRBBIRuleScanner.java55 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()

Completed in 24 milliseconds

12