| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/ |
| H A D | PruneNoOps.cpp | 26 bool IsNoOp(TIntermNode *node) in IsNoOp() argument
69 bool PruneNoOpsTraverser::visitDeclaration(Visit visit, TIntermDeclaration *node) in visitDeclaration() argument
137 visitBlock(Visit visit, TIntermBlock *node) visitBlock() argument
199 visitBranch(Visit visit, TIntermBranch *node) visitBranch() argument
[all...] |
| H A D | RewriteTexelFetchOffset.cpp | 72 bool Traverser::visitAggregate(Visit visit, TIntermAggregate *node) in visitAggregate() argument
[all...] |
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/d3d/ |
| H A D | SeparateExpressionsReturningArrays.cpp | 53 TIntermBinary *CopyAssignmentNode(TIntermBinary *node) in CopyAssignmentNode() argument
58 visitBinary(Visit visit, TIntermBinary *node) visitBinary() argument
87 visitAggregate(Visit visit, TIntermAggregate *node) visitAggregate() argument
[all...] |
| H A D | RewriteElseBlocks.cpp | 43 bool ElseBlockRewriter::visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) in visitFunctionDefinition() argument
50 bool ElseBlockRewriter::visitBlock(Visit visit, TIntermBlock *node) in visitBlock() argument
115 bool RewriteElseBlocks(TCompiler *compiler, TIntermNode *node, TSymbolTable *symbolTable) in RewriteElseBlocks() argument
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| H A D | NodeType.h | 47 NodeType operator()(TIntermNode &node) in operator ()() argument
|
| /third_party/skia/src/core/ |
| H A D | SkLRUCache.h | 37 Entry* node = fLRU.head(); in ~SkLRUCache() local
|
| H A D | SkArenaAllocList.h | 42 explicit Iter(Node* node) : fCurr(node) {} in Iter() argument
|
| H A D | SkRTree.cpp | 154 void SkRTree::search(Node* node, const SkRect& query, std::vector<int>* results) const { in search() argument
|
| /third_party/skia/third_party/externals/swiftshader/src/OpenGL/compiler/ |
| H A D | ValidateSwitch.cpp | 95 bool ValidateSwitch::visitCase(Visit, TIntermCase *node) in visitCase() argument
|
| H A D | intermOut.cpp | 68 void OutputTreeText(TInfoSinkBase& sink, TIntermNode* node, const int depth) in OutputTreeText() argument
87 void TOutputTraverser::visitSymbol(TIntermSymbol* node) in visitSymbol() argument
95 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary* node) in visitBinary() argument
159 visitUnary(Visit visit, TIntermUnary* node) visitUnary() argument
245 visitAggregate(Visit visit, TIntermAggregate* node) visitAggregate() argument
337 visitSelection(Visit visit, TIntermSelection* node) visitSelection() argument
370 visitConstantUnion(TIntermConstantUnion* node) visitConstantUnion() argument
407 visitLoop(Visit visit, TIntermLoop* node) visitLoop() argument
445 visitBranch(Visit visit, TIntermBranch* node) visitBranch() argument
[all...] |
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| H A D | unify_const_pass.cpp | 46 auto* node = root_.get(); in LookupEquivalentResultFor() local
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| H A D | unify_const_pass.cpp | 46 auto* node = root_.get(); in LookupEquivalentResultFor() local
[all...] |
| /third_party/skia/third_party/externals/icu/source/tools/genrb/ |
| H A D | filterrb.cpp | 98 const Tree* node = &fRoot; in match() local
[all...] |
| /third_party/skia/tests/ |
| H A D | DebugLayerManagerTest.cpp | 39 int node = 2; in test_basic() local
|
| /third_party/skia/src/xml/ |
| H A D | SkDOM.h | 88 bool findScalar(const Node* node, const char name[], SkScalar value[]) const { in findScalar() argument
|
| H A D | SkDOMParser.cpp | 28 SkDOM::Node* node = fAlloc->make<SkDOM::Node>(); in flushAttributes() local
[all...] |
| /third_party/skia/src/sksl/lex/ |
| H A D | Main.cpp | 208 RegexNode node = RegexNode(RegexNode::kChar_Kind, pattern[1]); in process() local
|
| /third_party/skia/third_party/externals/angle2/src/tests/test_utils/ |
| H A D | ShaderCompileTreeTest.cpp | 168 IsZero(TIntermNode *node) IsZero() argument
[all...] |
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| H A D | LinkedListTests.cpp | 279 MultipleInheritanceNode node; in TEST() local
[all...] |
| /third_party/skia/third_party/externals/freetype/src/cache/ |
| H A D | ftcmru.c | 206 FTC_MruNode first, node; FT_LOCAL_DEF() local
240 FTC_MruNode node = NULL; FT_LOCAL_DEF() local
294 FTC_MruNode node; FT_LOCAL_DEF() local
330 FTC_MruNode first, node, next; FTC_MruList_RemoveSelection() local
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/marl/src/ |
| H A D | dag_test.cpp | 119 auto node = root.then([](Data& data) { data.push("N"); }); in TEST_P() local
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| H A D | rbbinode.cpp | 288 static int32_t serial(const RBBINode *node) { in serial() argument
293 printNode(const RBBINode *node) printNode() argument
347 printTree(const RBBINode *node, UBool printHeading) printTree() argument
[all...] |
| H A D | ucharstrie.cpp | 37 int32_t node; in current() local
85 int32_t node=*pos; in branchNext() local
115 int32_t node=*pos; branchNext() local
125 int32_t node=*pos++; nextImpl() local
166 int32_t node; next() local
198 int32_t node; next() local
218 int32_t node; next() local
236 int32_t node=*pos++; next() local
299 int32_t node=*pos++; findUniqueValueFromBranch() local
325 int32_t node=*pos++; findUniqueValue() local
376 int32_t node=*pos++; getNextUChars() local
[all...] |
| /third_party/toybox/lib/ |
| H A D | dirtree.c | 79 char *dirtree_path(struct dirtree *node, int *plen) in dirtree_path() argument
99 int dirtree_parentfd(struct dirtree *node) in dirtree_parentfd() argument
109 dirtree_handle_callback(struct dirtree *new, int (*callback)(struct dirtree *node)) dirtree_handle_callback() argument
134 dirtree_recurse(struct dirtree *node, int (*callback)(struct dirtree *node), int dirfd, int flags) dirtree_recurse() argument
189 dirtree_flagread(char *path, int flags, int (*callback)(struct dirtree *node)) dirtree_flagread() argument
196 dirtree_read(char *path, int (*callback)(struct dirtree *node)) dirtree_read() argument
[all...] |
| H A D | llist.c | 10 void llist_free_arg(void *node) in llist_free_arg() argument
18 void llist_free_double(void *node) in llist_free_double() argument
27 void llist_traverse(void *list, void (*using)(void *node)) in llist_traverse() argument
|