/external/owasp/sanitizer/distrib/lib/ |
H A D | guava.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ... |
/external/owasp/sanitizer/lib/guava-libraries/ |
H A D | guava.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ... |
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 278 typedef GraphTraits<Inverse<BlockT *> > InvBlockGTraits;
|
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 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)); 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 D | GraphTraits.h | 13 // 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 D | PostOrderIterator.h | 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) {} 221 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) :
|
H A D | 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);
|
/external/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyInfoImpl.h | 784 typedef GraphTraits<Inverse<const BlockT *>> Predecessor;
|
H A D | Interval.h | 136 template <> struct GraphTraits<Inverse<Interval*> > { 139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
H A D | IntervalIterator.h | 89 class IGT = GraphTraits<Inverse<NodeTy*> > >
|
H A D | LoopInfo.h | 171 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits; 238 typedef GraphTraits<Inverse<BlockT*> > InvBlockTraits;
|
H A D | 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;
|
H A D | ScalarEvolution.h | 527 bool Inverse);
|
/external/llvm/include/llvm/CodeGen/ |
H A D | 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) {
|
H A D | MachineFunction.h | 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) {
|
/external/llvm/include/llvm/IR/ |
H A D | 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*> > { 370 static NodeType *getEntryNode(Inverse<Function*> G) { 374 template <> struct GraphTraits<Inverse<cons [all...] |
H A D | Dominators.h | 42 void Calculate<Function LLVM_COMMA Inverse<BasicBlock *> >( 43 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
|
/external/llvm/include/llvm/Support/ |
H A D | 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);
|
H A D | GenericDomTreeConstruction.h | 207 typedef GraphTraits<Inverse<NodeT> > InvTraits;
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 6384 bool Inverse) { 6392 if (!Inverse) 6393 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) || 6394 isImpliedCond(Pred, LHS, RHS, BO->getOperand(1), Inverse); 6396 if (Inverse) 6397 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) || 6398 isImpliedCond(Pred, LHS, RHS, BO->getOperand(1), Inverse); 6417 if (Inverse)
|
/external/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 1876 Constant *Inverse = ConstantExpr::getBitCast(C1, CE2Op0->getType()); local 1877 return ConstantExpr::getICmp(pred, Inverse, CE2Op0);
|
H A D | Dominators.cpp | 72 void llvm::Calculate<Function LLVM_COMMA Inverse<BasicBlock *> >( 73 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
|
/external/llvm/lib/Target/R600/ |
H A D | AMDILCFGStructurizer.cpp | 1119 typedef GraphTraits<Inverse<MachineBasicBlock*> > InvMBBTraits; 1151 typedef GraphTraits<Inverse<MachineBasicBlock *> > GTIM;
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCompares.cpp | 2219 bool Inverse = false; local 2224 Inverse = true; 2230 Inverse = true; 2236 Inverse = true; 2241 if (Inverse) {
|
/external/libvpx/libvpx/vp8/common/ppc/ |
H A D | loopfilter_filters_altivec.asm | 247 ;# Inverse transpose is similar, except here I -> (I+3) mod 7 and the
|