| /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...
61 // Inverse - This class is used as a little marker class to tell the graph
62 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
63 // Not all graphs define an inverse ordering, and if they do, it depends on
71 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
75 struct Inverse {
78 inline Inverse(const GraphType &G) : Graph(G) {}
81 // Provide a partial specialization of GraphTraits so that the inverse of an
82 // inverse falls back to the original graph
[all...] |
| SCCIterator.h | 16 // To visit S1 *before* S2, use the scc_iterator on the Inverse graph.
209 scc_iterator<Inverse<T> > scc_begin(const Inverse<T> &G) {
210 return scc_iterator<Inverse<T> >::begin(G);
214 scc_iterator<Inverse<T> > scc_end(const Inverse<T> &G) {
215 return scc_iterator<Inverse<T> >::end(G);
|
| DepthFirstIterator.h | 17 // * Depth-first iteration on the 'inverse' graph.
26 // * Depth-first iteration on the 'inverse' graph.
228 // Provide global definitions of inverse depth first iterators...
232 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
233 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V)
234 : df_iterator<Inverse<T>, SetTy, External>(V) {}
239 return idf_iterator<T>::begin(Inverse<T>(G));
244 return idf_iterator<T>::end(Inverse<T>(G));
247 // Provide global definitions of external inverse depth first iterators...
252 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V
[all...] |
| PostOrderIterator.h | 147 // Provide global definitions of inverse post order iterators...
151 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External > {
152 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) :
153 po_iterator<Inverse<T>, SetType, External> (V) {}
166 //Provide global definitions of external inverse postorder iterators...
172 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) :
|
| /external/llvm/include/llvm/Support/ |
| DataFlow.h | 60 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) {
|
| CFG.h | 270 // graph of basic blocks... and to walk it in inverse order. Inverse order for
274 template <> struct GraphTraits<Inverse<BasicBlock*> > {
277 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
286 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
289 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
330 // graph of basic blocks... and to walk it in inverse order. Inverse order for
334 template <> struct GraphTraits<Inverse<Function*> > :
335 public GraphTraits<Inverse<BasicBlock*> >
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 49 typedef GraphTraits< Inverse<BlockT *> > GT;
170 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
171 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
207 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
208 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
249 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head),
250 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head);
297 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
298 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
|
| Interval.h | 139 template <> struct GraphTraits<Inverse<Interval*> > {
142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
| LoopInfo.h | 157 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
292 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
313 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
433 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
768 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
816 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
[all...] |
| Dominators.h | 235 typedef GraphTraits<Inverse<N> > InvTraits;
543 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
678 Calculate<FT, Inverse<NodeT*> >(*this, F);
|
| IntervalIterator.h | 89 class IGT = GraphTraits<Inverse<NodeTy*> > >
|
| DominatorInternals.h | 207 typedef GraphTraits<Inverse<NodeT> > InvTraits;
|
| ScalarEvolution.h | 439 bool Inverse);
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 229 /// method provides the inverse mapping.
459 // graph of basic blocks... and to walk it in inverse order. Inverse order for
463 template <> struct GraphTraits<Inverse<MachineFunction*> > :
464 public GraphTraits<Inverse<MachineBasicBlock*> > {
465 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
469 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
470 public GraphTraits<Inverse<const MachineBasicBlock*> > {
471 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
|
| MachineBasicBlock.h | 497 // in inverse order. Inverse order for a function is considered
501 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
504 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
515 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
518 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
|
| /external/guava/src/com/google/common/collect/ |
| AbstractBiMap.java | 50 private transient AbstractBiMap<V, K> inverse; field in class:AbstractBiMap
57 /** Private constructor for inverse bimap. */
60 inverse = forward;
73 checkState(inverse == null);
78 inverse = new Inverse<V, K>(backward, this);
81 void setInverse(AbstractBiMap<V, K> inverse) {
82 this.inverse = inverse;
88 return inverse.containsKey(value)
153 public BiMap<V, K> inverse() { method in class:AbstractBiMap
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 746 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
750 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
788 template <> struct GraphTraits<Inverse<const ::clang::CFG*> >
789 : public GraphTraits<Inverse<const ::clang::CFGBlock*> > {
|
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | 680 // to do is multiply by the inverse. Therefore, this step can be done at
736 // Calculate the multiplicative inverse of K! / 2^T;
[all...] |
| /external/libvpx/vp8/common/ppc/ |
| loopfilter_filters_altivec.asm | 175 ;# This transformation is its own inverse, and we need to perform it
247 ;# Inverse transpose is similar, except here I -> (I+3) mod 7 and the
[all...] |
| /external/llvm/lib/VMCore/ |
| ConstantFold.cpp | [all...] |
| /external/dropbear/libtommath/ |
| bn.tex | 217 \hline Modular inverse odd moduli only & BN\_MP\_INVMOD\_SLOW\_C \\
218 \hline Modular inverse (both, smaller/slower) & BN\_FAST\_MP\_INVMOD\_C \\
[all...] |
| /prebuilt/common/tradefed/ |
| tradefed-prebuilt.jar | |
