| /external/clang/lib/AST/ |
| D | StmtPrinter.cpp | 96 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt()
99 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr()
117 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt()
134 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt()
138 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt()
144 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt()
150 void StmtPrinter::VisitCaseStmt(CaseStmt *Node) { in VisitCaseStmt()
162 void StmtPrinter::VisitDefaultStmt(DefaultStmt *Node) { in VisitDefaultStmt()
167 void StmtPrinter::VisitLabelStmt(LabelStmt *Node) { in VisitLabelStmt()
172 void StmtPrinter::VisitAttributedStmt(AttributedStmt *Node) { in VisitAttributedStmt()
[all …]
|
| D | ASTDumper.cpp | 541 void VisitLambdaExpr(const LambdaExpr *Node) { in VisitLambdaExpr()
1767 void ASTDumper::VisitStmt(const Stmt *Node) { in VisitStmt()
1776 void ASTDumper::VisitDeclStmt(const DeclStmt *Node) { in VisitDeclStmt()
1784 void ASTDumper::VisitAttributedStmt(const AttributedStmt *Node) { in VisitAttributedStmt()
1792 void ASTDumper::VisitLabelStmt(const LabelStmt *Node) { in VisitLabelStmt()
1797 void ASTDumper::VisitGotoStmt(const GotoStmt *Node) { in VisitGotoStmt()
1803 void ASTDumper::VisitCXXCatchStmt(const CXXCatchStmt *Node) { in VisitCXXCatchStmt()
1808 void ASTDumper::VisitCapturedStmt(const CapturedStmt *Node) { in VisitCapturedStmt()
1818 const OMPExecutableDirective *Node) { in VisitOMPExecutableDirective()
1847 void ASTDumper::VisitExpr(const Expr *Node) { in VisitExpr()
[all …]
|
| /external/libaom/libaom/tools/txfm_analyzer/ |
| D | txfm_graph.h | 15 struct Node { struct
16 Node *inNode[2]; argument
17 int inNodeNum; argument
18 int inNodeIdx[2]; argument
19 double inWeight[2];
20 double value;
21 int nodeIdx;
22 int stageIdx;
23 int visited;
|
| /external/skia/src/sksl/ |
| D | SkSLCFGGenerator.h | 23 struct Node { struct
24 enum Kind {
29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression, in Node() function
36 std::unique_ptr<Expression>* expression() const { in expression()
41 void setExpression(std::unique_ptr<Expression> expr) { in setExpression()
46 std::unique_ptr<Statement>* statement() const { in statement()
51 void setStatement(std::unique_ptr<Statement> stmt) { in setStatement()
57 String description() const { in description()
90 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter);
|
| /external/skqp/src/sksl/ |
| D | SkSLCFGGenerator.h | 23 struct Node { struct
24 enum Kind {
29 Node(Kind kind, bool constantPropagation, std::unique_ptr<Expression>* expression, in Node() function
36 std::unique_ptr<Expression>* expression() const { in expression()
41 void setExpression(std::unique_ptr<Expression> expr) { in setExpression()
46 std::unique_ptr<Statement>* statement() const { in statement()
51 void setStatement(std::unique_ptr<Statement> stmt) { in setStatement()
56 String description() const { in description()
88 bool tryRemoveExpression(std::vector<BasicBlock::Node>::iterator* iter);
|
| /external/libcxx/test/libcxx/containers/associative/ |
| D | tree_right_rotate.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
26 Node* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
27 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
29 Node() : __left_(), __right_(), __parent_() {} in Node() argument
|
| D | tree_left_rotate.pass.cpp | 20 struct Node struct
22 Node* __left_; argument
23 Node* __right_; argument
24 Node* __parent_; argument
26 Node* __parent_unsafe() const { return __parent_; } in __parent_unsafe() argument
27 void __set_parent(Node* x) { __parent_ = x;} in __set_parent() argument
29 Node() : __left_(), __right_(), __parent_() {} in Node() function
|
| /external/swiftshader/src/Vulkan/ |
| D | VkDescriptorPool.hpp | 41 struct Node struct in vk::DescriptorPool
43 Node(uint8_t *set, size_t size) in Node() function
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;
|
| /external/llvm/unittests/ADT/ |
| D | ilistTest.cpp | 20 struct Node : ilist_node<Node> { struct
21 int Value;
23 Node() {} in Node() function
24 Node(int Value) : Value(Value) {} in Node() function
26 ~Node() { Value = -1; } in ~Node()
|
| /external/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 72 struct SpillPlacement::Node { struct in SpillPlacement
74 BlockFrequency BiasN;
76 BlockFrequency BiasP;
81 int Value;
83 typedef SmallVector<std::pair<BlockFrequency, unsigned>, 4> LinkVector;
87 LinkVector Links;
90 BlockFrequency SumLinkWeights;
93 bool preferReg() const { in preferReg()
99 bool mustSpill() const { in mustSpill()
108 void clear(const BlockFrequency &Threshold) { in clear()
[all …]
|
| /external/swiftshader/third_party/llvm-7.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 …]
|
| /external/tensorflow/tensorflow/lite/experimental/ruy/profiler/ |
| D | treeview.h | 34 struct Node { struct
35 std::vector<std::unique_ptr<Node>> children; argument
45 using ThreadRootsMap = std::map<std::uint32_t, std::unique_ptr<Node>>; argument
|
| /external/skqp/src/core/ |
| D | SkArenaAllocList.h | 51 struct Node { struct
53 Node(Args... args) : fT(std::forward<Args>(args)...) {} in Node() argument
55 Node* fNext = nullptr; argument
|
| D | SkRTree.h | 72 struct Node { struct
78 void search(Node* root, const SkRect& query, SkTDArray<int>* results) const; argument
|
| /external/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
|
| /external/libchrome/base/sampling_heap_profiler/ |
| D | lock_free_address_hash_set.h | 83 struct Node { struct
84 Node() : key(0), next(0) {} in Node() function
92 Node* FindNode(void* key) const; argument
103 inline LockFreeAddressHashSet::Node::Node(void* a_key) { in Node() function
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 99 inline QualType getUnderlyingType(const Expr &Node) { return Node.getType(); } in getUnderlyingType()
101 inline QualType getUnderlyingType(const ValueDecl &Node) { in getUnderlyingType()
105 inline QualType getUnderlyingType(const TypedefNameDecl &Node) { in getUnderlyingType()
112 getFunctionProtoType(const FunctionProtoType &Node) { in getFunctionProtoType()
116 inline const FunctionProtoType *getFunctionProtoType(const FunctionDecl &Node) { in getFunctionProtoType()
299 bool matches(const T &Node, in matches()
506 bool matches(const T &Node, in matches()
536 bool matches(const QualType &Node, ASTMatchFinder *Finder, in matches()
650 bool matchesNode(const T &Node) const override { in matchesNode()
659 bool matchesSpecialized(const CXXOperatorCallExpr &Node) const { in matchesSpecialized()
[all …]
|
| /external/clang/test/CXX/expr/expr.post/expr.ref/ |
| D | p3.cpp | 4 template<typename T> struct Node { struct
8 Node<T> n[1]; in splay() argument
|
| /external/OpenCL-CTS/test_conformance/SVM/ |
| D | common.h | 70 typedef struct Node{ struct
73 struct Node* pNext; argument
74 } Node; typedef
|
| /external/llvm/include/llvm/Support/ |
| D | GraphWriter.h | 69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { in getEdgeSourceLabels()
147 bool isNodeHidden(NodeType &Node) { in isNodeHidden()
151 bool isNodeHidden(NodeType *const *Node) { in isNodeHidden()
155 bool isNodeHidden(NodeType *Node) { in isNodeHidden()
159 void writeNode(NodeType& Node) { in writeNode()
163 void writeNode(NodeType *const *Node) { in writeNode()
167 void writeNode(NodeType *Node) { in writeNode()
240 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
|
| /external/gemmlowp/profiling/ |
| D | profiler.h | 158 struct Node { struct
159 std::vector<Node*> children; argument
162 Node() : label(nullptr), weight(0) {} in Node() argument
163 ~Node() { in ~Node() argument
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | AllocatorList.h | 36 struct Node : ilist_node<Node> { struct
39 Node &operator=(Node &&) = delete; argument
40 Node &operator=(const Node &) = delete; argument
42 Node(T &&V) : V(std::move(V)) {} in Node() argument
43 Node(const T &V) : V(V) {} in Node() function
44 template <class... Ts> Node(Ts &&... Vs) : V(std::forward<Ts>(Vs)...) {} in Node() function
48 using list_type = simple_ilist<Node>; argument
|
| /external/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()
|
| /external/clang/include/clang/Tooling/ |
| D | FixIt.h | 43 template <typename T> SourceRange getSourceRange(const T &Node) { in getSourceRange()
50 StringRef getText(const T &Node, const ASTContext &Context) { in getText()
56 template <typename T> FixItHint createRemoval(const T &Node) { in createRemoval()
|