/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...] |
DepthFirstIterator.h | 17 // * Depth-first iteration on the 'inverse' graph. 26 // * Depth-first iteration on the 'inverse' graph. 239 // Provide global definitions of inverse depth first iterators... 243 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> { 244 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) 245 : df_iterator<Inverse<T>, SetTy, External>(V) {} 250 return idf_iterator<T>::begin(Inverse<T>(G)); 255 return idf_iterator<T>::end(Inverse<T>(G)); 264 // Provide global definitions of external inverse depth first iterators... 269 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V [all...] |
SCCIterator.h | 18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE: 233 /// \brief Construct the begin iterator for a deduced graph type T's Inverse<T>. 234 template <class T> scc_iterator<Inverse<T> > scc_begin(const Inverse<T> &G) { 235 return scc_iterator<Inverse<T> >::begin(G); 238 /// \brief Construct the end iterator for a deduced graph type T's Inverse<T>. 239 template <class T> scc_iterator<Inverse<T> > scc_end(const Inverse<T> &G) { 240 return scc_iterator<Inverse<T> >::end(G);
|
/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...] |
SCCIterator.h | 16 // To visit S1 *before* S2, use the scc_iterator on the Inverse graph. 209 scc_iterator<Inverse<T> > scc_begin(const Inverse<T> &G) { 210 return scc_iterator<Inverse<T> >::begin(G); 214 scc_iterator<Inverse<T> > scc_end(const Inverse<T> &G) { 215 return scc_iterator<Inverse<T> >::end(G);
|
DepthFirstIterator.h | 17 // * Depth-first iteration on the 'inverse' graph. 26 // * Depth-first iteration on the 'inverse' graph. 228 // Provide global definitions of inverse depth first iterators... 232 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> { 233 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) 234 : df_iterator<Inverse<T>, SetTy, External>(V) {} 239 return idf_iterator<T>::begin(Inverse<T>(G)); 244 return idf_iterator<T>::end(Inverse<T>(G)); 247 // Provide global definitions of external inverse depth first iterators... 252 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V [all...] |
/external/swiftshader/third_party/llvm-7.0/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... 75 // Inverse - This class is used as a little marker class to tell the graph 76 // iterator to iterate over the graph in a graph defined "Inverse" ordering. 77 // Not all graphs define an inverse ordering, and if they do, it depends on 85 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M); 89 struct Inverse { 92 inline Inverse(const GraphType &G) : Graph(G) {} 95 // Provide a partial specialization of GraphTraits so that the inverse of an 96 // inverse falls back to the original graph [all...] |
DepthFirstIterator.h | 17 // * Depth-first iteration on the 'inverse' graph. 26 // * Depth-first iteration on the 'inverse' graph. 255 // Provide global definitions of inverse depth first iterators... 260 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> { 261 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) 262 : df_iterator<Inverse<T>, SetTy, External>(V) {} 267 return idf_iterator<T>::begin(Inverse<T>(G)); 272 return idf_iterator<T>::end(Inverse<T>(G)); 281 // Provide global definitions of external inverse depth first iterators... 286 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V [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;
|
real_fourier.h | 19 // Uniform interface class for the real DFT and its inverse, for power-of-2 65 // Inverse transform. Same input format as output above, conjugate pairs 67 virtual void Inverse(const std::complex<float>* src, float* dest) const = 0;
|
real_fourier_openmax.cc | 61 void RealFourierOpenmax::Inverse(const complex<float>* src, float* dest) const {
|
/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...] |
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
CFG.h | 188 // graph of basic blocks... and to walk it in inverse order. Inverse order for 192 template <> struct GraphTraits<Inverse<BasicBlock*>> { 196 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } 201 template <> struct GraphTraits<Inverse<const BasicBlock*>> { 205 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; } 253 // graph of basic blocks... and to walk it in inverse order. Inverse order for 257 template <> struct GraphTraits<Inverse<Function*>> : 258 public GraphTraits<Inverse<BasicBlock*>> [all...] |
/external/llvm/include/llvm/Analysis/ |
IteratedDominanceFrontier.h | 43 /// The template parameters should be either BasicBlock* or Inverse<BasicBlock 95 typedef IDFCalculator<Inverse<BasicBlock *>> ReverseIDFCalculator;
|
Interval.h | 138 template <> struct GraphTraits<Inverse<Interval*> > { 141 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
IteratedDominanceFrontier.h | 43 /// The template parameters should be either BasicBlock* or Inverse<BasicBlock 93 typedef IDFCalculator<Inverse<BasicBlock *>, true> ReverseIDFCalculator;
|
Interval.h | 131 template <> struct GraphTraits<Inverse<Interval*>> { 135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
BlockFrequencyImpl.h | 50 typedef GraphTraits< Inverse<BlockT *> > GT; 157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), 158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), 195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), 239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); 290 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), 291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
|
Interval.h | 139 template <> struct GraphTraits<Inverse<Interval*> > { 142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
/external/pdfium/fxbarcode/common/reedsolomon/ |
BC_ReedSolomonGF256.h | 32 int32_t Inverse(int32_t a, int32_t& e);
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
MachineFunction.h | 229 /// method provides the inverse mapping. 459 // graph of basic blocks... and to walk it in inverse order. Inverse order for 463 template <> struct GraphTraits<Inverse<MachineFunction*> > : 464 public GraphTraits<Inverse<MachineBasicBlock*> > { 465 static NodeType *getEntryNode(Inverse<MachineFunction*> G) { 469 template <> struct GraphTraits<Inverse<const MachineFunction*> > : 470 public GraphTraits<Inverse<const MachineBasicBlock*> > { 471 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
|