Home
last modified time | relevance | path

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

1234567

/external/oboe/samples/RhythmGame/third_party/glm/gtc/
Dmatrix_inverse.inl34 tmat2x2<T, P> Inverse( local
40 return Inverse;
51 tmat3x3<T, P> Inverse(uninitialize); local
52 Inverse[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]);
53 Inverse[0][1] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]);
54 Inverse[0][2] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]);
55 Inverse[1][0] = - (m[0][1] * m[2][2] - m[2][1] * m[0][2]);
56 Inverse[1][1] = + (m[0][0] * m[2][2] - m[2][0] * m[0][2]);
57 Inverse[1][2] = - (m[0][0] * m[2][1] - m[2][0] * m[0][1]);
58 Inverse[2][0] = + (m[0][1] * m[1][2] - m[1][1] * m[0][2]);
[all …]
/external/llvm-project/llvm/include/llvm/ADT/
DGraphTraits.h95 struct Inverse { struct
98 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
115 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
116 GraphTraits<Inverse<GraphType>>::nodes_end(G));
127 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
129 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
130 GraphTraits<Inverse<GraphType>>::child_end(G));
DDepthFirstIterator.h259 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
260 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
261 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
266 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
271 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
285 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
291 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
296 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DGraphTraits.h95 struct Inverse { struct
98 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
115 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
116 GraphTraits<Inverse<GraphType>>::nodes_end(G));
127 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
129 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
130 GraphTraits<Inverse<GraphType>>::child_end(G));
DDepthFirstIterator.h259 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
260 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
261 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
266 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
271 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
285 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
291 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
296 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
DPostOrderIterator.h214 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> {
215 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
216 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
239 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/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()
/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/llvm-project/mlir/include/mlir/IR/
DRegionGraphTraits.h35 template <> struct GraphTraits<Inverse<mlir::Block *>> {
39 static NodeRef getEntryNode(Inverse<NodeRef> inverseGraph) {
67 struct GraphTraits<Inverse<mlir::Region *>>
68 : public GraphTraits<Inverse<mlir::Block *>> {
69 using GraphType = Inverse<mlir::Region *>;
/external/oboe/samples/RhythmGame/third_party/glm/detail/
Dfunc_matrix.inl261 tmat2x2<T, P> Inverse( local
267 return Inverse;
281 tmat3x3<T, P> Inverse(uninitialize); local
282 Inverse[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]) * OneOverDeterminant;
283 Inverse[1][0] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]) * OneOverDeterminant;
284 Inverse[2][0] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]) * OneOverDeterminant;
285 Inverse[0][1] = - (m[0][1] * m[2][2] - m[2][1] * m[0][2]) * OneOverDeterminant;
286 Inverse[1][1] = + (m[0][0] * m[2][2] - m[2][0] * m[0][2]) * OneOverDeterminant;
287 Inverse[2][1] = - (m[0][0] * m[2][1] - m[2][0] * m[0][1]) * OneOverDeterminant;
288 Inverse[0][2] = + (m[0][1] * m[1][2] - m[1][1] * m[0][2]) * OneOverDeterminant;
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DCFG.h322 template <> struct GraphTraits<Inverse<BasicBlock*>> {
326 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
331 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
335 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
387 template <> struct GraphTraits<Inverse<Function*>> :
388 public GraphTraits<Inverse<BasicBlock*>> {
389 static NodeRef getEntryNode(Inverse<Function *> G) {
393 template <> struct GraphTraits<Inverse<const Function*>> :
394 public GraphTraits<Inverse<const BasicBlock*>> {
395 static NodeRef getEntryNode(Inverse<const Function *> G) {
/external/llvm-project/llvm/include/llvm/IR/
DCFG.h323 template <> struct GraphTraits<Inverse<BasicBlock*>> {
327 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
332 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
336 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
388 template <> struct GraphTraits<Inverse<Function*>> :
389 public GraphTraits<Inverse<BasicBlock*>> {
390 static NodeRef getEntryNode(Inverse<Function *> G) {
394 template <> struct GraphTraits<Inverse<const Function*>> :
395 public GraphTraits<Inverse<const BasicBlock*>> {
396 static NodeRef getEntryNode(Inverse<const Function *> G) {
/external/skia/modules/sksg/src/
DSkSGTransform.cpp84 class Inverse final : public Transform { class
88 explicit Inverse(sk_sp<Transform> t) in Inverse() function in sksg::__anon48347fba0111::Inverse
95 ~Inverse() override { in ~Inverse()
166 ? sk_sp<Transform>(new Inverse<SkM44 >(std::move(t))) in MakeInverse()
167 : sk_sp<Transform>(new Inverse<SkMatrix>(std::move(t))); in MakeInverse()
/external/libchrome/ui/gfx/geometry/
Dmatrix3_unittest.cc70 TEST(Matrix3fTest, Inverse) { in TEST() argument
72 Matrix3F inv_identity = identity.Inverse(); in TEST()
80 EXPECT_EQ(Matrix3F::Zeros(), singular.Inverse()); in TEST()
86 Matrix3F inv_regular = regular.Inverse(); in TEST()
/external/llvm-project/llvm/include/llvm/Analysis/
DLoopInfoImpl.h97 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
201 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopPredecessor()
219 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopLatch()
311 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
312 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
317 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
318 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
427 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
470 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) { in discoverAndMapSubloop()
553 for (const auto Backedge : children<Inverse<BlockT *>>(Header)) { in analyze()
DInterval.h130 template <> struct GraphTraits<Inverse<Interval*>> {
134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DLoopInfoImpl.h91 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
195 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopPredecessor()
213 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopLatch()
305 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
306 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
311 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
312 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
421 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
464 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) { in discoverAndMapSubloop()
547 for (const auto Backedge : children<Inverse<BlockT *>>(Header)) { in analyze()
DInterval.h130 template <> struct GraphTraits<Inverse<Interval*>> {
134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
/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/tensorflow/tensorflow/compiler/xla/
Dcomparison_util.cc122 absl::optional<Comparison> Comparison::Inverse() const { in Inverse() function in xla::Comparison
131 return Comparison(Inverse(dir_), type_); in Inverse()
180 /* static */ Comparison::Direction Comparison::Inverse( in Inverse() function in xla::Comparison
/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; }

1234567