| /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);
|
| PostOrderIterator.h | 208 // Provide global definitions of inverse post order iterators...
212 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External > {
213 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) :
214 po_iterator<Inverse<T>, SetType, External> (V) {}
232 // Provide global definitions of external inverse postorder iterators...
238 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) :
|
| /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 {
|
| real_fourier_ooura.cc | 64 void RealFourierOoura::Inverse(const complex<float>* src, float* dest) const {
|
| lapped_transform.cc | 48 parent_->fft_->Inverse(parent_->cplx_post_.Row(i),
|
| real_fourier_unittest.cc | 101 this->rf_.Inverse(this->cplx_buffer_.get(), this->real_buffer_.get());
|
| /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...] |
| Dominators.h | 44 extern template void Calculate<Function, Inverse<BasicBlock *>>(
45 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
|
| /external/pdfium/xfa/src/fxbarcode/common/reedsolomon/ |
| BC_ReedSolomonGF256.h | 26 int32_t Inverse(int32_t a, int32_t& e);
|
| BC_ReedSolomonDecoder.cpp | 130 int32_t dltInverse = m_field->Inverse(denominatorLeadingTerm, e);
173 int32_t inverse = m_field->Inverse(sigmaTildeAtZero, e);
local
175 CBC_ReedSolomonGF256Poly* rsg13 = t->Multiply(inverse, e);
178 CBC_ReedSolomonGF256Poly* rsg14 = r->Multiply(inverse, e);
201 (*result)[ie] = m_field->Inverse(i, ie);
222 int32_t xiInverse = m_field->Inverse(errorLocations->operator[](i), e);
233 int32_t temp = m_field->Inverse(denominator, temp);
|
| BC_ReedSolomonGF256.cpp | 112 int32_t CBC_ReedSolomonGF256::Inverse(int32_t a, int32_t& e) {
|
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 136 template <> struct GraphTraits<Inverse<Interval*> > {
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| /external/pdfium/xfa/src/fxbarcode/pdf417/ |
| BC_PDF417HighLevelEncoder.h | 19 static void Inverse();
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 289 /// method provides the inverse mapping.
566 // graph of basic blocks... and to walk it in inverse order. Inverse order for
570 template <> struct GraphTraits<Inverse<MachineFunction*> > :
571 public GraphTraits<Inverse<MachineBasicBlock*> > {
572 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
576 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
577 public GraphTraits<Inverse<const MachineBasicBlock*> > {
578 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
|
| /external/opencv3/modules/ts/include/opencv2/ts/ |
| cuda_test.hpp | 278 // Direct/Inverse
280 class Inverse
283 inline Inverse(bool val = false) : val_(val) {}
291 CV_EXPORTS void PrintTo(const Inverse& useRoi, std::ostream* os);
293 #define DIRECT_INVERSE testing::Values(Inverse(false), Inverse(true))
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractBiMap.java | 49 transient AbstractBiMap<V, K> inverse; field in class:AbstractBiMap
56 /** Private constructor for inverse bimap. */
59 inverse = forward;
86 checkState(inverse == null);
91 inverse = new Inverse<V, K>(backward, this);
94 void setInverse(AbstractBiMap<V, K> inverse) {
95 this.inverse = inverse;
101 return inverse.containsKey(value)
170 public BiMap<V, K> inverse() { method in class:AbstractBiMap
[all...] |
| /external/opencv3/modules/cudawarping/test/ |
| test_warp_affine.cpp | 65 PARAM_TEST_CASE(BuildWarpAffineMaps, cv::cuda::DeviceInfo, cv::Size, Inverse)
69 bool inverse; local
75 inverse = GET_PARAM(2);
87 cv::cuda::buildWarpAffineMaps(M, inverse, size, xmap, ymap);
92 if (inverse)
133 void warpAffineGold(const cv::Mat& src, const cv::Mat& M, bool inverse, cv::Size dsize, cv::Mat& dst, int interpolation, int borderType, cv::Scalar borderVal)
169 if (inverse)
183 PARAM_TEST_CASE(WarpAffine, cv::cuda::DeviceInfo, cv::Size, MatType, Inverse, Interpolation, BorderType, UseRoi)
188 bool inverse; local
198 inverse = GET_PARAM(3)
241 bool inverse; local
[all...] |
| test_warp_perspective.cpp | 66 PARAM_TEST_CASE(BuildWarpPerspectiveMaps, cv::cuda::DeviceInfo, cv::Size, Inverse)
70 bool inverse; local
76 inverse = GET_PARAM(2);
87 cv::cuda::buildWarpPerspectiveMaps(M, inverse, size, xmap, ymap);
93 if (inverse)
136 void warpPerspectiveGold(const cv::Mat& src, const cv::Mat& M, bool inverse, cv::Size dsize, cv::Mat& dst, int interpolation, int borderType, cv::Scalar borderVal)
172 if (inverse)
186 PARAM_TEST_CASE(WarpPerspective, cv::cuda::DeviceInfo, cv::Size, MatType, Inverse, Interpolation, BorderType, UseRoi)
191 bool inverse; local
201 inverse = GET_PARAM(3)
244 bool inverse; local
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | [all...] |
| /external/llvm/lib/IR/ |
| Dominators.cpp | 70 template void llvm::Calculate<Function, Inverse<BasicBlock *>>(
71 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
|
