| /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...] |
| 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 | 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/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 | 276 // graph of basic blocks... and to walk it in inverse order. Inverse order for
280 template <> struct GraphTraits<Inverse<BasicBlock*> > {
283 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
292 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
295 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
338 // graph of basic blocks... and to walk it in inverse order. Inverse order for
342 template <> struct GraphTraits<Inverse<Function*> > :
343 public GraphTraits<Inverse<BasicBlock*> >
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 49 typedef GraphTraits< Inverse<BlockT *> > GT;
157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head),
239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head);
290 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
291 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; }
|
| LoopInfoImpl.h | 149 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
273 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
368 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
530 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
|
| Dominators.h | 247 typedef GraphTraits<Inverse<N> > InvTraits;
539 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
674 Calculate<FT, Inverse<NodeT*> >(*this, F);
|
| IntervalIterator.h | 89 class IGT = GraphTraits<Inverse<NodeTy*> > >
|
| DominatorInternals.h | 207 typedef GraphTraits<Inverse<NodeT> > InvTraits;
|
| LoopInfo.h | 166 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
|
| ScalarEvolution.h | 508 bool Inverse);
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 255 /// method provides the inverse mapping.
505 // graph of basic blocks... and to walk it in inverse order. Inverse order for
509 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) {
|
| MachineBasicBlock.h | 696 // in inverse order. Inverse order for a function is considered
700 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
703 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
714 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
717 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
|
| /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 | 888 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
892 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G)
902 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
906 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
[all...] |
| /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/lib/Analysis/ |
| ScalarEvolution.cpp | 707 // to do is multiply by the inverse. Therefore, this step can be done at
763 // Calculate the multiplicative inverse of K! / 2^T;
[all...] |
| /external/llvm/lib/IR/ |
| ConstantFold.cpp | [all...] |
| /external/libvpx/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...] |
| /prebuilts/tools/common/gradle-plugins/repository/com/google/guava/guava/14.0/ |
| guava-14.0.jar | |
| /external/llvm/lib/Target/R600/ |
| AMDILCFGStructurizer.cpp | 178 typedef GraphTraits<Inverse<BlockT *> > InvBlockGTraits;
[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...] |
