| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
67 // Inverse - This class is used as a little marker class to tell the graph
68 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
69 // Not all graphs define an inverse ordering, and if they do, it depends on
77 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
81 struct Inverse {
84 inline Inverse(const GraphType &G) : Graph(G) {}
87 // Provide a partial specialization of GraphTraits so that the inverse of an
88 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
67 // Inverse - This class is used as a little marker class to tell the graph
68 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
69 // Not all graphs define an inverse ordering, and if they do, it depends on
77 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
81 struct Inverse {
84 inline Inverse(const GraphType &G) : Graph(G) {}
87 // Provide a partial specialization of GraphTraits so that the inverse of an
88 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
64 // Inverse - This class is used as a little marker class to tell the graph
65 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
66 // Not all graphs define an inverse ordering, and if they do, it depends on
74 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
78 struct Inverse {
81 inline Inverse(const GraphType &G) : Graph(G) {}
84 // Provide a partial specialization of GraphTraits so that the inverse of an
85 // inverse falls back to the original graph
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
61 // Inverse - This class is used as a little marker class to tell the graph
62 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
63 // Not all graphs define an inverse ordering, and if they do, it depends on
71 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
75 struct Inverse {
78 inline Inverse(const GraphType &G) : Graph(G) {}
81 // Provide a partial specialization of GraphTraits so that the inverse of an
82 // inverse falls back to the original graph
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Inverse.h | 20 struct traits<Inverse<XprType> >
32 /** \class Inverse
34 * \brief Expression of the inverse of another expression
36 * \tparam XprType the type of the expression we are taking the inverse
38 * This class represents an abstract expression of A.inverse()
43 class Inverse : public InverseImpl<XprType,typename internal::traits<XprType>::StorageKind>
51 typedef typename internal::ref_selector<Inverse>::type Nested;
54 explicit EIGEN_DEVICE_FUNC Inverse(const XprType &xpr)
70 : public internal::generic_xpr_base<Inverse<XprType> >::type
73 typedef typename internal::generic_xpr_base<Inverse<XprType> >::type Base
[all...] |
| /external/webrtc/webrtc/common_audio/ |
| real_fourier_openmax.h | 26 void Inverse(const std::complex<float>* src, float* dest) const override;
|
| real_fourier_ooura.h | 26 void Inverse(const std::complex<float>* src, float* dest) const override;
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| DataFlow.h | 60 template <> struct GraphTraits<Inverse<const User*> > {
64 static NodeType *getEntryNode(Inverse<const User*> G) {
81 template <> struct GraphTraits<Inverse<User*> > {
85 static NodeType *getEntryNode(Inverse<User*> G) {
|
| CFG.h | 270 // graph of basic blocks... and to walk it in inverse order. Inverse order for
274 template <> struct GraphTraits<Inverse<BasicBlock*> > {
277 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
286 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
289 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
330 // graph of basic blocks... and to walk it in inverse order. Inverse order for
334 template <> struct GraphTraits<Inverse<Function*> > :
335 public GraphTraits<Inverse<BasicBlock*> >
[all...] |
| /external/llvm/include/llvm/IR/ |
| CFG.h | 184 // graph of basic blocks... and to walk it in inverse order. Inverse order for
188 template <> struct GraphTraits<Inverse<BasicBlock*> > {
191 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
200 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
203 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
246 // graph of basic blocks... and to walk it in inverse order. Inverse order for
250 template <> struct GraphTraits<Inverse<Function*> > :
251 public GraphTraits<Inverse<BasicBlock*> >
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| CFG.h | 182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
186 template <> struct GraphTraits<Inverse<BasicBlock*>> {
189 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
194 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
197 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
245 // graph of basic blocks... and to walk it in inverse order. Inverse order for
249 template <> struct GraphTraits<Inverse<Function*>> :
250 public GraphTraits<Inverse<BasicBlock*>>
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/ |
| CFG.h | 182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
186 template <> struct GraphTraits<Inverse<BasicBlock*>> {
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
195 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
251 template <> struct GraphTraits<Inverse<Function*>> :
252 public GraphTraits<Inverse<BasicBlock*>>
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/IR/ |
| CFG.h | 182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
186 template <> struct GraphTraits<Inverse<BasicBlock*>> {
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
195 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
251 template <> struct GraphTraits<Inverse<Function*>> :
252 public GraphTraits<Inverse<BasicBlock*>>
[all...] |
