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

/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.h232 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));
252 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V)
258 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
263 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
H A DSCCIterator.h16 // 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);
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/Support/
H A 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) {
H A DCFG.h276 // 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*> > {
344 static NodeType *getEntryNode(Inverse<Function*> G) {
348 template <> struct GraphTraits<Inverse<cons
[all...]
/external/llvm/include/llvm/Analysis/
H A DBlockFrequencyImpl.h49 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);
H A DInterval.h139 template <> struct GraphTraits<Inverse<Interval*> > {
142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DLoopInfoImpl.h148 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
170 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
272 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
367 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
529 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
H A DDominators.h247 typedef GraphTraits<Inverse<N> > InvTraits;
539 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
675 Calculate<FT, Inverse<NodeT*> >(*this, F);
H A DIntervalIterator.h89 class IGT = GraphTraits<Inverse<NodeTy*> > >
H A DDominatorInternals.h207 typedef GraphTraits<Inverse<NodeT> > InvTraits;
H A DLoopInfo.h171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
H A DScalarEvolution.h509 bool Inverse);
/external/llvm/include/llvm/CodeGen/
H A DMachineFunction.h472 // graph of basic blocks... and to walk it in inverse order. Inverse order for
476 template <> struct GraphTraits<Inverse<MachineFunction*> > :
477 public GraphTraits<Inverse<MachineBasicBlock*> > {
478 static NodeType *getEntryNode(Inverse<MachineFunction*> G) {
482 template <> struct GraphTraits<Inverse<const MachineFunction*> > :
483 public GraphTraits<Inverse<const MachineBasicBlock*> > {
484 static NodeType *getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h647 // in inverse order. Inverse order for a function is considered
651 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
654 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
665 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
668 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
/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.h856 template <> struct GraphTraits<Inverse< ::clang::CFGBlock*> > {
860 static NodeType *getEntryNode(Inverse< ::clang::CFGBlock*> G)
870 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock*> > {
874 static NodeType *getEntryNode(Inverse<const ::clang::CFGBlock*> G)
916 template <> struct GraphTraits<Inverse< ::clang::CFG*> >
917 : public GraphTraits<Inverse< ::clang::CFGBlock*> > {
926 template <> struct GraphTraits<Inverse<const ::clang::CFG*> >
927 : public GraphTraits<Inverse<const ::clang::CFGBlock*> > {
/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/lib/Analysis/
H A DScalarEvolution.cpp6085 bool Inverse) {
6093 if (!Inverse)
6094 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) ||
6095 isImpliedCond(Pred, LHS, RHS, BO->getOperand(1), Inverse);
6097 if (Inverse)
6098 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) ||
6099 isImpliedCond(Pred, LHS, RHS, BO->getOperand(1), Inverse);
6118 if (Inverse)
/external/llvm/lib/VMCore/
H A DConstantFold.cpp1857 Constant *Inverse = ConstantExpr::getBitCast(C1, CE2Op0->getType()); local
1858 return ConstantExpr::getICmp(pred, Inverse, CE2Op0);
/external/libvpx/vp8/common/ppc/
H A Dloopfilter_filters_altivec.asm247 ;# Inverse transpose is similar, except here I -> (I+3) mod 7 and the
/external/dropbear/libtommath/
H A Dbn.tex1809 \section{Modular Inverse}

Completed in 696 milliseconds