Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 4313) sorted by relevance

12345678910>>...173

/third_party/typescript/src/compiler/factory/
DnodeTests.ts4 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 …]
DnodeFactory.ts36 …Node | undefined; }>(kind: T["kind"]) => (node: T, type: T["type"]) => updateJSDocUnaryTypeWorker<…
38 …ix: boolean; }>(kind: T["kind"]) => (node: T, type: T["type"]) => updateJSDocPrePostfixUnaryTypeWo…
40 …d: T["kind"]) => (node: T, tagName: Identifier | undefined, comment?: NodeArray<JSDocComment>) => …
42 …node: T, tagName: Identifier | undefined, typeExpression?: JSDocTypeExpression, comment?: NodeArra…
591 const node = createBaseNode(kind); constant
594 node.symbol = undefined!; // initialized by binder
595 node.localSymbol = undefined; // initialized by binder
596 node.locals = undefined; // initialized by binder
597 node.nextContainer = undefined; // initialized by binder
598 return node;
[all …]
DemitNode.ts7 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 …Debug.assert(!(node.emitNode.flags & EmitFlags.Immutable), "Invalid attempt to mutate an immutable…
26 return node.emitNode;
[all …]
/third_party/node/deps/v8/src/compiler/backend/
Dinstruction-selector.cc33 Smi NumberConstantToSmi(Node* node) { in NumberConstantToSmi() argument
34 DCHECK_EQ(node->opcode(), IrOpcode::kNumberConstant); in NumberConstantToSmi()
35 const double d = OpParameter<double>(node->op()); in NumberConstantToSmi()
284 bool InstructionSelector::CanCover(Node* user, Node* node) const { in CanCover()
286 if (schedule()->block(node) != current_block_) { in CanCover()
290 if (node->op()->HasProperty(Operator::kPure)) { in CanCover()
291 return node->OwnedBy(user); in CanCover()
294 if (GetEffectLevel(node) != current_effect_level_) { in CanCover()
298 for (Edge const edge : node->use_edges()) { in CanCover()
307 Node* node) const { in IsOnlyUserOfNodeInSameBlock()
[all …]
/third_party/typescript/src/compiler/
DvisitorPublic.ts10 …function visitNode<T extends Node>(node: T, visitor: Visitor | undefined, test?: (node: Node) => b…
20 …on visitNode<T extends Node>(node: T | undefined, visitor: Visitor | undefined, test?: (node: Node…
22 …on visitNode<T extends Node>(node: T | undefined, visitor: Visitor | undefined, test?: (node: Node…
23 if (node === undefined || visitor === undefined) {
24 return node;
27 const visited = visitor(node);
28 if (visited === node) {
29 return node;
48 …s Node, U extends T>(nodes: NodeArray<T>, visitor: Visitor, test: (node: Node) => node is U, start…
59 … extends Node>(nodes: NodeArray<T>, visitor: Visitor | undefined, test?: (node: Node) => boolean, …
[all …]
DutilitiesPublic.ts261 …export function isParameterPropertyDeclaration(node: Node, parent: Node): node is ParameterPropert…
262 …return hasSyntacticModifier(node, ModifierFlags.ParameterPropertyModifier) && parent.kind === Synt…
265 export function isEmptyBindingPattern(node: BindingName): node is BindingPattern {
266 if (isBindingPattern(node)) {
267 return every(node.elements, isEmptyBindingElement);
272 export function isEmptyBindingElement(node: BindingElement): boolean {
273 if (isOmittedExpression(node)) {
276 return isEmptyBindingPattern(node.name);
280 let node = binding.parent;
281 while (isBindingElement(node.parent)) {
[all …]
Dbinder.ts18 …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 …]
Demitter.ts505 function collectLinkedAliases(node: Node) {
506 if (isExportAssignment(node)) {
507 if (node.expression.kind === SyntaxKind.Identifier) {
508 … resolver.collectLinkedAliases(node.expression as Identifier, /*setVisibility*/ true);
512 else if (isExportSpecifier(node)) {
513 … resolver.collectLinkedAliases(node.propertyName || node.name, /*setVisibility*/ true);
516 forEachChild(node, collectLinkedAliases);
958 let currentParenthesizerRule: ((node: Node) => Node) | undefined;
982 function printNode(hint: EmitHint, node: Node, sourceFile: SourceFile): string {
985 Debug.assert(isSourceFile(node), "Expected a SourceFile node.");
[all …]
/third_party/typescript/src/compiler/transformers/
Dts.ts82 function transformSourceFileOrBundle(node: SourceFile | Bundle) {
83 if (node.kind === SyntaxKind.Bundle) {
84 return transformBundle(node);
86 return transformSourceFile(node);
89 function transformBundle(node: Bundle) {
90 …return factory.createBundle(node.sourceFiles.map(transformSourceFile), mapDefined(node.prepends, p…
103 function transformSourceFile(node: SourceFile) {
104 if (node.isDeclarationFile) {
105 return node;
108 currentSourceFile = node;
[all …]
DlegacyDecorators.ts28 function transformSourceFile(node: SourceFile) {
29 const visited = visitEachChild(node, visitor, context);
34 function modifierVisitor(node: Node): VisitResult<Node> {
35 return isDecorator(node) ? undefined : node;
38 function visitor(node: Node): VisitResult<Node> {
39 if (!(node.transformFlags & TransformFlags.ContainsDecorators)) {
40 return node;
43 switch (node.kind) {
48 return visitClassDeclaration(node as ClassDeclaration);
50 return visitClassExpression(node as ClassExpression);
[all …]
Des2018.ts108 function transformSourceFile(node: SourceFile) {
109 if (node.isDeclarationFile) {
110 return node;
113 currentSourceFile = node;
114 const visited = visitSourceFile(node);
122 function visitor(node: Node): VisitResult<Node> {
123 return visitorWorker(node, /*expressionResultIsUnused*/ false);
126 function visitorWithUnusedExpressionResult(node: Node): VisitResult<Node> {
127 return visitorWorker(node, /*expressionResultIsUnused*/ true);
130 function visitorNoAsyncModifier(node: Node): VisitResult<Node> {
[all …]
/third_party/node/deps/v8/src/ast/
Dprettyprinter.cc63 void CallPrinter::Find(AstNode* node, bool print) { in Find() argument
67 Visit(node); in Find()
72 Visit(node); in Find()
94 void CallPrinter::VisitBlock(Block* node) { in VisitBlock() argument
95 FindStatements(node->statements()); in VisitBlock()
99 void CallPrinter::VisitVariableDeclaration(VariableDeclaration* node) {} in VisitVariableDeclaration() argument
102 void CallPrinter::VisitFunctionDeclaration(FunctionDeclaration* node) {} in VisitFunctionDeclaration() argument
105 void CallPrinter::VisitExpressionStatement(ExpressionStatement* node) { in VisitExpressionStatement() argument
106 Find(node->expression()); in VisitExpressionStatement()
110 void CallPrinter::VisitEmptyStatement(EmptyStatement* node) {} in VisitEmptyStatement() argument
[all …]
/third_party/node/deps/acorn/acorn-walk/dist/
Dwalk.js25 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 …]
/third_party/python/Lib/
Dast.py65 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/typescript/src/services/
DcallHierarchy.ts9 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);
47 function isPossibleCallHierarchyDeclaration(node: Node) {
48 return isSourceFile(node)
[all …]
Dbreakpoints.ts49 …function spanInNodeIfStartsOnSameLine(node: Node | undefined, otherwiseOnNode?: Node): TextSpan | …
50 …if (node && lineOfPosition === sourceFile.getLineAndCharacterOfPosition(node.getStart(sourceFile))…
51 return spanInNode(node);
56 …function spanInNodeArray<T extends Node>(nodeArray: NodeArray<T> | undefined, node: T, match: (val…
58 const index = nodeArray.indexOf(node);
67 return textSpan(node);
70 function spanInPreviousNode(node: Node): TextSpan | undefined {
71 return spanInNode(findPrecedingToken(node.pos, sourceFile));
74 function spanInNextNode(node: Node): TextSpan | undefined {
75 return spanInNode(findNextToken(node, node.parent, sourceFile));
[all …]
/third_party/nghttp2/src/
Dshrpx_router.cc44 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/node/deps/v8/src/compiler/
Djs-intrinsic-lowering.cc29 Reduction JSIntrinsicLowering::Reduce(Node* node) { in Reduce() argument
30 if (node->opcode() != IrOpcode::kJSCallRuntime) return NoChange(); in Reduce()
32 Runtime::FunctionForId(CallRuntimeParametersOf(node->op()).id()); in Reduce()
35 return ReduceIsBeingInterpreted(node); in Reduce()
37 return ReduceTurbofanStaticAssert(node); in Reduce()
39 return ReduceVerifyType(node); in Reduce()
46 return ReduceCopyDataProperties(node); in Reduce()
48 return ReduceCopyDataPropertiesWithExcludedPropertiesOnStack(node); in Reduce()
50 return ReduceCreateIterResultObject(node); in Reduce()
52 return ReduceDeoptimizeNow(node); in Reduce()
[all …]
Dnode-properties.h32 static int FirstValueIndex(const Node* node) { return 0; } in FirstValueIndex() argument
33 static int FirstContextIndex(Node* node) { return PastValueIndex(node); } in FirstContextIndex() argument
34 static int FirstFrameStateIndex(Node* node) { return PastContextIndex(node); } in FirstFrameStateIndex() argument
35 static int FirstEffectIndex(Node* node) { return PastFrameStateIndex(node); } in FirstEffectIndex() argument
36 static int FirstControlIndex(Node* node) { return PastEffectIndex(node); } in FirstControlIndex() argument
38 static int PastValueIndex(Node* node) { in PastValueIndex() argument
39 return FirstValueIndex(node) + node->op()->ValueInputCount(); in PastValueIndex()
42 static int PastContextIndex(Node* node) { in PastContextIndex() argument
43 return FirstContextIndex(node) + in PastContextIndex()
44 OperatorProperties::GetContextInputCount(node->op()); in PastContextIndex()
[all …]
Dmachine-operator-reducer.cc77 Reduction ReduceWordNAnd(Node* node) { return r_->ReduceWord32And(node); } in ReduceWordNAnd() argument
78 Reduction ReduceIntNAdd(Node* node) { return r_->ReduceInt32Add(node); } in ReduceIntNAdd() argument
79 Reduction TryMatchWordNRor(Node* node) { return r_->TryMatchWord32Ror(node); } in TryMatchWordNRor() argument
137 Reduction ReduceWordNAnd(Node* node) { return r_->ReduceWord64And(node); } in ReduceWordNAnd() argument
138 Reduction ReduceIntNAdd(Node* node) { return r_->ReduceInt64Add(node); } in ReduceIntNAdd() argument
139 Reduction TryMatchWordNRor(Node* node) { in TryMatchWordNRor() argument
207 Node* const node = graph()->NewNode(machine()->Word32And(), lhs, rhs); in Word32And() local
208 Reduction const reduction = ReduceWord32And(node); in Word32And()
209 return reduction.Changed() ? reduction.replacement() : node; in Word32And()
227 Node* const node = graph()->NewNode(machine()->Word64And(), lhs, rhs); in Word64And() local
[all …]
Dsimplified-lowering.cc182 void ReplaceEffectControlUses(Node* node, Node* effect, Node* control) { in ReplaceEffectControlUses() argument
183 for (Edge edge : node->use_edges()) { in ReplaceEffectControlUses()
236 base::Optional<Type> GetType(Node* node) override { in GetType() argument
237 return verifier_->GetType(node); in GetType()
252 void SetAndCheckInput(Node* node, int index, UseInfo use_info) { in SetAndCheckInput() argument
254 input_use_infos_.resize(node->InputCount(), UseInfo::None()); in SetAndCheckInput()
280 static void ChangeOp(Node* node, const Operator* new_op) { UNREACHABLE(); } in ChangeOp() argument
369 Type TypeOf(Node* node) { in TypeOf() argument
370 Type type = GetInfo(node)->feedback_type(); in TypeOf()
371 return type.IsInvalid() ? NodeProperties::GetType(node) : type; in TypeOf()
[all …]
/third_party/typescript/src/compiler/transformers/module/
Dsystem.ts50 function transformSourceFile(node: SourceFile) {
51 …if (node.isDeclarationFile || !(isEffectiveExternalModule(node, compilerOptions) || node.transform…
52 return node;
55 const id = getOriginalNodeId(node);
56 currentSourceFile = node;
57 enclosingBlockScopedContainer = node;
73 …moduleInfo = moduleInfoMap[id] = collectExternalModuleInfo(context, node, resolver, compilerOption…
83 const moduleBodyBlock = createSystemModuleBody(node, dependencyGroups);
100 const moduleName = tryGetModuleNameFromFile(factory, node, host, compilerOptions);
104 node,
[all …]
/third_party/selinux/libsepol/cil/src/
Dcil_tree.c44 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/
Dscheduler.c351 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/node/deps/npm/lib/commands/
Dls.js127 getChildren (node, nodeResult) { argument
129 const workspace = node.isWorkspace
130 const currentDepth = workspace ? 0 : node[_depth]
132 !(node instanceof Arborist.Node) || (currentDepth > depthToPrint)
135 : [...(node.target).edgesOut.values()]
142 .concat(appendExtraneousChildren({ node, seenPaths })) property
153 visit (node) { argument
154 node[_problems] = getProblems(node, { global })
157 ? getJsonOutputItem(node, { global, long })
160 : getHumanOutputItem(node, { args, chalk, global, long })
[all …]

12345678910>>...173