Home
last modified time | relevance | path

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

12

/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.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.h200 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External > {
201 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
202 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
221 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/external/llvm/include/llvm/Support/
DCFG.h288 template <> struct GraphTraits<Inverse<BasicBlock*> > {
291 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
300 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
303 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
350 template <> struct GraphTraits<Inverse<Function*> > :
351 public GraphTraits<Inverse<BasicBlock*> > {
352 static NodeType *getEntryNode(Inverse<Function*> G) {
356 template <> struct GraphTraits<Inverse<const Function*> > :
357 public GraphTraits<Inverse<const BasicBlock*> > {
358 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/llvm/include/llvm/Analysis/
DBlockFrequencyImpl.h49 typedef GraphTraits< Inverse<BlockT *> > GT;
134 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in getSingleBlockPred()
135 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in getSingleBlockPred()
171 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doBlock()
172 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in doBlock()
219 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), in doLoop()
220 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); in doLoop()
296 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doFunction()
297 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; }
DLoopInfoImpl.h149 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopPredecessor()
171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in getLoopLatch()
273 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in verifyLoop()
368 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in discoverAndMapSubloop()
530 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; in Analyze()
DDominators.h247 typedef GraphTraits<Inverse<N> > InvTraits; in Split()
539 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB); in splitBlock()
674 Calculate<FT, Inverse<NodeT*> >(*this, F); in recalculate()
/external/chromium_org/ui/gfx/
Dmatrix3_unittest.cc67 TEST(Matrix3fTest, Inverse) { in TEST() argument
69 Matrix3F inv_identity = identity.Inverse(); in TEST()
77 EXPECT_EQ(Matrix3F::Zeros(), singular.Inverse()); in TEST()
83 Matrix3F inv_regular = regular.Inverse(); in TEST()
Dmatrix3_f.h64 Matrix3F Inverse() const;
/external/llvm/include/llvm/CodeGen/
DMachineFunction.h509 template <> struct GraphTraits<Inverse<MachineFunction*> > :
510 public GraphTraits<Inverse<MachineBasicBlock*> > {
511 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
515 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
516 public GraphTraits<Inverse<const MachineBasicBlock*> > {
517 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
DMachineBasicBlock.h708 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
711 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
722 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
725 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
/external/clang/include/clang/Analysis/
DCFG.h893 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
897 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G)
907 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
911 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
953 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
954 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
963 template <> struct GraphTraits<Inverse<const ::clang::CFG*> >
964 : public GraphTraits<Inverse<const ::clang::CFGBlock*> > {
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DAbstractBiMap.java76 inverse = new Inverse<V, K>(backward, this); in setDelegates()
368 private static class Inverse<K, V> extends AbstractBiMap<K, V> {
369 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) {
/external/guava/guava/src/com/google/common/collect/
DAbstractBiMap.java80 inverse = new Inverse<V, K>(backward, this); in setDelegates()
372 private static class Inverse<K, V> extends AbstractBiMap<K, V> {
373 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) {
/external/dropbear/libtommath/logs/
Dgraphs.dem16 plot 'invmod.log' smooth bezier title "Modular Inverse"
/external/eigen/Eigen/
DLU28 #include "src/LU/Inverse.h"
/external/chromium_org/cc/test/
Dgeometry_test_utils.cc37 gfx::Transform Inverse(const gfx::Transform& transform) { in Inverse() function
Dgeometry_test_utils.h94 gfx::Transform Inverse(const gfx::Transform& transform);
/external/qemu/distrib/jpeg-6b/
Dfilelist.doc91 jidctint.c Inverse DCT using slow-but-accurate integer method.
92 jidctfst.c Inverse DCT using faster, less accurate integer method.
93 jidctflt.c Inverse DCT using floating-point arithmetic.
94 jidctred.c Inverse DCTs with reduced-size outputs.
/external/jpeg/
Dfilelist.doc91 jidctint.c Inverse DCT using slow-but-accurate integer method.
92 jidctfst.c Inverse DCT using faster, less accurate integer method.
93 jidctflt.c Inverse DCT using floating-point arithmetic.
94 jidctred.c Inverse DCTs with reduced-size outputs.
/external/chromium_org/chrome_frame/test/
Durlmon_moniker_tests.h145 MOCK_METHOD1_WITH_CALLTYPE(__stdcall, Inverse,
/external/chromium_org/cc/layers/
Dlayer_position_constraint_unittest.cc649 Inverse(rotation_about_z)); in TEST_F()
689 Inverse(rotation_about_z)); in TEST_F()
827 Inverse(compound_draw_transform)); in TEST_F()
873 Inverse(compound_draw_transform)); in TEST_F()

12