| /third_party/typescript/src/compiler/factory/ |
| D | nodeTests.ts | 4 export function isNumericLiteral(node: Node): node is NumericLiteral { 5 return node.kind === SyntaxKind.NumericLiteral; 8 export function isBigIntLiteral(node: Node): node is BigIntLiteral { 9 return node.kind === SyntaxKind.BigIntLiteral; 12 export function isStringLiteral(node: Node): node is StringLiteral { 13 return node.kind === SyntaxKind.StringLiteral; 16 export function isJsxText(node: Node): node is JsxText { 17 return node.kind === SyntaxKind.JsxText; 20 export function isRegularExpressionLiteral(node: Node): node is RegularExpressionLiteral { 21 return node.kind === SyntaxKind.RegularExpressionLiteral; [all …]
|
| D | nodeFactory.ts | 36 …Node | undefined; }>(kind: T["kind"]) => (node: T, type: T["type"]) => updateJSDocUnaryTypeWorker<… 38 …Tag>(kind: T["kind"]) => (node: T, tagName: Identifier | undefined, comment?: string) => updateJSD… 40 …) => (node: T, tagName: Identifier | undefined, typeExpression?: JSDocTypeExpression, comment?: st… 549 const node = createBaseNode(kind); constant 550 node.decorators = asNodeArray(decorators); 551 node.modifiers = asNodeArray(modifiers); 552 node.transformFlags |= 553 propagateChildrenFlags(node.decorators) | 554 propagateChildrenFlags(node.modifiers); 557 node.symbol = undefined!; // initialized by binder [all …]
|
| D | emitNode.ts | 7 export function getOrCreateEmitNode(node: Node): EmitNode { 8 if (!node.emitNode) { 9 if (isParseTreeNode(node)) { 13 if (node.kind === SyntaxKind.SourceFile) { 14 return node.emitNode = { annotatedNodes: [node] } as EmitNode; 17 …const sourceFile = getSourceFileOfNode(getParseTreeNode(getSourceFileOfNode(node))) ?? Debug.fail(… 18 getOrCreateEmitNode(sourceFile).annotatedNodes!.push(node); 21 node.emitNode = {} as EmitNode; 24 return node.emitNode; 40 for (const node of annotatedNodes) { constant [all …]
|
| /third_party/cef/tools/yapf/yapf/yapflib/ |
| D | split_penalty.py | 64 def Visit_import_as_names(self, node): # pyline: disable=invalid-name argument 66 self.DefaultNodeVisit(node) 68 for child in node.children: 74 def Visit_classdef(self, node): # pylint: disable=invalid-name argument 78 _SetUnbreakable(node.children[1]) 79 if len(node.children) > 4: 81 _SetUnbreakable(node.children[2]) 83 _SetUnbreakable(node.children[-2]) 84 self.DefaultNodeVisit(node) 86 def Visit_funcdef(self, node): # pylint: disable=invalid-name argument [all …]
|
| /third_party/typescript/src/compiler/transformers/ |
| D | ts.ts | 91 function transformSourceFileOrBundle(node: SourceFile | Bundle) { 92 if (node.kind === SyntaxKind.Bundle) { 93 return transformBundle(node); 95 return transformSourceFile(node); 98 function transformBundle(node: Bundle) { 99 …return factory.createBundle(node.sourceFiles.map(transformSourceFile), mapDefined(node.prepends, p… 112 function transformSourceFile(node: SourceFile) { 113 if (node.isDeclarationFile) { 114 return node; 117 currentSourceFile = node; [all …]
|
| D | es2018.ts | 107 function transformSourceFile(node: SourceFile) { 108 if (node.isDeclarationFile) { 109 return node; 112 currentSourceFile = node; 113 const visited = visitSourceFile(node); 121 function visitor(node: Node): VisitResult<Node> { 122 return visitorWorker(node, /*expressionResultIsUnused*/ false); 125 function visitorWithUnusedExpressionResult(node: Node): VisitResult<Node> { 126 return visitorWorker(node, /*expressionResultIsUnused*/ true); 129 function visitorNoAsyncModifier(node: Node): VisitResult<Node> { [all …]
|
| D | classFields.ts | 71 function transformSourceFile(node: SourceFile) { 73 if (node.isDeclarationFile 75 return node; 77 const visited = visitEachChild(node, visitor, context); 82 function visitor(node: Node): VisitResult<Node> { 83 if (!(node.transformFlags & TransformFlags.ContainsClassFields)) return node; 85 switch (node.kind) { 88 return visitClassLike(node as ClassLikeDeclaration); 90 return visitPropertyDeclaration(node as PropertyDeclaration); 92 return visitVariableStatement(node as VariableStatement); [all …]
|
| D | es2017.ts | 63 function transformSourceFile(node: SourceFile) { 64 if (node.isDeclarationFile) { 65 return node; 69 …setContextFlag(ContextFlags.HasLexicalThis, !isEffectiveStrictModeSourceFile(node, compilerOptions… 70 const visited = visitEachChild(node, visitor, context); 102 function visitDefault(node: Node): VisitResult<Node> { 103 return visitEachChild(node, visitor, context); 106 function visitor(node: Node): VisitResult<Node> { 107 if ((node.transformFlags & TransformFlags.ContainsES2017) === 0) { 108 return node; [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 128 node.timestamp = timestamp; in CreateNode() 129 node.value = value; in CreateNode() 130 node.size = 1; in CreateNode() 132 node.height = 1; in CreateNode() 151 Val ValueOf(uint32_t node) const { in ValueOf() argument 152 return nodes_.at(node).value; in ValueOf() 156 uint32_t LeftOf(uint32_t node) const { in LeftOf() argument 157 return nodes_.at(node).left; in LeftOf() 161 uint32_t RightOf(uint32_t node) const { in RightOf() argument [all …]
|
| /third_party/typescript/src/compiler/ |
| D | utilitiesPublic.ts | 257 …export function isParameterPropertyDeclaration(node: Node, parent: Node): node is ParameterPropert… 258 …return hasSyntacticModifier(node, ModifierFlags.ParameterPropertyModifier) && parent.kind === Synt… 261 export function isEmptyBindingPattern(node: BindingName): node is BindingPattern { 262 if (isBindingPattern(node)) { 263 return every(node.elements, isEmptyBindingElement); 268 export function isEmptyBindingElement(node: BindingElement): boolean { 269 if (isOmittedExpression(node)) { 272 return isEmptyBindingPattern(node.name); 276 let node = binding.parent; 277 while (isBindingElement(node.parent)) { [all …]
|
| D | visitorPublic.ts | 12 …function visitNode<T extends Node>(node: T, visitor: Visitor | undefined, test?: (node: Node) => b… 22 …on visitNode<T extends Node>(node: T | undefined, visitor: Visitor | undefined, test?: (node: Node… 24 …on visitNode<T extends Node>(node: T | undefined, visitor: Visitor | undefined, test?: (node: Node… 25 if (node === undefined || visitor === undefined) { 26 return node; 29 const visited = visitor(node); 30 if (visited === node) { 31 return node; 58 … extends Node>(nodes: NodeArray<T>, visitor: Visitor | undefined, test?: (node: Node) => boolean, … 69 …e>(nodes: NodeArray<T> | undefined, visitor: Visitor | undefined, test?: (node: Node) => boolean, … [all …]
|
| D | binder.ts | 18 …export function getModuleInstanceState(node: ModuleDeclaration, visited?: ESMap<number, ModuleInst… 19 if (node.body && !node.body.parent) { 21 setParent(node.body, node); 22 setParentRecursive(node.body, /*incremental*/ false); 24 …return node.body ? getModuleInstanceStateCached(node.body, visited) : ModuleInstanceState.Instanti… 27 …function getModuleInstanceStateCached(node: Node, visited = new Map<number, ModuleInstanceState | … 28 const nodeId = getNodeId(node); 33 const result = getModuleInstanceStateWorker(node, visited); 38 …function getModuleInstanceStateWorker(node: Node, visited: ESMap<number, ModuleInstanceState | und… 40 switch (node.kind) { [all …]
|
| D | emitter.ts | 518 function collectLinkedAliases(node: Node) { 519 if (isExportAssignment(node)) { 520 if (node.expression.kind === SyntaxKind.Identifier) { 521 … resolver.collectLinkedAliases(node.expression as Identifier, /*setVisibility*/ true); 525 else if (isExportSpecifier(node)) { 526 … resolver.collectLinkedAliases(node.propertyName || node.name, /*setVisibility*/ true); 529 forEachChild(node, collectLinkedAliases); 947 function printNode(hint: EmitHint, node: Node, sourceFile: SourceFile): string { 950 Debug.assert(isSourceFile(node), "Expected a SourceFile node."); 953 Debug.assert(isIdentifier(node), "Expected an Identifier node."); [all …]
|
| /third_party/node/deps/acorn/acorn-walk/dist/ |
| D | walk.js | 25 function simple(node, visitors, baseVisitor, state, override) { argument 27 ; }(function c(node, st, override) { argument 28 var type = override || node.type, found = visitors[type]; 29 baseVisitor[type](node, st, c); 30 if (found) { found(node, st); } 31 })(node, state, override); 37 function ancestor(node, visitors, baseVisitor, state, override) { argument 40 ; }(function c(node, st, override) { argument 41 var type = override || node.type, found = visitors[type]; 42 var isNew = node !== ancestors[ancestors.length - 1]; [all …]
|
| D | walk.mjs | 8 // Expression: function(node) { ... } 11 // to do something with all expressions. All Parser API node types 12 // can be used to identify node types, as well as Expression and 19 function simple(node, visitors, baseVisitor, state, override) { argument 21 ; }(function c(node, st, override) { argument 22 var type = override || node.type, found = visitors[type]; 23 baseVisitor[type](node, st, c); 24 if (found) { found(node, st); } 25 })(node, state, override); 29 // current node) and passes them to the callback as third parameter [all …]
|
| /third_party/python/Lib/ |
| D | ast.py | 65 def _raise_malformed_node(node): argument 67 if lno := getattr(node, 'lineno', None): 70 def _convert_num(node): argument 71 if not isinstance(node, Constant) or type(node.value) not in (int, float, complex): 72 _raise_malformed_node(node) 73 return node.value 74 def _convert_signed_num(node): argument 75 if isinstance(node, UnaryOp) and isinstance(node.op, (UAdd, USub)): 76 operand = _convert_num(node.operand) 77 if isinstance(node.op, UAdd): [all …]
|
| /third_party/nghttp2/src/ |
| D | shrpx_router.cc | 44 RNode *find_next_node(const RNode *node, char c) { in find_next_node() argument 45 auto itr = std::lower_bound(std::begin(node->next), std::end(node->next), c, in find_next_node() 48 if (itr == std::end(node->next) || (*itr)->s[0] != c) { in find_next_node() 57 void add_next_node(RNode *node, std::unique_ptr<RNode> new_node) { in add_next_node() argument 58 auto itr = std::lower_bound(std::begin(node->next), std::end(node->next), in add_next_node() 62 node->next.insert(itr, std::move(new_node)); in add_next_node() 66 void Router::add_node(RNode *node, const char *pattern, size_t patlen, in add_node() argument 71 add_next_node(node, std::move(new_node)); in add_node() 82 auto node = &root_; in add_route() local 86 auto next_node = find_next_node(node, pattern[i]); in add_route() [all …]
|
| /third_party/typescript/src/services/ |
| D | callHierarchy.ts | 9 function isNamedExpression(node: Node): node is NamedExpression { 10 return (isFunctionExpression(node) || isClassExpression(node)) && isNamedDeclaration(node); 20 function isConstNamedExpression(node: Node): node is ConstNamedExpression { 21 return (isFunctionExpression(node) || isArrowFunction(node) || isClassExpression(node)) 22 && isVariableDeclaration(node.parent) 23 && node === node.parent.initializer 24 && isIdentifier(node.parent.name) 25 && !!(getCombinedNodeFlags(node.parent) & NodeFlags.Const); 46 function isPossibleCallHierarchyDeclaration(node: Node) { 47 return isSourceFile(node) [all …]
|
| D | breakpoints.ts | 48 …function spanInNodeIfStartsOnSameLine(node: Node | undefined, otherwiseOnNode?: Node): TextSpan | … 49 …if (node && lineOfPosition === sourceFile.getLineAndCharacterOfPosition(node.getStart(sourceFile))… 50 return spanInNode(node); 59 function spanInPreviousNode(node: Node): TextSpan | undefined { 60 return spanInNode(findPrecedingToken(node.pos, sourceFile)); 63 function spanInNextNode(node: Node): TextSpan | undefined { 64 return spanInNode(findNextToken(node, node.parent, sourceFile)); 67 function spanInNode(node: Node | undefined): TextSpan | undefined { 68 if (node) { 69 const { parent } = node; [all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_tree.c | 44 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() argument 48 if (!node) { in cil_tree_get_next_path() 52 node = node->parent; in cil_tree_get_next_path() 54 while (node) { in cil_tree_get_next_path() 55 if (node->flavor == CIL_NODE && node->data == NULL) { in cil_tree_get_next_path() 56 if (node->cl_head && node->cl_head->data == CIL_KEY_SRC_INFO) { in cil_tree_get_next_path() 57 if (!node->cl_head->next || !node->cl_head->next->next || !node->cl_head->next->next->next) { in cil_tree_get_next_path() 61 *info_kind = node->cl_head->next->data; in cil_tree_get_next_path() 62 rc = cil_string_to_uint32(node->cl_head->next->next->data, hll_line, 10); in cil_tree_get_next_path() 66 *path = node->cl_head->next->next->next->data; in cil_tree_get_next_path() [all …]
|
| /third_party/mesa3d/src/gallium/drivers/lima/ir/gp/ |
| D | scheduler.c | 351 static void schedule_update_distance(gpir_node *node) in schedule_update_distance() argument 353 if (gpir_node_is_leaf(node)) { in schedule_update_distance() 354 node->sched.dist = 0; in schedule_update_distance() 358 gpir_node_foreach_pred(node, dep) { in schedule_update_distance() 365 if (node->sched.dist < dist) in schedule_update_distance() 366 node->sched.dist = dist; in schedule_update_distance() 370 static bool gpir_is_input_node(gpir_node *node) in gpir_is_input_node() argument 372 gpir_node_foreach_succ(node, dep) { in gpir_is_input_node() 382 static int gpir_get_slots_required(gpir_node *node) in gpir_get_slots_required() argument 384 if (!gpir_is_input_node(node)) in gpir_get_slots_required() [all …]
|
| /third_party/typescript/src/compiler/transformers/module/ |
| D | system.ts | 52 function transformSourceFile(node: SourceFile) { 53 …if (node.isDeclarationFile || !(isEffectiveExternalModule(node, compilerOptions) || node.transform… 54 return node; 57 const id = getOriginalNodeId(node); 58 currentSourceFile = node; 59 enclosingBlockScopedContainer = node; 75 …moduleInfo = moduleInfoMap[id] = collectExternalModuleInfo(context, node, resolver, compilerOption… 85 const moduleBodyBlock = createSystemModuleBody(node, dependencyGroups); 102 const moduleName = tryGetModuleNameFromFile(factory, node, host, compilerOptions); 106 node, [all …]
|
| /third_party/mesa3d/src/util/tests/ |
| D | dag_test.cpp | 50 struct node: public dag_node { struct 54 struct node &operator>>(struct node &child) { in operator >>() argument 60 void add_edge(struct node &child, uintptr_t data) { in add_edge() argument 65 void add_edge_max_data(struct node &child, uintptr_t data) { in add_edge_max_data() argument 73 struct node *node = static_cast<struct node *>(dag_node); in output_cb() local 75 util_dynarray_append(output, int, node->val); in output_cb() 79 init_nodes(struct dag *dag, struct node *nodes, unsigned num_nodes) in init_nodes() 89 struct node node[(num_nodes)]; \ 90 init_nodes(dag, node, (num_nodes)) 153 node[0] >> node[1]; in TEST_F() [all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| D | AsNode.h | 28 static ANGLE_INLINE TIntermNode *exec(TIntermNode *node) { return node; } 34 static ANGLE_INLINE TIntermTyped *exec(TIntermNode *node) 36 return node ? node->getAsTyped() : nullptr; 43 static ANGLE_INLINE TIntermSymbol *exec(TIntermNode *node) 45 return node ? node->getAsSymbolNode() : nullptr; 52 static ANGLE_INLINE TIntermConstantUnion *exec(TIntermNode *node) 54 return node ? node->getAsConstantUnion() : nullptr; 61 static ANGLE_INLINE TIntermFunctionPrototype *exec(TIntermNode *node) 63 return node ? node->getAsFunctionPrototypeNode() : nullptr; 70 static ANGLE_INLINE TIntermPreprocessorDirective *exec(TIntermNode *node) [all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
| D | OutputTree.cpp | 41 bool visitSwizzle(Visit visit, TIntermSwizzle *node) override; 44 bool visitTernary(Visit visit, TIntermTernary *node) override; 45 bool visitIfElse(Visit visit, TIntermIfElse *node) override; 46 bool visitSwitch(Visit visit, TIntermSwitch *node) override; 47 bool visitCase(Visit visit, TIntermCase *node) override; 48 void visitFunctionPrototype(TIntermFunctionPrototype *node) override; 49 bool visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) override; 53 TIntermGlobalQualifierDeclaration *node) override; 54 bool visitDeclaration(Visit visit, TIntermDeclaration *node) override; 67 void OutputTreeText(TInfoSinkBase &out, TIntermNode *node, const int depth) in OutputTreeText() argument [all …]
|