| /third_party/flutter/skia/gm/ |
| D | animatedimageblurs.cpp | 45 fNodes[i].init(&fRand); in onOnceBeforeDraw()
55 layerPaint.setImageFilter(SkImageFilters::Blur(fNodes[i].sigma(), fNodes[i].sigma(), in onDraw()
60 SkRect rect = SkRect::MakeLTRB(fNodes[i].pos().fX - fNodes[i].size()-0.5f, in onDraw()
61 fNodes[i].pos().fY - fNodes[i].size()-0.5f, in onDraw()
62 fNodes[i].pos().fX + fNodes[i].size()+0.5f, in onDraw()
63 fNodes[i].pos().fY + fNodes[i].size()+0.5f); in onDraw()
64 SkRRect rrect = SkRRect::MakeRectXY(rect, fNodes[i].size(), fNodes[i].size()); in onDraw()
73 fNodes[i].update(nanos, fLastTime); in onAnimate()
137 Node fNodes[kNumNodes]; member in AnimatedImageBlurs
|
| /third_party/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
|
| /third_party/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 …]
|
| /third_party/flutter/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 …]
|
| /third_party/flutter/skia/src/sksl/ |
| D | SkSLCFGGenerator.cpp | 70 for (size_t j = 0; j < fBlocks[i].fNodes.size(); j++) { in dump()
71 BasicBlock::Node& n = fBlocks[i].fNodes[j]; in dump()
96 if ((*iter) == fNodes.begin()) { in tryRemoveExpressionBefore()
105 SkASSERT(*iter != fNodes.end()); in tryRemoveExpressionBefore()
111 if ((*iter) == fNodes.begin()) { in tryRemoveExpressionBefore()
120 SkASSERT(*iter != fNodes.end()); in tryRemoveExpressionBefore()
172 *iter = fNodes.erase(*iter); in tryRemoveExpression()
184 *iter = fNodes.erase(*iter); in tryRemoveExpression()
192 *iter = fNodes.erase(*iter); in tryRemoveExpression()
203 *iter = fNodes.erase(*iter); in tryRemoveExpression()
[all …]
|
| D | SkSLASTNode.h | 166 return (*fNodes)[fID.fValue];
171 return &(*fNodes)[fID.fValue];
176 : fNodes(nodes) in iterator()
179 std::vector<ASTNode>* fNodes; member
364 : fNodes(nodes) in ASTNode()
426 : fNodes(nodes) in ASTNode()
432 : fNodes(nodes) in ASTNode()
438 : fNodes(nodes) in ASTNode()
444 : fNodes(nodes) in ASTNode()
450 : fNodes(nodes) in ASTNode()
[all …]
|
| D | SkSLASTFile.h | 20 return fNodes[fRoot.fValue]; in root()
24 std::vector<ASTNode> fNodes;
|
| D | SkSLCompiler.cpp | 402 for (const BasicBlock::Node& n : block.fNodes) { in scanCFG()
442 for (const auto& node : block.fNodes) { in compute_start_state()
585 if (*iter == b->fNodes.begin()) { in delete_left()
595 *iter = b->fNodes.erase(*iter); in delete_left()
618 if (*iter == b->fNodes.begin()) { in delete_right()
628 *iter = b->fNodes.erase(*iter); in delete_right()
1150 cfg.fBlocks[i].fNodes.size()) { in scanCFG()
1152 switch (cfg.fBlocks[i].fNodes[0].fKind) { in scanCFG()
1154 offset = (*cfg.fBlocks[i].fNodes[0].statement())->fOffset; in scanCFG()
1157 offset = (*cfg.fBlocks[i].fNodes[0].expression())->fOffset; in scanCFG()
[all …]
|
| D | SkSLParser.h | 151 SkASSERT(id.fValue >= 0 && id.fValue < (int) fFile->fNodes.size()); in getNode()
152 return fFile->fNodes[id.fValue]; in getNode()
|
| D | SkSLParser.cpp | 113 ASTNode::ID result(fFile->fNodes.size()); \
114 fFile->fNodes.emplace_back(&fFile->fNodes, __VA_ARGS__)
124 fFile->fNodes[target.fValue].addChild(child)
128 ASTNode::ID child(fFile->fNodes.size()); \
129 fFile->fNodes.emplace_back(); \
130 fFile->fNodes[target.fValue].addChild(child); \
575 currentVar = ASTNode::ID(fFile->fNodes.size()); in varDeclarationEnd()
577 fFile->fNodes.emplace_back(&fFile->fNodes, -1, ASTNode::Kind::kVarDeclaration); in varDeclarationEnd()
|
| D | SkSLCFGGenerator.h | 113 std::vector<Node> fNodes; member
|
| D | SkSLIRGenerator.cpp | 653 ASTNode endPrimitiveID(&fFile->fNodes, -1, ASTNode::Kind::kIdentifier, "EndPrimitive"); in applyInvocationIDWorkaround()
1037 ASTNode enumType(e.fNodes, e.fOffset, ASTNode::Kind::kType, in convertEnum()
1266 ctor = this->convertIdentifier(ASTNode(&fFile->fNodes, -1, ASTNode::Kind::kIdentifier, in coerce()
1269 ctor = this->convertIdentifier(ASTNode(&fFile->fNodes, -1, ASTNode::Kind::kIdentifier, in coerce()
1272 ctor = this->convertIdentifier(ASTNode(&fFile->fNodes, -1, ASTNode::Kind::kIdentifier, in coerce()
2256 result = convertIdentifier(ASTNode(&fFile->fNodes, offset, ASTNode::Kind::kIdentifier, in convertTypeField()
|
| /third_party/flutter/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 | 40 fNodes.setReserve(1); in insert()
47 fNodes.setReserve(CountNodes(fCount)); in insert()
54 SkDEBUGCODE(Node* p = fNodes.begin()); in allocateNodeAtLevel()
55 Node* out = fNodes.push(); in allocateNodeAtLevel()
56 SkASSERT(fNodes.begin() == p); // If this fails, we didn't setReserve() enough. in allocateNodeAtLevel()
175 byteCount += fNodes.reserved() * sizeof(Node); in bytesUsed()
|
| D | SkRTree.h | 84 SkTDArray<Node> fNodes; variable
|
| /third_party/skia/src/core/ |
| 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
|
| /third_party/skia/third_party/externals/icu/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
|
| /third_party/node/deps/icu-small/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
|
| /third_party/flutter/skia/third_party/externals/icu/source/i18n/ |
| D | tznames_impl.cpp | 175 : 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 …]
|
| D | tznames_impl.h | 146 CharacterNode *fNodes; variable
|
| /third_party/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
|