/third_party/typescript/tests/baselines/reference/ |
H A D | parserRealSource3.js | 8 // Note: Any addition to the NodeType should also be supported with addition to AstWalkerDetailCallback 9 export enum NodeType { 128 // Note: Any addition to the NodeType should also be supported with addition to AstWalkerDetailCallback
129 var NodeType;
130 (function (NodeType) {
131 NodeType[NodeType["None"] = 0] = "None";
132 NodeType[NodeType["Empty"] = 1] = "Empty";
133 NodeType[NodeTyp [all...] |
H A D | parserRealSource10.js | 189 if (binopNodeType != NodeType.None) { 193 if (unopNodeType != NodeType.None) { 199 setTokenInfo(TokenID.Any, Reservation.TypeScript, OperatorPrecedence.None, NodeType.None, OperatorPrecedence.None, NodeType.None, "any", ErrorRecoverySet.PrimType); 200 setTokenInfo(TokenID.Bool, Reservation.TypeScript, OperatorPrecedence.None, NodeType.None, OperatorPrecedence.None, NodeType.None, "boolean", ErrorRecoverySet.PrimType); 201 setTokenInfo(TokenID.Break, Reservation.TypeScriptAndJS, OperatorPrecedence.None, NodeType.None, OperatorPrecedence.None, NodeType.None, "break", ErrorRecoverySet.Stmt); 202 setTokenInfo(TokenID.Case, Reservation.TypeScriptAndJS, OperatorPrecedence.None, NodeType.None, OperatorPrecedence.None, NodeType [all...] |
H A D | parserRealSource14.js | 69 public nodeType(): TypeScript.NodeType { 71 return TypeScript.NodeType.None; 95 return (this.ast().nodeType === TypeScript.NodeType.Name) && 96 (this.parent().nodeType === TypeScript.NodeType.ClassDeclaration) && 104 return (this.ast().nodeType === TypeScript.NodeType.Name) && 105 (this.parent().nodeType === TypeScript.NodeType.InterfaceDeclaration) && 113 return (this.ast().nodeType === TypeScript.NodeType.Name) && 114 (this.parent().nodeType === TypeScript.NodeType.ArgDecl) && 122 return (this.ast().nodeType === TypeScript.NodeType.Name) && 123 (this.parent().nodeType === TypeScript.NodeType [all...] |
H A D | parserRealSource12.js | 95 this.childrenWalkers[NodeType.None] = ChildrenWalkers.walkNone; 96 this.childrenWalkers[NodeType.Empty] = ChildrenWalkers.walkNone; 97 this.childrenWalkers[NodeType.EmptyExpr] = ChildrenWalkers.walkNone; 98 this.childrenWalkers[NodeType.True] = ChildrenWalkers.walkNone; 99 this.childrenWalkers[NodeType.False] = ChildrenWalkers.walkNone; 100 this.childrenWalkers[NodeType.This] = ChildrenWalkers.walkNone; 101 this.childrenWalkers[NodeType.Super] = ChildrenWalkers.walkNone; 102 this.childrenWalkers[NodeType.QString] = ChildrenWalkers.walkNone; 103 this.childrenWalkers[NodeType.Regex] = ChildrenWalkers.walkNone; 104 this.childrenWalkers[NodeType [all...] |
H A D | parserRealSource11.js | 25 constructor (public nodeType: NodeType) { 39 case NodeType.Error: 40 case NodeType.EmptyExpr: 43 case NodeType.This: 45 case NodeType.Null: 48 case NodeType.False: 49 case NodeType.True: 52 case NodeType.Super: 54 case NodeType.EndCode: 55 case NodeType [all...] |
H A D | parserRealSource8.js | 211 context.scopeChain.previous.scope.container.declAST.nodeType == NodeType.FuncDecl && 257 container.declAST.nodeType == NodeType.FuncDecl && 287 ((!fgSym || fgSym.declAST.nodeType != NodeType.FuncDecl) && funcDecl.isAccessor()) || 395 if (ast.nodeType == NodeType.List) { 399 else if (ast.nodeType == NodeType.ModuleDeclaration) { 402 else if (ast.nodeType == NodeType.ClassDeclaration) { 405 else if (ast.nodeType == NodeType.InterfaceDeclaration) { 408 else if (ast.nodeType == NodeType.With) { 411 else if (ast.nodeType == NodeType.FuncDecl) { 414 else if (ast.nodeType == NodeType [all...] |
H A D | parserRealSource6.js | 121 if (ast.nodeType == NodeType.Script && context.pos > limChar) 127 case NodeType.Script: 135 case NodeType.ClassDeclaration: 143 case NodeType.ObjectLit: 157 case NodeType.ModuleDeclaration: 165 case NodeType.InterfaceDeclaration: 172 case NodeType.FuncDecl: { 330 if (ast.nodeType == NodeType.Script && context.pos > limChar)
335 case NodeType.Script:
342 case NodeType [all...] |
H A D | parserRealSource7.js | 102 case NodeType.Name: 124 case NodeType.Dot: 232 if (symbol && symbol.declAST && symbol.declAST.nodeType != NodeType.ModuleDeclaration) { 315 valTypeSymbol.declAST.nodeType == NodeType.FuncDecl && 614 containerSym.declAST.nodeType == NodeType.FuncDecl && 711 if (!isConstructor && fgSym.declAST.nodeType == NodeType.FuncDecl && !(<FuncDecl>fgSym.declAST).isAccessor() && !(<FuncDecl>fgSym.declAST).isSignature()) { 737 if (((!fgSym || fgSym.declAST.nodeType != NodeType.FuncDecl) && funcDecl.isAccessor()) || (fgSym && fgSym.isAccessor())) { 773 if (ast.nodeType == NodeType.Script) { 778 else if (ast.nodeType == NodeType.List) { 781 else if (ast.nodeType == NodeType [all...] |
/third_party/skia/third_party/externals/spirv-tools/source/util/ |
H A D | ilist.h | 48 template <class NodeType> 52 std::is_base_of<IntrusiveNodeBase<NodeType>, NodeType>::value, 110 NodeType* first_node = list->sentinel_.next_node_; in MoveBefore() 111 NodeType* last_node = list->sentinel_.previous_node_; in MoveBefore() 144 using iterator = iterator_template<NodeType>; 145 using const_iterator = iterator_template<const NodeType>; 169 void push_back(NodeType* node); 179 NodeType& front(); 180 NodeType [all...] |
H A D | ilist_node.h | 23 template <class NodeType> 29 template <class NodeType> 50 inline NodeType* NextNode() const; 55 inline NodeType* PreviousNode() const; 61 // It is assumed that the given node is of type NodeType. It is an error if 63 inline void InsertBefore(NodeType* pos); 69 // It is assumed that the given node is of type NodeType. It is an error if 71 inline void InsertAfter(NodeType* pos); 90 void ReplaceWith(NodeType* target); 98 NodeType* next_node [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/util/ |
H A D | ilist.h | 48 template <class NodeType> 52 std::is_base_of<IntrusiveNodeBase<NodeType>, NodeType>::value, 110 NodeType* first_node = list->sentinel_.next_node_; in MoveBefore() 111 NodeType* last_node = list->sentinel_.previous_node_; in MoveBefore() 144 using iterator = iterator_template<NodeType>; 145 using const_iterator = iterator_template<const NodeType>; 169 void push_back(NodeType* node); 179 NodeType& front(); 180 NodeType [all...] |
H A D | ilist_node.h | 23 template <class NodeType> 29 template <class NodeType> 50 inline NodeType* NextNode() const; 55 inline NodeType* PreviousNode() const; 61 // It is assumed that the given node is of type NodeType. It is an error if 63 inline void InsertBefore(NodeType* pos); 69 // It is assumed that the given node is of type NodeType. It is an error if 71 inline void InsertAfter(NodeType* pos); 90 void ReplaceWith(NodeType* target); 98 NodeType* next_node [all...] |
/third_party/spirv-tools/source/util/ |
H A D | ilist.h | 48 template <class NodeType> 52 std::is_base_of<IntrusiveNodeBase<NodeType>, NodeType>::value, 110 NodeType* first_node = list->sentinel_.next_node_; in MoveBefore() 111 NodeType* last_node = list->sentinel_.previous_node_; in MoveBefore() 144 using iterator = iterator_template<NodeType>; 145 using const_iterator = iterator_template<const NodeType>; 169 void push_back(NodeType* node); 179 NodeType& front(); 180 NodeType [all...] |
H A D | ilist_node.h | 23 template <class NodeType> 29 template <class NodeType> 50 inline NodeType* NextNode() const; 55 inline NodeType* PreviousNode() const; 61 // It is assumed that the given node is of type NodeType. It is an error if 63 inline void InsertBefore(NodeType* pos); 69 // It is assumed that the given node is of type NodeType. It is an error if 71 inline void InsertAfter(NodeType* pos); 90 void ReplaceWith(NodeType* target); 98 NodeType* next_node [all...] |
/third_party/vk-gl-cts/external/amber/src/src/vkscript/ |
H A D | section_parser_test.cc | 48 EXPECT_EQ(NodeType::kShader, sections[0].section_type); in TEST_F() 63 EXPECT_EQ(NodeType::kShader, sections[0].section_type); in TEST_F() 100 EXPECT_EQ(NodeType::kShader, sections[0].section_type); in TEST_F() 106 EXPECT_EQ(NodeType::kShader, sections[1].section_type); in TEST_F() 112 EXPECT_EQ(NodeType::kShader, sections[2].section_type); in TEST_F() 118 EXPECT_EQ(NodeType::kIndices, sections[3].section_type); in TEST_F() 123 EXPECT_EQ(NodeType::kTest, sections[4].section_type); in TEST_F() 137 EXPECT_EQ(NodeType::kShader, sections[0].section_type); in TEST_F() 152 EXPECT_EQ(NodeType::kShader, sections[0].section_type); in TEST_F() 188 NodeType section_typ in TEST_F() [all...] |
H A D | section_parser.cc | 29 bool SectionParser::HasShader(const NodeType type) { in HasShader() 30 return type == NodeType::kShader; in HasShader() 45 NodeType* section_type, in NameToNodeType() 76 *section_type = NodeType::kComment; in NameToNodeType() 78 *section_type = NodeType::kIndices; in NameToNodeType() 80 *section_type = NodeType::kRequire; in NameToNodeType() 82 *section_type = NodeType::kTest; in NameToNodeType() 84 *section_type = NodeType::kVertexData; in NameToNodeType() 86 *section_type = NodeType::kShader; in NameToNodeType() 91 *section_type = NodeType in NameToNodeType() [all...] |
H A D | section_parser.h | 28 enum class NodeType : uint8_t { class 43 NodeType section_type; 50 static bool HasShader(const NodeType type); 63 NodeType* section_type, in NameToNodeTypeForTesting() 71 void AddSection(NodeType section_type, 77 NodeType* section_type,
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
H A D | DirectedGraph.h | 27 template <class NodeType, class EdgeType> class DGEdge { 31 explicit DGEdge(NodeType &N) : TargetNode(N) {} in DGEdge() 32 explicit DGEdge(const DGEdge<NodeType, EdgeType> &E) in DGEdge() 34 DGEdge<NodeType, EdgeType> &operator=(const DGEdge<NodeType, EdgeType> &E) { in operator =() 45 const NodeType &getTargetNode() const { return TargetNode; } in getTargetNode() 46 NodeType &getTargetNode() { in getTargetNode() 47 return const_cast<NodeType &>( in getTargetNode() 48 static_cast<const DGEdge<NodeType, EdgeType> &>(*this).getTargetNode()); in getTargetNode() 52 void setTargetNode(const NodeType [all...] |
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
H A D | NodeType.h | 15 enum class NodeType class 42 NodeType nodeType; 47 NodeType operator()(TIntermNode &node) in operator ()() 54 void visitSymbol(TIntermSymbol *) override { nodeType = NodeType::Symbol; } 56 void visitConstantUnion(TIntermConstantUnion *) override { nodeType = NodeType::ConstantUnion; } 60 nodeType = NodeType::FunctionPrototype; 65 nodeType = NodeType::PreprocessorDirective; 70 nodeType = NodeType::Swizzle; 76 nodeType = NodeType::Binary; 82 nodeType = NodeType [all...] |
H A D | IntermRebuild.cpp | 324 const NodeType currNodeType = getNodeType(*currNode); in traverseAny() 345 const NodeType originalNodeType = getNodeType(originalNode); in traversePre() 349 case NodeType::Unknown: in traversePre() 352 case NodeType::Symbol: in traversePre() 354 case NodeType::ConstantUnion: in traversePre() 356 case NodeType::FunctionPrototype: in traversePre() 358 case NodeType::PreprocessorDirective: in traversePre() 360 case NodeType::Unary: in traversePre() 362 case NodeType::Binary: in traversePre() 364 case NodeType in traversePre() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
H A D | DependenceGraphBuilder.h | 33 using NodeType = typename GraphType::NodeType; 38 using NodeListType = SmallVector<NodeType *, 4>; 100 virtual NodeType &createRootNode() = 0; 103 virtual NodeType &createFineGrainedNode(Instruction &I) = 0; 107 virtual NodeType &createPiBlock(const NodeListType &L) = 0; 110 virtual EdgeType &createDefUseEdge(NodeType &Src, NodeType &Tgt) = 0; 113 virtual EdgeType &createMemoryEdge(NodeType &Src, NodeType [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
H A D | DependenceGraphBuilder.cpp | 79 df_iterator_default_set<const NodeType *, 4> Visited; in createAndConnectRootNode() 123 llvm::sort(NL, [&](NodeType *LHS, NodeType *RHS) { in createPiBlocks() 127 NodeType &PiNode = createPiBlock(NL); in createPiBlocks() 132 SmallPtrSet<NodeType *, 4> NodesInSCC(NL.begin(), NL.end()); in createPiBlocks() 136 for (NodeType *N : Graph) { in createPiBlocks() 142 for (NodeType *SCCNode : NL) { in createPiBlocks() 162 auto createEdgeOfKind = [this](NodeType &Src, NodeType &Dst, in createPiBlocks() 179 auto reconnectEdges = [&](NodeType *Sr in createPiBlocks() [all...] |
/third_party/node/deps/v8/src/handles/ |
H A D | global-handles.cc | 48 using NodeType = _NodeType; 50 V8_INLINE static const NodeBlock* From(const NodeType* node); 51 V8_INLINE static NodeBlock* From(NodeType* node); 54 GlobalHandles::NodeSpace<NodeType>* space, 62 NodeType* at(size_t index) { return &nodes_[index]; } in at() 63 const NodeType* at(size_t index) const { return &nodes_[index]; } in at() 64 GlobalHandles::NodeSpace<NodeType>* space() const { return space_; } in space() 108 NodeType nodes_[kBlockSize]; 111 GlobalHandles::NodeSpace<NodeType>* const space_; 118 template <class NodeType> [all...] |
/third_party/gn/src/gn/ |
H A D | pointer_set.h | 62 using NodeType = PointerSetNode; 63 using BaseType = HashTableBase<NodeType>; 101 NodeType* node = Lookup(ptr); in add() 116 NodeType* node = Lookup(ptr); in erase() 206 NodeType* Lookup(T* ptr) const { in Lookup() 207 size_t hash = NodeType::MakeHash(ptr); in Lookup() 208 return NodeLookup(hash, [&](NodeType* node) { return node->ptr_ == ptr; }); in Lookup()
|
H A D | builder_record_map.h | 31 using NodeType = BuilderRecordNode; 50 NodeType* node = Lookup(label); in try_emplace() 73 NodeType* Lookup(const Label& label) const { in Lookup() 74 return NodeLookup(label.hash(), [&label](const NodeType* node) { in Lookup()
|