| /third_party/typescript/src/compiler/factory/ |
| D | nodeTests.ts | 4 export function isNumericLiteral(node: Node): node is NumericLiteral {
8 export function isBigIntLiteral(node: Node): node is BigIntLiteral {
12 export function isStringLiteral(node: Node): node is StringLiteral {
16 export function isJsxText(node: Node): node is JsxText {
20 export function isRegularExpressionLiteral(node: Node): node is RegularExpressionLiteral {
24 …export function isNoSubstitutionTemplateLiteral(node: Node): node is NoSubstitutionTemplateLiteral…
30 export function isTemplateHead(node: Node): node is TemplateHead {
34 export function isTemplateMiddle(node: Node): node is TemplateMiddle {
38 export function isTemplateTail(node: Node): node is TemplateTail {
44 export function isIdentifier(node: Node): node is Identifier {
[all …]
|
| /third_party/libxml2/result/pattern/ |
| D | multiple | 1 Node /c/b[1]/a[1] matches pattern a
2 Node /c/b[1]/a[2] matches pattern a
3 Node /c/c/b/a[1] matches pattern a
4 Node /c/c/b/a[2] matches pattern a
5 Node /c/b[2]/a[1] matches pattern a
6 Node /c/b[2]/a[2] matches pattern a
7 Node /c/b[1] matches pattern b
8 Node /c/c/b matches pattern b
9 Node /c/b[2] matches pattern b
10 Node /c matches pattern c
[all …]
|
| D | conj | 1 Node /a matches pattern a|b
2 Node /a/b matches pattern a|b
3 Node /a/b/c[1]/b matches pattern a|b
4 Node /a/b/c[2]/b matches pattern a|b
5 Node /a/b/c[2]/c/b matches pattern a|b
6 Node /a/c/b matches pattern a|b
7 Node /a matches pattern a|c
8 Node /a/b/c[1] matches pattern a|c
9 Node /a/b/c[2] matches pattern a|c
10 Node /a/b/c[2]/c matches pattern a|c
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/ |
| D | ItaniumDemangle.h | 113 class Node {
143 Node(Kind K_, Cache RHSComponentCache_ = Cache::No,
183 virtual const Node *getSyntaxNode(OutputStream &) const { in getSyntaxNode()
205 virtual ~Node() = default;
213 Node **Elements;
218 NodeArray(Node **Elements_, size_t NumElements_) in NodeArray()
224 Node **begin() const { return Elements; } in begin()
225 Node **end() const { return Elements + NumElements; } in end()
227 Node *operator[](size_t Idx) const { return Elements[Idx]; }
250 struct NodeArrayNode : Node {
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/BinaryFormat/ |
| D | AMDGPUMetadataVerifier.cpp | 23 msgpack::DocNode &Node, msgpack::Type SKind, in verifyScalar() argument
25 if (!Node.isScalar()) in verifyScalar()
27 if (Node.getKind() != SKind) { in verifyScalar()
32 if (Node.getKind() != msgpack::Type::String) in verifyScalar()
34 StringRef StringValue = Node.getString(); in verifyScalar()
35 Node.fromString(StringValue); in verifyScalar()
36 if (Node.getKind() != SKind) in verifyScalar()
40 return verifyValue(Node); in verifyScalar()
44 bool MetadataVerifier::verifyInteger(msgpack::DocNode &Node) { in verifyInteger() argument
45 if (!verifyScalar(Node, msgpack::Type::UInt)) in verifyInteger()
[all …]
|
| D | MsgPackDocument.cpp | 63 DocNode Node; member
96 DocNode Node; in readFromBlob() local
99 Node = getNode(); in readFromBlob()
102 Node = getNode(Obj.Int); in readFromBlob()
105 Node = getNode(Obj.UInt); in readFromBlob()
108 Node = getNode(Obj.Bool); in readFromBlob()
111 Node = getNode(Obj.Float); in readFromBlob()
114 Node = getNode(Obj.Raw); in readFromBlob()
117 Node = getMapNode(); in readFromBlob()
120 Node = getArrayNode(); in readFromBlob()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | LegalizeVectorOps.cpp | 91 SDValue UnrollVSETCC(SDNode *Node);
97 void Expand(SDNode *Node, SmallVectorImpl<SDValue> &Results);
101 void ExpandFP_TO_UINT(SDNode *Node, SmallVectorImpl<SDValue> &Results);
105 void ExpandUINT_TO_FLOAT(SDNode *Node, SmallVectorImpl<SDValue> &Results);
108 SDValue ExpandSEXTINREG(SDNode *Node);
115 SDValue ExpandANY_EXTEND_VECTOR_INREG(SDNode *Node);
122 SDValue ExpandSIGN_EXTEND_VECTOR_INREG(SDNode *Node);
128 SDValue ExpandZERO_EXTEND_VECTOR_INREG(SDNode *Node);
131 SDValue ExpandBSWAP(SDNode *Node);
135 SDValue ExpandVSELECT(SDNode *Node);
[all …]
|
| D | LegalizeDAG.cpp | 111 void LegalizeOp(SDNode *Node);
116 void LegalizeLoadOps(SDNode *Node);
117 void LegalizeStoreOps(SDNode *Node);
140 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
142 void ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
147 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
153 void ExpandArgFPLibCall(SDNode *Node,
158 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
159 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
165 SDValue ExpandBUILD_VECTOR(SDNode *Node);
[all …]
|
| /third_party/flutter/skia/src/xml/ |
| D | SkDOM.h | 29 typedef SkDOMNode Node; typedef
34 virtual const Node* build(SkStream&);
35 virtual const Node* copy(const SkDOM& dom, const Node* node);
37 const Node* getRootNode() const;
40 const Node* finishParsing();
46 Type getType(const Node*) const;
48 const char* getName(const Node*) const;
49 const Node* getFirstChild(const Node*, const char elem[] = nullptr) const;
50 const Node* getNextSibling(const Node*, const char elem[] = nullptr) const;
52 const char* findAttr(const Node*, const char attrName[]) const;
[all …]
|
| /third_party/skia/src/xml/ |
| D | SkDOM.h | 49 typedef SkDOMNode Node; typedef
51 static void walk_dom(const SkDOM& dom, const SkDOM::Node* node, SkXMLParser* parser);
54 virtual const Node* build(SkStream&);
56 virtual const Node* copy(const SkDOM& dom, const Node* node);
58 virtual const Node* finishParsing();
60 const Node* getRootNode() const;
66 Type getType(const Node*) const;
68 const char* getName(const Node*) const;
69 const Node* getFirstChild(const Node*, const char elem[] = nullptr) const;
70 const Node* getNextSibling(const Node*, const char elem[] = nullptr) const;
[all …]
|
| /third_party/rust/crates/bindgen/bindgen/ir/analysis/ |
| D | mod.rs | 81 type Node: Copy; typedef
101 fn initial_worklist(&self) -> Vec<Self::Node>; in initial_worklist() argument
110 fn constrain(&mut self, node: Self::Node) -> ConstrainResult; in constrain()
116 fn each_depending_on<F>(&self, node: Self::Node, f: F) in each_depending_on() argument
118 F: FnMut(Self::Node); in each_depending_on() argument
262 struct Node(usize); struct
265 struct Graph(HashMap<Node, Vec<Node>>);
270 g.0.insert(Node(1), vec![Node(3)]); in make_test_graph()
271 g.0.insert(Node(2), vec![Node(2)]); in make_test_graph()
272 g.0.insert(Node(3), vec![Node(4), Node(5)]); in make_test_graph()
[all …]
|
| /third_party/flutter/skia/third_party/externals/wuffs/lang/ast/ |
| D | ast.go | 143 type Node struct { struct
182 lhs *Node // Left Hand Side. argument
183 mhs *Node // Middle Hand Side. argument
184 rhs *Node // Right Hand Side. argument
186 list0 []*Node argument
187 list1 []*Node argument
188 list2 []*Node argument
191 func (n *Node) Kind() Kind { return n.kind } argument
192 func (n *Node) MBounds() interval.IntRange { return n.mBounds } argument
193 func (n *Node) MType() *TypeExpr { return n.mType } argument
[all …]
|
| /third_party/flutter/skia/tests/ |
| D | IncrTopoSortTest.cpp | 15 class Node : public SkRefCnt { class
26 for (Node* tmp : fNodesIDependOn) { in print()
32 for (Node* tmp : fNodesThatDependOnMe) { in print()
41 for (Node* dependedOn : fNodesIDependOn) { in validate()
44 for (Node* dependent : fNodesThatDependOnMe) { in validate()
50 static bool CompareIndicesGT(Node* const& a, Node* const& b) { in CompareIndicesGT()
55 Node* dependent(int index) const { in dependent()
63 explicit Node(char id) : fID(id), fIndexInSort(-1), fVisited(false) {} in Node() function in Node
67 void addDependency(Node* dependedOn) { in addDependency()
72 void addDependent(Node* dependent) { in addDependent()
[all …]
|
| /third_party/skia/tests/ |
| D | IncrTopoSortTest.cpp | 15 class Node : public SkRefCnt { class
26 for (Node* tmp : fNodesIDependOn) { in print()
32 for (Node* tmp : fNodesThatDependOnMe) { in print()
41 for (Node* dependedOn : fNodesIDependOn) { in validate()
44 for (Node* dependent : fNodesThatDependOnMe) { in validate()
50 static bool CompareIndicesGT(Node* const& a, Node* const& b) { in CompareIndicesGT()
55 Node* dependent(int index) const { in dependent()
63 explicit Node(char id) : fID(id), fIndexInSort(-1), fVisited(false) {} in Node() function in Node
67 void addDependency(Node* dependedOn) { in addDependency()
72 void addDependent(Node* dependent) { in addDependent()
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | LinkedListTests.cpp | 13 class Node : public LinkNode<Node> { class
15 explicit Node(int id) : id_(id) { in Node() function in Node
61 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection()
66 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); node != list.end(); in ExpectListContentsForDirection()
76 void ExpectListContents(const LinkedList<Node>& list, int num_nodes, const int* node_ids) { in ExpectListContents()
88 LinkedList<Node> list; in TEST()
95 LinkedList<Node> list; in TEST()
98 Node n1(1); in TEST()
108 Node n2(2); in TEST()
118 Node n3(3); in TEST()
[all …]
|
| /third_party/mesa3d/src/nouveau/codegen/ |
| D | nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
38 class Node;
52 Edge(Node *dst, Node *src, Type kind);
55 inline Node *getOrigin() const { return origin; } in getOrigin()
56 inline Node *getTarget() const { return target; } in getTarget()
62 Node *origin;
63 Node *target;
92 inline Node *getNode() const { assert(e); return d ? in getNode()
104 class Node
107 Node(void *);
[all …]
|
| /third_party/typescript/src/compiler/ |
| D | utilitiesPublic.ts | 248 for (let current: Node = d; current; current = current.parent) {
257 …export function isParameterPropertyDeclaration(node: Node, parent: Node): node is ParameterPropert…
283 function getCombinedFlags(node: Node, getFlags: (n: Node) => number): number {
317 export function getCombinedNodeFlags(node: Node): NodeFlags {
396 export function getOriginalNode(node: Node): Node;
397 …export function getOriginalNode<T extends Node>(node: Node, nodeTest: (node: Node) => node is T): …
398 export function getOriginalNode(node: Node | undefined): Node | undefined;
399 …export function getOriginalNode<T extends Node>(node: Node | undefined, nodeTest: (node: Node | un…
400 …export function getOriginalNode(node: Node | undefined, nodeTest?: (node: Node | undefined) => boo…
416 …export function findAncestor<T extends Node>(node: Node | undefined, callback: (element: Node) => …
[all …]
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/ |
| D | RangeTree.java | 124 private static final class Node implements DfaNode { class in RangeTree
126 private static final Node TERMINAL = new Node();
158 private Node() { in Node() method in RangeTree.Node
170 private Node(ImmutableList<Edge> edges, boolean canTerminate) { in Node() method in RangeTree.Node
220 Node findTarget(int digit) { in findTarget()
226 private Node targetFromJumpTableIndex(int n) { in targetFromJumpTableIndex()
276 if (!(o instanceof Node)) { in equals()
279 Node tree = (Node) o; in equals()
297 private final Node target;
299 private Edge(int mask, Node target) { in Edge()
[all …]
|
| /third_party/icu/icu4c/source/common/unicode/ |
| D | stringtriebuilder.h | 100 class Node; variable
104 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
106 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
160 Node *registerNode(Node *newNode, UErrorCode &errorCode);
171 Node *registerFinalValue(int32_t value, UErrorCode &errorCode);
200 class Node : public UObject {
202 Node(int32_t initialHash) : hash(initialHash), offset(0) {} in Node() function
205 … static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); } in hashCode()
207 virtual UBool operator==(const Node &other) const;
208 inline UBool operator!=(const Node &other) const { return !operator==(other); }
[all …]
|
| /third_party/node/deps/icu-small/source/common/unicode/ |
| D | stringtriebuilder.h | 100 class Node; variable
104 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
106 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
160 Node *registerNode(Node *newNode, UErrorCode &errorCode);
171 Node *registerFinalValue(int32_t value, UErrorCode &errorCode);
200 class Node : public UObject {
202 Node(int32_t initialHash) : hash(initialHash), offset(0) {} in Node() function
205 … static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); } in hashCode()
207 virtual bool operator==(const Node &other) const;
208 inline bool operator!=(const Node &other) const { return !operator==(other); }
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/common/unicode/ |
| D | stringtriebuilder.h | 97 class Node; variable
101 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
103 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
157 Node *registerNode(Node *newNode, UErrorCode &errorCode);
168 Node *registerFinalValue(int32_t value, UErrorCode &errorCode);
197 class Node : public UObject {
199 Node(int32_t initialHash) : hash(initialHash), offset(0) {} in Node() function
202 … static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); } in hashCode()
204 virtual UBool operator==(const Node &other) const;
205 inline UBool operator!=(const Node &other) const { return !operator==(other); }
[all …]
|
| /third_party/skia/third_party/externals/icu/source/common/unicode/ |
| D | stringtriebuilder.h | 100 class Node; variable
104 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
106 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
160 Node *registerNode(Node *newNode, UErrorCode &errorCode);
171 Node *registerFinalValue(int32_t value, UErrorCode &errorCode);
200 class Node : public UObject {
202 Node(int32_t initialHash) : hash(initialHash), offset(0) {} in Node() function
205 … static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); } in hashCode()
207 virtual UBool operator==(const Node &other) const;
208 inline UBool operator!=(const Node &other) const { return !operator==(other); }
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 114 class Node;
141 explicit Edge(Node &N, Kind K);
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
188 friend class LazyCallGraph::Node;
200 friend class LazyCallGraph::Node;
231 friend class LazyCallGraph::Node;
262 Edge &operator[](Node &N) {
269 Edge *lookup(Node &N) { in lookup()
296 DenseMap<Node *, int> EdgeIndexMap;
[all …]
|
| /third_party/skia/third_party/externals/spirv-cross/reference/shaders/vulkan/comp/ |
| D | buffer-reference.nocompat.vk.comp.vk | 6 layout(buffer_reference) buffer Node;
7 layout(buffer_reference, std430) buffer Node
10 layout(offset = 16) Node next;
11 layout(offset = 32) Node prev;
16 Node head1;
17 Node head2;
20 void copy_node(restrict Node dst, restrict Node a, restrict Node b)
25 void overwrite_node(out restrict Node dst, restrict Node src)
32 Node _45;
41 restrict Node n = _45;
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/WindowsManifest/ |
| D | WindowsManifestMerger.cpp | 98 static xmlAttrPtr getAttribute(xmlNodePtr Node, in getAttribute() argument
100 for (xmlAttrPtr Attribute = Node->properties; Attribute != nullptr; in getAttribute()
126 static xmlNsPtr search(const unsigned char *HRef, xmlNodePtr Node) { in search() argument
127 for (xmlNsPtr Def = Node->nsDef; Def; Def = Def->next) { in search()
132 if (Node->parent) { in search()
133 return search(HRef, Node->parent); in search()
154 xmlNodePtr Node) { in searchOrDefine() argument
155 if (xmlNsPtr Def = search(HRef, Node)) in searchOrDefine()
157 if (xmlNsPtr Def = xmlNewNs(Node, HRef, getPrefixForHref(HRef))) in searchOrDefine()
179 xmlNodePtr Node) { in getNamespaceWithPrefix() argument
[all …]
|