Home
last modified time | relevance | path

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

12345

/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/eigen/Eigen/src/Core/
DInverse.h20 struct traits<Inverse<XprType> >
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;
94 struct unary_evaluator<Inverse<ArgType> >
95 : public evaluator<typename Inverse<ArgType>::PlainObject>
97 typedef Inverse<ArgType> InverseType;
/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/swiftshader/third_party/LLVM/include/llvm/ADT/
DGraphTraits.h75 struct Inverse { struct
78 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
84 struct GraphTraits<Inverse<Inverse<T> > > {
88 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
DDepthFirstIterator.h232 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
233 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
234 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
239 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
244 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
252 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
258 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
263 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
DSCCIterator.h209 scc_iterator<Inverse<T> > scc_begin(const Inverse<T> &G) { in scc_begin()
210 return scc_iterator<Inverse<T> >::begin(G); in scc_begin()
214 scc_iterator<Inverse<T> > scc_end(const Inverse<T> &G) { in scc_end()
215 return scc_iterator<Inverse<T> >::end(G); in scc_end()
DPostOrderIterator.h161 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External > {
162 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
163 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
182 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) {
/external/swiftshader/third_party/LLVM/include/llvm/Support/
DCFG.h274 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) {
334 template <> struct GraphTraits<Inverse<Function*> > :
335 public GraphTraits<Inverse<BasicBlock*> > {
336 static NodeType *getEntryNode(Inverse<Function*> G) {
340 template <> struct GraphTraits<Inverse<const Function*> > :
341 public GraphTraits<Inverse<const BasicBlock*> > {
342 static NodeType *getEntryNode(Inverse<const Function *> G) {
DDataFlow.h60 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) {
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DBlockFrequencyImpl.h50 typedef GraphTraits< Inverse<BlockT *> > GT;
157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in getSingleBlockPred()
158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in getSingleBlockPred()
194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doBlock()
195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in doBlock()
238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), in doLoop()
239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); in doLoop()
290 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doFunction()
291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in doFunction()
DInterval.h139 template <> struct GraphTraits<Inverse<Interval*> > {
142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
DMachineFunction.h463 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) {
DMachineBasicBlock.h501 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
504 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
515 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
518 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> 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 …]
/external/llvm/include/llvm/CodeGen/
DMachineFunction.h651 template <> struct GraphTraits<Inverse<MachineFunction*> > :
652 public GraphTraits<Inverse<MachineBasicBlock*> > {
653 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
657 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
658 public GraphTraits<Inverse<const MachineBasicBlock*> > {
659 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
/external/eigen/Eigen/src/SparseCore/
DSparsePermutation.h161 inline const Product<SparseDerived, Inverse<PermutationType>, AliasFreeProduct>
164 …return Product<SparseDerived, Inverse<PermutationType>, AliasFreeProduct>(matrix.derived(), tperm.…
170 inline const Product<Inverse<PermutationType>, SparseDerived, AliasFreeProduct>
173 …return Product<Inverse<PermutationType>, SparseDerived, AliasFreeProduct>(tperm.derived(), matrix.…
/external/llvm/include/llvm/Analysis/
DInterval.h138 template <> struct GraphTraits<Inverse<Interval*> > {
141 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/eigen/Eigen/src/QR/
DCompleteOrthogonalDecomposition.h276 inline const Inverse<CompleteOrthogonalDecomposition> pseudoInverse() const
278 return Inverse<CompleteOrthogonalDecomposition>(*this);
531 struct Assignment<DstXprType, Inverse<CompleteOrthogonalDecomposition<MatrixType> >, internal::assi…
534 typedef Inverse<CodType> SrcXprType;
/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/eigen/Eigen/src/LU/
DPartialPivLU.h197 inline const Inverse<PartialPivLU> inverse() const
200 return Inverse<PartialPivLU>(*this);
568 struct Assignment<DstXprType, Inverse<PartialPivLU<MatrixType> >, internal::assign_op<typename DstX…
571 typedef Inverse<LuType> SrcXprType;

12345