| /llvm-project/polly/lib/External/isl/ |
| H A D | isl_scheduler.c | 81 int isl_sched_edge_has_type(struct isl_sched_edge *edge, in isl_sched_edge_has_type()
89 static void set_type(struct isl_sched_edge *edge, enum isl_edge_type type) in set_type()
96 static void clear_type(struct isl_sched_edge *edge, enum isl_edge_type type) in clear_type()
103 static int is_validity(struct isl_sched_edge *edge) in is_validity()
110 static void set_validity(struct isl_sched_edge *edge) in set_validity()
117 int isl_sched_edge_is_proximity(struct isl_sched_edge *edge) in isl_sched_edge_is_proximity()
124 static int is_local(struct isl_sched_edge *edge) in is_local()
131 static void set_local(struct isl_sched_edge *edge) in set_local()
138 static void clear_local(struct isl_sched_edge *edge) in clear_local()
145 static int is_coincidence(struct isl_sched_edge *edge) in is_coincidence()
[all …]
|
| H A D | isl_scheduler_clustering.c | 92 static isl_bool is_non_empty_proximity(struct isl_sched_edge *edge) in is_non_empty_proximity()
120 struct isl_sched_edge *edge = &graph->edge[i]; in find_proximity() local
216 int edge, struct isl_clustering *c) in mark_merge_sccs()
363 struct isl_sched_edge *edge, __isl_keep isl_union_map *umap, in add_non_conditional_constraints()
390 struct isl_sched_edge *edge, __isl_keep isl_union_map *umap, in add_conditional_constraints()
429 struct isl_sched_edge *edge, __isl_keep isl_union_map *cluster_map, in collect_edge_constraints()
482 struct isl_sched_edge *edge = &graph->edge[i]; in collect_constraints() local
839 static isl_bool has_bounded_distances(isl_ctx *ctx, struct isl_sched_edge *edge, in has_bounded_distances()
914 struct isl_sched_edge *edge = &graph->edge[i]; in ok_to_merge_proximity() local
1175 struct isl_sched_edge *edge = &graph->edge[i]; in any_no_merge() local
[all …]
|
| H A D | isl_scheduler.h | 239 struct isl_sched_edge *edge; member
|
| H A D | isl_scheduler_scc.c | 505 struct isl_sched_edge *edge = *entry; in add_scc_edge() local
|
| /llvm-project/mlir/lib/Analysis/ |
| H A D | CallGraph.cpp | 60 return llvm::any_of(edges, [](const Edge &edge) { return edge.isChild(); }); in hasChildren() argument
161 for (const CallGraphNode::Edge &edge : llvm::make_early_inc_range(*node)) in eraseNode() local
167 it.second->edges.remove_if([node](const CallGraphNode::Edge &edge) { in eraseNode() argument
[all...] |
| /llvm-project/mlir/lib/Transforms/Utils/ |
| H A D | CFGToSCF.cpp | 273 void redirectEdge(Edge edge, ValueRange extraArgs = {}) const { in redirectEdge()
529 for (Edge edge : entryEdges) in createSingleEntryBlock() local
763 for (Edge edge : successorEdges(latch)) in transformToReduceLoop() local
913 for (Edge edge : successorEdges(block)) { in createSingleExitBranchRegion() local
1085 for (Edge edge : successorEdges(block)) { in transformToStructuredCFBranches() local
1100 continuationEdges, [](Edge edge, bool) { return edge.getSuccessor(); }, in transformToStructuredCFBranches()
|
| H A D | Inliner.cpp | 717 __anond8076aeb0c02(CallGraphNode::Edge const &edge) shouldInline() argument
|
| /llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); addIntraChainConstraint() local
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); addInterChainConstraint() local
[all...] |
| /llvm-project/lld/MachO/ |
| H A D | ExportTrie.cpp | 152 for (const Edge &edge : edges) { in updateOffset() local
184 for (const Edge &edge : edges) { in writeTo() local
|
| /llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 49 using edge = ProfiledCallGraphEdge; member
|
| /llvm-project/lld/ELF/Arch/ |
| H A D | MipsArchTree.cpp | 175 for (const auto &edge : archTree) { in isArchMatched() local
|
| /llvm-project/lldb/source/Symbol/ |
| H A D | Function.cpp | 353 __anone89b8e2b0302(const std::unique_ptr<CallEdge> &edge) GetTailCallingEdges() argument
360 __anone89b8e2b0402(const std::unique_ptr<CallEdge> &edge) GetCallEdgeForReturnAddress() argument
|
| /llvm-project/mlir/lib/Dialect/Affine/Analysis/ |
| H A D | Utils.cpp | 306 bool hasOutEdge = llvm::any_of(outEdges[srcId], [=](Edge &edge) { in hasEdge() argument
309 bool hasInEdge = llvm::any_of(inEdges[dstId], [=](Edge &edge) { in hasEdge() argument
373 Edge edge = outEdges[idAndIndex.first][idAndIndex.second]; hasDependencePath() local
416 for (MemRefDependenceGraph::Edge edge : inEdges[id]) gatherDefiningNodes() local
602 for (const auto &edge : edges) { forEachMemRefEdge() local
[all...] |
| /llvm-project/lldb/source/Target/ |
| H A D | StackFrameList.cpp | 268 for (const auto &edge : begin.GetCallEdges()) FindInterveningFrames() local
335 for (const auto &edge : callee.GetTailCallingEdges()) { FindInterveningFrames() local
|
| /llvm-project/mlir/lib/Analysis/DataFlow/ |
| H A D | DeadCodeAnalysis.cpp | 59 if (auto *edge = dyn_cast<CFGEdge>(programPoint)) { onUpdate() local
|
| /llvm-project/mlir/lib/Transforms/ |
| H A D | ViewOpGraph.cpp | 136 for (const std::string &edge : edges) emitAllEdgeStmts() local
|
| /llvm-project/lldb/source/Expression/ |
| H A D | DWARFExpression.cpp | 656 // in order to look up the associated call edge in the first non-inlined in Evaluate_DW_OP_entry_value() local
|
| /llvm-project/mlir/lib/Dialect/Affine/Transforms/ |
| H A D | LoopFusion.cpp | 802 __anonedfcc1450802(const auto &edge) canCreatePrivateMemRef() argument
|
| /llvm-project/llvm/unittests/ADT/ |
| H A D | APIntTest.cpp | 468 int64_t edge = INT64_MIN; TEST() local
488 uint64_t edge = 0x4000000000000000; TEST() local
[all...] |
| /llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
| H A D | SymbolFileDWARF.cpp | 4127 std::unique_ptr<CallEdge> edge; CollectCallEdges() local
|