Home
last modified time | relevance | path

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

123

/third_party/skia/third_party/externals/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 …]
/third_party/skia/third_party/externals/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()
/third_party/skia/third_party/externals/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 …]
/third_party/skia/third_party/externals/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) {
DCFGDiff.h276 std::pair<const GraphDiff<BasicBlock *, false> *, Inverse<BasicBlock *>>>
280 std::pair<const GraphDiff<BasicBlock *, true> *, Inverse<BasicBlock *>>>
/third_party/flutter/skia/modules/sksg/src/
DSkSGTransform.cpp66 class Inverse final : public Transform { class
70 explicit Inverse(sk_sp<Transform> t) in Inverse() function in sksg::__anon82be39790111::Inverse
77 ~Inverse() override { in ~Inverse()
136 ? sk_sp<Transform>(new Inverse<SkMatrix44>(std::move(t))) in MakeInverse()
137 : sk_sp<Transform>(new Inverse<SkMatrix >(std::move(t))); in MakeInverse()
/third_party/skia/modules/sksg/src/
DSkSGTransform.cpp84 class Inverse final : public Transform { class
88 explicit Inverse(sk_sp<Transform> t) in Inverse() function in sksg::__anon745ae5840111::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()
/third_party/skia/third_party/externals/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; }
DLoopInfo.h227 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header); in isLoopLatch()
228 auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header); in isLoopLatch()
238 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getNumBackEdges()
317 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getLoopLatches()
DMemorySSAUpdater.h68 std::pair<const GraphDiff<BasicBlock *> *, Inverse<BasicBlock *>>;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachineFunction.h1067 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1068 public GraphTraits<Inverse<MachineBasicBlock*>> {
1069 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1073 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1074 public GraphTraits<Inverse<const MachineBasicBlock*>> {
1075 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
DMachineBasicBlock.h894 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> {
898 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
906 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> {
910 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/third_party/flutter/skia/site/dev/present/
Dpathops.md27 ## [Path Ops Inverse Fill Illustration](https://drive.google.com/file/d/0BwoLUwz9PYkHLWpsaXd0UDdaN0…
/third_party/skia/site/docs/dev/present/
Dpathops.md32 ## [Path Ops Inverse Fill Illustration](https://drive.google.com/file/d/0BwoLUwz9PYkHLWpsaXd0UDdaN0…
/third_party/flutter/skia/third_party/externals/wuffs/test/data/artificial/
Ddeflate-backref-crosses-blocks.deflate.commentary.txt8 000003 0x0003 . 0xFB 0b_1111_1011 Inverse: 0xFFFB
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
DVPlan.h1263 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
1267 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1323 struct GraphTraits<Inverse<VPRegionBlock *>>
1324 : public GraphTraits<Inverse<VPBlockBase *>> {
1328 static NodeRef getEntryNode(Inverse<GraphRef> N) {
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DGenericDomTree.h653 Split<Inverse<NodeT *>>(NewBB);
781 for (auto Pred : children<Inverse<N>>(NewBB))
787 for (auto Pred : children<Inverse<N>>(NewBBSucc)) {
DGenericIteratedDominanceFrontier.h60 typename std::conditional<IsPostDom, Inverse<NodeTy *>, NodeTy *>::type;
/third_party/openssl/doc/man3/
DSSL_CONF_cmd.pod459 B<SessionTicket>: session ticket support, enabled by default. Inverse of
463 B<Compression>: SSL/TLS compression support, disabled by default. Inverse
468 is set by default. Inverse of B<SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS>.
472 B<DHSingle>: enable single use DH keys, set by default. Inverse of
475 B<ECDHSingle>: enable single use ECDH keys, set by default. Inverse of
501 default. Inverse of B<SSL_OP_NO_ENCRYPT_THEN_MAC>: that is,
524 default. Inverse of B<SSL_OP_NO_EXTENDED_MASTER_SECRET>: that is,
528 default. Inverse of B<SSL_OP_DISABLE_TLSEXT_CA_NAMES>: that is,
/third_party/flutter/skia/third_party/externals/icu/source/data/translit/
DHebr_Latn.txt22 # Use hebrew-latin/XXX for Output 1, and (Inverse) for Output 2
/third_party/icu/icu4c/source/data/translit/
DHebr_Latn.txt23 # Use hebrew-latin/XXX for Output 1, and (Inverse) for Output 2
/third_party/skia/third_party/externals/icu/source/data/translit/
DHebr_Latn.txt23 # Use hebrew-latin/XXX for Output 1, and (Inverse) for Output 2

123