Home
last modified time | relevance | path

Searched refs:Inverse (Results 1 – 25 of 66) sorted by relevance

123

/external/vulkan-validation-layers/libs/glm/gtc/
Dmatrix_inverse.inl71 detail::tmat2x2<T, P> Inverse( local
77 return Inverse;
91 detail::tmat3x3<T, P> Inverse; local
92 Inverse[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]);
93 Inverse[0][1] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]);
94 Inverse[0][2] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]);
95 Inverse[1][0] = - (m[0][1] * m[2][2] - m[2][1] * m[0][2]);
96 Inverse[1][1] = + (m[0][0] * m[2][2] - m[2][0] * m[0][2]);
97 Inverse[1][2] = - (m[0][0] * m[2][1] - m[2][0] * m[0][1]);
98 Inverse[2][0] = + (m[0][1] * m[1][2] - m[1][1] * m[0][2]);
[all …]
/external/llvm/include/llvm/ADT/
DGraphTraits.h78 struct Inverse { struct
81 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
87 struct GraphTraits<Inverse<Inverse<T> > > {
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
DDepthFirstIterator.h243 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
244 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
245 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
250 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
255 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
269 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
275 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
280 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
DSCCIterator.h234 template <class T> scc_iterator<Inverse<T> > scc_begin(const Inverse<T> &G) { in scc_begin()
235 return scc_iterator<Inverse<T> >::begin(G); in scc_begin()
239 template <class T> scc_iterator<Inverse<T> > scc_end(const Inverse<T> &G) { in scc_end()
240 return scc_iterator<Inverse<T> >::end(G); in scc_end()
DPostOrderIterator.h212 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External > {
213 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
214 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
238 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/external/llvm/include/llvm/IR/
DCFG.h188 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) {
250 template <> struct GraphTraits<Inverse<Function*> > :
251 public GraphTraits<Inverse<BasicBlock*> > {
252 static NodeType *getEntryNode(Inverse<Function*> G) {
256 template <> struct GraphTraits<Inverse<const Function*> > :
257 public GraphTraits<Inverse<const BasicBlock*> > {
258 static NodeType *getEntryNode(Inverse<const Function *> G) {
DDominators.h44 extern template void Calculate<Function, Inverse<BasicBlock *>>(
45 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
/external/llvm/include/llvm/CodeGen/
DMachineFunction.h570 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/vulkan-validation-layers/libs/glm/detail/
Dtype_mat3x3.inl418 detail::tmat3x3<T, P> Inverse(detail::tmat3x3<T, P>::_null); local
419 Inverse[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]) * OneOverDeterminant;
420 Inverse[1][0] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]) * OneOverDeterminant;
421 Inverse[2][0] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]) * OneOverDeterminant;
422 Inverse[0][1] = - (m[0][1] * m[2][2] - m[2][1] * m[0][2]) * OneOverDeterminant;
423 Inverse[1][1] = + (m[0][0] * m[2][2] - m[2][0] * m[0][2]) * OneOverDeterminant;
424 Inverse[2][1] = - (m[0][0] * m[2][1] - m[2][0] * m[0][1]) * OneOverDeterminant;
425 Inverse[0][2] = + (m[0][1] * m[1][2] - m[1][1] * m[0][2]) * OneOverDeterminant;
426 Inverse[1][2] = - (m[0][0] * m[1][2] - m[1][0] * m[0][2]) * OneOverDeterminant;
427 Inverse[2][2] = + (m[0][0] * m[1][1] - m[1][0] * m[0][1]) * OneOverDeterminant;
[all …]
Dintrinsic_matrix.inl410 // valType Determinant = m[0][0] * Inverse[0][0]
411 // + m[0][1] * Inverse[1][0]
412 // + m[0][2] * Inverse[2][0]
413 // + m[0][3] * Inverse[3][0];
756 // valType Determinant = m[0][0] * Inverse[0][0]
757 // + m[0][1] * Inverse[1][0]
758 // + m[0][2] * Inverse[2][0]
759 // + m[0][3] * Inverse[3][0];
764 // Inverse /= Determinant;
977 // valType Determinant = m[0][0] * Inverse[0][0]
[all …]
/external/pdfium/xfa/src/fxbarcode/common/reedsolomon/
DBC_ReedSolomonDecoder.cpp130 int32_t dltInverse = m_field->Inverse(denominatorLeadingTerm, e); in RunEuclideanAlgorithm()
173 int32_t inverse = m_field->Inverse(sigmaTildeAtZero, e); in RunEuclideanAlgorithm()
201 (*result)[ie] = m_field->Inverse(i, ie); in FindErrorLocations()
222 int32_t xiInverse = m_field->Inverse(errorLocations->operator[](i), e); in FindErrorMagnitudes()
233 int32_t temp = m_field->Inverse(denominator, temp); in FindErrorMagnitudes()
DBC_ReedSolomonGF256.h26 int32_t Inverse(int32_t a, int32_t& e);
/external/llvm/include/llvm/Analysis/
DInterval.h136 template <> struct GraphTraits<Inverse<Interval*> > {
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
DLoopInfoImpl.h136 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopPredecessor()
158 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopLatch()
255 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in verifyLoop()
349 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in discoverAndMapSubloop()
481 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in analyze()
/external/pdfium/third_party/libopenjpeg20/
D0003-dwt-decode.patch28 Inverse 5-3 wavelet transform in 1-D
43 Inverse wavelet transform in 2-D.
94 /* Inverse 5-3 wavelet transform in 1-D. */
102 /* Inverse 5-3 wavelet transform in 1-D. */
168 /* Inverse wavelet transform in 2-D. */
/external/clang/include/clang/Analysis/
DCFG.h1028 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
1032 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G)
1042 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
1046 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
1088 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
1089 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
1098 template <> struct GraphTraits<Inverse<const ::clang::CFG*> >
1099 : public GraphTraits<Inverse<const ::clang::CFGBlock*> > {
/external/webrtc/webrtc/common_audio/
Dreal_fourier_openmax.h26 void Inverse(const std::complex<float>* src, float* dest) const override;
Dreal_fourier_ooura.h26 void Inverse(const std::complex<float>* src, float* dest) const override;
Dreal_fourier.h67 virtual void Inverse(const std::complex<float>* src, float* dest) const = 0;
Dreal_fourier_openmax.cc61 void RealFourierOpenmax::Inverse(const complex<float>* src, float* dest) const { in Inverse() function in webrtc::RealFourierOpenmax
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DAbstractBiMap.java91 inverse = new Inverse<V, K>(backward, this); in setDelegates()
349 private static class Inverse<K, V> extends AbstractBiMap<K, V> {
350 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) {
/external/guava/guava/src/com/google/common/collect/
DRegularImmutableBiMap.java247 return (result == null) ? inverse = new Inverse() : result;
250 private final class Inverse extends ImmutableBiMap<V, K> {
285 return Inverse.this;
DAbstractBiMap.java95 inverse = new Inverse<V, K>(backward, this); in setDelegates()
353 private static class Inverse<K, V> extends AbstractBiMap<K, V> {
354 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) {
/external/llvm/lib/IR/
DDominators.cpp70 template void llvm::Calculate<Function, Inverse<BasicBlock *>>(
71 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
/external/skia/site/dev/present/
Dpathops.md27 ## [Path Ops Inverse Fill Illustration](https://drive.google.com/file/d/0BwoLUwz9PYkHLWpsaXd0UDdaN0…

123