| /llvm-project/libcxx/test/std/containers/container.node/ |
| H A D | node_handle.nodiscard.verify.cpp | 25 std::map<int, int>::node_type node; in test() local
29 std::multimap<int, int>::node_type node; in test() local
34 std::set<int> node; in test() local
38 std::multiset<int> node; in test() local
42 std::unordered_map<int, int> node; in test() local
46 std::unordered_multimap<int, int> node; in test() local
50 std::unordered_set<int> node; in test() local
54 std::unordered_multiset<int> node; in test() local
|
| /llvm-project/lldb/test/API/functionalities/recursion/ |
| H A D | main.cpp | 6 struct node { struct
8 node* next; argument
9 node () : value(1),next(NULL) {} in node() argument
10 node (int v) : value(v), next(NULL) {} in node() function
|
| /llvm-project/mlir/lib/Target/LLVMIR/ |
| H A D | DebugImporter.cpp | 53 DIBasicTypeAttr DebugImporter::translateImpl(llvm::DIBasicType *node) { in translateImpl() argument
58 DICompileUnitAttr DebugImporter::translateImpl(llvm::DICompileUnit *node) { in translateImpl() argument
71 translateImpl(llvm::DICompositeType * node) translateImpl() argument
103 translateImpl(llvm::DIDerivedType * node) translateImpl() argument
116 translateImpl(llvm::DIStringType * node) translateImpl() argument
125 translateImpl(llvm::DIFile * node) translateImpl() argument
129 translateImpl(llvm::DILabel * node) translateImpl() argument
139 translateImpl(llvm::DILexicalBlock * node) translateImpl() argument
149 translateImpl(llvm::DILexicalBlockFile * node) translateImpl() argument
159 translateImpl(llvm::DIGlobalVariable * node) translateImpl() argument
175 translateImpl(llvm::DILocalVariable * node) translateImpl() argument
186 translateImpl(llvm::DIVariable * node) translateImpl() argument
190 translateImpl(llvm::DIScope * node) translateImpl() argument
194 translateImpl(llvm::DIModule * node) translateImpl() argument
204 translateImpl(llvm::DINamespace * node) translateImpl() argument
210 translateImpl(llvm::DISubprogram * node) translateImpl() argument
232 translateImpl(llvm::DISubrange * node) translateImpl() argument
262 translateImpl(llvm::DISubroutineType * node) translateImpl() argument
281 translateImpl(llvm::DIType * node) translateImpl() argument
285 translate(llvm::DINode * node) translate() argument
302 __anoncd650c700402(llvm::DINode *node) translate() argument
355 getRecSelfConstructor(llvm::DINode * node) getRecSelfConstructor() argument
365 pruneOrPushTranslationStack(llvm::DINode * node) pruneOrPushTranslationStack() argument
397 finalizeTranslation(llvm::DINode * node,DINodeAttr result) finalizeTranslation() argument
426 popTranslationStack(llvm::DINode * node) popTranslationStack() argument
449 lookup(llvm::DINode * node) lookup() argument
488 translateExpression(llvm::DIExpression * node) translateExpression() argument
507 translateGlobalVariableExpression(llvm::DIGlobalVariableExpression * node) translateGlobalVariableExpression() argument
519 getOrCreateDistinctID(llvm::DINode * node) getOrCreateDistinctID() argument
[all...] |
| /llvm-project/polly/lib/External/isl/ |
| H A D | isl_schedule_node.c | 31 isl_schedule_node *node; in isl_schedule_node_alloc() local
69 isl_schedule_node *node; in isl_schedule_node_from_domain() local
87 isl_schedule_node *node; in isl_schedule_node_from_extension() local
103 isl_ctx *isl_schedule_node_get_ctx(__isl_keep isl_schedule_node *node) in isl_schedule_node_get_ctx()
111 __isl_keep isl_schedule_node *node) in isl_schedule_node_peek_leaf()
119 __isl_keep isl_schedule_node *node) in isl_schedule_node_get_leaf()
127 __isl_keep isl_schedule_node *node) in isl_schedule_node_get_type()
136 __isl_keep isl_schedule_node *node) in isl_schedule_node_get_parent_type()
167 __isl_keep isl_schedule_node *node) in isl_schedule_node_get_tree()
178 __isl_keep isl_schedule_node *node) in isl_schedule_node_get_schedule()
[all …]
|
| H A D | isl_test_python.py | 361 def inc_count(node): argument
368 def fail_map(node): argument
381 def inc_count(node): argument
390 def inc_count(node): argument
397 def is_not_domain(node): argument
403 def fail(node): argument
416 def collect_filters(node): argument
434 def mark_unroll(node): argument
444 def inc_count_ast(node, build): argument
466 def inc_count_ast(node, build): argument
[all …]
|
| H A D | isl_ast.c | 118 __isl_keep isl_ast_node *node, void *user), in isl_ast_print_options_set_print_user()
139 __isl_keep isl_ast_node *node, void *user), in isl_ast_print_options_set_print_for()
902 isl_ctx *isl_ast_node_get_ctx(__isl_keep isl_ast_node *node) in isl_ast_node_get_ctx()
907 enum isl_ast_node_type isl_ast_node_get_type(__isl_keep isl_ast_node *node) in isl_ast_node_get_type()
915 isl_ast_node *node; in isl_ast_node_alloc() local
935 isl_ast_node *node; in isl_ast_node_alloc_if() local
957 isl_ast_node *node; in isl_ast_node_alloc_for() local
981 __isl_take isl_ast_node *node) in isl_ast_node_alloc_mark()
1010 isl_ast_node *node; in isl_ast_node_user_from_expr() local
1040 isl_ast_node *node; in isl_ast_node_block_from_children() local
[all …]
|
| H A D | isl_schedule.c | 249 isl_bool (*fn)(__isl_keep isl_schedule_node *node, void *user), in isl_schedule_foreach_schedule_node_top_down()
252 isl_schedule_node *node; in isl_schedule_foreach_schedule_node_top_down() local
272 __isl_give isl_schedule *isl_schedule_map_schedule_node_bottom_up( in isl_schedule_map_schedule_node_bottom_up()
277 isl_schedule_node *node; in isl_schedule_map_schedule_node_bottom_up() local
293 __isl_take isl_schedule_node *node, void *user) in reset_user()
312 __isl_take isl_schedule_node *node, void *user) in align_params()
335 __isl_take isl_schedule_node *node, void *user) in pullback_upma()
372 isl_schedule_node *node; in isl_schedule_expand() local
399 isl_schedule_node *node; in isl_schedule_intersect_domain() local
429 isl_schedule_node *node; in isl_schedule_gist_domain_params() local
[all …]
|
| H A D | isl_test_cpp-checked.cc | 192 auto fail_map = [](isl::schedule_node node) { in test_schedule_tree()
198 auto inc_count = [&count](isl::schedule_node node) { in test_schedule_tree()
206 auto inc_count_once = [&count](isl::schedule_node node) { in test_schedule_tree()
213 auto is_not_domain = [](isl::schedule_node node) { in test_schedule_tree()
219 auto fail = [](isl::schedule_node node) { in test_schedule_tree()
226 auto collect_filters = [&filters](isl::schedule_node node) { in test_schedule_tree()
263 [&count_ast](isl::ast_node node, isl::ast_build build) { in test_ast_build()
|
| H A D | isl_scheduler.c | 58 struct isl_sched_node *node = (struct isl_sched_node *)entry; in node_has_tuples() local
64 int isl_sched_node_scc_exactly(struct isl_sched_node *node, int scc) in isl_sched_node_scc_exactly()
69 static int node_scc_at_most(struct isl_sched_node *node, int scc) in node_scc_at_most()
74 static int node_scc_at_least(struct isl_sched_node *node, int scc) in node_scc_at_least()
229 struct isl_sched_node *node) in isl_sched_graph_is_node()
495 struct isl_sched_node *node) in clear_node()
612 static isl_stat set_max_coefficient(isl_ctx *ctx, struct isl_sched_node *node) in set_max_coefficient()
644 struct isl_sched_node *node) in compute_max_coefficient()
696 struct isl_sched_node *node) in construct_compressed_id()
792 static isl_stat compress_node(struct isl_sched_node *node, in compress_node()
[all …]
|
| H A D | isl_test_cpp.cc | 214 auto fail_map = [](isl::schedule_node node) { in test_schedule_tree()
228 auto inc_count = [&count](isl::schedule_node node) { in test_schedule_tree()
236 auto inc_count_once = [&count](isl::schedule_node node) { in test_schedule_tree()
243 auto is_not_domain = [](isl::schedule_node node) { in test_schedule_tree()
249 auto fail = [](isl::schedule_node node) { in test_schedule_tree()
264 auto collect_filters = [&filters](isl::schedule_node node) { in test_schedule_tree()
308 [&count_ast](isl::ast_node node, isl::ast_build build) { in test_ast_build()
|
| /llvm-project/mlir/examples/toy/Ch7/parser/ |
| H A D | AST.cpp | 69 static std::string loc(T *node) { in loc()
87 VariableExprAST>([&](auto *node) { this->dump(node); }) in dump()
147 void ASTDumper::dump(LiteralExprAST *node) { in dump()
155 void ASTDumper::dump(StructLiteralExprAST *node) { in dump()
165 void ASTDumper::dump(VariableExprAST *node) { in dump()
171 void ASTDumper::dump(ReturnExprAST *node) { in dump()
183 void ASTDumper::dump(BinaryExprAST *node) { in dump()
192 void ASTDumper::dump(CallExprAST *node) { in dump()
202 void ASTDumper::dump(PrintExprAST *node) { in dump()
222 void ASTDumper::dump(PrototypeAST *node) { in dump()
[all …]
|
| /llvm-project/mlir/examples/toy/Ch2/parser/ |
| H A D | AST.cpp | 67 static std::string loc(T *node) { in loc()
85 [&](auto *node) { this->dump(node); }) in dump()
144 void ASTDumper::dump(LiteralExprAST *node) { in dump()
152 void ASTDumper::dump(VariableExprAST *node) { in dump()
158 void ASTDumper::dump(ReturnExprAST *node) { in dump()
170 void ASTDumper::dump(BinaryExprAST *node) { in dump()
179 void ASTDumper::dump(CallExprAST *node) { in dump()
189 void ASTDumper::dump(PrintExprAST *node) { in dump()
206 void ASTDumper::dump(PrototypeAST *node) { in dump()
217 void ASTDumper::dump(FunctionAST *node) { in dump()
[all …]
|
| /llvm-project/mlir/examples/toy/Ch5/parser/ |
| H A D | AST.cpp | 67 static std::string loc(T *node) { in loc()
85 [&](auto *node) { this->dump(node); }) in dump()
144 void ASTDumper::dump(LiteralExprAST *node) { in dump()
152 void ASTDumper::dump(VariableExprAST *node) { in dump()
158 void ASTDumper::dump(ReturnExprAST *node) { in dump()
170 void ASTDumper::dump(BinaryExprAST *node) { in dump()
179 void ASTDumper::dump(CallExprAST *node) { in dump()
189 void ASTDumper::dump(PrintExprAST *node) { in dump()
206 void ASTDumper::dump(PrototypeAST *node) { in dump()
217 void ASTDumper::dump(FunctionAST *node) { in dump()
[all …]
|
| /llvm-project/mlir/examples/toy/Ch1/parser/ |
| H A D | AST.cpp | 67 static std::string loc(T *node) { in loc()
85 [&](auto *node) { this->dump(node); }) in dump()
144 void ASTDumper::dump(LiteralExprAST *node) { in dump()
152 void ASTDumper::dump(VariableExprAST *node) { in dump()
158 void ASTDumper::dump(ReturnExprAST *node) { in dump()
170 void ASTDumper::dump(BinaryExprAST *node) { in dump()
179 void ASTDumper::dump(CallExprAST *node) { in dump()
189 void ASTDumper::dump(PrintExprAST *node) { in dump()
206 void ASTDumper::dump(PrototypeAST *node) { in dump()
217 void ASTDumper::dump(FunctionAST *node) { in dump()
[all …]
|
| /llvm-project/mlir/examples/toy/Ch6/parser/ |
| H A D | AST.cpp | 67 static std::string loc(T *node) { in loc()
85 [&](auto *node) { this->dump(node); }) in dump()
144 void ASTDumper::dump(LiteralExprAST *node) { in dump()
152 void ASTDumper::dump(VariableExprAST *node) { in dump()
158 void ASTDumper::dump(ReturnExprAST *node) { in dump()
170 void ASTDumper::dump(BinaryExprAST *node) { in dump()
179 void ASTDumper::dump(CallExprAST *node) { in dump()
189 void ASTDumper::dump(PrintExprAST *node) { in dump()
206 void ASTDumper::dump(PrototypeAST *node) { in dump()
217 void ASTDumper::dump(FunctionAST *node) { in dump()
[all …]
|
| /llvm-project/mlir/examples/toy/Ch3/parser/ |
| H A D | AST.cpp | 67 static std::string loc(T *node) { in loc()
85 [&](auto *node) { this->dump(node); }) in dump()
144 void ASTDumper::dump(LiteralExprAST *node) { in dump()
152 void ASTDumper::dump(VariableExprAST *node) { in dump()
158 void ASTDumper::dump(ReturnExprAST *node) { in dump()
170 void ASTDumper::dump(BinaryExprAST *node) { in dump()
179 void ASTDumper::dump(CallExprAST *node) { in dump()
189 void ASTDumper::dump(PrintExprAST *node) { in dump()
206 void ASTDumper::dump(PrototypeAST *node) { in dump()
217 void ASTDumper::dump(FunctionAST *node) { in dump()
[all …]
|
| /llvm-project/mlir/examples/toy/Ch4/parser/ |
| H A D | AST.cpp | 67 static std::string loc(T *node) { in loc()
85 [&](auto *node) { this->dump(node); }) in dump()
144 void ASTDumper::dump(LiteralExprAST *node) { in dump()
152 void ASTDumper::dump(VariableExprAST *node) { in dump()
158 void ASTDumper::dump(ReturnExprAST *node) { in dump()
170 void ASTDumper::dump(BinaryExprAST *node) { in dump()
179 void ASTDumper::dump(CallExprAST *node) { in dump()
189 void ASTDumper::dump(PrintExprAST *node) { in dump()
206 void ASTDumper::dump(PrototypeAST *node) { in dump()
217 void ASTDumper::dump(FunctionAST *node) { in dump()
[all …]
|
| /llvm-project/llvm/include/llvm/Frontend/OpenMP/ |
| H A D | ConstructDecompositionT.h | 265 syms[object.id()].insert(node); in addClauseSymsToMap() argument
259 addClauseSymsToMap(const ObjectTy & object,const ClauseTy * node) addClauseSymsToMap() argument
272 addClauseSymsToMap(const TypeTy & item,const ClauseTy * node) addClauseSymsToMap() argument
278 addClauseSymsToMap(const ExprTy & item,const ClauseTy * node) addClauseSymsToMap() argument
285 addClauseSymsToMap(const tomp::clause::MapT<TypeTy,IdTy,ExprTy> & item,const ClauseTy * node) addClauseSymsToMap() argument
297 addClauseSymsToMap(const std::optional<U> & item,const ClauseTy * node) addClauseSymsToMap() argument
305 addClauseSymsToMap(const tomp::ListT<U> & item,const ClauseTy * node) addClauseSymsToMap() argument
313 addClauseSymsToMap(const std::tuple<U...> & item,const ClauseTy * node,std::index_sequence<Is...>) addClauseSymsToMap() argument
323 addClauseSymsToMap(U && item,const ClauseTy * node) addClauseSymsToMap() argument
331 addClauseSymsToMap(U && item,const ClauseTy * node) addClauseSymsToMap() argument
339 addClauseSymsToMap(U && item,const ClauseTy * node) addClauseSymsToMap() argument
347 addClauseSymsToMap(U && item,const ClauseTy * node) addClauseSymsToMap() argument
355 addClauseSymsToMap(U && item,const ClauseTy * node) addClauseSymsToMap() argument
365 addClauseSymsToMap(U && item,const ClauseTy * node) addClauseSymsToMap() argument
373 applyToUnique(const ClauseTy * node) applyToUnique() argument
390 applyToFirst(const ClauseTy * node,llvm::iterator_range<Iterator> range) applyToFirst() argument
406 applyToInnermost(const ClauseTy * node) applyToInnermost() argument
413 applyToOutermost(const ClauseTy * node) applyToOutermost() argument
419 applyIf(const ClauseTy * node,Predicate shouldApply) applyIf() argument
435 applyToAll(const ClauseTy * node) applyToAll() argument
442 applyClause(Specific && specific,const ClauseTy * node) applyClause() argument
466 applyClause(const tomp::clause::CollapseT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
492 applyClause(const tomp::clause::PrivateT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
529 applyClause(const tomp::clause::FirstprivateT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
646 applyClause(const tomp::clause::LastprivateT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
726 applyClause(const tomp::clause::SharedT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
741 applyClause(const tomp::clause::DefaultT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
756 applyClause(const tomp::clause::ThreadLimitT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
771 applyClause(const tomp::clause::OrderT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
788 applyClause(const tomp::clause::AllocateT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
847 applyClause(const tomp::clause::ReductionT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
1009 applyClause(const tomp::clause::IfT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
1053 applyClause(const tomp::clause::LinearT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
1100 applyClause(const tomp::clause::NowaitT<TypeTy,IdTy,ExprTy> & clause,const ClauseTy * node) applyClause() argument
1111 for (const ClauseTy *node : nodes) split() local
1119 for (const ClauseTy *node : nodes) { split() local
1123 for (const auto *node : linears) { split() local
1143 for (const ClauseTy *node : nodes) { split() local
1152 for (const ClauseTy *node : nodes) { split() local
[all...] |
| /llvm-project/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 43 void CallGraphNode::addAbstractEdge(CallGraphNode *node) { in addAbstractEdge() argument
49 void CallGraphNode::addCallEdge(CallGraphNode *node) { in addCallEdge() argument
64 addEdge(CallGraphNode * node,Edge::Kind kind) addEdge() argument
117 std::unique_ptr<CallGraphNode> &node = nodes[region]; getOrAddNode() local
151 if (auto *node = lookupNode(callableOp.getCallableRegion())) resolveCallable() local
158 eraseNode(CallGraphNode * node) eraseNode() argument
183 __anon9b6eb71d0302(const CallGraphNode *node) print() argument
203 const CallGraphNode *node = nodeIt.second.get(); print() local
229 for (auto &node : scc) { print() local
[all...] |
| /llvm-project/lldb/include/lldb/Symbol/ |
| H A D | PostfixExpression.h | 70 static bool classof(const Node *node) { return node->GetKind() == BinaryOp; } in classof()
83 static bool classof(const Node *node) { in classof()
95 static bool classof(const Node *node) { return node->GetKind() == Integer; } in classof()
111 static bool classof(const Node *node) { return node->GetKind() == Register; } in classof()
125 static bool classof(const Node *node) { return node->GetKind() == Symbol; } in classof()
146 static bool classof(const Node *node) { return node->GetKind() == UnaryOp; } in classof()
176 ResultT Dispatch(Node *&node) { in Dispatch()
|
| /llvm-project/lldb/source/Host/common/ |
| H A D | XML.cpp | 95 XMLNode::XMLNode(XMLNodeImpl node) : m_node(node) {} in XMLNode()
214 for (xmlNodePtr node = m_node; node; node = node->next) { in ForEachSiblingNode() local
227 for (xmlNodePtr node = m_node; node; node = node->next) { in ForEachSiblingElement() local
245 for (xmlNodePtr node = m_node; node; node = node->next) { in ForEachSiblingElementWithName() local
285 for (xmlNodePtr node = m_node->children; node != nullptr; in GetElementText() local
333 name, [&result_node](const XMLNode &node) -> bool { in FindFirstChildElementWithName()
360 XMLNode node = FindFirstChildElementWithName(path[0].c_str()); in GetElementForPath() local
435 bool ApplePropertyList::ExtractStringFromValueNode(const XMLNode &node, in ExtractStringFromValueNode()
456 static StructuredData::ObjectSP CreatePlistValue(XMLNode node) { in CreatePlistValue()
461 node.ForEachChildElement([&array_sp](const XMLNode &node) -> bool { in CreatePlistValue()
[all …]
|
| /llvm-project/libc/src/__support/ |
| H A D | freelist.h | 95 set_freelist_node(FreeListNode & node,span<cpp::byte> chunk) set_freelist_node() argument
110 FreeListNode *node = ::new (chunk.data()) FreeListNode; add_chunk() local
146 FreeListNode *node = chunks_[static_cast<unsigned short>(i)]; find_chunk() local
169 FreeListNode *node = chunks_[chunk_ptr]; remove_chunk() local
[all...] |
| /llvm-project/mlir/lib/Target/LLVMIR/Dialect/LLVMIR/ |
| H A D | LLVMIRToLLVMTranslation.cpp | 138 branchWeights.reserve(node->getNumOperands() - 1); in setTBAAAttr() argument
84 setProfilingAttr(OpBuilder & builder,llvm::MDNode * node,Operation * op,LLVM::ModuleImport & moduleImport) setProfilingAttr() argument
155 setAccessGroupsAttr(const llvm::MDNode * node,Operation * op,LLVM::ModuleImport & moduleImport) setAccessGroupsAttr() argument
175 setLoopAttr(const llvm::MDNode * node,Operation * op,LLVM::ModuleImport & moduleImport) setLoopAttr() argument
193 setAliasScopesAttr(const llvm::MDNode * node,Operation * op,LLVM::ModuleImport & moduleImport) setAliasScopesAttr() argument
212 setNoaliasScopesAttr(const llvm::MDNode * node,Operation * op,LLVM::ModuleImport & moduleImport) setNoaliasScopesAttr() argument
248 setMetadataAttrs(OpBuilder & builder,unsigned kind,llvm::MDNode * node,Operation * op,LLVM::ModuleImport & moduleImport) const setMetadataAttrs() argument
[all...] |
| /llvm-project/clang/utils/TableGen/ |
| H A D | ASTTableGen.cpp | 25 return node.getName(); in getName() local
34 removeExpectedNodeNameSuffix(Record * node,StringRef suffix) removeExpectedNodeNameSuffix() argument
97 visitASTNodeRecursive(ASTNode node,ASTNode base,const ChildMap & map,ASTNodeHierarchyVisitor<ASTNode> visit) visitASTNodeRecursive() argument
123 for (ASTNode node : nodes) { visitHierarchy() local
[all...] |
| /llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_deadlock_detector.h | 182 uptr getData(uptr node) const { return data_[nodeToIndex(node)]; } in getData() argument
184 bool nodeBelongsToCurrentEpoch(uptr node) { in nodeBelongsToCurrentEpoch() argument
188 void removeNode(uptr node) { in removeNode() argument
208 findLockContext(DeadlockDetectorTLS<BV> * dtls,uptr node) findLockContext() argument
325 onUnlock(DeadlockDetectorTLS<BV> * dtls,uptr node) onUnlock() argument
342 isHeld(DeadlockDetectorTLS<BV> * dtls,uptr node) isHeld() argument
365 check_node(uptr node) check_node() argument
375 nodeToIndexUnchecked(uptr node) nodeToIndexUnchecked() argument
377 nodeToIndex(uptr node) nodeToIndex() argument
382 nodeToEpoch(uptr node) nodeToEpoch() argument
[all...] |