| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| CFLGraph.h | 69 EdgeList Edges, ReverseEdges;
132 FromInfo->Edges.push_back(Edge{To, Offset});
173 /// Gets the edges our graph should have, based on an Instruction*
235 // non-pointer operands, we'll entirely skip adding edges for those.
|
| CFLGraph.h | 69 EdgeList Edges, ReverseEdges;
132 FromInfo->Edges.push_back(Edge{To, Offset});
173 /// Gets the edges our graph should have, based on an Instruction*
235 // non-pointer operands, we'll entirely skip adding edges for those.
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| DirectedGraph.h | 71 /// The node has a (possibly empty) list of outgoing edges.
79 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); }
82 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {}
83 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {}
86 Edges = N.Edges;
90 Edges = std::move(N.Edges)
[all...] |
| DirectedGraph.h | 71 /// The node has a (possibly empty) list of outgoing edges.
79 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); }
82 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {}
83 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {}
86 Edges = N.Edges;
90 Edges = std::move(N.Edges)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 203 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges;
204 FindFunctionBackedges(F, Edges);
206 for (unsigned i = 0, e = Edges.size(); i != e; ++i)
207 UniqueLoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second));
|
| SimplifyCFGPass.cpp | 203 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges;
204 FindFunctionBackedges(F, Edges);
206 for (unsigned i = 0, e = Edges.size(); i != e; ++i)
207 UniqueLoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second));
|
| JumpThreading.cpp | 603 /// edges across a loop header. For example, threading a jump from outside the
611 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges;
612 FindFunctionBackedges(F, Edges);
614 for (const auto &Edge : Edges)
1321 // because the edges between the invoke and the EH pad cannot have other
1710 // If all edges were unthreadable, we fail.
1789 // edges to the block. Factor each of these edges by listing them
1796 // If the threadable edges are branching on an undefined value, we get to pick
2138 // edges (say, PredBB1 and PredBB2), we know the value of %var in each copy o
[all...] |
| JumpThreading.cpp | 603 /// edges across a loop header. For example, threading a jump from outside the
611 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges;
612 FindFunctionBackedges(F, Edges);
614 for (const auto &Edge : Edges)
1321 // because the edges between the invoke and the EH pad cannot have other
1710 // If all edges were unthreadable, we fail.
1789 // edges to the block. Factor each of these edges by listing them
1796 // If the threadable edges are branching on an undefined value, we get to pick
2138 // edges (say, PredBB1 and PredBB2), we know the value of %var in each copy o
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| Graph.h | 48 /// Usage Example Graph with weighted edges and vertices:
58 /// for(const auto &e : G.edges()){
59 /// // Do something with the edges in the graph;
76 /// These objects are used to name edges and vertices in the graph.
85 /// This type is the value_type of all iterators which range over edges,
86 /// Determined by the Edges DenseMap.
99 /// The type used for storing the edges entering a vertex. Indexed by
101 /// where the incoming edges are, the EdgeIdentifiers are stored in an
112 EdgeMapT Edges;
171 /// A const iterator type for iterating through the set of edges entering
355 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
357 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| Graph.h | 48 /// Usage Example Graph with weighted edges and vertices:
58 /// for(const auto &e : G.edges()){
59 /// // Do something with the edges in the graph;
76 /// These objects are used to name edges and vertices in the graph.
85 /// This type is the value_type of all iterators which range over edges,
86 /// Determined by the Edges DenseMap.
99 /// The type used for storing the edges entering a vertex. Indexed by
101 /// where the incoming edges are, the EdgeIdentifiers are stored in an
112 EdgeMapT Edges;
171 /// A const iterator type for iterating through the set of edges entering
355 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
357 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/ |
| GIMatchDag.h | 79 EdgesVec Edges;
88 : Ctx(Ctx), InstrNodes(), PredicateNodes(), Edges(),
94 return raw_pointer_iterator<EdgesVec::iterator>(Edges.begin());
97 return raw_pointer_iterator<EdgesVec::iterator>(Edges.end());
100 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.begin());
103 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.end());
105 iterator_range<edge_iterator> edges() { function in class:llvm::GIMatchDag
108 iterator_range<const_edge_iterator> edges() const { function in class:llvm::GIMatchDag
202 Edges.push_back(std::move(Obj));
222 size_t getNumEdges() const { return Edges.size();
[all...] |
| GIMatchDag.h | 79 EdgesVec Edges;
88 : Ctx(Ctx), InstrNodes(), PredicateNodes(), Edges(),
94 return raw_pointer_iterator<EdgesVec::iterator>(Edges.begin());
97 return raw_pointer_iterator<EdgesVec::iterator>(Edges.end());
100 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.begin());
103 return raw_pointer_iterator<EdgesVec::const_iterator>(Edges.end());
105 iterator_range<edge_iterator> edges() { function in class:llvm::GIMatchDag
108 iterator_range<const_edge_iterator> edges() const { function in class:llvm::GIMatchDag
202 Edges.push_back(std::move(Obj));
222 size_t getNumEdges() const { return Edges.size();
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| ImmutableGraph.h | 11 /// implemented as two arrays: one containing nodes, and one containing edges.
14 /// 2. Operations on sets of nodes/edges are efficient, and representations of
15 /// those sets in memory are compact. For instance, a set of edges is
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; }
69 // Nodes are allocated sequentially. Edges for a node are stored together.
70 // The end of this Node's edges is the beginning of the next node's edges.
73 const Edge *edges_end() const { return (this + 1)->Edges; }
74 ArrayRef<Edge> edges() const function in class:llvm::ImmutableGraph::Node
94 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); } function in class:llvm::ImmutableGraph
[all...] |
| X86DomainReassignment.cpp | 287 /// A closure is a set of virtual register representing all of the edges in
288 /// the closure, as well as all of the instructions connected by those edges.
301 DenseSet<Register> Edges;
331 bool empty() const { return Edges.empty(); }
333 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; }
336 iterator_range<const_edge_iterator> edges() const { function in class:__anon5194::Closure
337 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end());
351 for (Register Reg : Edges) {
376 /// All edges that are included in some closur
[all...] |
| X86LoadValueInjectionLoadHardening.cpp | 109 unsigned int *Edges, int *EdgeValues,
124 std::unique_ptr<Edge[]> Edges, size_type NodesSize,
126 : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize),
541 // Returns the number of remaining gadget edges that could not be eliminated
546 // Eliminate fences and CFG edges that ingress and egress the fence, as
548 for (const Edge &E : G.edges()) {
553 for (const Edge &DE : Dest->edges())
559 // Find and eliminate gadget edges that have been mitigated.
563 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge))
572 for (const Edge &E : N->edges()) {
[all...] |
| ImmutableGraph.h | 11 /// implemented as two arrays: one containing nodes, and one containing edges.
14 /// 2. Operations on sets of nodes/edges are efficient, and representations of
15 /// those sets in memory are compact. For instance, a set of edges is
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; }
69 // Nodes are allocated sequentially. Edges for a node are stored together.
70 // The end of this Node's edges is the beginning of the next node's edges.
73 const Edge *edges_end() const { return (this + 1)->Edges; }
74 ArrayRef<Edge> edges() const function in class:llvm::ImmutableGraph::Node
94 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); } function in class:llvm::ImmutableGraph
[all...] |
| X86DomainReassignment.cpp | 287 /// A closure is a set of virtual register representing all of the edges in
288 /// the closure, as well as all of the instructions connected by those edges.
301 DenseSet<Register> Edges;
331 bool empty() const { return Edges.empty(); }
333 bool insertEdge(Register Reg) { return Edges.insert(Reg).second; }
336 iterator_range<const_edge_iterator> edges() const { function in class:__anon5194::Closure
337 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end());
351 for (Register Reg : Edges) {
376 /// All edges that are included in some closur
[all...] |
| X86LoadValueInjectionLoadHardening.cpp | 109 unsigned int *Edges, int *EdgeValues,
124 std::unique_ptr<Edge[]> Edges, size_type NodesSize,
126 : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize),
541 // Returns the number of remaining gadget edges that could not be eliminated
546 // Eliminate fences and CFG edges that ingress and egress the fence, as
548 for (const Edge &E : G.edges()) {
553 for (const Edge &DE : Dest->edges())
559 // Find and eliminate gadget edges that have been mitigated.
563 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge))
572 for (const Edge &E : N->edges()) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 15 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
68 /// With the edges of this graph, the motivating constraint that we are
87 /// both the direct call edges and any direct call edges that might be formed
92 /// edges for functions. Walking "up" the graph can be done by looking at all
119 /// A class used to represent edges in the call graph.
121 /// The lazy call graph models both *call* edges and *reference* edges. Call
122 /// edges are much what you would expect, and exist when there is a 'call' or
123 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| LazyCallGraph.h | 15 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
68 /// With the edges of this graph, the motivating constraint that we are
87 /// both the direct call edges and any direct call edges that might be formed
92 /// edges for functions. Walking "up" the graph can be done by looking at all
119 /// A class used to represent edges in the call graph.
121 /// The lazy call graph models both *call* edges and *reference* edges. Call
122 /// edges are much what you would expect, and exist when there is a 'call' or
123 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| BlockFrequencyInfoImpl.h | 225 ExitMap Exits; ///< Successor edges (and weights).
300 /// there are no irreducible edges to Node, then it will have complexity
351 /// All edges in the original function are 32-bit. However, exit edges from
401 /// Combines multiple edges to the same \a Weight::TargetNode and scales
433 /// Add all edges out of a packaged loop to the distribution.
435 /// Adds all edges from LocalLoopHead to Dist. Calls addToDist() to add each
595 /// graphs for most edges, but getting others from \a LoopData::ExitMap. The
611 std::deque<const IrrNode *> Edges;
617 iterator pred_begin() const { return Edges.begin();
[all...] |
| BlockFrequencyInfoImpl.h | 225 ExitMap Exits; ///< Successor edges (and weights).
300 /// there are no irreducible edges to Node, then it will have complexity
351 /// All edges in the original function are 32-bit. However, exit edges from
401 /// Combines multiple edges to the same \a Weight::TargetNode and scales
433 /// Add all edges out of a packaged loop to the distribution.
435 /// Adds all edges from LocalLoopHead to Dist. Calls addToDist() to add each
595 /// graphs for most edges, but getting others from \a LoopData::ExitMap. The
611 std::deque<const IrrNode *> Edges;
617 iterator pred_begin() const { return Edges.begin();
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineBlockPlacement.cpp | 238 /// block chains for SCC-formation and iteration. We store the edges to child
349 /// Edges that have already been computed as optimal.
407 /// allow implicitly defining edges between chains as the existing edges
545 /// Get the best pair of non-conflicting edges.
548 MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
649 // Disregard edges within a fixed chain, or edges to the loop header.
669 /// the total branch probability of edges from \p BB to those
675 // Adjust edge probabilities by excluding edges pointing to blocks that i
[all...] |
| MachineBlockPlacement.cpp | 238 /// block chains for SCC-formation and iteration. We store the edges to child
349 /// Edges that have already been computed as optimal.
407 /// allow implicitly defining edges between chains as the existing edges
545 /// Get the best pair of non-conflicting edges.
548 MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
649 // Disregard edges within a fixed chain, or edges to the loop header.
669 /// the total branch probability of edges from \p BB to those
675 // Adjust edge probabilities by excluding edges pointing to blocks that i
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| ModuleSummaryIndex.h | 516 /// Types for -force-summary-edges-cold debugging option.
609 /// Create an empty FunctionSummary (with specified call edges).
612 makeDummyFunctionSummary(std::vector<FunctionSummary::EdgeTy> Edges) {
620 std::vector<ValueInfo>(), std::move(Edges),
1192 std::vector<FunctionSummary::EdgeTy> Edges;
1193 // create edges to all roots in the Index
1197 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
1199 if (Edges.empty()) {
1203 auto CallGraphRoot = FunctionSummary::makeDummyFunctionSummary(Edges);
|
