| /third_party/typescript/src/compiler/factory/ |
| D | nodeFactory.ts | 13 // Do not set an `original` pointer when updating a node. enumerator
549 const node = createBaseNode(kind); constant
570 const node = createBaseDeclaration( constant
608 const node = createBaseNamedDeclaration( constant
629 const node = createBaseGenericNamedDeclaration( constant
661 const node = createBaseSignatureDeclaration( constant
691 const node = createBaseGenericNamedDeclaration( constant
712 const node = createBaseInterfaceOrClassLikeDeclaration( constant
732 const node = createBaseNamedDeclaration( constant
751 const node = createBaseBindingLikeDeclaration( constant
[all …]
|
| /third_party/cef/tools/yapf/yapf/yapflib/ |
| D | subtype_assigner.py | 63 def Visit_dictsetmaker(self, node): # pylint: disable=invalid-name argument
106 def Visit_expr_stmt(self, node): # pylint: disable=invalid-name argument
114 def Visit_or_test(self, node): # pylint: disable=invalid-name argument
121 def Visit_and_test(self, node): # pylint: disable=invalid-name argument
128 def Visit_not_test(self, node): # pylint: disable=invalid-name argument
135 def Visit_comparison(self, node): # pylint: disable=invalid-name argument
147 def Visit_star_expr(self, node): # pylint: disable=invalid-name argument
154 def Visit_expr(self, node): # pylint: disable=invalid-name argument
161 def Visit_xor_expr(self, node): # pylint: disable=invalid-name argument
168 def Visit_and_expr(self, node): # pylint: disable=invalid-name argument
[all …]
|
| D | split_penalty.py | 64 def Visit_import_as_names(self, node): # pyline: disable=invalid-name argument
74 def Visit_classdef(self, node): # pylint: disable=invalid-name argument
86 def Visit_funcdef(self, node): # pylint: disable=invalid-name argument
110 def Visit_lambdef(self, node): # pylint: disable=invalid-name argument
118 def Visit_parameters(self, node): # pylint: disable=invalid-name argument
127 def Visit_arglist(self, node): # pylint: disable=invalid-name argument
137 def Visit_argument(self, node): # pylint: disable=invalid-name argument
150 def Visit_dotted_name(self, node): # pylint: disable=invalid-name argument
154 def Visit_dictsetmaker(self, node): # pylint: disable=invalid-name argument
165 def Visit_trailer(self, node): # pylint: disable=invalid-name argument
[all …]
|
| D | pytree_unwrapper.py | 125 def Visit_simple_stmt(self, node): argument
146 def _VisitCompoundStatement(self, node, substatement_names): argument
170 def Visit_if_stmt(self, node): # pylint: disable=invalid-name argument
175 def Visit_while_stmt(self, node): # pylint: disable=invalid-name argument
180 def Visit_for_stmt(self, node): # pylint: disable=invalid-name argument
185 def Visit_try_stmt(self, node): # pylint: disable=invalid-name argument
190 def Visit_except_clause(self, node): # pylint: disable=invalid-name argument
195 def Visit_funcdef(self, node): # pylint: disable=invalid-name argument
198 def Visit_async_funcdef(self, node): # pylint: disable=invalid-name argument
211 def Visit_classdef(self, node): # pylint: disable=invalid-name argument
[all …]
|
| D | blank_line_calculator.py | 66 def Visit_simple_stmt(self, node): # pylint: disable=invalid-name argument
71 def Visit_decorator(self, node): # pylint: disable=invalid-name argument
81 def Visit_classdef(self, node): # pylint: disable=invalid-name argument
91 def Visit_funcdef(self, node): # pylint: disable=invalid-name argument
107 def DefaultNodeVisit(self, node): argument
123 def _SetBlankLinesBetweenCommentAndClassFunc(self, node): argument
154 def _GetNumNewlines(self, node): argument
161 def _SetNumNewlines(self, node, num_newlines): argument
165 def _IsTopLevel(self, node): argument
170 def _StartsInZerothColumn(node): argument
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/opt/ |
| D | pass.cc | 126 Status IRNodePass::Visit(std::shared_ptr<BatchNode> node, bool *const modified) { in Visit()
129 Status IRNodePass::VisitAfter(std::shared_ptr<BatchNode> node, bool *const modified) { in VisitAfter()
132 Status IRNodePass::Visit(std::shared_ptr<BucketBatchByLengthNode> node, bool *const modified) { in Visit()
135 Status IRNodePass::VisitAfter(std::shared_ptr<BucketBatchByLengthNode> node, bool *const modified) { in VisitAfter()
138 Status IRNodePass::Visit(std::shared_ptr<BuildVocabNode> node, bool *const modified) { in Visit()
141 Status IRNodePass::VisitAfter(std::shared_ptr<BuildVocabNode> node, bool *const modified) { in VisitAfter()
144 Status IRNodePass::Visit(std::shared_ptr<ConcatNode> node, bool *const modified) { in Visit()
147 Status IRNodePass::VisitAfter(std::shared_ptr<ConcatNode> node, bool *const modified) { in VisitAfter()
151 Status IRNodePass::Visit(std::shared_ptr<CacheLookupNode> node, bool *const modified) { in Visit()
154 Status IRNodePass::VisitAfter(std::shared_ptr<CacheLookupNode> node, bool *const modified) { in VisitAfter()
[all …]
|
| /third_party/mindspore/mindspore/lite/src/ops/ |
| D | ops_utils.cc | 26 std::unique_ptr<schema::PrimitiveT> GetPrimitiveT(const AnfNodePtr &node) { in GetPrimitiveT()
48 std::unique_ptr<schema::PrimitiveT> AbsPrimitiveCreator(const AnfNodePtr &node) { in AbsPrimitiveCreator()
52 std::unique_ptr<schema::PrimitiveT> AbsGradPrimitiveCreator(const AnfNodePtr &node) { in AbsGradPrimitiveCreator()
56 std::unique_ptr<schema::PrimitiveT> ActivationPrimitiveCreator(const AnfNodePtr &node) { in ActivationPrimitiveCreator()
60 std::unique_ptr<schema::PrimitiveT> ActivationGradPrimitiveCreator(const AnfNodePtr &node) { in ActivationGradPrimitiveCreator()
64 std::unique_ptr<schema::PrimitiveT> AdamPrimitiveCreator(const AnfNodePtr &node) { in AdamPrimitiveCreator()
68 std::unique_ptr<schema::PrimitiveT> AdderFusionPrimitiveCreator(const AnfNodePtr &node) { in AdderFusionPrimitiveCreator()
72 std::unique_ptr<schema::PrimitiveT> AddFusionPrimitiveCreator(const AnfNodePtr &node) { in AddFusionPrimitiveCreator()
76 std::unique_ptr<schema::PrimitiveT> AddGradPrimitiveCreator(const AnfNodePtr &node) { in AddGradPrimitiveCreator()
80 std::unique_ptr<schema::PrimitiveT> AddNPrimitiveCreator(const AnfNodePtr &node) { in AddNPrimitiveCreator()
[all …]
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/source/util/ |
| D | move_to_front.h | 127 Node& node = nodes_.back(); in CreateNode() local
151 Val ValueOf(uint32_t node) const { in ValueOf()
156 uint32_t LeftOf(uint32_t node) const { in LeftOf()
161 uint32_t RightOf(uint32_t node) const { in RightOf()
166 uint32_t ParentOf(uint32_t node) const { in ParentOf()
171 uint32_t TimestampOf(uint32_t node) const { in TimestampOf()
177 uint32_t SizeOf(uint32_t node) const { in SizeOf()
182 uint32_t HeightOf(uint32_t node) const { in HeightOf()
187 Val& MutableValueOf(uint32_t node) { in MutableValueOf()
193 uint32_t& MutableLeftOf(uint32_t node) { in MutableLeftOf()
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| D | IntermRebuild.cpp | 49 TIntermRebuild::BaseResult::BaseResult(TIntermNode &node, VisitBits visit) in BaseResult()
53 TIntermRebuild::BaseResult::BaseResult(TIntermNode *node, VisitBits visit) in BaseResult()
117 PreResult::PreResult(TIntermNode &node, VisitBits visit) : BaseResult(node, visit) {} in PreResult()
118 PreResult::PreResult(TIntermNode *node, VisitBits visit) : BaseResult(node, visit) {} in PreResult()
134 PostResult::PostResult(TIntermNode &node) : BaseResult(node, VisitBits::Neither) {} in PostResult()
135 PostResult::PostResult(TIntermNode *node) : BaseResult(node, VisitBits::Neither) {} in PostResult()
191 bool TIntermRebuild::rebuildInPlace(TIntermAggregate &node) in rebuildInPlace()
196 bool TIntermRebuild::rebuildInPlace(TIntermBlock &node) in rebuildInPlace()
201 bool TIntermRebuild::rebuildInPlace(TIntermDeclaration &node) in rebuildInPlace()
207 bool TIntermRebuild::rebuildInPlaceImpl(Node &node) in rebuildInPlaceImpl()
[all …]
|
| /third_party/python/Lib/ |
| D | ast.py | 65 def _raise_malformed_node(node): argument
70 def _convert_num(node): argument
74 def _convert_signed_num(node): argument
82 def _convert(node): argument
111 def dump(node, annotate_fields=True, include_attributes=False, *, indent=None): argument
123 def _format(node, level=0): argument
195 def fix_missing_locations(node): argument
203 def _fix(node, lineno, col_offset, end_lineno, end_col_offset): argument
230 def increment_lineno(node, n=1): argument
247 def iter_fields(node): argument
[all …]
|
| /third_party/node/deps/acorn/acorn-walk/dist/ |
| D | walk.mjs | 19 function simple(node, visitors, baseVisitor, state, override) { argument
21 ; }(function c(node, st, override) { argument
31 function ancestor(node, visitors, baseVisitor, state, override) { argument
34 ; }(function c(node, st, override) { argument
49 function recursive(node, state, funcs, baseVisitor, override) { argument
51 ;(function c(node, st, override) { argument
65 var Found = function Found(node, state) { this.node = node; this.state = state; }; argument
68 function full(node, callback, baseVisitor, state, override) { argument
71 ;(function c(node, st, override) { argument
83 function fullAncestor(node, callback, baseVisitor, state) { argument
[all …]
|
| D | walk.js | 25 function simple(node, visitors, baseVisitor, state, override) { argument
27 ; }(function c(node, st, override) { argument
37 function ancestor(node, visitors, baseVisitor, state, override) { argument
40 ; }(function c(node, st, override) { argument
55 function recursive(node, state, funcs, baseVisitor, override) { argument
57 ;(function c(node, st, override) { argument
71 var Found = function Found(node, state) { this.node = node; this.state = state; }; argument
74 function full(node, callback, baseVisitor, state, override) { argument
77 ;(function c(node, st, override) { argument
89 function fullAncestor(node, callback, baseVisitor, state) { argument
[all …]
|
| /third_party/flutter/skia/third_party/externals/angle2/src/compiler/translator/ |
| D | ValidateAST.cpp | 85 void ValidateAST::visitNode(Visit visit, TIntermNode *node) in visitNode()
110 void ValidateAST::expectNonNullChildren(Visit visit, TIntermNode *node, size_t least_count) in expectNonNullChildren()
132 void ValidateAST::visitSymbol(TIntermSymbol *node) in visitSymbol()
137 void ValidateAST::visitConstantUnion(TIntermConstantUnion *node) in visitConstantUnion()
142 bool ValidateAST::visitSwizzle(Visit visit, TIntermSwizzle *node) in visitSwizzle()
148 bool ValidateAST::visitBinary(Visit visit, TIntermBinary *node) in visitBinary()
154 bool ValidateAST::visitUnary(Visit visit, TIntermUnary *node) in visitUnary()
160 bool ValidateAST::visitTernary(Visit visit, TIntermTernary *node) in visitTernary()
166 bool ValidateAST::visitIfElse(Visit visit, TIntermIfElse *node) in visitIfElse()
172 bool ValidateAST::visitSwitch(Visit visit, TIntermSwitch *node) in visitSwitch()
[all …]
|
| D | OutputTree.cpp | 66 void OutputTreeText(TInfoSinkBase &out, TIntermNode *node, const int depth) in OutputTreeText()
85 void TOutputTraverser::visitSymbol(TIntermSymbol *node) in visitSymbol()
102 bool TOutputTraverser::visitSwizzle(Visit visit, TIntermSwizzle *node) in visitSwizzle()
114 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary *node) in visitBinary()
300 bool TOutputTraverser::visitUnary(Visit visit, TIntermUnary *node) in visitUnary()
354 bool TOutputTraverser::visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) in visitFunctionDefinition()
361 bool TOutputTraverser::visitInvariantDeclaration(Visit visit, TIntermInvariantDeclaration *node) in visitInvariantDeclaration()
368 void TOutputTraverser::visitFunctionPrototype(TIntermFunctionPrototype *node) in visitFunctionPrototype()
383 bool TOutputTraverser::visitAggregate(Visit visit, TIntermAggregate *node) in visitAggregate()
455 bool TOutputTraverser::visitBlock(Visit visit, TIntermBlock *node) in visitBlock()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/opt/post/ |
| D | repeat_pass.cc | 35 Status RepeatPass::Visit(std::shared_ptr<RepeatNode> node, bool *const modified) { in Visit()
60 Status RepeatPass::Visit(std::shared_ptr<EpochCtrlNode> node, bool *const modified) { in Visit()
75 Status RepeatPass::Visit(std::shared_ptr<CacheMergeNode> node, bool *const modified) { in Visit()
84 Status RepeatPass::Visit(std::shared_ptr<CacheNode> node, bool *const modified) { in Visit()
94 Status RepeatPass::VisitAfter(std::shared_ptr<RepeatNode> node, bool *const modified) { in VisitAfter()
122 Status RepeatPass::VisitAfter(std::shared_ptr<EpochCtrlNode> node, bool *const modified) { in VisitAfter()
135 Status RepeatPass::VisitAfter(std::shared_ptr<DatasetNode> node, bool *const modified) { in VisitAfter()
150 Status RepeatPass::VisitAfter(std::shared_ptr<CacheNode> node, bool *const modified) { in VisitAfter()
173 Status RepeatPass::VisitAfter(std::shared_ptr<CacheMergeNode> node, bool *const modified) { in VisitAfter()
190 Status RepeatPass::VisitAfter(std::shared_ptr<CacheLookupNode> node, bool *const modified) { in VisitAfter()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/opt/pre/ |
| D | cache_validation_pass.cc | 37 Status CacheValidationPass::Visit(std::shared_ptr<BatchNode> node, bool *const modified) { in Visit()
49 Status CacheValidationPass::Visit(std::shared_ptr<ConcatNode> node, bool *const modified) { in Visit()
61 Status CacheValidationPass::Visit(std::shared_ptr<FilterNode> node, bool *const modified) { in Visit()
73 Status CacheValidationPass::Visit(std::shared_ptr<SkipNode> node, bool *const modified) { in Visit()
85 Status CacheValidationPass::Visit(std::shared_ptr<TakeNode> node, bool *const modified) { in Visit()
97 Status CacheValidationPass::Visit(std::shared_ptr<ZipNode> node, bool *const modified) { in Visit()
109 Status CacheValidationPass::Visit(std::shared_ptr<MapNode> node, bool *const modified) { in Visit()
136 Status CacheValidationPass::Visit(std::shared_ptr<DatasetNode> node, bool *const modified) { in Visit()
153 Status CacheValidationPass::VisitAfter(std::shared_ptr<RepeatNode> node, bool *const modified) { in VisitAfter()
161 Status CacheValidationPass::VisitAfter(std::shared_ptr<TFRecordNode> node, bool *const modified) { in VisitAfter()
[all …]
|
| /third_party/flutter/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| D | IntermNodePatternMatcher.cpp | 27 TIntermTyped *node = sequence[ii]->getAsTyped(); in ContainsMatrixNode() local
38 TIntermTyped *node = sequence[ii]->getAsTyped(); in ContainsVectorNode() local
50 bool IntermNodePatternMatcher::IsDynamicIndexingOfNonSSBOVectorOrMatrix(TIntermBinary *node) in IsDynamicIndexingOfNonSSBOVectorOrMatrix()
56 bool IntermNodePatternMatcher::IsDynamicIndexingOfVectorOrMatrix(TIntermBinary *node) in IsDynamicIndexingOfVectorOrMatrix()
62 bool IntermNodePatternMatcher::matchInternal(TIntermBinary *node, TIntermNode *parentNode) in matchInternal()
84 bool IntermNodePatternMatcher::match(TIntermUnary *node) in match()
96 bool IntermNodePatternMatcher::match(TIntermBinary *node, TIntermNode *parentNode) in match()
105 bool IntermNodePatternMatcher::match(TIntermBinary *node, in match()
123 bool IntermNodePatternMatcher::match(TIntermAggregate *node, TIntermNode *parentNode) in match()
158 bool IntermNodePatternMatcher::match(TIntermTernary *node) in match()
[all …]
|
| /third_party/PyYAML/lib/yaml/ |
| D | constructor.py | 54 def construct_document(self, node): argument
67 def construct_object(self, node, deep=False): argument
117 def construct_scalar(self, node): argument
124 def construct_sequence(self, node, deep=False): argument
132 def construct_mapping(self, node, deep=False): argument
147 def construct_pairs(self, node, deep=False): argument
173 def construct_scalar(self, node): argument
180 def flatten_mapping(self, node): argument
215 def construct_mapping(self, node, deep=False): argument
220 def construct_yaml_null(self, node): argument
[all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_tree.c | 53 struct cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t… in cil_tree_get_next_path()
106 char *cil_tree_get_cil_path(struct cil_tree_node *node) in cil_tree_get_cil_path()
122 __attribute__((format (printf, 3, 4))) void cil_tree_log(struct cil_tree_node *node, enum cil_log_l… in cil_tree_log()
161 int cil_tree_subtree_has_decl(struct cil_tree_node *node) in cil_tree_subtree_has_decl()
199 void cil_tree_subtree_destroy(struct cil_tree_node *node) in cil_tree_subtree_destroy()
205 void cil_tree_children_destroy(struct cil_tree_node *node) in cil_tree_children_destroy()
224 void cil_tree_node_init(struct cil_tree_node **node) in cil_tree_node_init()
239 void cil_tree_node_destroy(struct cil_tree_node **node) in cil_tree_node_destroy()
276 int cil_tree_walk_core(struct cil_tree_node *node, in cil_tree_walk_core()
277 int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), in cil_tree_walk_core()
[all …]
|
| /third_party/boost/libs/coroutine/example/asymmetric/ |
| D | same_fringe.cpp | 20 struct node struct
22 typedef boost::shared_ptr< node > ptr_t; argument
31 node(const std::string& v): in node() argument
35 node(ptr_t l, const std::string& v, ptr_t r): in node() function
41 return ptr_t(new node(v)); in create() argument
46 return ptr_t(new node(l, v, r)); in create() argument
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
| D | OutputTree.cpp | 67 void OutputTreeText(TInfoSinkBase &out, TIntermNode *node, const int depth) in OutputTreeText()
86 void TOutputTraverser::visitSymbol(TIntermSymbol *node) in visitSymbol()
103 bool TOutputTraverser::visitSwizzle(Visit visit, TIntermSwizzle *node) in visitSwizzle()
115 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary *node) in visitBinary()
301 bool TOutputTraverser::visitUnary(Visit visit, TIntermUnary *node) in visitUnary()
364 bool TOutputTraverser::visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) in visitFunctionDefinition()
372 TIntermGlobalQualifierDeclaration *node) in visitGlobalQualifierDeclaration()
386 void TOutputTraverser::visitFunctionPrototype(TIntermFunctionPrototype *node) in visitFunctionPrototype()
401 bool TOutputTraverser::visitAggregate(Visit visit, TIntermAggregate *node) in visitAggregate()
479 bool TOutputTraverser::visitBlock(Visit visit, TIntermBlock *node) in visitBlock()
[all …]
|
| /third_party/glib/glib/ |
| D | gnode.c | 93 #define g_node_free(node) g_slice_free (GNode, node) argument
108 GNode *node = g_node_alloc0 (); in g_node_new() local
114 g_nodes_free (GNode *node) in g_nodes_free()
151 g_node_unlink (GNode *node) in g_node_unlink()
182 g_node_copy_deep (GNode *node, in g_node_copy_deep()
217 g_node_copy (GNode *node) in g_node_copy()
248 GNode *node) in g_node_insert()
278 GNode *node) in g_node_insert_before()
335 GNode *node) in g_node_insert_after()
379 GNode *node) in g_node_prepend()
[all …]
|
| /third_party/typescript/src/services/ |
| D | breakpoints.ts | 273 const { left, operatorToken } = <BinaryExpression>node; constant
343 … const { initializer, type } = <VariableDeclaration | ParameterDeclaration>node.parent; constant
350 const { left } = <BinaryExpression>node.parent; constant
539 …const elements: NodeArray<Expression | ObjectLiteralElement> = node.kind === SyntaxKind.ArrayLiter… constant
559 const enumDeclaration = <EnumDeclaration>node.parent; constant
563 const classDeclaration = <ClassDeclaration>node.parent; constant
600 const caseBlock = <CaseBlock>node.parent; constant
609 const bindingPattern = <BindingPattern>node.parent; constant
616 const objectLiteral = <ObjectLiteralExpression>node.parent; constant
627 const bindingPattern = <BindingPattern>node.parent; constant
[all …]
|
| /third_party/node/tools/inspector_protocol/jinja2/ |
| D | compiler.py | 64 def new_func(self, node, frame, **kwargs): argument
74 def generate(node, environment, name, filename, stream=None, argument
123 def __init__(self, node): argument
203 def visit_Filter(self, node): argument
207 def visit_Test(self, node): argument
211 def visit_Block(self, node): argument
225 def visit_Name(self, node): argument
233 def visit_Block(self, node): argument
353 def start_write(self, frame, node=None): argument
365 def simple_write(self, s, frame, node=None): argument
[all …]
|
| /third_party/mindspore/mindspore/lite/tools/converter/parser/tf/ |
| D | functionalize_control_op_pass.h | 38 static bool IsMerge(const AnfNodePtr &node) { return CheckPrimitiveType(node, prim::kPrimMerge); } in IsMerge()
39 static bool IsLoopCond(const AnfNodePtr &node) { in IsLoopCond()
42 static bool IsEnter(const AnfNodePtr &node) { in IsEnter()
45 static bool IsExit(const AnfNodePtr &node) { in IsExit()
48 …static bool IsSwitch(const AnfNodePtr &node) { return CheckPrimitiveType(node, prim::kPrimSwitch);… in IsSwitch()
49 static bool IsNextIteration(const AnfNodePtr &node) { in IsNextIteration()
52 static bool IsControlFlowOp(const AnfNodePtr &node) { in IsControlFlowOp()
|