Home
last modified time | relevance | path

Searched refs:fNodes (Results 1 – 18 of 18) sorted by relevance

/external/skqp/gm/
Danimatedimageblurs.cpp36 fNodes[i].init(&fRand); in onOnceBeforeDraw()
46 layerPaint.setImageFilter(SkBlurImageFilter::Make(fNodes[i].sigma(), in onDraw()
47 fNodes[i].sigma(), in onDraw()
52 SkRect rect = SkRect::MakeLTRB(fNodes[i].pos().fX - fNodes[i].size()-0.5f, in onDraw()
53 fNodes[i].pos().fY - fNodes[i].size()-0.5f, in onDraw()
54 fNodes[i].pos().fX + fNodes[i].size()+0.5f, in onDraw()
55 fNodes[i].pos().fY + fNodes[i].size()+0.5f); in onDraw()
56 SkRRect rrect = SkRRect::MakeRectXY(rect, fNodes[i].size(), fNodes[i].size()); in onDraw()
65 fNodes[i].update(timer, fLastTime); in onAnimate()
130 Node fNodes[kNumNodes]; member in AnimatedImageBlurs
/external/skia/gm/
Danimatedimageblurs.cpp36 fNodes[i].init(&fRand); in onOnceBeforeDraw()
46 layerPaint.setImageFilter(SkBlurImageFilter::Make(fNodes[i].sigma(), in onDraw()
47 fNodes[i].sigma(), in onDraw()
52 SkRect rect = SkRect::MakeLTRB(fNodes[i].pos().fX - fNodes[i].size()-0.5f, in onDraw()
53 fNodes[i].pos().fY - fNodes[i].size()-0.5f, in onDraw()
54 fNodes[i].pos().fX + fNodes[i].size()+0.5f, in onDraw()
55 fNodes[i].pos().fY + fNodes[i].size()+0.5f); in onDraw()
56 SkRRect rrect = SkRRect::MakeRectXY(rect, fNodes[i].size(), fNodes[i].size()); in onDraw()
65 fNodes[i].update(timer, fLastTime); in onAnimate()
130 Node fNodes[kNumNodes]; member in AnimatedImageBlurs
/external/skqp/tests/
DIncrTopoSortTest.cpp88 : fNodes(numNodesToReserve) in Graph()
96 fNodes.push_back(tmp); // The graph gets the creation ref in addNode()
97 tmp->setIndexInSort(fNodes.count()-1); in addNode()
152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region in addEdges()
174 for (int i = 0; i < fNodes.count(); ++i) { in getActual()
175 (*actual) += fNodes[i]->id(); in getActual()
176 if (i < fNodes.count()-1) { in getActual()
185 for (int i = 0; i < fNodes.count(); ++i) { in print()
186 if (fNodes[i]) { in print()
187 SkDebugf("%c ", fNodes[i]->id()); in print()
[all …]
/external/skia/tests/
DIncrTopoSortTest.cpp88 : fNodes(numNodesToReserve) in Graph()
96 fNodes.push_back(tmp); // The graph gets the creation ref in addNode()
97 tmp->setIndexInSort(fNodes.count()-1); in addNode()
152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region in addEdges()
174 for (int i = 0; i < fNodes.count(); ++i) { in getActual()
175 (*actual) += fNodes[i]->id(); in getActual()
176 if (i < fNodes.count()-1) { in getActual()
185 for (int i = 0; i < fNodes.count(); ++i) { in print()
186 if (fNodes[i]) { in print()
187 SkDebugf("%c ", fNodes[i]->id()); in print()
[all …]
/external/skqp/src/sksl/
DSkSLCFGGenerator.cpp69 for (size_t j = 0; j < fBlocks[i].fNodes.size(); j++) { in dump()
70 BasicBlock::Node& n = fBlocks[i].fNodes[j]; in dump()
95 if ((*iter) == fNodes.begin()) { in tryRemoveExpressionBefore()
104 SkASSERT(*iter != fNodes.end()); in tryRemoveExpressionBefore()
110 if ((*iter) == fNodes.begin()) { in tryRemoveExpressionBefore()
119 SkASSERT(*iter != fNodes.end()); in tryRemoveExpressionBefore()
170 *iter = fNodes.erase(*iter); in tryRemoveExpression()
182 *iter = fNodes.erase(*iter); in tryRemoveExpression()
190 *iter = fNodes.erase(*iter); in tryRemoveExpression()
201 *iter = fNodes.erase(*iter); in tryRemoveExpression()
[all …]
DSkSLCompiler.cpp389 for (const BasicBlock::Node& n : block.fNodes) { in scanCFG()
429 for (const auto& node : block.fNodes) { in compute_start_state()
564 if (*iter == b->fNodes.begin()) { in delete_left()
574 *iter = b->fNodes.erase(*iter); in delete_left()
597 if (*iter == b->fNodes.begin()) { in delete_right()
607 *iter = b->fNodes.erase(*iter); in delete_right()
1129 cfg.fBlocks[i].fNodes.size()) { in scanCFG()
1131 switch (cfg.fBlocks[i].fNodes[0].fKind) { in scanCFG()
1133 offset = (*cfg.fBlocks[i].fNodes[0].statement())->fOffset; in scanCFG()
1136 offset = (*cfg.fBlocks[i].fNodes[0].expression())->fOffset; in scanCFG()
[all …]
DSkSLCFGGenerator.h113 std::vector<Node> fNodes; member
/external/skia/src/sksl/
DSkSLCFGGenerator.cpp69 for (size_t j = 0; j < fBlocks[i].fNodes.size(); j++) { in dump()
70 BasicBlock::Node& n = fBlocks[i].fNodes[j]; in dump()
95 if ((*iter) == fNodes.begin()) { in tryRemoveExpressionBefore()
104 SkASSERT(*iter != fNodes.end()); in tryRemoveExpressionBefore()
110 if ((*iter) == fNodes.begin()) { in tryRemoveExpressionBefore()
119 SkASSERT(*iter != fNodes.end()); in tryRemoveExpressionBefore()
170 *iter = fNodes.erase(*iter); in tryRemoveExpression()
182 *iter = fNodes.erase(*iter); in tryRemoveExpression()
190 *iter = fNodes.erase(*iter); in tryRemoveExpression()
201 *iter = fNodes.erase(*iter); in tryRemoveExpression()
[all …]
DSkSLCompiler.cpp389 for (const BasicBlock::Node& n : block.fNodes) { in scanCFG()
429 for (const auto& node : block.fNodes) { in compute_start_state()
564 if (*iter == b->fNodes.begin()) { in delete_left()
574 *iter = b->fNodes.erase(*iter); in delete_left()
597 if (*iter == b->fNodes.begin()) { in delete_right()
607 *iter = b->fNodes.erase(*iter); in delete_right()
1129 cfg.fBlocks[i].fNodes.size()) { in scanCFG()
1131 switch (cfg.fBlocks[i].fNodes[0].fKind) { in scanCFG()
1133 offset = (*cfg.fBlocks[i].fNodes[0].statement())->fOffset; in scanCFG()
1136 offset = (*cfg.fBlocks[i].fNodes[0].expression())->fOffset; in scanCFG()
[all …]
DSkSLCFGGenerator.h113 std::vector<Node> fNodes; member
/external/skqp/src/core/
DSkTLList.h59 block->fNodes[i].~Node(); in ~SkTLList()
223 Node fNodes[N]; member
230 fFreeList.addToHead(fFirstBlock.fNodes + i); in delayedInit()
231 fFirstBlock.fNodes[i].fBlock = &fFirstBlock; in delayedInit()
250 node = &block->fNodes[0]; in createNode()
255 new (block->fNodes + i) Node; in createNode()
256 fFreeList.addToHead(block->fNodes + i); in createNode()
257 block->fNodes[i].fBlock = block; in createNode()
272 if (block->fNodes + i != node) { in removeNode()
273 fFreeList.remove(block->fNodes + i); in removeNode()
[all …]
DSkRTree.cpp41 fNodes.setReserve(1); in insert()
48 fNodes.setReserve(CountNodes(fCount, fAspectRatio)); in insert()
55 SkDEBUGCODE(Node* p = fNodes.begin()); in allocateNodeAtLevel()
56 Node* out = fNodes.push(); in allocateNodeAtLevel()
57 SkASSERT(fNodes.begin() == p); // If this fails, we didn't setReserve() enough. in allocateNodeAtLevel()
186 byteCount += fNodes.reserved() * sizeof(Node); in bytesUsed()
DSkRTree.h92 SkTDArray<Node> fNodes; variable
/external/skia/src/core/
DSkTLList.h59 block->fNodes[i].~Node(); in ~SkTLList()
223 Node fNodes[N]; member
230 fFreeList.addToHead(fFirstBlock.fNodes + i); in delayedInit()
231 fFirstBlock.fNodes[i].fBlock = &fFirstBlock; in delayedInit()
250 node = &block->fNodes[0]; in createNode()
255 new (block->fNodes + i) Node; in createNode()
256 fFreeList.addToHead(block->fNodes + i); in createNode()
257 block->fNodes[i].fBlock = block; in createNode()
272 if (block->fNodes + i != node) { in removeNode()
273 fFreeList.remove(block->fNodes + i); in removeNode()
[all …]
DSkRTree.cpp41 fNodes.setReserve(1); in insert()
48 fNodes.setReserve(CountNodes(fCount, fAspectRatio)); in insert()
55 SkDEBUGCODE(Node* p = fNodes.begin()); in allocateNodeAtLevel()
56 Node* out = fNodes.push(); in allocateNodeAtLevel()
57 SkASSERT(fNodes.begin() == p); // If this fails, we didn't setReserve() enough. in allocateNodeAtLevel()
186 byteCount += fNodes.reserved() * sizeof(Node); in bytesUsed()
DSkRTree.h92 SkTDArray<Node> fNodes; variable
/external/icu/icu4c/source/i18n/
Dtznames_impl.cpp175 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0), in TextTrieMap()
182 fNodes[index].deleteValues(fValueDeleter); in ~TextTrieMap()
184 uprv_free(fNodes); in ~TextTrieMap()
247 if (fNodes == NULL) { in putImpl()
249 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode)); in putImpl()
250 if (fNodes == NULL) { in putImpl()
254 fNodes[0].clear(); // Init root node. in putImpl()
271 CharacterNode *node = fNodes; in putImpl()
292 uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode)); in growNodes()
293 uprv_free(fNodes); in growNodes()
[all …]
Dtznames_impl.h146 CharacterNode *fNodes; variable