HomeSort by: relevance | last modified time | path
    Searched defs:Edge (Results 1 - 14 of 14) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CFLGraph.h 52 /// Each Node in the graph is an InstantiatedValue, and each edge represent a
55 /// implicitly assume that for each node (X, I) it has a dereference edge to (X,
56 /// I+1) and a reference edge to (X, I-1).
61 struct Edge {
66 using EdgeList = std::vector<Edge>;
132 FromInfo->Edges.push_back(Edge{To, Offset});
133 ToInfo->ReverseEdges.push_back(Edge{From, Offset});
DependenceGraphBuilder.cpp 69 // node N, do a DFS starting from N. A rooted edge is established between the
75 // the iteration order. For example for a graph {A -> B}, an edge from the
151 // keep one edge from that node to the pi-block node. Similarly, if
153 // we only keep one edge from the pi-block node to the outside node.
155 // for each type of edge supported, using a two-dimensional boolean
174 llvm_unreachable("Unsupported type of edge.");
197 LLVM_DEBUG(dbgs() << "created edge from Src to New.\n");
200 LLVM_DEBUG(dbgs() << "created edge from New to Dst.\n");
206 LLVM_DEBUG(dbgs() << "removed old edge between Src and Dst.\n\n");
253 << "skipped def-use edge since the sink" << *U
    [all...]
DomTreeUpdater.cpp 40 // Edge does not exist in IR.
44 // Edge exists in IR.
257 auto Edge = std::make_pair(U.getFrom(), U.getTo());
259 // and updates to an edge need to be strictly ordered,
260 // it is safe to infer the existence of an edge from the first update
261 // to this edge.
262 // If the first update to an edge is "Delete", it means that the edge
263 // existed before. If the first update to an edge is "Insert", it means
264 // that the edge didn't exist before
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
MaximumSpanningTree.h 29 typedef std::pair<const T*, const T*> Edge;
30 typedef std::pair<Edge, double> EdgeWeight;
33 typedef std::vector<Edge> MaxSpanTree;
49 // Equal edge weights: break ties by comparing block sizes.
78 Edge e = (*EWi).first;
87 Edge e = (*EWi).first;
91 // So we know now that the edge is not already in a subtree, so we push
92 // the edge to the MST.
GCOVProfiling.cpp 1 //===- GCOVProfiling.cpp - Insert edge counters for gcov profiling --------===//
216 struct Edge {
228 Edge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W = 1)
231 // Return the information string of an edge.
756 static BasicBlock *getInstrBB(CFGMST<Edge, BBInfo> &MST, Edge &E,
763 // For a fake edge, instrument the real BB.
778 // otherwise, the DestBB if this is not a critical edge.
801 static void dumpEdges(CFGMST<Edge, BBInfo> &MST, GCOVFunction &GF) {
806 dbgs() << " Edge " << ID++ << ": " << Src.Number << "->" << Dst.Numbe
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/JITLink/
JITLink.h 58 class Edge {
63 Invalid, // Invalid edge value.
65 KeepAlive = FirstKeepAlive, // Tag first edge kind that preserves liveness.
72 Edge(Kind K, OffsetT Offset, Symbol &Target, AddendT Addend)
81 assert(isRelocation() && "Not a relocation edge");
97 /// Returns the string name of the given generic edge kind, or "unknown"
99 const char *getGenericEdgeKindName(Edge::Kind K);
180 using EdgeVector = std::vector<Edge>;
234 /// Add an edge to this block.
235 void addEdge(Edge::Kind K, Edge::OffsetT Offset, Symbol &Target
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_deadlock_detector.h 253 Edge e = {(u16)added_edges[i], (u16)cur_idx,
258 // Printf("Edge%zd: %u %zd=>%zd in T%d\n",
396 struct Edge {
410 Edge edges_[BV::kSize * 32];
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
ImmutableGraph.h 16 /// implemented as a bit vector, wherein each bit corresponds to one edge in
17 /// the edge array. This implies a lower bound of 64x spatial improvement
47 class Edge {
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; }
73 const Edge *edges_end() const { return (this + 1)->Edges; }
74 ArrayRef<Edge> edges() const {
80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges,
94 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); }
95 const Edge *edges_begin() const { return edges().begin();
    [all...]
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_deadlock_detector.h 249 Edge e = {(u16)added_edges[i], (u16)cur_idx,
390 struct Edge {
404 Edge edges_[BV::kSize * 32];
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_deadlock_detector.h 249 Edge e = {(u16)added_edges[i], (u16)cur_idx,
390 struct Edge {
404 Edge edges_[BV::kSize * 32];
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LazyCallGraph.h 27 /// potential-call-edge graph.
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
72 /// DAG. That is, no optimizations will delete, remove, or add an edge such
86 /// an indirect call edge. Another way to think about it is that it represents
89 /// of a function to be an edge in the call graph because this might be
98 /// form even a potential call edge from a function body which may dynamically
131 /// node. This allows the edge structure itself to be a very compact data
133 class Edge {
135 /// The kind of edge in the graph.
138 Edge();
    [all...]
LoopInfo.h 308 /// Edge type.
309 typedef std::pair<BlockT *, BlockT *> Edge;
312 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const;
315 /// if there is only one edge to the header of the loop from outside of the
592 /// Obtain the unique incoming and back edge. Return false if they are
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
GVN.cpp 1304 // If any of these blocks has more than one successor (i.e. if the edge we
1347 dbgs() << "COULD NOT PRE LOAD BECAUSE OF INDBR CRITICAL EDGE '"
1352 // FIXME: Can we support the fallthrough edge?
1355 dbgs() << "COULD NOT PRE LOAD BECAUSE OF CALLBR CRITICAL EDGE '"
1362 dbgs() << "COULD NOT PRE LOAD BECAUSE OF AN EH PAD CRITICAL EDGE '"
1372 << "COULD NOT PRE LOAD BECAUSE OF A BACKEDGE CRITICAL EDGE '"
1412 LLVM_DEBUG(dbgs() << "Split critical edge " << OrigPred->getName() << "->"
1425 // We do the translation for each edge we skipped by going from Load's block
1470 // HINT: Don't revert the edge-splitting as following transformation may
1569 // TODO: Support critical edge splitting if blocker has more than 1 successor
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonConstPropagation.cpp 656 LLVM_DEBUG(dbgs() << " edge " << printMBBReference(*PB) << "->"
672 LLVM_DEBUG(dbgs() << " edge from " << printMBBReference(*PB) << ": "
778 // last one set "FallsThru", then add an edge to the layout successor
789 LLVM_DEBUG(dbgs() << " pushing edge " << printMBBReference(B) << " -> "
800 // later (via a flow-edge in the work queue). In such case, the instruc-
884 // Start with a fake edge, just to process the entry node.
888 CFGEdge Edge = FlowQ.front();
892 dbgs() << "Picked edge "
893 << printMBBReference(*MF.getBlockNumbered(Edge.first)) << "->"
894 << printMBBReference(*MF.getBlockNumbered(Edge.second)) << '\n')
    [all...]

Completed in 67 milliseconds