reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/DepthFirstIterator.h
  259 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
  260   idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V)
  261     : df_iterator<Inverse<T>, SetTy, External>(V) {}
  266   return idf_iterator<T>::begin(Inverse<T>(G));
  271   return idf_iterator<T>::end(Inverse<T>(G));
  285   idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V)
  291   return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
  296   return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
include/llvm/ADT/GraphTraits.h
  103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
  103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
  113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
  127 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
  129   return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
  130                     GraphTraits<Inverse<GraphType>>::child_end(G));
include/llvm/ADT/PostOrderIterator.h
  214 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> {
  215   ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) :
  216      po_iterator<Inverse<T>, SetType, External> (V) {}
  239   ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) :
include/llvm/Analysis/BlockFrequencyInfoImpl.h
  851   using Predecessor = GraphTraits<Inverse<const BlockT *>>;
include/llvm/Analysis/Interval.h
  134   static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
include/llvm/Analysis/LoopInfo.h
  227     auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header);
  228     auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header);
  238     for (const auto Pred : children<Inverse<BlockT *>>(H))
  317     for (const auto Pred : children<Inverse<BlockT *>>(H))
include/llvm/Analysis/LoopInfoImpl.h
   91     for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB))
  195   for (const auto Pred : children<Inverse<BlockT *>>(Header)) {
  213   for (const auto Pred : children<Inverse<BlockT *>>(Header)) {
  311     std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB),
  312                   GraphTraits<Inverse<BlockT *>>::child_end(BB),
  421   typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits;
  464       for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) {
  547     for (const auto Backedge : children<Inverse<BlockT *>>(Header)) {
include/llvm/Analysis/RegionInfo.h
  269   using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
  689   using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
include/llvm/CodeGen/MachineBasicBlock.h
  898   static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
  910   static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
include/llvm/CodeGen/MachineFunction.h
 1066   public GraphTraits<Inverse<MachineBasicBlock*>> {
 1067   static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
 1072   public GraphTraits<Inverse<const MachineBasicBlock*>> {
 1073   static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
include/llvm/IR/CFG.h
  326   static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
  335   static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
  388   public GraphTraits<Inverse<BasicBlock*>> {
  389   static NodeRef getEntryNode(Inverse<Function *> G) {
  394   public GraphTraits<Inverse<const BasicBlock*>> {
  395   static NodeRef getEntryNode(Inverse<const Function *> G) {
include/llvm/Support/GenericDomTree.h
  653       Split<Inverse<NodeT *>>(NewBB);
  781     for (const auto &Pred : children<Inverse<N>>(NewBB))
  787     for (const auto &Pred : children<Inverse<N>>(NewBBSucc)) {
include/llvm/Support/GenericIteratedDominanceFrontier.h
   60       typename std::conditional<IsPostDom, Inverse<NodeTy *>, NodeTy *>::type;
lib/Transforms/Vectorize/VPlan.h
 1375   static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
 1432     : public GraphTraits<Inverse<VPBlockBase *>> {
 1436   static NodeRef getEntryNode(Inverse<GraphRef> N) {
tools/clang/include/clang/Analysis/CFG.h
 1498   static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
 1513   static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
 1556   : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
 1565   : public GraphTraits<Inverse<const ::clang::CFGBlock *>> {