Searched refs:Inverse (Results 1 - 25 of 41) sorted by relevance

12

/external/llvm/include/llvm/ADT/
H A DGraphTraits.h13 // This file also defines the marker class Inverse that is used to iterate over
64 // Inverse - This class is used as a little marker class to tell the graph
65 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
74 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
78 struct Inverse { struct in namespace:llvm
81 inline Inverse(const GraphType &G) : Graph(G) {} function in struct:llvm::Inverse
87 struct GraphTraits<Inverse<Inverse<T> > > {
91 static NodeType *getEntryNode(Inverse<Inverse<
[all...]
H A DDepthFirstIterator.h239 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
240 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V)
241 : df_iterator<Inverse<T>, SetTy, External>(V) {}
246 return idf_iterator<T>::begin(Inverse<T>(G));
251 return idf_iterator<T>::end(Inverse<T>(G));
265 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V)
271 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
276 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
H A DSCCIterator.h18 /// To visit S1 *before* S2, use the scc_iterator on the Inverse graph. (NOTE:
233 /// \brief Construct the begin iterator for a deduced graph type T's Inverse<T>.
234 template <class T> scc_iterator<Inverse<T> > scc_begin(const Inverse<T> &G) {
235 return scc_iterator<Inverse<T> >::begin(G);
238 /// \brief Construct the end iterator for a deduced graph type T's Inverse<T>.
239 template <class T> scc_iterator<Inverse<T> > scc_end(const Inverse<T> &G) {
240 return scc_iterator<Inverse<T> >::end(G);
H A DPostOrderIterator.h200 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External > {
201 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) :
202 po_iterator<Inverse<T>, SetType, External> (V) {}
221 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) :
/external/llvm/include/llvm/IR/
H A DCFG.h302 // graph of basic blocks... and to walk it in inverse order. Inverse order for
306 template <> struct GraphTraits<Inverse<BasicBlock*> > {
309 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
318 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
321 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
364 // graph of basic blocks... and to walk it in inverse order. Inverse order for
368 template <> struct GraphTraits<Inverse<Function*> > :
369 public GraphTraits<Inverse<BasicBlock*> > {
370 static NodeType *getEntryNode(Inverse<Function*> G) {
374 template <> struct GraphTraits<Inverse<cons
[all...]
H A DDominators.h42 void Calculate<Function LLVM_COMMA Inverse<BasicBlock *> >(
43 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
/external/llvm/include/llvm/CodeGen/
H A DMachineFunction.h516 // graph of basic blocks... and to walk it in inverse order. Inverse order for
520 template <> struct GraphTraits<Inverse<MachineFunction*> > :
521 public GraphTraits<Inverse<MachineBasicBlock*> > {
522 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
526 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
527 public GraphTraits<Inverse<const MachineBasicBlock*> > {
528 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h731 // in inverse order. Inverse order for a function is considered
735 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
738 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
749 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
752 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
/external/llvm/include/llvm/Analysis/
H A DInterval.h136 template <> struct GraphTraits<Inverse<Interval*> > {
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DLoopInfoImpl.h136 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
158 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
255 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
349 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
510 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
H A DIntervalIterator.h89 class IGT = GraphTraits<Inverse<NodeTy*> > >
H A DLoopInfo.h171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
238 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
H A DScalarEvolution.h527 bool Inverse);
/external/chromium_org/ui/gfx/geometry/
H A Dmatrix3_unittest.cc67 TEST(Matrix3fTest, Inverse) {
69 Matrix3F inv_identity = identity.Inverse();
77 EXPECT_EQ(Matrix3F::Zeros(), singular.Inverse());
83 Matrix3F inv_regular = regular.Inverse();
H A Dmatrix3_f.h64 Matrix3F Inverse() const;
H A Dmatrix3_f.cc101 Matrix3F Matrix3F::Inverse() const { function in class:gfx::Matrix3F
/external/chromium_org/cc/test/
H A Dgeometry_test_utils.cc37 gfx::Transform Inverse(const gfx::Transform& transform) { function in namespace:cc
H A Dgeometry_test_utils.h94 gfx::Transform Inverse(const gfx::Transform& transform);
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DAbstractBiMap.java76 inverse = new Inverse<V, K>(backward, this);
368 private static class Inverse<K, V> extends AbstractBiMap<K, V> { class in class:AbstractBiMap
369 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) { method in class:AbstractBiMap.Inverse
/external/clang/include/clang/Analysis/
H A DCFG.h1030 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
1034 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G)
1044 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
1048 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
1090 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
1091 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
1100 template <> struct GraphTraits<Inverse<const ::clang::CFG*> >
1101 : public GraphTraits<Inverse<const ::clang::CFGBlock*> > {
/external/llvm/lib/IR/
H A DDominators.cpp72 void llvm::Calculate<Function LLVM_COMMA Inverse<BasicBlock *> >(
73 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
/external/guava/guava/src/com/google/common/collect/
H A DAbstractBiMap.java80 inverse = new Inverse<V, K>(backward, this);
372 private static class Inverse<K, V> extends AbstractBiMap<K, V> { class in class:AbstractBiMap
373 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) { method in class:AbstractBiMap.Inverse
/external/llvm/include/llvm/Support/
H A DGenericDomTree.h241 typedef GraphTraits<Inverse<N> > InvTraits;
568 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
703 Calculate<FT, Inverse<NodeT*> >(*this, F);
H A DGenericDomTreeConstruction.h207 typedef GraphTraits<Inverse<NodeT> > InvTraits;
/external/chromium_org/cc/layers/
H A Dlayer_position_constraint_unittest.cc657 Inverse(rotation_about_z));
697 Inverse(rotation_about_z));
819 // transform is: compound_draw_transform.Inverse() * translate(positive scroll
834 Inverse(compound_draw_transform));
880 Inverse(compound_draw_transform));

Completed in 762 milliseconds

12