| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
62 /// With the edges of this graph, the motivating constraint that we are
81 /// both the direct call edges and any direct call edges that might be formed
86 /// edges for functions. Walking "up" the graph can be done by looking at all
115 /// A class used to represent edges in the call graph.
117 /// The lazy call graph models both *call* edges and *reference* edges. Call
118 /// edges are much what you would expect, and exist when there is a 'call' or
119 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
62 /// With the edges of this graph, the motivating constraint that we are
81 /// both the direct call edges and any direct call edges that might be formed
86 /// edges for functions. Walking "up" the graph can be done by looking at all
115 /// A class used to represent edges in the call graph.
117 /// The lazy call graph models both *call* edges and *reference* edges. Call
118 /// edges are much what you would expect, and exist when there is a 'call' or
119 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
62 /// With the edges of this graph, the motivating constraint that we are
81 /// both the direct call edges and any direct call edges that might be formed
86 /// edges for functions. Walking "up" the graph can be done by looking at all
115 /// A class used to represent edges in the call graph.
117 /// The lazy call graph models both *call* edges and *reference* edges. Call
118 /// edges are much what you would expect, and exist when there is a 'call' or
119 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// 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
121 /// A class used to represent edges in the call graph.
123 /// The lazy call graph models both *call* edges and *reference* edges. Call
124 /// edges are much what you would expect, and exist when there is a 'call' or
125 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// 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
121 /// A class used to represent edges in the call graph.
123 /// The lazy call graph models both *call* edges and *reference* edges. Call
124 /// edges are much what you would expect, and exist when there is a 'call' or
125 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// 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
121 /// A class used to represent edges in the call graph.
123 /// The lazy call graph models both *call* edges and *reference* edges. Call
124 /// edges are much what you would expect, and exist when there is a 'call' or
125 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// 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
121 /// A class used to represent edges in the call graph.
123 /// The lazy call graph models both *call* edges and *reference* edges. Call
124 /// edges are much what you would expect, and exist when there is a 'call' or
125 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
62 /// With the edges of this graph, the motivating constraint that we are
81 /// both the direct call edges and any direct call edges that might be formed
86 /// edges for functions. Walking "up" the graph can be done by looking at all
115 /// A class used to represent edges in the call graph.
117 /// The lazy call graph models both *call* edges and *reference* edges. Call
118 /// edges are much what you would expect, and exist when there is a 'call' or
119 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
62 /// With the edges of this graph, the motivating constraint that we are
81 /// both the direct call edges and any direct call edges that might be formed
86 /// edges for functions. Walking "up" the graph can be done by looking at all
115 /// A class used to represent edges in the call graph.
117 /// The lazy call graph models both *call* edges and *reference* edges. Call
118 /// edges are much what you would expect, and exist when there is a 'call' or
119 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// edges in this call graph that do not correspond to a 'call' or 'invoke'
62 /// With the edges of this graph, the motivating constraint that we are
81 /// both the direct call edges and any direct call edges that might be formed
86 /// edges for functions. Walking "up" the graph can be done by looking at all
115 /// A class used to represent edges in the call graph.
117 /// The lazy call graph models both *call* edges and *reference* edges. Call
118 /// edges are much what you would expect, and exist when there is a 'call' or
119 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| LazyCallGraph.h | 16 /// 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
121 /// A class used to represent edges in the call graph.
123 /// The lazy call graph models both *call* edges and *reference* edges. Call
124 /// edges are much what you would expect, and exist when there is a 'call' or
125 /// 'invoke' instruction of some function. Reference edges are also tracke
[all...] |
