| /external/skia/gm/ |
| D | animatedimageblurs.cpp | 46 fNodes[i].init(&fRand); in onOnceBeforeDraw()
56 layerPaint.setImageFilter(SkImageFilters::Blur(fNodes[i].sigma(), fNodes[i].sigma(), in onDraw()
61 SkRect rect = SkRect::MakeLTRB(fNodes[i].pos().fX - fNodes[i].size()-0.5f, in onDraw()
62 fNodes[i].pos().fY - fNodes[i].size()-0.5f, in onDraw()
63 fNodes[i].pos().fX + fNodes[i].size()+0.5f, in onDraw()
64 fNodes[i].pos().fY + fNodes[i].size()+0.5f); in onDraw()
65 SkRRect rrect = SkRRect::MakeRectXY(rect, fNodes[i].size(), fNodes[i].size()); in onDraw()
74 fNodes[i].update(nanos, fLastTime); in onAnimate()
138 Node fNodes[kNumNodes]; member in AnimatedImageBlurs
|
| /external/skqp/gm/ |
| D | animatedimageblurs.cpp | 36 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/ |
| D | IncrTopoSortTest.cpp | 88 : 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/ |
| D | IncrTopoSortTest.cpp | 88 : 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/ |
| D | SkSLCFGGenerator.cpp | 69 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 …]
|
| D | SkSLCompiler.cpp | 389 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 …]
|
| D | SkSLCFGGenerator.h | 113 std::vector<Node> fNodes; member
|
| /external/skia/src/sksl/ |
| D | SkSLASTNode.h | 165 return (*fNodes)[fID.fValue];
170 return &(*fNodes)[fID.fValue];
175 : fNodes(nodes) in iterator()
178 std::vector<ASTNode>* fNodes; member
346 : fNodes(nodes) in ASTNode()
407 : fNodes(nodes) in ASTNode()
413 : fNodes(nodes) in ASTNode()
419 : fNodes(nodes) in ASTNode()
425 : fNodes(nodes) in ASTNode()
431 : fNodes(nodes) in ASTNode()
[all …]
|
| D | SkSLASTFile.h | 20 return fNodes[fRoot.fValue]; in root()
24 std::vector<ASTNode> fNodes;
|
| D | SkSLParser.h | 146 SkASSERT(id.fValue >= 0 && id.fValue < (int) fFile->fNodes.size()); in getNode()
147 return fFile->fNodes[id.fValue]; in getNode()
283 fASTCheckpoint = fParser->fFile->fNodes.size(); in Checkpoint()
290 fParser->fFile->fNodes.resize(fASTCheckpoint); in rewind()
|
| D | SkSLParser.cpp | 138 ASTNode::ID result(fFile->fNodes.size()); in createNode()
139 fFile->fNodes.emplace_back(&fFile->fNodes, std::forward<Args>(args)...); in createNode()
144 fFile->fNodes[target.fValue].addChild(child); in addChild()
149 ASTNode::ID child(fFile->fNodes.size()); in createEmptyChild()
150 fFile->fNodes.emplace_back(); in createEmptyChild()
151 fFile->fNodes[target.fValue].addChild(child); in createEmptyChild()
157 fFile->fNodes.reserve(fText.size() / 10); // a typical program is approx 10:1 for chars:nodes in compilationUnit()
711 currentVar = ASTNode::ID(fFile->fNodes.size()); in varDeclarationEnd()
713 fFile->fNodes.emplace_back(&fFile->fNodes, offset, ASTNode::Kind::kVarDeclaration); in varDeclarationEnd()
|
| D | SkSLIRGenerator.cpp | 703 ASTNode endPrimitiveID(&fFile->fNodes, -1, ASTNode::Kind::kIdentifier, "EndPrimitive"); in applyInvocationIDWorkaround()
1183 ASTNode enumType(e.fNodes, e.fOffset, ASTNode::Kind::kType, e.getString()); in convertEnum()
1690 convertIdentifier(ASTNode(&fFile->fNodes, offset, ASTNode::Kind::kIdentifier, field)); in convertTypeField()
|
| /external/skqp/src/core/ |
| D | SkTLList.h | 59 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 …]
|
| D | SkRTree.cpp | 41 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()
|
| D | SkRTree.h | 92 SkTDArray<Node> fNodes; variable
|
| /external/skia/src/core/ |
| D | SkTLList.h | 59 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 …]
|
| D | SkRTree.cpp | 33 fNodes.reserve(1); in insert()
40 fNodes.reserve(CountNodes(fCount)); in insert()
47 SkDEBUGCODE(Node* p = fNodes.data()); in allocateNodeAtLevel()
48 fNodes.push_back(Node{}); in allocateNodeAtLevel()
49 Node& out = fNodes.back(); in allocateNodeAtLevel()
50 SkASSERT(fNodes.data() == p); // If this fails, we didn't reserve() enough. in allocateNodeAtLevel()
169 byteCount += fNodes.capacity() * sizeof(Node); in bytesUsed()
|
| D | SkRTree.h | 79 std::vector<Node> fNodes; variable
|
| /external/icu/icu4c/source/i18n/ |
| D | tznames_impl.cpp | 177 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0), in TextTrieMap()
184 fNodes[index].deleteValues(fValueDeleter); in ~TextTrieMap()
186 uprv_free(fNodes); in ~TextTrieMap()
249 if (fNodes == NULL) { in putImpl()
251 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode)); in putImpl()
252 if (fNodes == NULL) { in putImpl()
256 fNodes[0].clear(); // Init root node. in putImpl()
273 CharacterNode *node = fNodes; in putImpl()
294 uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode)); in growNodes()
295 uprv_free(fNodes); in growNodes()
[all …]
|
| D | tznames_impl.h | 146 CharacterNode *fNodes; variable
|
| /external/icu/libicu/cts_headers/ |
| D | tznames_impl.h | 146 CharacterNode *fNodes; variable
|