Home
last modified time | relevance | path

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

12

/external/skia/src/core/
DSkRasterClipStack.h67 : fStack(fStorage, sizeof(fStorage)) in SkRasterClipStack()
70 Rec& rec = fStack.push(); in SkRasterClipStack()
73 SkASSERT(fStack.count() == 1); in SkRasterClipStack()
79 SkASSERT(fStack.count() == 1); in setNewSize()
80 Rec& rec = fStack.top(); in setNewSize()
85 const SkRasterClip& rc() const { return fStack.top().fRC; } in rc()
89 SkASSERT(fStack.top().fDeferredCount >= 0); in save()
90 fStack.top().fDeferredCount += 1; in save()
95 if (--fStack.top().fDeferredCount < 0) { in restore()
96 SkASSERT(fStack.top().fDeferredCount == -1); in restore()
[all …]
DSkClipStack.cpp843 SkClipStack::Iter::Iter() : fStack(nullptr) { in Iter()
847 : fStack(&stack) { in Iter()
861 if (nullptr == fStack) { in skipToTopmost()
865 fIter.reset(fStack->fDeque, SkDeque::Iter::kBack_IterStart); in skipToTopmost()
884 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
892 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
899 fStack = &stack; in reset()
/external/skqp/src/core/
DSkRasterClipStack.h67 : fStack(fStorage, sizeof(fStorage)) in SkRasterClipStack()
70 Rec& rec = fStack.push(); in SkRasterClipStack()
73 SkASSERT(fStack.count() == 1); in SkRasterClipStack()
79 SkASSERT(fStack.count() == 1); in setNewSize()
80 Rec& rec = fStack.top(); in setNewSize()
85 const SkRasterClip& rc() const { return fStack.top().fRC; } in rc()
89 SkASSERT(fStack.top().fDeferredCount >= 0); in save()
90 fStack.top().fDeferredCount += 1; in save()
95 if (--fStack.top().fDeferredCount < 0) { in restore()
96 SkASSERT(fStack.top().fDeferredCount == -1); in restore()
[all …]
DSkClipStack.cpp873 SkClipStack::Iter::Iter() : fStack(nullptr) { in Iter()
877 : fStack(&stack) { in Iter()
891 if (nullptr == fStack) { in skipToTopmost()
895 fIter.reset(fStack->fDeque, SkDeque::Iter::kBack_IterStart); in skipToTopmost()
914 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
922 fIter.reset(fStack->fDeque, SkDeque::Iter::kFront_IterStart); in skipToTopmost()
929 fStack = &stack; in reset()
/external/skia/src/sksl/lex/
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()
92 fStack.push(this->escapeSequence(peek())); in literal()
96 fStack.push(RegexNode(RegexNode::kChar_Kind, c)); in literal()
[all …]
DRegexParser.h86 std::stack<RegexNode> fStack; variable
/external/skqp/src/sksl/lex/
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()
92 fStack.push(this->escapeSequence(peek())); in literal()
96 fStack.push(RegexNode(RegexNode::kChar_Kind, c)); in literal()
[all …]
DRegexParser.h86 std::stack<RegexNode> fStack; variable
/external/skia/experimental/xform/
DXContext.cpp99 int prevCount = fStack.count(); in onPush()
101 Xform** ptr = fStack.append(n) + n; in onPush()
109 RasterXformResolver res(fStack[prevCount - 1]); in onPush()
110 for (int i = prevCount; i < fStack.count(); ++i) { in onPush()
111 fStack[i]->visit(&res); in onPush()
112 fStack[i]->setCache(res.ctm(), res.snapCache()); in onPush()
116 for (int i = 0; i < fStack.count(); ++i) { in onPush()
117 fStack[i]->visit(&res); in onPush()
118 fStack[i]->setCache(res.ctm(), res.snapCache()); in onPush()
129 fStack.setCount(fStack.count() - n); in onPop()
[all …]
/external/skqp/src/sksl/
DSkSLInterpreter.cpp49 StackIndex current = (StackIndex) fStack.size(); in run()
61 fStack.push_back(value); in push()
65 auto iter = fStack.end() - 1; in pop()
67 fStack.erase(iter); in pop()
72 int result = fStack.size(); in stackAlloc()
74 fStack.push_back(Value((int) 0xDEADBEEF)); in stackAlloc()
168 fStack[pos] = this->evaluate(*var->fInitialValue); in runStatement()
238 fPipeline.append(SkRasterPipeline::matrix_4x5, &fStack[transpose]); in appendStage()
310 Value result = fStack[left]; \ in evaluate()
321 fStack[left] = result; \ in evaluate()
[all …]
DSkSLInterpreter.h57 , fStack(*stack) {} in Interpreter()
84 std::vector<Value> &fStack; variable
/external/skia/tests/
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()
239 fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() }); in dfs()
254 for (int i = 0; i < fStack.count(); ++i) { in stackContains()
255 if (node == fStack[i].fNode.get()) { in stackContains()
269 while (!fStack.empty()) { in shift()
290 while (!fStack.empty() && node.get() == fStack.back().fDest) { in shift()
[all …]
/external/skqp/tests/
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()
239 fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() }); in dfs()
254 for (int i = 0; i < fStack.count(); ++i) { in stackContains()
255 if (node == fStack[i].fNode.get()) { in stackContains()
269 while (!fStack.empty()) { in shift()
290 while (!fStack.empty() && node.get() == fStack.back().fDest) { in shift()
[all …]
/external/icu/icu4c/source/i18n/
Drematch.cpp157 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()
2390 fStack->setMaxCapacity(0); in setStackLimit()
2399 fStack->setMaxCapacity(adjustedLimit); in setStackLimit()
2498 fStack->removeAllElements(); in resetStack()
2500 …REStackFrame *iFrame = (REStackFrame *)fStack->reserveBlock(fPattern->fFrameSize, fDeferredStatus); in resetStack()
2696 int64_t *newFP = fStack->reserveBlock(fFrameSize, status); in StateSave()
[all …]
Dregexcmp.h163 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable
/external/skqp/src/gpu/
DGrClipStackClip.cpp38 if (!fStack || fStack->isWideOpen()) { in quickContains()
41 return fStack->quickContains(rect); in quickContains()
45 if (!fStack || fStack->isWideOpen()) { in quickContains()
48 return fStack->quickContains(rrect); in quickContains()
52 if (!fStack) { in isRRect()
57 if (fStack->isRRect(*rtBounds, rr, &isAA)) { in isRRect()
66 if (!fStack) { in getConservativeBounds()
74 fStack->getConservativeBounds(0, 0, width, height, &devBounds, isIntersectionOfRects); in getConservativeBounds()
200 if (!fStack || fStack->isWideOpen()) { in apply()
218 GrReducedClip reducedClip(*fStack, devBounds, context->contextPriv().caps(), in apply()
[all …]
DGrClipStackClip.h25 void reset(const SkClipStack* stack) { fStack = stack; } in reset()
65 const SkClipStack* fStack; variable
/external/skia/src/gpu/
DGrClipStackClip.cpp38 if (!fStack || fStack->isWideOpen()) { in quickContains()
41 return fStack->quickContains(rect); in quickContains()
45 if (!fStack || fStack->isWideOpen()) { in quickContains()
48 return fStack->quickContains(rrect); in quickContains()
52 if (!fStack) { in isRRect()
57 if (fStack->isRRect(*rtBounds, rr, &isAA)) { in isRRect()
66 if (!fStack) { in getConservativeBounds()
74 fStack->getConservativeBounds(0, 0, width, height, &devBounds, isIntersectionOfRects); in getConservativeBounds()
203 if (!fStack || fStack->isWideOpen()) { in apply()
225 GrReducedClip reducedClip(*fStack, devBounds, context->priv().caps(), in apply()
[all …]
DGrClipStackClip.h25 void reset(const SkClipStack* stack) { fStack = stack; } in reset()
65 const SkClipStack* fStack; variable
/external/skia/modules/particles/include/
DSkParticleSerialization.h70 fStack.push_back(&fRoot); in SkFromJsonVisitor()
107 fStack.push_back((const skjson::ObjectValue*)get(name)); in enterObject()
110 fStack.pop_back(); in exitObject()
115 fStack.push_back(arrVal); in enterArray()
120 fStack.pop_back(); in exitArray()
127 if (const skjson::Value* cur = fStack.back()) { in get()
182 SkSTArray<16, const skjson::Value*, true> fStack; variable
/external/skqp/tools/bookmaker/
DparserCommon.cpp417 SkASSERT(fStack.back().fObject.isArray()); in baseDir()
418 SkASSERT(fStack.size() > 2); in baseDir()
420 for (unsigned index = 2; index < fStack.size(); ++index) { in baseDir()
421 dir += fStack[index].fName; in baseDir()
422 if (index < fStack.size() - 1) { in baseDir()
437 if (fStack.empty()) { in next()
440 status = &fStack.back(); in next()
444 fStack.pop_back(); in next()
446 if (1 == fStack.size()) { in next()
472 fStack.emplace_back(block); in next()
[all …]
DparserCommon.h266 bool empty() { return fStack.empty(); } in empty()
270 fStack.clear(); in reset()
274 vector<JsonStatus> fStack; variable
DfiddleParser.cpp23 if (fStack.empty()) { in parseFiddles()
26 JsonStatus* status = &fStack.back(); in parseFiddles()
/external/skia/src/sksl/
DSkSLInterpreter.h360 , fStack(stack) in Context()
367 Vector* fStack; member
638 SkASSERT(context.fStack + address >= fMemory && \
639 context.fStack + address <= fMemory + MEMORY_SIZE)
960 return context.fCallStack.empty() ? context.fStack in innerRun()
1050 context.fStack -= stackSlotCount; in innerRun()
1051 memcpy(context.fStack, &fRegisters[args.fIndex], in innerRun()
1226 context.fStack[fRegisters[src.fIndex].fInt[i]].fInt[i]; in innerRun()
1240 context.fStack[fRegisters[src.fIndex].fInt[i] + j].fInt[i]; in innerRun()
1250 fRegisters[target.fIndex].fInt = context.fStack[src.fAddress].fInt; in innerRun()
[all …]
/external/icu/icu4c/source/common/
Drbbiscan.h117 uint16_t fStack[kStackSize]; // State stack, holds state pushes variable

12