| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
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.
66 // Not all graphs define an inverse ordering, and if they do, it depends on
74 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
78 struct Inverse {
81 inline Inverse(const GraphType &G) : Graph(G) {}
84 // Provide a partial specialization of GraphTraits so that the inverse of an
85 // inverse falls back to the original graph
[all...] |
| DepthFirstIterator.h | 17 // * Depth-first iteration on the 'inverse' graph.
26 // * Depth-first iteration on the 'inverse' graph.
235 // Provide global definitions of inverse depth first iterators...
239 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));
260 // Provide global definitions of external inverse depth first iterators...
265 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V
[all...] |
| SCCIterator.h | 18 /// 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);
|
| PostOrderIterator.h | 196 // Provide global definitions of inverse post order iterators...
200 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) {}
215 // Provide global definitions of external inverse postorder iterators...
221 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) :
|
| /external/llvm/include/llvm/IR/ |
| CFG.h | 302 // 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*> >
[all...] |
| Dominators.h | 42 void Calculate<Function LLVM_COMMA Inverse<BasicBlock *> >(
43 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
|
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 136 template <> struct GraphTraits<Inverse<Interval*> > {
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| LoopInfoImpl.h | 136 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;
|
| IntervalIterator.h | 89 class IGT = GraphTraits<Inverse<NodeTy*> > >
|
| LoopInfo.h | 171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
238 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 254 /// method provides the inverse mapping.
516 // 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) {
|
| MachineBasicBlock.h | 731 // 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/chromium_org/ui/gfx/geometry/ |
| matrix3_unittest.cc | 67 TEST(Matrix3fTest, Inverse) {
69 Matrix3F inv_identity = identity.Inverse();
77 EXPECT_EQ(Matrix3F::Zeros(), singular.Inverse());
83 Matrix3F inv_regular = regular.Inverse();
|
| matrix3_f.h | 62 // Returns an inverse of this if the matrix is non-singular, zero (== Zero())
64 Matrix3F Inverse() const;
|
| matrix3_f.cc | 34 // computing inverse we do want higher precision afforded by the explicit
101 Matrix3F Matrix3F::Inverse() const {
102 Matrix3F inverse = Matrix3F::Zeros(); local
105 return inverse; // Singular matrix. Return Zeros().
107 inverse.set(
117 return inverse;
|
| /external/chromium_org/cc/test/ |
| geometry_test_utils.cc | 37 gfx::Transform Inverse(const gfx::Transform& transform) {
|
| geometry_test_utils.h | 94 gfx::Transform Inverse(const gfx::Transform& transform);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractBiMap.java | 48 private transient AbstractBiMap<V, K> inverse; field in class:AbstractBiMap
55 /** Private constructor for inverse bimap. */
58 inverse = forward;
71 checkState(inverse == null);
76 inverse = new Inverse<V, K>(backward, this);
79 void setInverse(AbstractBiMap<V, K> inverse) {
80 this.inverse = inverse;
86 return inverse.containsKey(value)
153 public BiMap<V, K> inverse() { method in class:AbstractBiMap
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | [all...] |
| /external/llvm/lib/IR/ |
| Dominators.cpp | 72 void llvm::Calculate<Function LLVM_COMMA Inverse<BasicBlock *> >(
73 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractBiMap.java | 52 private transient AbstractBiMap<V, K> inverse; field in class:AbstractBiMap
59 /** Private constructor for inverse bimap. */
62 inverse = forward;
75 checkState(inverse == null);
80 inverse = new Inverse<V, K>(backward, this);
83 void setInverse(AbstractBiMap<V, K> inverse) {
84 this.inverse = inverse;
90 return inverse.containsKey(value)
157 public BiMap<V, K> inverse() { method in class:AbstractBiMap
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 241 typedef GraphTraits<Inverse<N> > InvTraits;
568 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
703 Calculate<FT, Inverse<NodeT*> >(*this, F);
|
| GenericDomTreeConstruction.h | 207 typedef GraphTraits<Inverse<NodeT> > InvTraits;
|
| /external/chromium_org/cc/layers/ |
| layer_position_constraint_unittest.cc | 651 // The rotation and its inverse are needed to place the scroll delta
653 // rotation/inverse are backwards, too, so it requires perfect order of
657 Inverse(rotation_about_z));
692 // The rotation and its inverse are needed to place the scroll delta
694 // rotation/inverse are backwards, too, so it requires perfect order of
697 Inverse(rotation_about_z));
[all...] |
| /development/ndk/sources/android/ndk_helper/ |
| vecmath.cpp | 115 Mat4 Mat4::Inverse()
172 /* Calculate -C * inverse(A) */
|
