| /third_party/ninja/src/ |
| D | graph.h | 39 struct Node { struct
40 Node(const std::string& path, uint64_t slash_bits) in Node() argument
63 /// Mark the Node as already-stat()ed and missing. argument
64 void MarkMissing() { in MarkMissing()
71 bool exists() const { in exists()
75 bool status_known() const { in status_known()
79 const std::string& path() const { return path_; } in path()
81 std::string PathDecanonicalized() const { in PathDecanonicalized()
86 uint64_t slash_bits() const { return slash_bits_; } in slash_bits()
88 TimeStamp mtime() const { return mtime_; } in mtime()
[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()
44 bool MetadataVerifier::verifyInteger(msgpack::DocNode &Node) { in verifyInteger()
52 msgpack::DocNode &Node, function_ref<bool(msgpack::DocNode &)> verifyNode, in verifyArray()
79 return verifyEntry(MapNode, Key, Required, [=](msgpack::DocNode &Node) { in verifyScalarEntry()
86 return verifyEntry(MapNode, Key, Required, [this](msgpack::DocNode &Node) { in verifyIntegerEntry()
91 bool MetadataVerifier::verifyKernelArgs(msgpack::DocNode &Node) { in verifyKernelArgs()
199 bool MetadataVerifier::verifyKernel(msgpack::DocNode &Node) { in verifyKernel()
224 KernelMap, ".language_version", false, [this](msgpack::DocNode &Node) { in verifyKernel()
227 [this](msgpack::DocNode &Node) { return verifyInteger(Node); }, 2); in verifyKernel()
230 if (!verifyEntry(KernelMap, ".args", false, [this](msgpack::DocNode &Node) { in verifyKernel()
[all …]
|
| /third_party/node/src/permission/ |
| D | fs_permission.h | 22 struct Node { struct
23 std::string prefix;
24 std::unordered_map<char, Node*> children;
25 Node* wildcard_child;
27 explicit Node(const std::string& pre) in Node() function
30 Node() : wildcard_child(nullptr) {} in Node() function
32 Node* CreateChild(std::string prefix) { in CreateChild()
60 Node* CreateWildcardChild() { in CreateWildcardChild()
68 Node* NextNode(const std::string& path, unsigned int idx) { in NextNode()
111 bool IsEndNode() { in IsEndNode()
|
| /third_party/skia/third_party/externals/swiftshader/src/Vulkan/ |
| D | VkDescriptorPool.hpp | 41 struct Node struct in vk::DescriptorPool
43 Node(uint8_t *set, size_t size) in Node() argument
47 bool operator<(const Node &node) const { return set < node.set; } in operator <()
48 bool operator==(const uint8_t *other) const { return set == other; } in operator ==()
50 uint8_t *set = nullptr;
51 size_t size = 0;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 79 struct SpillPlacement::Node { struct in SpillPlacement
81 BlockFrequency BiasN;
84 BlockFrequency BiasP;
89 int Value;
91 using LinkVector = SmallVector<std::pair<BlockFrequency, unsigned>, 4>;
95 LinkVector Links;
98 BlockFrequency SumLinkWeights;
101 bool preferReg() const { in preferReg()
107 bool mustSpill() const { in mustSpill()
116 void clear(const BlockFrequency &Threshold) { in clear()
[all …]
|
| /third_party/ffmpeg/libavcodec/ |
| D | huffman.h | 33 typedef struct Node { struct
37 } Node; argument
|
| /third_party/skia/tests/ |
| D | ArenaAllocTest.cpp | 120 struct Node { in DEF_TEST() struct
121 Node(Node* n) : next(n) { created++; } in DEF_TEST() function
122 ~Node() { destroyed++; } in DEF_TEST()
123 Node *next; in DEF_TEST()
124 char filler[64]; in DEF_TEST()
141 struct Node { in DEF_TEST() struct
142 Node(Node* n) : next(n) { created++; } in DEF_TEST() function
143 ~Node() { in DEF_TEST()
149 Node *next; in DEF_TEST()
|
| /third_party/skia/src/core/ |
| D | SkArenaAllocList.h | 51 struct Node { struct
53 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node() function
55 Node* fNext = nullptr; argument
|
| D | SkRTree.h | 60 struct Node { struct
66 void search(Node* root, const SkRect& query, std::vector<int>* results) const; argument
|
| /third_party/jinja2/ |
| D | visitor.py | 12 def __call__(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.Any:
28 def get_visitor(self, node: Node) -> "t.Optional[VisitCallable]":
35 def visit(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.Any:
44 def generic_visit(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.Any:
61 def generic_visit(self, node: Node, *args: t.Any, **kwargs: t.Any) -> Node:
83 def visit_list(self, node: Node, *args: t.Any, **kwargs: t.Any) -> t.List[Node]:
|
| /third_party/musl/libc-test/src/functionalext/supplement/search/search_gtest/ |
| D | search_tdelete_test.cpp | 11 struct Node { struct
12 explicit Node(int i) : i(i) {} in Node() function
18 return reinterpret_cast<const Node*>(rhs)->i - reinterpret_cast<const Node*>(lhs)->i; in NodeCmp() argument
|
| D | search_tfind_test.cpp | 11 struct Node { struct
12 explicit Node(int i) : i(i) {} in Node() function
18 return reinterpret_cast<const Node*>(rhs)->i - reinterpret_cast<const Node*>(lhs)->i; in NodeCmp() argument
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | TrailingPathOptimizer.java | 51 public static ValueGraph<Node, SimpleEdge> optimize(ValueGraph<Node, SimpleEdge> graph) { in optimize()
129 Node node, AnyPath path, MutableValueGraph<Node, SimpleEdge> g, Map<Node, AnyPath> anyPaths) { in recursivelyDetachTrailingPaths()
161 private static boolean beginsAnAnyPath(Node target, ValueGraph<Node, SimpleEdge> g) { in beginsAnAnyPath()
178 private static boolean canTerminate(Node node, ValueGraph<Node, SimpleEdge> g) { in canTerminate()
186 Node node, Node end, AnyPath path, Node lastAdded, MutableValueGraph<Node, SimpleEdge> out) { in addPath()
|
| D | NfaFlattener.java | 44 public static Edge flatten(ValueGraph<Node, SimpleEdge> graph) { in flatten()
70 private NfaFlattener(ValueGraph<Node, SimpleEdge> graph) { in NfaFlattener()
178 static Comparator<Node> nodeOrdering(ValueGraph<Node, ?> graph) { in nodeOrdering()
186 Node node, int length, ValueGraph<Node, ?> graph, Map<Node, Integer> map) { in recursivelySetMaxPathLength()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | AllocatorList.h | 35 struct Node : ilist_node<Node> { struct
38 Node &operator=(Node &&) = delete; argument
39 Node &operator=(const Node &) = delete; argument
41 Node(T &&V) : V(std::move(V)) {} in Node() argument
42 Node(const T &V) : V(V) {} in Node() function
43 template <class... Ts> Node(Ts &&... Vs) : V(std::forward<Ts>(Vs)...) {} in Node() function
47 using list_type = simple_ilist<Node>; argument
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | LegalizeVectorOps.cpp | 256 SDNode *Node = DAG.UpdateNodeOperands(Op.getNode(), Ops); in LegalizeOp() local
526 bool VectorLegalizer::LowerOperationWrapper(SDNode *Node, in LowerOperationWrapper()
555 void VectorLegalizer::Promote(SDNode *Node, SmallVectorImpl<SDValue> &Results) { in Promote()
619 void VectorLegalizer::PromoteINT_TO_FP(SDNode *Node, in PromoteINT_TO_FP()
660 void VectorLegalizer::PromoteFP_TO_INT(SDNode *Node, in PromoteFP_TO_INT()
841 void VectorLegalizer::Expand(SDNode *Node, SmallVectorImpl<SDValue> &Results) { in Expand()
998 SDValue VectorLegalizer::ExpandSELECT(SDNode *Node) { in ExpandSELECT()
1053 SDValue VectorLegalizer::ExpandSEXTINREG(SDNode *Node) { in ExpandSEXTINREG()
1074 SDValue VectorLegalizer::ExpandANY_EXTEND_VECTOR_INREG(SDNode *Node) { in ExpandANY_EXTEND_VECTOR_INREG()
1110 SDValue VectorLegalizer::ExpandSIGN_EXTEND_VECTOR_INREG(SDNode *Node) { in ExpandSIGN_EXTEND_VECTOR_INREG()
[all …]
|
| /third_party/skia/third_party/externals/tint/tools/src/cmd/check-spec-examples/ |
| D | main.go | 243 func gatherExamples(node *html.Node, examples *[]example) error {
267 func exampleCode(node *html.Node) string {
279 func printNodeText(node *html.Node, sb *strings.Builder) {
290 func hasClass(node *html.Node, class string) bool {
306 func nodeID(node *html.Node) string {
|
| /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()
116 fn each_depending_on<F>(&self, node: Self::Node, f: F) in each_depending_on()
118 F: FnMut(Self::Node); in each_depending_on()
262 struct Node(usize); struct
305 type Node = Node; typedef
318 fn initial_worklist(&self) -> Vec<Node> { in initial_worklist()
360 fn each_depending_on<F>(&self, node: Node, mut f: F) in each_depending_on()
362 F: FnMut(Node), in each_depending_on()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
| D | IceLiveness.h | 79 SizeT getNumVarsInNode(const CfgNode *Node) const { in getNumVarsInNode()
82 SizeT &getNumNonDeadPhis(const CfgNode *Node) { in getNumNonDeadPhis()
85 LivenessBV &getLiveIn(const CfgNode *Node) { in getLiveIn()
90 LivenessBV &getLiveOut(const CfgNode *Node) { in getLiveOut()
96 LiveBeginEndMap *getLiveBegin(const CfgNode *Node) { in getLiveBegin()
101 LiveBeginEndMap *getLiveEnd(const CfgNode *Node) { in getLiveEnd()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | DAGDeltaAlgorithm.cpp | 81 pred_iterator_ty pred_begin(change_ty Node) { in pred_begin()
85 pred_iterator_ty pred_end(change_ty Node) { in pred_end()
90 pred_closure_iterator_ty pred_closure_begin(change_ty Node) { in pred_closure_begin()
94 pred_closure_iterator_ty pred_closure_end(change_ty Node) { in pred_closure_end()
99 succ_iterator_ty succ_begin(change_ty Node) { in succ_begin()
103 succ_iterator_ty succ_end(change_ty Node) { in succ_end()
108 succ_closure_iterator_ty succ_closure_begin(change_ty Node) { in succ_closure_begin()
112 succ_closure_iterator_ty succ_closure_end(change_ty Node) { in succ_closure_end()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | DominanceFrontierImpl.h | 45 const DomTreeNodeT *Node; variable
59 BlockT *Node) { in addToFrontier()
67 iterator I, BlockT *Node) { in removeFromFrontier()
82 BlockT *Node = *I++; in compareDomSet() local
110 BlockT *Node = I->first; in compare() local
161 const DomTreeNodeT *Node) { in calculate()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Remarks/ |
| D | YAMLRemarkParser.cpp | 37 yaml::Stream &Stream, yaml::Node &Node) { in YAMLParseError()
178 Error YAMLRemarkParser::error(StringRef Message, yaml::Node &Node) { in error()
273 Expected<Type> YAMLRemarkParser::parseType(yaml::MappingNode &Node) { in parseType()
287 Expected<StringRef> YAMLRemarkParser::parseKey(yaml::KeyValueNode &Node) { in parseKey()
294 Expected<StringRef> YAMLRemarkParser::parseStr(yaml::KeyValueNode &Node) { in parseStr()
309 Expected<unsigned> YAMLRemarkParser::parseUnsigned(yaml::KeyValueNode &Node) { in parseUnsigned()
321 YAMLRemarkParser::parseDebugLoc(yaml::KeyValueNode &Node) { in parseDebugLoc()
363 Expected<Argument> YAMLRemarkParser::parseArg(yaml::Node &Node) { in parseArg()
430 Expected<StringRef> YAMLStrTabRemarkParser::parseStr(yaml::KeyValueNode &Node) { in parseStr()
|
| /third_party/rust/crates/syn/json/src/ |
| D | lib.rs | 76 pub struct Node { struct
80 pub ident: String,
83 pub features: Features,
91 pub data: Data,
94 pub exhaustive: bool,
|
| /third_party/mesa3d/src/imagination/csbgen/ |
| D | gen_pack_header.py | 96 class Node(ABC): class
102 def __init__(self, parent: Node, name: str, *, name_is_safe: bool = False) -> None:
120 def add(self, element: Node) -> None:
151 def add(self, element: Node) -> None:
212 def __init__(self, parent: Node, name: str) -> None:
227 def add(self, element: Node) -> None:
252 def __init__(self, parent: Node, name: str, value: int) -> None:
270 def __init__(self, parent: Node, name: str, length: int) -> None:
300 def add(self, element: Node) -> None:
418 def __init__(self, parent: Node, name: str, start: int, end: int, ty: str, *,
[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()
126 static xmlNsPtr search(const unsigned char *HRef, xmlNodePtr Node) { in search()
154 xmlNodePtr Node) { in searchOrDefine()
179 xmlNodePtr Node) { in getNamespaceWithPrefix()
193 static xmlNsPtr getClosestDefault(xmlNodePtr Node) { in getClosestDefault()
290 static bool hasInheritedNs(xmlNodePtr Node) { in hasInheritedNs()
296 static bool hasInheritedDefaultNs(xmlNodePtr Node) { in hasInheritedDefaultNs()
301 static bool hasDefinedDefaultNamespace(xmlNodePtr Node) { in hasDefinedDefaultNamespace()
310 static void explicateNamespace(xmlNsPtr PrefixDef, xmlNodePtr Node) { in explicateNamespace()
482 static bool hasRecognizedNamespace(xmlNodePtr Node) { in hasRecognizedNamespace()
[all …]
|