HomeSort by relevance Sort by last modified time
    Searched refs:fNodes (Results 1 - 18 of 18) sorted by null

  /external/skia/gm/
animatedimageblurs.cpp 36 fNodes[i].init(&fRand);
46 layerPaint.setImageFilter(SkBlurImageFilter::Make(fNodes[i].sigma(),
47 fNodes[i].sigma(),
52 SkRect rect = SkRect::MakeLTRB(fNodes[i].pos().fX - fNodes[i].size()-0.5f,
53 fNodes[i].pos().fY - fNodes[i].size()-0.5f,
54 fNodes[i].pos().fX + fNodes[i].size()+0.5f,
55 fNodes[i].pos().fY + fNodes[i].size()+0.5f)
    [all...]
  /external/skqp/gm/
animatedimageblurs.cpp 36 fNodes[i].init(&fRand);
46 layerPaint.setImageFilter(SkBlurImageFilter::Make(fNodes[i].sigma(),
47 fNodes[i].sigma(),
52 SkRect rect = SkRect::MakeLTRB(fNodes[i].pos().fX - fNodes[i].size()-0.5f,
53 fNodes[i].pos().fY - fNodes[i].size()-0.5f,
54 fNodes[i].pos().fX + fNodes[i].size()+0.5f,
55 fNodes[i].pos().fY + fNodes[i].size()+0.5f)
    [all...]
  /external/skia/tests/
IncrTopoSortTest.cpp 88 : fNodes(numNodesToReserve)
96 fNodes.push_back(tmp); // The graph gets the creation ref
97 tmp->setIndexInSort(fNodes.count()-1);
119 // invalid nodes from 'fNodes' and shifting valid nodes left to fill in the gaps. In this
122 // they are reintroduced to the 'fNodes' array but now in the appropriate position. The
152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region
174 for (int i = 0; i < fNodes.count(); ++i) {
175 (*actual) += fNodes[i]->id();
176 if (i < fNodes.count()-1) {
185 for (int i = 0; i < fNodes.count(); ++i)
    [all...]
  /external/skqp/tests/
IncrTopoSortTest.cpp 88 : fNodes(numNodesToReserve)
96 fNodes.push_back(tmp); // The graph gets the creation ref
97 tmp->setIndexInSort(fNodes.count()-1);
119 // invalid nodes from 'fNodes' and shifting valid nodes left to fill in the gaps. In this
122 // they are reintroduced to the 'fNodes' array but now in the appropriate position. The
152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region
174 for (int i = 0; i < fNodes.count(); ++i) {
175 (*actual) += fNodes[i]->id();
176 if (i < fNodes.count()-1) {
185 for (int i = 0; i < fNodes.count(); ++i)
    [all...]
  /external/skia/src/core/
SkTLList.h 59 block->fNodes[i].~Node();
223 Node fNodes[N];
230 fFreeList.addToHead(fFirstBlock.fNodes + i);
231 fFirstBlock.fNodes[i].fBlock = &fFirstBlock;
250 node = &block->fNodes[0];
255 new (block->fNodes + i) Node;
256 fFreeList.addToHead(block->fNodes + i);
257 block->fNodes[i].fBlock = block;
272 if (block->fNodes + i != node) {
273 fFreeList.remove(block->fNodes + i)
    [all...]
SkRTree.h 92 SkTDArray<Node> fNodes;
SkRTree.cpp 41 fNodes.setReserve(1);
48 fNodes.setReserve(CountNodes(fCount, fAspectRatio));
55 SkDEBUGCODE(Node* p = fNodes.begin());
56 Node* out = fNodes.push();
57 SkASSERT(fNodes.begin() == p); // If this fails, we didn't setReserve() enough.
186 byteCount += fNodes.reserved() * sizeof(Node);
  /external/skqp/src/core/
SkTLList.h 59 block->fNodes[i].~Node();
223 Node fNodes[N];
230 fFreeList.addToHead(fFirstBlock.fNodes + i);
231 fFirstBlock.fNodes[i].fBlock = &fFirstBlock;
250 node = &block->fNodes[0];
255 new (block->fNodes + i) Node;
256 fFreeList.addToHead(block->fNodes + i);
257 block->fNodes[i].fBlock = block;
272 if (block->fNodes + i != node) {
273 fFreeList.remove(block->fNodes + i)
    [all...]
SkRTree.h 92 SkTDArray<Node> fNodes;
SkRTree.cpp 41 fNodes.setReserve(1);
48 fNodes.setReserve(CountNodes(fCount, fAspectRatio));
55 SkDEBUGCODE(Node* p = fNodes.begin());
56 Node* out = fNodes.push();
57 SkASSERT(fNodes.begin() == p); // If this fails, we didn't setReserve() enough.
186 byteCount += fNodes.reserved() * sizeof(Node);
  /external/skia/src/sksl/
SkSLCFGGenerator.cpp 69 for (size_t j = 0; j < fBlocks[i].fNodes.size(); j++) {
70 BasicBlock::Node& n = fBlocks[i].fNodes[j];
95 if ((*iter) == fNodes.begin()) {
104 SkASSERT(*iter != fNodes.end());
110 if ((*iter) == fNodes.begin()) {
119 SkASSERT(*iter != fNodes.end());
170 *iter = fNodes.erase(*iter);
182 *iter = fNodes.erase(*iter);
190 *iter = fNodes.erase(*iter);
201 *iter = fNodes.erase(*iter)
    [all...]
SkSLCFGGenerator.h 113 std::vector<Node> fNodes;
SkSLCompiler.cpp 389 for (const BasicBlock::Node& n : block.fNodes) {
429 for (const auto& node : block.fNodes) {
564 if (*iter == b->fNodes.begin()) {
574 *iter = b->fNodes.erase(*iter);
597 if (*iter == b->fNodes.begin()) {
607 *iter = b->fNodes.erase(*iter);
    [all...]
  /external/skqp/src/sksl/
SkSLCFGGenerator.cpp 69 for (size_t j = 0; j < fBlocks[i].fNodes.size(); j++) {
70 BasicBlock::Node& n = fBlocks[i].fNodes[j];
95 if ((*iter) == fNodes.begin()) {
104 SkASSERT(*iter != fNodes.end());
110 if ((*iter) == fNodes.begin()) {
119 SkASSERT(*iter != fNodes.end());
170 *iter = fNodes.erase(*iter);
182 *iter = fNodes.erase(*iter);
190 *iter = fNodes.erase(*iter);
201 *iter = fNodes.erase(*iter)
    [all...]
SkSLCFGGenerator.h 113 std::vector<Node> fNodes;
SkSLCompiler.cpp 389 for (const BasicBlock::Node& n : block.fNodes) {
429 for (const auto& node : block.fNodes) {
564 if (*iter == b->fNodes.begin()) {
574 *iter = b->fNodes.erase(*iter);
597 if (*iter == b->fNodes.begin()) {
607 *iter = b->fNodes.erase(*iter);
    [all...]
  /external/icu/icu4c/source/i18n/
tznames_impl.cpp 175 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0),
182 fNodes[index].deleteValues(fValueDeleter);
184 uprv_free(fNodes);
197 // Trie is built, while fNodes and fLazyContents change with the lazy init
247 if (fNodes == NULL) {
249 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode));
250 if (fNodes == NULL) {
254 fNodes[0].clear(); // Init root node.
271 CharacterNode *node = fNodes;
292 uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode))
    [all...]
tznames_impl.h 146 CharacterNode *fNodes;

Completed in 5116 milliseconds