Coverage Report

Created: 2018-11-16 02:38

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/ADT/DepthFirstIterator.h
Line
Count
Source
1
//===- llvm/ADT/DepthFirstIterator.h - Depth First iterator -----*- C++ -*-===//
2
//
3
//                     The LLVM Compiler Infrastructure
4
//
5
// This file is distributed under the University of Illinois Open Source
6
// License. See LICENSE.TXT for details.
7
//
8
//===----------------------------------------------------------------------===//
9
//
10
// This file builds on the ADT/GraphTraits.h file to build generic depth
11
// first graph iterator.  This file exposes the following functions/types:
12
//
13
// df_begin/df_end/df_iterator
14
//   * Normal depth-first iteration - visit a node and then all of its children.
15
//
16
// idf_begin/idf_end/idf_iterator
17
//   * Depth-first iteration on the 'inverse' graph.
18
//
19
// df_ext_begin/df_ext_end/df_ext_iterator
20
//   * Normal depth-first iteration - visit a node and then all of its children.
21
//     This iterator stores the 'visited' set in an external set, which allows
22
//     it to be more efficient, and allows external clients to use the set for
23
//     other purposes.
24
//
25
// idf_ext_begin/idf_ext_end/idf_ext_iterator
26
//   * Depth-first iteration on the 'inverse' graph.
27
//     This iterator stores the 'visited' set in an external set, which allows
28
//     it to be more efficient, and allows external clients to use the set for
29
//     other purposes.
30
//
31
//===----------------------------------------------------------------------===//
32
33
#ifndef LLVM_ADT_DEPTHFIRSTITERATOR_H
34
#define LLVM_ADT_DEPTHFIRSTITERATOR_H
35
36
#include "llvm/ADT/GraphTraits.h"
37
#include "llvm/ADT/None.h"
38
#include "llvm/ADT/Optional.h"
39
#include "llvm/ADT/SmallPtrSet.h"
40
#include "llvm/ADT/iterator_range.h"
41
#include <iterator>
42
#include <set>
43
#include <utility>
44
#include <vector>
45
46
namespace llvm {
47
48
// df_iterator_storage - A private class which is used to figure out where to
49
// store the visited set.
50
template<class SetType, bool External>   // Non-external set
51
class df_iterator_storage {
52
public:
53
  SetType Visited;
54
};
55
56
template<class SetType>
57
class df_iterator_storage<SetType, true> {
58
public:
59
7.72M
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
59
1.48M
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
59
9.26k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
59
957k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
59
3.34M
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
59
1.02M
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
59
982
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
ADCE.cpp:llvm::df_iterator_storage<(anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true>::df_iterator_storage((anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
59
914k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
60
19.3M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true> const&)
Line
Count
Source
60
4.38M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true> const&)
Line
Count
Source
60
9.26k
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true> const&)
Line
Count
Source
60
3.82M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true> const&)
Line
Count
Source
60
3.34M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true> const&)
Line
Count
Source
60
4.08M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true> const&)
Line
Count
Source
60
3.92k
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
ADCE.cpp:llvm::df_iterator_storage<(anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true>::df_iterator_storage(llvm::df_iterator_storage<(anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true> const&)
Line
Count
Source
60
3.65M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
61
62
  SetType &Visited;
63
};
64
65
// The visited stated for the iteration is a simple set augmented with
66
// one more method, completed, which is invoked when all children of a
67
// node have been processed. It is intended to distinguish of back and
68
// cross edges in the spanning tree but is not used in the common case.
69
template <typename NodeRef, unsigned SmallSize=8>
70
struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> {
71
  using BaseSet = SmallPtrSet<NodeRef, SmallSize>;
72
  using iterator = typename BaseSet::iterator;
73
74
50.6M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::insert(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
74
4.05M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::Loop*, 8u>::insert(llvm::Loop*)
Line
Count
Source
74
561k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::insert(llvm::MachineLoop*)
Line
Count
Source
74
135
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::insert(llvm::BasicBlock*)
Line
Count
Source
74
23.4M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
10.5M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>::insert(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
74
5.69M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::RegionNode*, 8u>::insert(llvm::RegionNode*)
Line
Count
Source
74
13.4k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>::insert(llvm::RegionNode const*)
Line
Count
Source
74
8
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>::insert(llvm::BasicBlock const*)
Line
Count
Source
74
779
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::insert(llvm::Loop const*)
Line
Count
Source
74
1.89k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
14.0k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
3.90M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::insert(llvm::MachineRegionNode*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::insert(llvm::MachineRegionNode const*)
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::insert(llvm::MachineBasicBlock const*)
Line
Count
Source
74
2.31M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>::insert(llvm::BasicBlock*)
Line
Count
Source
74
1.16k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::insert(llvm::VPBlockBase*)
Line
Count
Source
74
78.1k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>::insert(llvm::VPBlockBase const*)
75
  template <typename IterT>
76
  void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); }
77
78
38.3M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
78
4.05M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop*, 8u>::completed(llvm::Loop*)
Line
Count
Source
78
561k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::completed(llvm::MachineLoop*)
Line
Count
Source
78
135
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
15.8M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
7.23M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
78
5.69M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>::completed(llvm::BasicBlock const*)
Line
Count
Source
78
388
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>::completed(llvm::RegionNode const*)
Line
Count
Source
78
8
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::RegionNode*, 8u>::completed(llvm::RegionNode*)
Line
Count
Source
78
10.9k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::completed(llvm::Loop const*)
Line
Count
Source
78
1.89k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
5.77k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
2.75M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::completed(llvm::MachineBasicBlock const*)
Line
Count
Source
78
2.11M
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::completed(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::completed(llvm::MachineRegionNode*)
llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
551
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::completed(llvm::VPBlockBase*)
Line
Count
Source
78
75.1k
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>::completed(llvm::VPBlockBase const*)
79
};
80
81
// Generic Depth First Iterator
82
template <class GraphT,
83
          class SetType =
84
              df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
85
          bool ExtStorage = false, class GT = GraphTraits<GraphT>>
86
class df_iterator
87
    : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
88
      public df_iterator_storage<SetType, ExtStorage> {
89
  using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
90
  using NodeRef = typename GT::NodeRef;
91
  using ChildItTy = typename GT::ChildIteratorType;
92
93
  // First element is node reference, second is the 'next child' to visit.
94
  // The second child is initialized lazily to pick up graph changes during the
95
  // DFS.
96
  using StackElement = std::pair<NodeRef, Optional<ChildItTy>>;
97
98
  // VisitStack - Used to maintain the ordering.  Top = current block
99
  std::vector<StackElement> VisitStack;
100
101
private:
102
4.18M
  inline df_iterator(NodeRef Node) {
103
4.18M
    this->Visited.insert(Node);
104
4.18M
    VisitStack.push_back(StackElement(Node, None));
105
4.18M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::df_iterator(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
102
509k
  inline df_iterator(NodeRef Node) {
103
509k
    this->Visited.insert(Node);
104
509k
    VisitStack.push_back(StackElement(Node, None));
105
509k
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::df_iterator(llvm::Loop*)
Line
Count
Source
102
406k
  inline df_iterator(NodeRef Node) {
103
406k
    this->Visited.insert(Node);
104
406k
    VisitStack.push_back(StackElement(Node, None));
105
406k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::df_iterator(llvm::MachineLoop*)
Line
Count
Source
102
123
  inline df_iterator(NodeRef Node) {
103
123
    this->Visited.insert(Node);
104
123
    VisitStack.push_back(StackElement(Node, None));
105
123
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::df_iterator(llvm::BasicBlock*)
Line
Count
Source
102
1.74M
  inline df_iterator(NodeRef Node) {
103
1.74M
    this->Visited.insert(Node);
104
1.74M
    VisitStack.push_back(StackElement(Node, None));
105
1.74M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::df_iterator(llvm::MachineBasicBlock*)
Line
Count
Source
102
118k
  inline df_iterator(NodeRef Node) {
103
118k
    this->Visited.insert(Node);
104
118k
    VisitStack.push_back(StackElement(Node, None));
105
118k
  }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::df_iterator(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
102
1.26M
  inline df_iterator(NodeRef Node) {
103
1.26M
    this->Visited.insert(Node);
104
1.26M
    VisitStack.push_back(StackElement(Node, None));
105
1.26M
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::df_iterator(llvm::RegionNode*)
Line
Count
Source
102
4.36k
  inline df_iterator(NodeRef Node) {
103
4.36k
    this->Visited.insert(Node);
104
4.36k
    VisitStack.push_back(StackElement(Node, None));
105
4.36k
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::df_iterator(llvm::RegionNode const*)
Line
Count
Source
102
4
  inline df_iterator(NodeRef Node) {
103
4
    this->Visited.insert(Node);
104
4
    VisitStack.push_back(StackElement(Node, None));
105
4
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::df_iterator(llvm::BasicBlock const*)
Line
Count
Source
102
14
  inline df_iterator(NodeRef Node) {
103
14
    this->Visited.insert(Node);
104
14
    VisitStack.push_back(StackElement(Node, None));
105
14
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::df_iterator(llvm::RegionNode*)
Line
Count
Source
102
1
  inline df_iterator(NodeRef Node) {
103
1
    this->Visited.insert(Node);
104
1
    VisitStack.push_back(StackElement(Node, None));
105
1
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::df_iterator(llvm::Loop const*)
Line
Count
Source
102
1.75k
  inline df_iterator(NodeRef Node) {
103
1.75k
    this->Visited.insert(Node);
104
1.75k
    VisitStack.push_back(StackElement(Node, None));
105
1.75k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator(llvm::MachineRegionNode*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::df_iterator(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator(llvm::MachineBasicBlock const*)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::BasicBlock*)
Line
Count
Source
102
205
  inline df_iterator(NodeRef Node) {
103
205
    this->Visited.insert(Node);
104
205
    VisitStack.push_back(StackElement(Node, None));
105
205
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::BasicBlock*)
Line
Count
Source
102
17
  inline df_iterator(NodeRef Node) {
103
17
    this->Visited.insert(Node);
104
17
    VisitStack.push_back(StackElement(Node, None));
105
17
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::df_iterator(llvm::BasicBlock const*)
Line
Count
Source
102
319
  inline df_iterator(NodeRef Node) {
103
319
    this->Visited.insert(Node);
104
319
    VisitStack.push_back(StackElement(Node, None));
105
319
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::df_iterator(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
102
77.2k
  inline df_iterator(NodeRef Node) {
103
77.2k
    this->Visited.insert(Node);
104
77.2k
    VisitStack.push_back(StackElement(Node, None));
105
77.2k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::df_iterator(llvm::VPBlockBase*)
Line
Count
Source
102
57.8k
  inline df_iterator(NodeRef Node) {
103
57.8k
    this->Visited.insert(Node);
104
57.8k
    VisitStack.push_back(StackElement(Node, None));
105
57.8k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::df_iterator(llvm::VPBlockBase const*)
106
107
4.18M
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::df_iterator()
Line
Count
Source
107
509k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::df_iterator()
Line
Count
Source
107
406k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::df_iterator()
Line
Count
Source
107
123
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::df_iterator()
Line
Count
Source
107
1.74M
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::df_iterator()
Line
Count
Source
107
118k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::df_iterator()
Line
Count
Source
107
1.26M
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::df_iterator()
Line
Count
Source
107
4.36k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::df_iterator()
Line
Count
Source
107
4
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::df_iterator()
Line
Count
Source
107
14
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::df_iterator()
Line
Count
Source
107
1
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::df_iterator()
Line
Count
Source
107
1.75k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator()
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator()
Line
Count
Source
107
205
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator()
Line
Count
Source
107
17
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::df_iterator()
Line
Count
Source
107
319
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::df_iterator()
Line
Count
Source
107
77.2k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::df_iterator()
Line
Count
Source
107
57.8k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::df_iterator()
108
109
  inline df_iterator(NodeRef Node, SetType &S)
110
3.86M
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
3.86M
    if (this->Visited.insert(Node).second)
112
3.86M
      VisitStack.push_back(StackElement(Node, None));
113
3.86M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
110
1.88k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
1.88k
    if (this->Visited.insert(Node).second)
112
1.88k
      VisitStack.push_back(StackElement(Node, None));
113
1.88k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
110
4.63k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
4.63k
    if (this->Visited.insert(Node).second)
112
4.50k
      VisitStack.push_back(StackElement(Node, None));
113
4.63k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
110
478k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
478k
    if (this->Visited.insert(Node).second)
112
478k
      VisitStack.push_back(StackElement(Node, None));
113
478k
  }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::df_iterator(llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
110
1.67M
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
1.67M
    if (this->Visited.insert(Node).second)
112
1.67M
      VisitStack.push_back(StackElement(Node, None));
113
1.67M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::df_iterator(llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
110
739k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
739k
    if (this->Visited.insert(Node).second)
112
739k
      VisitStack.push_back(StackElement(Node, None));
113
739k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
110
290
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
290
    if (this->Visited.insert(Node).second)
112
290
      VisitStack.push_back(StackElement(Node, None));
113
290
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
110
510k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
510k
    if (this->Visited.insert(Node).second)
112
510k
      VisitStack.push_back(StackElement(Node, None));
113
510k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
110
491
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
491
    if (this->Visited.insert(Node).second)
112
339
      VisitStack.push_back(StackElement(Node, None));
113
491
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::df_iterator(llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
110
457k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
457k
    if (this->Visited.insert(Node).second)
112
457k
      VisitStack.push_back(StackElement(Node, None));
113
457k
  }
114
115
  inline df_iterator(SetType &S)
116
3.86M
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
3.86M
    // End is when stack is empty
118
3.86M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
116
1.88k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
1.88k
    // End is when stack is empty
118
1.88k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
116
4.63k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
4.63k
    // End is when stack is empty
118
4.63k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
116
478k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
478k
    // End is when stack is empty
118
478k
  }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
116
1.67M
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
1.67M
    // End is when stack is empty
118
1.67M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
116
739k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
739k
    // End is when stack is empty
118
739k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
116
290
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
290
    // End is when stack is empty
118
290
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
116
510k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
510k
    // End is when stack is empty
118
510k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
116
491
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
491
    // End is when stack is empty
118
491
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::df_iterator((anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
116
457k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
457k
    // End is when stack is empty
118
457k
  }
119
120
41.2M
  inline void toNext() {
121
74.4M
    do {
122
74.4M
      NodeRef Node = VisitStack.back().first;
123
74.4M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
74.4M
125
74.4M
      if (!Opt)
126
41.2M
        Opt.emplace(GT::child_begin(Node));
127
74.4M
128
74.4M
      // Notice that we directly mutate *Opt here, so that
129
74.4M
      // VisitStack.back().second actually gets updated as the iterator
130
74.4M
      // increases.
131
88.0M
      while (*Opt != GT::child_end(Node)) {
132
46.8M
        NodeRef Next = *(*Opt)++;
133
46.8M
        // Has our next sibling been visited?
134
46.8M
        if (this->Visited.insert(Next).second) {
135
33.1M
          // No, do it now.
136
33.1M
          VisitStack.push_back(StackElement(Next, None));
137
33.1M
          return;
138
33.1M
        }
139
46.8M
      }
140
74.4M
      this->Visited.completed(Node);
141
41.2M
142
41.2M
      // Oops, ran out of successors... go up a level on the stack.
143
41.2M
      VisitStack.pop_back();
144
41.2M
    } while (!VisitStack.empty());
145
41.2M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::toNext()
Line
Count
Source
120
4.05M
  inline void toNext() {
121
7.60M
    do {
122
7.60M
      NodeRef Node = VisitStack.back().first;
123
7.60M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.60M
125
7.60M
      if (!Opt)
126
4.05M
        Opt.emplace(GT::child_begin(Node));
127
7.60M
128
7.60M
      // Notice that we directly mutate *Opt here, so that
129
7.60M
      // VisitStack.back().second actually gets updated as the iterator
130
7.60M
      // increases.
131
7.60M
      while (*Opt != GT::child_end(Node)) {
132
3.54M
        NodeRef Next = *(*Opt)++;
133
3.54M
        // Has our next sibling been visited?
134
3.54M
        if (this->Visited.insert(Next).second) {
135
3.54M
          // No, do it now.
136
3.54M
          VisitStack.push_back(StackElement(Next, None));
137
3.54M
          return;
138
3.54M
        }
139
3.54M
      }
140
7.60M
      this->Visited.completed(Node);
141
4.05M
142
4.05M
      // Oops, ran out of successors... go up a level on the stack.
143
4.05M
      VisitStack.pop_back();
144
4.05M
    } while (!VisitStack.empty());
145
4.05M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::toNext()
Line
Count
Source
120
561k
  inline void toNext() {
121
717k
    do {
122
717k
      NodeRef Node = VisitStack.back().first;
123
717k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
717k
125
717k
      if (!Opt)
126
561k
        Opt.emplace(GT::child_begin(Node));
127
717k
128
717k
      // Notice that we directly mutate *Opt here, so that
129
717k
      // VisitStack.back().second actually gets updated as the iterator
130
717k
      // increases.
131
717k
      while (*Opt != GT::child_end(Node)) {
132
155k
        NodeRef Next = *(*Opt)++;
133
155k
        // Has our next sibling been visited?
134
155k
        if (this->Visited.insert(Next).second) {
135
155k
          // No, do it now.
136
155k
          VisitStack.push_back(StackElement(Next, None));
137
155k
          return;
138
155k
        }
139
155k
      }
140
717k
      this->Visited.completed(Node);
141
561k
142
561k
      // Oops, ran out of successors... go up a level on the stack.
143
561k
      VisitStack.pop_back();
144
561k
    } while (!VisitStack.empty());
145
561k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::toNext()
Line
Count
Source
120
135
  inline void toNext() {
121
147
    do {
122
147
      NodeRef Node = VisitStack.back().first;
123
147
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
147
125
147
      if (!Opt)
126
135
        Opt.emplace(GT::child_begin(Node));
127
147
128
147
      // Notice that we directly mutate *Opt here, so that
129
147
      // VisitStack.back().second actually gets updated as the iterator
130
147
      // increases.
131
147
      while (*Opt != GT::child_end(Node)) {
132
12
        NodeRef Next = *(*Opt)++;
133
12
        // Has our next sibling been visited?
134
12
        if (this->Visited.insert(Next).second) {
135
12
          // No, do it now.
136
12
          VisitStack.push_back(StackElement(Next, None));
137
12
          return;
138
12
        }
139
12
      }
140
147
      this->Visited.completed(Node);
141
135
142
135
      // Oops, ran out of successors... go up a level on the stack.
143
135
      VisitStack.pop_back();
144
135
    } while (!VisitStack.empty());
145
135
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
13.0M
  inline void toNext() {
121
24.3M
    do {
122
24.3M
      NodeRef Node = VisitStack.back().first;
123
24.3M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
24.3M
125
24.3M
      if (!Opt)
126
13.0M
        Opt.emplace(GT::child_begin(Node));
127
24.3M
128
24.3M
      // Notice that we directly mutate *Opt here, so that
129
24.3M
      // VisitStack.back().second actually gets updated as the iterator
130
24.3M
      // increases.
131
30.7M
      while (*Opt != GT::child_end(Node)) {
132
17.6M
        NodeRef Next = *(*Opt)++;
133
17.6M
        // Has our next sibling been visited?
134
17.6M
        if (this->Visited.insert(Next).second) {
135
11.3M
          // No, do it now.
136
11.3M
          VisitStack.push_back(StackElement(Next, None));
137
11.3M
          return;
138
11.3M
        }
139
17.6M
      }
140
24.3M
      this->Visited.completed(Node);
141
13.0M
142
13.0M
      // Oops, ran out of successors... go up a level on the stack.
143
13.0M
      VisitStack.pop_back();
144
13.0M
    } while (!VisitStack.empty());
145
13.0M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
1.94M
  inline void toNext() {
121
3.77M
    do {
122
3.77M
      NodeRef Node = VisitStack.back().first;
123
3.77M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
3.77M
125
3.77M
      if (!Opt)
126
1.94M
        Opt.emplace(GT::child_begin(Node));
127
3.77M
128
3.77M
      // Notice that we directly mutate *Opt here, so that
129
3.77M
      // VisitStack.back().second actually gets updated as the iterator
130
3.77M
      // increases.
131
4.86M
      while (*Opt != GT::child_end(Node)) {
132
2.91M
        NodeRef Next = *(*Opt)++;
133
2.91M
        // Has our next sibling been visited?
134
2.91M
        if (this->Visited.insert(Next).second) {
135
1.82M
          // No, do it now.
136
1.82M
          VisitStack.push_back(StackElement(Next, None));
137
1.82M
          return;
138
1.82M
        }
139
2.91M
      }
140
3.77M
      this->Visited.completed(Node);
141
1.94M
142
1.94M
      // Oops, ran out of successors... go up a level on the stack.
143
1.94M
      VisitStack.pop_back();
144
1.94M
    } while (!VisitStack.empty());
145
1.94M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
7.60k
  inline void toNext() {
121
13.3k
    do {
122
13.3k
      NodeRef Node = VisitStack.back().first;
123
13.3k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
13.3k
125
13.3k
      if (!Opt)
126
7.60k
        Opt.emplace(GT::child_begin(Node));
127
13.3k
128
13.3k
      // Notice that we directly mutate *Opt here, so that
129
13.3k
      // VisitStack.back().second actually gets updated as the iterator
130
13.3k
      // increases.
131
16.2k
      while (*Opt != GT::child_end(Node)) {
132
8.65k
        NodeRef Next = *(*Opt)++;
133
8.65k
        // Has our next sibling been visited?
134
8.65k
        if (this->Visited.insert(Next).second) {
135
5.71k
          // No, do it now.
136
5.71k
          VisitStack.push_back(StackElement(Next, None));
137
5.71k
          return;
138
5.71k
        }
139
8.65k
      }
140
13.3k
      this->Visited.completed(Node);
141
7.60k
142
7.60k
      // Oops, ran out of successors... go up a level on the stack.
143
7.60k
      VisitStack.pop_back();
144
7.60k
    } while (!VisitStack.empty());
145
7.60k
  }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::toNext()
Line
Count
Source
120
5.60M
  inline void toNext() {
121
9.95M
    do {
122
9.95M
      NodeRef Node = VisitStack.back().first;
123
9.95M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
9.95M
125
9.95M
      if (!Opt)
126
5.60M
        Opt.emplace(GT::child_begin(Node));
127
9.95M
128
9.95M
      // Notice that we directly mutate *Opt here, so that
129
9.95M
      // VisitStack.back().second actually gets updated as the iterator
130
9.95M
      // increases.
131
9.95M
      while (*Opt != GT::child_end(Node)) {
132
4.34M
        NodeRef Next = *(*Opt)++;
133
4.34M
        // Has our next sibling been visited?
134
4.34M
        if (this->Visited.insert(Next).second) {
135
4.34M
          // No, do it now.
136
4.34M
          VisitStack.push_back(StackElement(Next, None));
137
4.34M
          return;
138
4.34M
        }
139
4.34M
      }
140
9.95M
      this->Visited.completed(Node);
141
5.60M
142
5.60M
      // Oops, ran out of successors... go up a level on the stack.
143
5.60M
      VisitStack.pop_back();
144
5.60M
    } while (!VisitStack.empty());
145
5.60M
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::toNext()
Line
Count
Source
120
62
  inline void toNext() {
121
110
    do {
122
110
      NodeRef Node = VisitStack.back().first;
123
110
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
110
125
110
      if (!Opt)
126
62
        Opt.emplace(GT::child_begin(Node));
127
110
128
110
      // Notice that we directly mutate *Opt here, so that
129
110
      // VisitStack.back().second actually gets updated as the iterator
130
110
      // increases.
131
144
      while (*Opt != GT::child_end(Node)) {
132
82
        NodeRef Next = *(*Opt)++;
133
82
        // Has our next sibling been visited?
134
82
        if (this->Visited.insert(Next).second) {
135
48
          // No, do it now.
136
48
          VisitStack.push_back(StackElement(Next, None));
137
48
          return;
138
48
        }
139
82
      }
140
110
      this->Visited.completed(Node);
141
62
142
62
      // Oops, ran out of successors... go up a level on the stack.
143
62
      VisitStack.pop_back();
144
62
    } while (!VisitStack.empty());
145
62
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::toNext()
Line
Count
Source
120
8
  inline void toNext() {
121
12
    do {
122
12
      NodeRef Node = VisitStack.back().first;
123
12
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
12
125
12
      if (!Opt)
126
8
        Opt.emplace(GT::child_begin(Node));
127
12
128
12
      // Notice that we directly mutate *Opt here, so that
129
12
      // VisitStack.back().second actually gets updated as the iterator
130
12
      // increases.
131
12
      while (*Opt != GT::child_end(Node)) {
132
4
        NodeRef Next = *(*Opt)++;
133
4
        // Has our next sibling been visited?
134
4
        if (this->Visited.insert(Next).second) {
135
4
          // No, do it now.
136
4
          VisitStack.push_back(StackElement(Next, None));
137
4
          return;
138
4
        }
139
4
      }
140
12
      this->Visited.completed(Node);
141
8
142
8
      // Oops, ran out of successors... go up a level on the stack.
143
8
      VisitStack.pop_back();
144
8
    } while (!VisitStack.empty());
145
8
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::toNext()
Line
Count
Source
120
10.9k
  inline void toNext() {
121
18.0k
    do {
122
18.0k
      NodeRef Node = VisitStack.back().first;
123
18.0k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
18.0k
125
18.0k
      if (!Opt)
126
10.9k
        Opt.emplace(GT::child_begin(Node));
127
18.0k
128
18.0k
      // Notice that we directly mutate *Opt here, so that
129
18.0k
      // VisitStack.back().second actually gets updated as the iterator
130
18.0k
      // increases.
131
19.9k
      while (*Opt != GT::child_end(Node)) {
132
9.05k
        NodeRef Next = *(*Opt)++;
133
9.05k
        // Has our next sibling been visited?
134
9.05k
        if (this->Visited.insert(Next).second) {
135
7.10k
          // No, do it now.
136
7.10k
          VisitStack.push_back(StackElement(Next, None));
137
7.10k
          return;
138
7.10k
        }
139
9.05k
      }
140
18.0k
      this->Visited.completed(Node);
141
10.9k
142
10.9k
      // Oops, ran out of successors... go up a level on the stack.
143
10.9k
      VisitStack.pop_back();
144
10.9k
    } while (!VisitStack.empty());
145
10.9k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::toNext()
Line
Count
Source
120
9
  inline void toNext() {
121
17
    do {
122
17
      NodeRef Node = VisitStack.back().first;
123
17
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
17
125
17
      if (!Opt)
126
9
        Opt.emplace(GT::child_begin(Node));
127
17
128
17
      // Notice that we directly mutate *Opt here, so that
129
17
      // VisitStack.back().second actually gets updated as the iterator
130
17
      // increases.
131
19
      while (*Opt != GT::child_end(Node)) {
132
10
        NodeRef Next = *(*Opt)++;
133
10
        // Has our next sibling been visited?
134
10
        if (this->Visited.insert(Next).second) {
135
8
          // No, do it now.
136
8
          VisitStack.push_back(StackElement(Next, None));
137
8
          return;
138
8
        }
139
10
      }
140
17
      this->Visited.completed(Node);
141
9
142
9
      // Oops, ran out of successors... go up a level on the stack.
143
9
      VisitStack.pop_back();
144
9
    } while (!VisitStack.empty());
145
9
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::toNext()
Line
Count
Source
120
1.89k
  inline void toNext() {
121
2.02k
    do {
122
2.02k
      NodeRef Node = VisitStack.back().first;
123
2.02k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
2.02k
125
2.02k
      if (!Opt)
126
1.89k
        Opt.emplace(GT::child_begin(Node));
127
2.02k
128
2.02k
      // Notice that we directly mutate *Opt here, so that
129
2.02k
      // VisitStack.back().second actually gets updated as the iterator
130
2.02k
      // increases.
131
2.02k
      while (*Opt != GT::child_end(Node)) {
132
137
        NodeRef Next = *(*Opt)++;
133
137
        // Has our next sibling been visited?
134
137
        if (this->Visited.insert(Next).second) {
135
137
          // No, do it now.
136
137
          VisitStack.push_back(StackElement(Next, None));
137
137
          return;
138
137
        }
139
137
      }
140
2.02k
      this->Visited.completed(Node);
141
1.89k
142
1.89k
      // Oops, ran out of successors... go up a level on the stack.
143
1.89k
      VisitStack.pop_back();
144
1.89k
    } while (!VisitStack.empty());
145
1.89k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
7.01k
  inline void toNext() {
121
12.0k
    do {
122
12.0k
      NodeRef Node = VisitStack.back().first;
123
12.0k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
12.0k
125
12.0k
      if (!Opt)
126
5.77k
        Opt.emplace(GT::child_begin(Node));
127
12.0k
128
12.0k
      // Notice that we directly mutate *Opt here, so that
129
12.0k
      // VisitStack.back().second actually gets updated as the iterator
130
12.0k
      // increases.
131
15.2k
      while (*Opt != GT::child_end(Node)) {
132
9.45k
        NodeRef Next = *(*Opt)++;
133
9.45k
        // Has our next sibling been visited?
134
9.45k
        if (this->Visited.insert(Next).second) {
135
6.24k
          // No, do it now.
136
6.24k
          VisitStack.push_back(StackElement(Next, None));
137
6.24k
          return;
138
6.24k
        }
139
9.45k
      }
140
12.0k
      this->Visited.completed(Node);
141
5.77k
142
5.77k
      // Oops, ran out of successors... go up a level on the stack.
143
5.77k
      VisitStack.pop_back();
144
5.77k
    } while (!VisitStack.empty());
145
7.01k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
2.75M
  inline void toNext() {
121
5.03M
    do {
122
5.03M
      NodeRef Node = VisitStack.back().first;
123
5.03M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
5.03M
125
5.03M
      if (!Opt)
126
2.75M
        Opt.emplace(GT::child_begin(Node));
127
5.03M
128
5.03M
      // Notice that we directly mutate *Opt here, so that
129
5.03M
      // VisitStack.back().second actually gets updated as the iterator
130
5.03M
      // increases.
131
6.18M
      while (*Opt != GT::child_end(Node)) {
132
3.42M
        NodeRef Next = *(*Opt)++;
133
3.42M
        // Has our next sibling been visited?
134
3.42M
        if (this->Visited.insert(Next).second) {
135
2.27M
          // No, do it now.
136
2.27M
          VisitStack.push_back(StackElement(Next, None));
137
2.27M
          return;
138
2.27M
        }
139
3.42M
      }
140
5.03M
      this->Visited.completed(Node);
141
2.75M
142
2.75M
      // Oops, ran out of successors... go up a level on the stack.
143
2.75M
      VisitStack.pop_back();
144
2.75M
    } while (!VisitStack.empty());
145
2.75M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::toNext()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::toNext()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::toNext()
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::toNext()
Line
Count
Source
120
2.11M
  inline void toNext() {
121
2.56M
    do {
122
2.56M
      NodeRef Node = VisitStack.back().first;
123
2.56M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
2.56M
125
2.56M
      if (!Opt)
126
2.11M
        Opt.emplace(GT::child_begin(Node));
127
2.56M
128
2.56M
      // Notice that we directly mutate *Opt here, so that
129
2.56M
      // VisitStack.back().second actually gets updated as the iterator
130
2.56M
      // increases.
131
2.76M
      while (*Opt != GT::child_end(Node)) {
132
644k
        NodeRef Next = *(*Opt)++;
133
644k
        // Has our next sibling been visited?
134
644k
        if (this->Visited.insert(Next).second) {
135
445k
          // No, do it now.
136
445k
          VisitStack.push_back(StackElement(Next, None));
137
445k
          return;
138
445k
        }
139
644k
      }
140
2.56M
      this->Visited.completed(Node);
141
2.11M
142
2.11M
      // Oops, ran out of successors... go up a level on the stack.
143
2.11M
      VisitStack.pop_back();
144
2.11M
    } while (!VisitStack.empty());
145
2.11M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
5.28M
  inline void toNext() {
121
9.82M
    do {
122
9.82M
      NodeRef Node = VisitStack.back().first;
123
9.82M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
9.82M
125
9.82M
      if (!Opt)
126
5.28M
        Opt.emplace(GT::child_begin(Node));
127
9.82M
128
9.82M
      // Notice that we directly mutate *Opt here, so that
129
9.82M
      // VisitStack.back().second actually gets updated as the iterator
130
9.82M
      // increases.
131
12.0M
      while (*Opt != GT::child_end(Node)) {
132
6.76M
        NodeRef Next = *(*Opt)++;
133
6.76M
        // Has our next sibling been visited?
134
6.76M
        if (this->Visited.insert(Next).second) {
135
4.54M
          // No, do it now.
136
4.54M
          VisitStack.push_back(StackElement(Next, None));
137
4.54M
          return;
138
4.54M
        }
139
6.76M
      }
140
9.82M
      this->Visited.completed(Node);
141
5.28M
142
5.28M
      // Oops, ran out of successors... go up a level on the stack.
143
5.28M
      VisitStack.pop_back();
144
5.28M
    } while (!VisitStack.empty());
145
5.28M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
120
395
  inline void toNext() {
121
585
    do {
122
585
      NodeRef Node = VisitStack.back().first;
123
585
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
585
125
585
      if (!Opt)
126
395
        Opt.emplace(GT::child_begin(Node));
127
585
128
585
      // Notice that we directly mutate *Opt here, so that
129
585
      // VisitStack.back().second actually gets updated as the iterator
130
585
      // increases.
131
629
      while (*Opt != GT::child_end(Node)) {
132
234
        NodeRef Next = *(*Opt)++;
133
234
        // Has our next sibling been visited?
134
234
        if (this->Visited.insert(Next).second) {
135
190
          // No, do it now.
136
190
          VisitStack.push_back(StackElement(Next, None));
137
190
          return;
138
190
        }
139
234
      }
140
585
      this->Visited.completed(Node);
141
395
142
395
      // Oops, ran out of successors... go up a level on the stack.
143
395
      VisitStack.pop_back();
144
395
    } while (!VisitStack.empty());
145
395
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
Line
Count
Source
120
3.72k
  inline void toNext() {
121
7.15k
    do {
122
7.15k
      NodeRef Node = VisitStack.back().first;
123
7.15k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.15k
125
7.15k
      if (!Opt)
126
3.72k
        Opt.emplace(GT::child_begin(Node));
127
7.15k
128
7.15k
      // Notice that we directly mutate *Opt here, so that
129
7.15k
      // VisitStack.back().second actually gets updated as the iterator
130
7.15k
      // increases.
131
7.33k
      while (*Opt != GT::child_end(Node)) {
132
3.61k
        NodeRef Next = *(*Opt)++;
133
3.61k
        // Has our next sibling been visited?
134
3.61k
        if (this->Visited.insert(Next).second) {
135
3.43k
          // No, do it now.
136
3.43k
          VisitStack.push_back(StackElement(Next, None));
137
3.43k
          return;
138
3.43k
        }
139
3.61k
      }
140
7.15k
      this->Visited.completed(Node);
141
3.72k
142
3.72k
      // Oops, ran out of successors... go up a level on the stack.
143
3.72k
      VisitStack.pop_back();
144
3.72k
    } while (!VisitStack.empty());
145
3.72k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
120
2.75M
  inline void toNext() {
121
4.99M
    do {
122
4.99M
      NodeRef Node = VisitStack.back().first;
123
4.99M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
4.99M
125
4.99M
      if (!Opt)
126
2.75M
        Opt.emplace(GT::child_begin(Node));
127
4.99M
128
4.99M
      // Notice that we directly mutate *Opt here, so that
129
4.99M
      // VisitStack.back().second actually gets updated as the iterator
130
4.99M
      // increases.
131
6.22M
      while (*Opt != GT::child_end(Node)) {
132
3.47M
        NodeRef Next = *(*Opt)++;
133
3.47M
        // Has our next sibling been visited?
134
3.47M
        if (this->Visited.insert(Next).second) {
135
2.24M
          // No, do it now.
136
2.24M
          VisitStack.push_back(StackElement(Next, None));
137
2.24M
          return;
138
2.24M
        }
139
3.47M
      }
140
4.99M
      this->Visited.completed(Node);
141
2.75M
142
2.75M
      // Oops, ran out of successors... go up a level on the stack.
143
2.75M
      VisitStack.pop_back();
144
2.75M
    } while (!VisitStack.empty());
145
2.75M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
Line
Count
Source
120
688
  inline void toNext() {
121
1.01k
    do {
122
1.01k
      NodeRef Node = VisitStack.back().first;
123
1.01k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.01k
125
1.01k
      if (!Opt)
126
688
        Opt.emplace(GT::child_begin(Node));
127
1.01k
128
1.01k
      // Notice that we directly mutate *Opt here, so that
129
1.01k
      // VisitStack.back().second actually gets updated as the iterator
130
1.01k
      // increases.
131
1.22k
      while (*Opt != GT::child_end(Node)) {
132
674
        NodeRef Next = *(*Opt)++;
133
674
        // Has our next sibling been visited?
134
674
        if (this->Visited.insert(Next).second) {
135
468
          // No, do it now.
136
468
          VisitStack.push_back(StackElement(Next, None));
137
468
          return;
138
468
        }
139
674
      }
140
1.01k
      this->Visited.completed(Node);
141
551
142
551
      // Oops, ran out of successors... go up a level on the stack.
143
551
      VisitStack.pop_back();
144
551
    } while (!VisitStack.empty());
145
688
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
Line
Count
Source
120
49
  inline void toNext() {
121
64
    do {
122
64
      NodeRef Node = VisitStack.back().first;
123
64
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
64
125
64
      if (!Opt)
126
32
        Opt.emplace(GT::child_begin(Node));
127
64
128
64
      // Notice that we directly mutate *Opt here, so that
129
64
      // VisitStack.back().second actually gets updated as the iterator
130
64
      // increases.
131
69
      while (*Opt != GT::child_end(Node)) {
132
37
        NodeRef Next = *(*Opt)++;
133
37
        // Has our next sibling been visited?
134
37
        if (this->Visited.insert(Next).second) {
135
32
          // No, do it now.
136
32
          VisitStack.push_back(StackElement(Next, None));
137
32
          return;
138
32
        }
139
37
      }
140
64
      this->Visited.completed(Node);
141
32
142
32
      // Oops, ran out of successors... go up a level on the stack.
143
32
      VisitStack.pop_back();
144
32
    } while (!VisitStack.empty());
145
49
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
2.91M
  inline void toNext() {
121
5.36M
    do {
122
5.36M
      NodeRef Node = VisitStack.back().first;
123
5.36M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
5.36M
125
5.36M
      if (!Opt)
126
2.91M
        Opt.emplace(GT::child_begin(Node));
127
5.36M
128
5.36M
      // Notice that we directly mutate *Opt here, so that
129
5.36M
      // VisitStack.back().second actually gets updated as the iterator
130
5.36M
      // increases.
131
6.69M
      while (*Opt != GT::child_end(Node)) {
132
3.78M
        NodeRef Next = *(*Opt)++;
133
3.78M
        // Has our next sibling been visited?
134
3.78M
        if (this->Visited.insert(Next).second) {
135
2.45M
          // No, do it now.
136
2.45M
          VisitStack.push_back(StackElement(Next, None));
137
2.45M
          return;
138
2.45M
        }
139
3.78M
      }
140
5.36M
      this->Visited.completed(Node);
141
2.91M
142
2.91M
      // Oops, ran out of successors... go up a level on the stack.
143
2.91M
      VisitStack.pop_back();
144
2.91M
    } while (!VisitStack.empty());
145
2.91M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::toNext()
Line
Count
Source
120
637
  inline void toNext() {
121
656
    do {
122
656
      NodeRef Node = VisitStack.back().first;
123
656
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
656
125
656
      if (!Opt)
126
330
        Opt.emplace(GT::child_begin(Node));
127
656
128
656
      // Notice that we directly mutate *Opt here, so that
129
656
      // VisitStack.back().second actually gets updated as the iterator
130
656
      // increases.
131
676
      while (*Opt != GT::child_end(Node)) {
132
350
        NodeRef Next = *(*Opt)++;
133
350
        // Has our next sibling been visited?
134
350
        if (this->Visited.insert(Next).second) {
135
330
          // No, do it now.
136
330
          VisitStack.push_back(StackElement(Next, None));
137
330
          return;
138
330
        }
139
350
      }
140
656
      this->Visited.completed(Node);
141
326
142
326
      // Oops, ran out of successors... go up a level on the stack.
143
326
      VisitStack.pop_back();
144
326
    } while (!VisitStack.empty());
145
637
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::toNext()
Line
Count
Source
120
87.7k
  inline void toNext() {
121
98.2k
    do {
122
98.2k
      NodeRef Node = VisitStack.back().first;
123
98.2k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
98.2k
125
98.2k
      if (!Opt)
126
87.7k
        Opt.emplace(GT::child_begin(Node));
127
98.2k
128
98.2k
      // Notice that we directly mutate *Opt here, so that
129
98.2k
      // VisitStack.back().second actually gets updated as the iterator
130
98.2k
      // increases.
131
98.2k
      while (*Opt != GT::child_end(Node)) {
132
10.5k
        NodeRef Next = *(*Opt)++;
133
10.5k
        // Has our next sibling been visited?
134
10.5k
        if (this->Visited.insert(Next).second) {
135
10.5k
          // No, do it now.
136
10.5k
          VisitStack.push_back(StackElement(Next, None));
137
10.5k
          return;
138
10.5k
        }
139
10.5k
      }
140
98.2k
      this->Visited.completed(Node);
141
87.7k
142
87.7k
      // Oops, ran out of successors... go up a level on the stack.
143
87.7k
      VisitStack.pop_back();
144
87.7k
    } while (!VisitStack.empty());
145
87.7k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::toNext()
Line
Count
Source
120
75.1k
  inline void toNext() {
121
92.5k
    do {
122
92.5k
      NodeRef Node = VisitStack.back().first;
123
92.5k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
92.5k
125
92.5k
      if (!Opt)
126
75.1k
        Opt.emplace(GT::child_begin(Node));
127
92.5k
128
92.5k
      // Notice that we directly mutate *Opt here, so that
129
92.5k
      // VisitStack.back().second actually gets updated as the iterator
130
92.5k
      // increases.
131
95.4k
      while (*Opt != GT::child_end(Node)) {
132
20.2k
        NodeRef Next = *(*Opt)++;
133
20.2k
        // Has our next sibling been visited?
134
20.2k
        if (this->Visited.insert(Next).second) {
135
17.3k
          // No, do it now.
136
17.3k
          VisitStack.push_back(StackElement(Next, None));
137
17.3k
          return;
138
17.3k
        }
139
20.2k
      }
140
92.5k
      this->Visited.completed(Node);
141
75.1k
142
75.1k
      // Oops, ran out of successors... go up a level on the stack.
143
75.1k
      VisitStack.pop_back();
144
75.1k
    } while (!VisitStack.empty());
145
75.1k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::toNext()
146
147
public:
148
  using pointer = typename super::pointer;
149
150
  // Provide static begin and end methods as our public "constructors"
151
4.18M
  static df_iterator begin(const GraphT &G) {
152
4.18M
    return df_iterator(GT::getEntryNode(G));
153
4.18M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::begin(llvm::MachineDominatorTree* const&)
Line
Count
Source
151
509k
  static df_iterator begin(const GraphT &G) {
152
509k
    return df_iterator(GT::getEntryNode(G));
153
509k
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::begin(llvm::Loop* const&)
Line
Count
Source
151
406k
  static df_iterator begin(const GraphT &G) {
152
406k
    return df_iterator(GT::getEntryNode(G));
153
406k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::begin(llvm::MachineLoop* const&)
Line
Count
Source
151
123
  static df_iterator begin(const GraphT &G) {
152
123
    return df_iterator(GT::getEntryNode(G));
153
123
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::begin(llvm::BasicBlock* const&)
Line
Count
Source
151
1.74M
  static df_iterator begin(const GraphT &G) {
152
1.74M
    return df_iterator(GT::getEntryNode(G));
153
1.74M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::begin(llvm::MachineFunction* const&)
Line
Count
Source
151
118k
  static df_iterator begin(const GraphT &G) {
152
118k
    return df_iterator(GT::getEntryNode(G));
153
118k
  }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::begin(llvm::DomTreeNodeBase<llvm::BasicBlock>* const&)
Line
Count
Source
151
1.26M
  static df_iterator begin(const GraphT &G) {
152
1.26M
    return df_iterator(GT::getEntryNode(G));
153
1.26M
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::begin(llvm::RegionNode* const&)
Line
Count
Source
151
4.36k
  static df_iterator begin(const GraphT &G) {
152
4.36k
    return df_iterator(GT::getEntryNode(G));
153
4.36k
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::begin(llvm::RegionNode const* const&)
Line
Count
Source
151
4
  static df_iterator begin(const GraphT &G) {
152
4
    return df_iterator(GT::getEntryNode(G));
153
4
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::begin(llvm::BasicBlock const* const&)
Line
Count
Source
151
14
  static df_iterator begin(const GraphT &G) {
152
14
    return df_iterator(GT::getEntryNode(G));
153
14
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::begin(llvm::RegionNode* const&)
Line
Count
Source
151
1
  static df_iterator begin(const GraphT &G) {
152
1
    return df_iterator(GT::getEntryNode(G));
153
1
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::begin(llvm::Loop const* const&)
Line
Count
Source
151
1.75k
  static df_iterator begin(const GraphT &G) {
152
1.75k
    return df_iterator(GT::getEntryNode(G));
153
1.75k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::begin(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::begin(llvm::MachineRegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::begin(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::begin(llvm::Function* const&)
Line
Count
Source
151
205
  static df_iterator begin(const GraphT &G) {
152
205
    return df_iterator(GT::getEntryNode(G));
153
205
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::begin(llvm::Inverse<llvm::BasicBlock*> const&)
Line
Count
Source
151
17
  static df_iterator begin(const GraphT &G) {
152
17
    return df_iterator(GT::getEntryNode(G));
153
17
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::begin(llvm::Inverse<llvm::BasicBlock const*> const&)
Line
Count
Source
151
319
  static df_iterator begin(const GraphT &G) {
152
319
    return df_iterator(GT::getEntryNode(G));
153
319
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::begin(llvm::DominatorTree* const&)
Line
Count
Source
151
77.2k
  static df_iterator begin(const GraphT &G) {
152
77.2k
    return df_iterator(GT::getEntryNode(G));
153
77.2k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::begin(llvm::VPBlockBase* const&)
Line
Count
Source
151
57.8k
  static df_iterator begin(const GraphT &G) {
152
57.8k
    return df_iterator(GT::getEntryNode(G));
153
57.8k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::begin(llvm::VPBlockBase const* const&)
154
4.18M
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::end(llvm::MachineDominatorTree* const&)
Line
Count
Source
154
509k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::end(llvm::Loop* const&)
Line
Count
Source
154
406k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::end(llvm::MachineLoop* const&)
Line
Count
Source
154
123
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::end(llvm::BasicBlock* const&)
Line
Count
Source
154
1.74M
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::end(llvm::MachineFunction* const&)
Line
Count
Source
154
118k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::end(llvm::DomTreeNodeBase<llvm::BasicBlock>* const&)
Line
Count
Source
154
1.26M
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::end(llvm::RegionNode* const&)
Line
Count
Source
154
4.36k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::end(llvm::RegionNode const* const&)
Line
Count
Source
154
4
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::end(llvm::BasicBlock const* const&)
Line
Count
Source
154
14
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::end(llvm::RegionNode* const&)
Line
Count
Source
154
1
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::end(llvm::Loop const* const&)
Line
Count
Source
154
1.75k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::end(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::end(llvm::MachineRegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::end(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::end(llvm::Function* const&)
Line
Count
Source
154
205
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::end(llvm::Inverse<llvm::BasicBlock*> const&)
Line
Count
Source
154
17
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::end(llvm::Inverse<llvm::BasicBlock const*> const&)
Line
Count
Source
154
319
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::end(llvm::DominatorTree* const&)
Line
Count
Source
154
77.2k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::end(llvm::VPBlockBase* const&)
Line
Count
Source
154
57.8k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::end(llvm::VPBlockBase const* const&)
155
156
  // Static begin and end methods as our public ctors for external iterators
157
3.86M
  static df_iterator begin(const GraphT &G, SetType &S) {
158
3.86M
    return df_iterator(GT::getEntryNode(G), S);
159
3.86M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
157
1.88k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
1.88k
    return df_iterator(GT::getEntryNode(G), S);
159
1.88k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
157
4.63k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
4.63k
    return df_iterator(GT::getEntryNode(G), S);
159
4.63k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
157
478k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
478k
    return df_iterator(GT::getEntryNode(G), S);
159
478k
  }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::begin(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
157
1.67M
  static df_iterator begin(const GraphT &G, SetType &S) {
158
1.67M
    return df_iterator(GT::getEntryNode(G), S);
159
1.67M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::begin(llvm::MachineFunction* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
157
739k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
739k
    return df_iterator(GT::getEntryNode(G), S);
159
739k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::begin(llvm::Inverse<llvm::BasicBlock*> const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
157
290
  static df_iterator begin(const GraphT &G, SetType &S) {
158
290
    return df_iterator(GT::getEntryNode(G), S);
159
290
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::begin(llvm::Function* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
157
510k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
510k
    return df_iterator(GT::getEntryNode(G), S);
159
510k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::begin(llvm::Inverse<llvm::BasicBlock*> const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
157
491
  static df_iterator begin(const GraphT &G, SetType &S) {
158
491
    return df_iterator(GT::getEntryNode(G), S);
159
491
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::begin(llvm::BasicBlock* const&, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
157
457k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
457k
    return df_iterator(GT::getEntryNode(G), S);
159
457k
  }
160
3.86M
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
160
1.88k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
160
4.63k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
160
478k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::end(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
160
1.67M
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::end(llvm::MachineFunction* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
160
739k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::end(llvm::Inverse<llvm::BasicBlock*> const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
160
290
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::end(llvm::Function* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
160
510k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::end(llvm::Inverse<llvm::BasicBlock*> const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
160
491
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::end(llvm::BasicBlock* const&, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
160
457k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
161
162
49.2M
  bool operator==(const df_iterator &x) const {
163
49.2M
    return VisitStack == x.VisitStack;
164
49.2M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator==(llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > const&) const
Line
Count
Source
162
4.56M
  bool operator==(const df_iterator &x) const {
163
4.56M
    return VisitStack == x.VisitStack;
164
4.56M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator==(llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> > const&) const
Line
Count
Source
162
968k
  bool operator==(const df_iterator &x) const {
163
968k
    return VisitStack == x.VisitStack;
164
968k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator==(llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > const&) const
Line
Count
Source
162
258
  bool operator==(const df_iterator &x) const {
163
258
    return VisitStack == x.VisitStack;
164
258
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator==(llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
162
14.7M
  bool operator==(const df_iterator &x) const {
163
14.7M
    return VisitStack == x.VisitStack;
164
14.7M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator==(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> > const&) const
Line
Count
Source
162
2.06M
  bool operator==(const df_iterator &x) const {
163
2.06M
    return VisitStack == x.VisitStack;
164
2.06M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
162
9.48k
  bool operator==(const df_iterator &x) const {
163
9.48k
    return VisitStack == x.VisitStack;
164
9.48k
  }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::operator==(llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> > const&) const
Line
Count
Source
162
6.86M
  bool operator==(const df_iterator &x) const {
163
6.86M
    return VisitStack == x.VisitStack;
164
6.86M
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator==(llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > const&) const
Line
Count
Source
162
76
  bool operator==(const df_iterator &x) const {
163
76
    return VisitStack == x.VisitStack;
164
76
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator==(llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> > const&) const
Line
Count
Source
162
12
  bool operator==(const df_iterator &x) const {
163
12
    return VisitStack == x.VisitStack;
164
12
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator==(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> > const&) const
Line
Count
Source
162
15.3k
  bool operator==(const df_iterator &x) const {
163
15.3k
    return VisitStack == x.VisitStack;
164
15.3k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator==(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > > const&) const
Line
Count
Source
162
10
  bool operator==(const df_iterator &x) const {
163
10
    return VisitStack == x.VisitStack;
164
10
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator==(llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > const&) const
Line
Count
Source
162
3.64k
  bool operator==(const df_iterator &x) const {
163
3.64k
    return VisitStack == x.VisitStack;
164
3.64k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
162
15.3k
  bool operator==(const df_iterator &x) const {
163
15.3k
    return VisitStack == x.VisitStack;
164
15.3k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
162
3.23M
  bool operator==(const df_iterator &x) const {
163
3.23M
    return VisitStack == x.VisitStack;
164
3.23M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator==(llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator==(llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> > const&) const
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator==(llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> > const&) const
Line
Count
Source
162
3.78M
  bool operator==(const df_iterator &x) const {
163
3.78M
    return VisitStack == x.VisitStack;
164
3.78M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator==(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> > const&) const
Line
Count
Source
162
6.02M
  bool operator==(const df_iterator &x) const {
163
6.02M
    return VisitStack == x.VisitStack;
164
6.02M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator==(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
162
600
  bool operator==(const df_iterator &x) const {
163
600
    return VisitStack == x.VisitStack;
164
600
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
162
4.01k
  bool operator==(const df_iterator &x) const {
163
4.01k
    return VisitStack == x.VisitStack;
164
4.01k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator==(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
162
3.26M
  bool operator==(const df_iterator &x) const {
163
3.26M
    return VisitStack == x.VisitStack;
164
3.26M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
162
1.17k
  bool operator==(const df_iterator &x) const {
163
1.17k
    return VisitStack == x.VisitStack;
164
1.17k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
162
49
  bool operator==(const df_iterator &x) const {
163
49
    return VisitStack == x.VisitStack;
164
49
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator==(llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
162
3.36M
  bool operator==(const df_iterator &x) const {
163
3.36M
    return VisitStack == x.VisitStack;
164
3.36M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > > const&) const
Line
Count
Source
162
956
  bool operator==(const df_iterator &x) const {
163
956
    return VisitStack == x.VisitStack;
164
956
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator==(llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > const&) const
Line
Count
Source
162
164k
  bool operator==(const df_iterator &x) const {
163
164k
    return VisitStack == x.VisitStack;
164
164k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator==(llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> > const&) const
Line
Count
Source
162
133k
  bool operator==(const df_iterator &x) const {
163
133k
    return VisitStack == x.VisitStack;
164
133k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator==(llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > const&) const
165
49.2M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator!=(llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > const&) const
Line
Count
Source
165
4.56M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator!=(llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> > const&) const
Line
Count
Source
165
968k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator!=(llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > const&) const
Line
Count
Source
165
258
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator!=(llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
165
14.7M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator!=(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> > const&) const
Line
Count
Source
165
2.06M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
9.48k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::operator!=(llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> > const&) const
Line
Count
Source
165
6.86M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator!=(llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > const&) const
Line
Count
Source
165
76
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator!=(llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> > const&) const
Line
Count
Source
165
12
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator!=(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> > const&) const
Line
Count
Source
165
15.3k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator!=(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > > const&) const
Line
Count
Source
165
10
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator!=(llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > const&) const
Line
Count
Source
165
3.64k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
15.3k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
3.23M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator!=(llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator!=(llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> > const&) const
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator!=(llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> > const&) const
Line
Count
Source
165
3.78M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator!=(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> > const&) const
Line
Count
Source
165
6.02M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator!=(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
165
600
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
165
4.01k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator!=(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
165
3.26M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
165
1.17k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
165
49
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator!=(llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
165
3.36M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > > const&) const
Line
Count
Source
165
956
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator!=(llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > const&) const
Line
Count
Source
165
164k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator!=(llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> > const&) const
Line
Count
Source
165
133k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator!=(llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > const&) const
166
167
41.2M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator*() const
Line
Count
Source
167
4.05M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator*() const
Line
Count
Source
167
561k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator*() const
Line
Count
Source
167
154
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator*() const
Line
Count
Source
167
13.0M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator*() const
Line
Count
Source
167
1.94M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
7.60k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::operator*() const
Line
Count
Source
167
5.60M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator*() const
Line
Count
Source
167
62
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator*() const
Line
Count
Source
167
8
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator*() const
Line
Count
Source
167
18.4k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator*() const
Line
Count
Source
167
9
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator*() const
Line
Count
Source
167
1.89k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
10.7k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
2.75M
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator*() const
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator*() const
Line
Count
Source
167
2.11M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator*() const
Line
Count
Source
167
5.28M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator*() const
Line
Count
Source
167
395
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
167
3.72k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator*() const
Line
Count
Source
167
2.75M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
167
807
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
167
32
  const NodeRef &operator*() const { return VisitStack.back().first; }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator*() const
Line
Count
Source
167
2.91M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::operator*() const
Line
Count
Source
167
649
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator*() const
Line
Count
Source
167
87.7k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator*() const
Line
Count
Source
167
75.1k
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator*() const
168
169
  // This is a nonstandard operator-> that dereferences the pointer an extra
170
  // time... so that you can actually call methods ON the Node, because
171
  // the contained type is a pointer.  This allows BBIt->getTerminator() f.e.
172
  //
173
13.8k
  NodeRef operator->() const { return **this; }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator->() const
Line
Count
Source
173
19
  NodeRef operator->() const { return **this; }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator->() const
Line
Count
Source
173
13.8k
  NodeRef operator->() const { return **this; }
174
175
41.2M
  df_iterator &operator++() { // Preincrement
176
41.2M
    toNext();
177
41.2M
    return *this;
178
41.2M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator++()
Line
Count
Source
175
4.05M
  df_iterator &operator++() { // Preincrement
176
4.05M
    toNext();
177
4.05M
    return *this;
178
4.05M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator++()
Line
Count
Source
175
561k
  df_iterator &operator++() { // Preincrement
176
561k
    toNext();
177
561k
    return *this;
178
561k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator++()
Line
Count
Source
175
135
  df_iterator &operator++() { // Preincrement
176
135
    toNext();
177
135
    return *this;
178
135
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
13.0M
  df_iterator &operator++() { // Preincrement
176
13.0M
    toNext();
177
13.0M
    return *this;
178
13.0M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
1.94M
  df_iterator &operator++() { // Preincrement
176
1.94M
    toNext();
177
1.94M
    return *this;
178
1.94M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
7.60k
  df_iterator &operator++() { // Preincrement
176
7.60k
    toNext();
177
7.60k
    return *this;
178
7.60k
  }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::operator++()
Line
Count
Source
175
5.60M
  df_iterator &operator++() { // Preincrement
176
5.60M
    toNext();
177
5.60M
    return *this;
178
5.60M
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator++()
Line
Count
Source
175
62
  df_iterator &operator++() { // Preincrement
176
62
    toNext();
177
62
    return *this;
178
62
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator++()
Line
Count
Source
175
8
  df_iterator &operator++() { // Preincrement
176
8
    toNext();
177
8
    return *this;
178
8
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator++()
Line
Count
Source
175
10.9k
  df_iterator &operator++() { // Preincrement
176
10.9k
    toNext();
177
10.9k
    return *this;
178
10.9k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator++()
Line
Count
Source
175
9
  df_iterator &operator++() { // Preincrement
176
9
    toNext();
177
9
    return *this;
178
9
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator++()
Line
Count
Source
175
1.89k
  df_iterator &operator++() { // Preincrement
176
1.89k
    toNext();
177
1.89k
    return *this;
178
1.89k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
5.77k
  df_iterator &operator++() { // Preincrement
176
5.77k
    toNext();
177
5.77k
    return *this;
178
5.77k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
2.75M
  df_iterator &operator++() { // Preincrement
176
2.75M
    toNext();
177
2.75M
    return *this;
178
2.75M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator++()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator++()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator++()
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator++()
Line
Count
Source
175
2.11M
  df_iterator &operator++() { // Preincrement
176
2.11M
    toNext();
177
2.11M
    return *this;
178
2.11M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
5.28M
  df_iterator &operator++() { // Preincrement
176
5.28M
    toNext();
177
5.28M
    return *this;
178
5.28M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
175
395
  df_iterator &operator++() { // Preincrement
176
395
    toNext();
177
395
    return *this;
178
395
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
175
3.72k
  df_iterator &operator++() { // Preincrement
176
3.72k
    toNext();
177
3.72k
    return *this;
178
3.72k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
175
2.75M
  df_iterator &operator++() { // Preincrement
176
2.75M
    toNext();
177
2.75M
    return *this;
178
2.75M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
175
688
  df_iterator &operator++() { // Preincrement
176
688
    toNext();
177
688
    return *this;
178
688
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
175
32
  df_iterator &operator++() { // Preincrement
176
32
    toNext();
177
32
    return *this;
178
32
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
2.91M
  df_iterator &operator++() { // Preincrement
176
2.91M
    toNext();
177
2.91M
    return *this;
178
2.91M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::operator++()
Line
Count
Source
175
330
  df_iterator &operator++() { // Preincrement
176
330
    toNext();
177
330
    return *this;
178
330
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator++()
Line
Count
Source
175
87.7k
  df_iterator &operator++() { // Preincrement
176
87.7k
    toNext();
177
87.7k
    return *this;
178
87.7k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator++()
Line
Count
Source
175
75.1k
  df_iterator &operator++() { // Preincrement
176
75.1k
    toNext();
177
75.1k
    return *this;
178
75.1k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator++()
179
180
  /// Skips all children of the current node and traverses to next node
181
  ///
182
  /// Note: This function takes care of incrementing the iterator. If you
183
  /// always increment and call this function, you risk walking off the end.
184
5.31k
  df_iterator &skipChildren() {
185
5.31k
    VisitStack.pop_back();
186
5.31k
    if (!VisitStack.empty())
187
1.57k
      toNext();
188
5.31k
    return *this;
189
5.31k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::skipChildren()
Line
Count
Source
184
4.98k
  df_iterator &skipChildren() {
185
4.98k
    VisitStack.pop_back();
186
4.98k
    if (!VisitStack.empty())
187
1.24k
      toNext();
188
4.98k
    return *this;
189
4.98k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::skipChildren()
Line
Count
Source
184
17
  df_iterator &skipChildren() {
185
17
    VisitStack.pop_back();
186
17
    if (!VisitStack.empty())
187
17
      toNext();
188
17
    return *this;
189
17
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::skipChildren()
Line
Count
Source
184
4
  df_iterator &skipChildren() {
185
4
    VisitStack.pop_back();
186
4
    if (!VisitStack.empty())
187
4
      toNext();
188
4
    return *this;
189
4
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::skipChildren()
Line
Count
Source
184
307
  df_iterator &skipChildren() {
185
307
    VisitStack.pop_back();
186
307
    if (!VisitStack.empty())
187
307
      toNext();
188
307
    return *this;
189
307
  }
190
191
  df_iterator operator++(int) { // Postincrement
192
    df_iterator tmp = *this;
193
    ++*this;
194
    return tmp;
195
  }
196
197
  // nodeVisited - return true if this iterator has already visited the
198
  // specified node.  This is public, and will probably be used to iterate over
199
  // nodes that a depth first iteration did not find: ie unreachable nodes.
200
  //
201
1.30k
  bool nodeVisited(NodeRef Node) const {
202
1.30k
    return this->Visited.count(Node) != 0;
203
1.30k
  }
204
205
  /// getPathLength - Return the length of the path from the entry node to the
206
  /// current node, counting both nodes.
207
7.35M
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::getPathLength() const
Line
Count
Source
207
2.56M
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::getPathLength() const
Line
Count
Source
207
4.78M
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::getPathLength() const
Line
Count
Source
207
15
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::getPathLength() const
Line
Count
Source
207
178
  unsigned getPathLength() const { return VisitStack.size(); }
208
209
  /// getPath - Return the n'th node in the path from the entry node to the
210
  /// current node.
211
2.71M
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::getPath(unsigned int) const
Line
Count
Source
211
445k
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::getPath(unsigned int) const
Line
Count
Source
211
2.26M
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::getPath(unsigned int) const
Line
Count
Source
211
280
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
212
};
213
214
// Provide global constructors that automatically figure out correct types...
215
//
216
template <class T>
217
4.17M
df_iterator<T> df_begin(const T& G) {
218
4.17M
  return df_iterator<T>::begin(G);
219
4.17M
}
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineDominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > llvm::df_begin<llvm::MachineDominatorTree*>(llvm::MachineDominatorTree* const&)
Line
Count
Source
217
509k
df_iterator<T> df_begin(const T& G) {
218
509k
  return df_iterator<T>::begin(G);
219
509k
}
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> > llvm::df_begin<llvm::DomTreeNodeBase<llvm::BasicBlock>*>(llvm::DomTreeNodeBase<llvm::BasicBlock>* const&)
Line
Count
Source
217
1.26M
df_iterator<T> df_begin(const T& G) {
218
1.26M
  return df_iterator<T>::begin(G);
219
1.26M
}
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop*> > llvm::df_begin<llvm::Loop*>(llvm::Loop* const&)
Line
Count
Source
217
406k
df_iterator<T> df_begin(const T& G) {
218
406k
  return df_iterator<T>::begin(G);
219
406k
}
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineLoop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > llvm::df_begin<llvm::MachineLoop*>(llvm::MachineLoop* const&)
Line
Count
Source
217
123
df_iterator<T> df_begin(const T& G) {
218
123
  return df_iterator<T>::begin(G);
219
123
}
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > llvm::df_begin<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
217
1.74M
df_iterator<T> df_begin(const T& G) {
218
1.74M
  return df_iterator<T>::begin(G);
219
1.74M
}
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineFunction*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> > llvm::df_begin<llvm::MachineFunction*>(llvm::MachineFunction* const&)
Line
Count
Source
217
118k
df_iterator<T> df_begin(const T& G) {
218
118k
  return df_iterator<T>::begin(G);
219
118k
}
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > llvm::df_begin<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
217
14
df_iterator<T> df_begin(const T& G) {
218
14
  return df_iterator<T>::begin(G);
219
14
}
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > llvm::df_begin<llvm::Loop const*>(llvm::Loop const* const&)
Line
Count
Source
217
1.75k
df_iterator<T> df_begin(const T& G) {
218
1.75k
  return df_iterator<T>::begin(G);
219
1.75k
}
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_begin<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_begin<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > llvm::df_begin<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
217
205
df_iterator<T> df_begin(const T& G) {
218
205
  return df_iterator<T>::begin(G);
219
205
}
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > llvm::df_begin<llvm::DominatorTree*>(llvm::DominatorTree* const&)
Line
Count
Source
217
77.2k
df_iterator<T> df_begin(const T& G) {
218
77.2k
  return df_iterator<T>::begin(G);
219
77.2k
}
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> > llvm::df_begin<llvm::VPBlockBase*>(llvm::VPBlockBase* const&)
Line
Count
Source
217
57.8k
df_iterator<T> df_begin(const T& G) {
218
57.8k
  return df_iterator<T>::begin(G);
219
57.8k
}
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > llvm::df_begin<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
220
221
template <class T>
222
4.17M
df_iterator<T> df_end(const T& G) {
223
4.17M
  return df_iterator<T>::end(G);
224
4.17M
}
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineDominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > llvm::df_end<llvm::MachineDominatorTree*>(llvm::MachineDominatorTree* const&)
Line
Count
Source
222
509k
df_iterator<T> df_end(const T& G) {
223
509k
  return df_iterator<T>::end(G);
224
509k
}
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> > llvm::df_end<llvm::DomTreeNodeBase<llvm::BasicBlock>*>(llvm::DomTreeNodeBase<llvm::BasicBlock>* const&)
Line
Count
Source
222
1.26M
df_iterator<T> df_end(const T& G) {
223
1.26M
  return df_iterator<T>::end(G);
224
1.26M
}
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop*> > llvm::df_end<llvm::Loop*>(llvm::Loop* const&)
Line
Count
Source
222
406k
df_iterator<T> df_end(const T& G) {
223
406k
  return df_iterator<T>::end(G);
224
406k
}
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineLoop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > llvm::df_end<llvm::MachineLoop*>(llvm::MachineLoop* const&)
Line
Count
Source
222
123
df_iterator<T> df_end(const T& G) {
223
123
  return df_iterator<T>::end(G);
224
123
}
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > llvm::df_end<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
222
1.74M
df_iterator<T> df_end(const T& G) {
223
1.74M
  return df_iterator<T>::end(G);
224
1.74M
}
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineFunction*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> > llvm::df_end<llvm::MachineFunction*>(llvm::MachineFunction* const&)
Line
Count
Source
222
118k
df_iterator<T> df_end(const T& G) {
223
118k
  return df_iterator<T>::end(G);
224
118k
}
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > llvm::df_end<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
222
14
df_iterator<T> df_end(const T& G) {
223
14
  return df_iterator<T>::end(G);
224
14
}
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > llvm::df_end<llvm::Loop const*>(llvm::Loop const* const&)
Line
Count
Source
222
1.75k
df_iterator<T> df_end(const T& G) {
223
1.75k
  return df_iterator<T>::end(G);
224
1.75k
}
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_end<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_end<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > llvm::df_end<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
222
205
df_iterator<T> df_end(const T& G) {
223
205
  return df_iterator<T>::end(G);
224
205
}
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > llvm::df_end<llvm::DominatorTree*>(llvm::DominatorTree* const&)
Line
Count
Source
222
77.2k
df_iterator<T> df_end(const T& G) {
223
77.2k
  return df_iterator<T>::end(G);
224
77.2k
}
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> > llvm::df_end<llvm::VPBlockBase*>(llvm::VPBlockBase* const&)
Line
Count
Source
222
57.8k
df_iterator<T> df_end(const T& G) {
223
57.8k
  return df_iterator<T>::end(G);
224
57.8k
}
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > llvm::df_end<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
225
226
// Provide an accessor method to use them in range-based patterns.
227
template <class T>
228
3.99M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
3.99M
  return make_range(df_begin(G), df_end(G));
230
3.99M
}
llvm::iterator_range<llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineDominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > > llvm::depth_first<llvm::MachineDominatorTree*>(llvm::MachineDominatorTree* const&)
Line
Count
Source
228
509k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
509k
  return make_range(df_begin(G), df_end(G));
230
509k
}
llvm::iterator_range<llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineLoop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > > llvm::depth_first<llvm::MachineLoop*>(llvm::MachineLoop* const&)
Line
Count
Source
228
104
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
104
  return make_range(df_begin(G), df_end(G));
230
104
}
llvm::iterator_range<llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineFunction*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> > > llvm::depth_first<llvm::MachineFunction*>(llvm::MachineFunction* const&)
Line
Count
Source
228
118k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
118k
  return make_range(df_begin(G), df_end(G));
230
118k
}
llvm::iterator_range<llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop*> > > llvm::depth_first<llvm::Loop*>(llvm::Loop* const&)
Line
Count
Source
228
268k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
268k
  return make_range(df_begin(G), df_end(G));
230
268k
}
llvm::iterator_range<llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> > > llvm::depth_first<llvm::DomTreeNodeBase<llvm::BasicBlock>*>(llvm::DomTreeNodeBase<llvm::BasicBlock>* const&)
Line
Count
Source
228
1.26M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
1.26M
  return make_range(df_begin(G), df_end(G));
230
1.26M
}
llvm::iterator_range<llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > > llvm::depth_first<llvm::Loop const*>(llvm::Loop const* const&)
Line
Count
Source
228
1.75k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
1.75k
  return make_range(df_begin(G), df_end(G));
230
1.75k
}
llvm::iterator_range<llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > > llvm::depth_first<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
228
205
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
205
  return make_range(df_begin(G), df_end(G));
230
205
}
llvm::iterator_range<llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > > llvm::depth_first<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
228
1.70M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
1.70M
  return make_range(df_begin(G), df_end(G));
230
1.70M
}
llvm::iterator_range<llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > > llvm::depth_first<llvm::DominatorTree*>(llvm::DominatorTree* const&)
Line
Count
Source
228
77.2k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
77.2k
  return make_range(df_begin(G), df_end(G));
230
77.2k
}
llvm::iterator_range<llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> > > llvm::depth_first<llvm::VPBlockBase*>(llvm::VPBlockBase* const&)
Line
Count
Source
228
57.8k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
57.8k
  return make_range(df_begin(G), df_end(G));
230
57.8k
}
Unexecuted instantiation: llvm::iterator_range<llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > > llvm::depth_first<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
231
232
// Provide global definitions of external depth first iterators...
233
template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
234
struct df_ext_iterator : public df_iterator<T, SetTy, true> {
235
  df_ext_iterator(const df_iterator<T, SetTy, true> &V)
236
7.72M
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&)
Line
Count
Source
236
3.76k
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&)
Line
Count
Source
236
9.26k
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&)
Line
Count
Source
236
957k
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> > const&)
Line
Count
Source
236
3.34M
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> > const&)
Line
Count
Source
236
1.47M
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >::df_ext_iterator(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> > const&)
Line
Count
Source
236
1.02M
    : df_iterator<T, SetTy, true>(V) {}
ADCE.cpp:llvm::df_ext_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState>::df_ext_iterator(llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> > const&)
Line
Count
Source
236
914k
    : df_iterator<T, SetTy, true>(V) {}
237
};
238
239
template <class T, class SetTy>
240
3.86M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
3.86M
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
3.86M
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > llvm::df_ext_begin<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
240
1.88k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
1.88k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
1.88k
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> > llvm::df_ext_begin<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
240
4.63k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
4.63k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
4.63k
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u> > llvm::df_ext_begin<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
240
478k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
478k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
478k
}
llvm::df_ext_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> > llvm::df_ext_begin<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> >(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
240
1.67M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
1.67M
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
1.67M
}
llvm::df_ext_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > llvm::df_ext_begin<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineFunction* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
240
739k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
739k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
739k
}
llvm::df_ext_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > llvm::df_ext_begin<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::Function* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
240
510k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
510k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
510k
}
ADCE.cpp:llvm::df_ext_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState> llvm::df_ext_begin<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState>(llvm::BasicBlock* const&, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
240
457k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
457k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
457k
}
243
244
template <class T, class SetTy>
245
3.86M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
3.86M
  return df_ext_iterator<T, SetTy>::end(G, S);
247
3.86M
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > llvm::df_ext_end<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
245
1.88k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
1.88k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
1.88k
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> > llvm::df_ext_end<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
245
4.63k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
4.63k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
4.63k
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u> > llvm::df_ext_end<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
245
478k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
478k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
478k
}
llvm::df_ext_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> > llvm::df_ext_end<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> >(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
245
1.67M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
1.67M
  return df_ext_iterator<T, SetTy>::end(G, S);
247
1.67M
}
llvm::df_ext_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > llvm::df_ext_end<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineFunction* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
245
739k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
739k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
739k
}
llvm::df_ext_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > llvm::df_ext_end<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::Function* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
245
510k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
510k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
510k
}
ADCE.cpp:llvm::df_ext_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState> llvm::df_ext_end<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState>(llvm::BasicBlock* const&, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
245
457k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
457k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
457k
}
248
249
template <class T, class SetTy>
250
iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G,
251
1.92M
                                                          SetTy &S) {
252
1.92M
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
1.92M
}
llvm::iterator_range<llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > > llvm::depth_first_ext<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
251
1.88k
                                                          SetTy &S) {
252
1.88k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
1.88k
}
llvm::iterator_range<llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u> > > llvm::depth_first_ext<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>&)
Line
Count
Source
251
478k
                                                          SetTy &S) {
252
478k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
478k
}
llvm::iterator_range<llvm::df_ext_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > > llvm::depth_first_ext<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::Function* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
251
510k
                                                          SetTy &S) {
252
510k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
510k
}
llvm::iterator_range<llvm::df_ext_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > > llvm::depth_first_ext<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineFunction* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
251
481k
                                                          SetTy &S) {
252
481k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
481k
}
ADCE.cpp:llvm::iterator_range<llvm::df_ext_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState> > llvm::depth_first_ext<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState>(llvm::BasicBlock* const&, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState&)
Line
Count
Source
251
457k
                                                          SetTy &S) {
252
457k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
457k
}
254
255
// Provide global definitions of inverse depth first iterators...
256
template <class T,
257
          class SetTy =
258
              df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
259
          bool External = false>
260
struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
261
  idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V)
262
2.23k
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
262
580
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
262
982
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
262
34
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > > const&)
Line
Count
Source
262
638
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
263
};
264
265
template <class T>
266
336
idf_iterator<T> idf_begin(const T& G) {
267
336
  return idf_iterator<T>::begin(Inverse<T>(G));
268
336
}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false> llvm::idf_begin<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
266
17
idf_iterator<T> idf_begin(const T& G) {
267
17
  return idf_iterator<T>::begin(Inverse<T>(G));
268
17
}
llvm::idf_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false> llvm::idf_begin<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
266
319
idf_iterator<T> idf_begin(const T& G) {
267
319
  return idf_iterator<T>::begin(Inverse<T>(G));
268
319
}
269
270
template <class T>
271
336
idf_iterator<T> idf_end(const T& G){
272
336
  return idf_iterator<T>::end(Inverse<T>(G));
273
336
}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false> llvm::idf_end<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
271
17
idf_iterator<T> idf_end(const T& G){
272
17
  return idf_iterator<T>::end(Inverse<T>(G));
273
17
}
llvm::idf_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false> llvm::idf_end<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
271
319
idf_iterator<T> idf_end(const T& G){
272
319
  return idf_iterator<T>::end(Inverse<T>(G));
273
319
}
274
275
// Provide an accessor method to use them in range-based patterns.
276
template <class T>
277
iterator_range<idf_iterator<T>> inverse_depth_first(const T& G) {
278
  return make_range(idf_begin(G), idf_end(G));
279
}
280
281
// Provide global definitions of external inverse depth first iterators...
282
template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
283
struct idf_ext_iterator : public idf_iterator<T, SetTy, true> {
284
  idf_ext_iterator(const idf_iterator<T, SetTy, true> &V)
285
    : idf_iterator<T, SetTy, true>(V) {}
286
  idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V)
287
1.56k
    : idf_iterator<T, SetTy, true>(V) {}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >::idf_ext_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
287
580
    : idf_iterator<T, SetTy, true>(V) {}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >::idf_ext_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
287
982
    : idf_iterator<T, SetTy, true>(V) {}
288
};
289
290
template <class T, class SetTy>
291
781
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
781
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
781
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > llvm::idf_ext_begin<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
291
290
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
290
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
290
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> > llvm::idf_ext_begin<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
291
491
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
491
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
491
}
294
295
template <class T, class SetTy>
296
781
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
781
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
781
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > llvm::idf_ext_end<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
296
290
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
290
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
290
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> > llvm::idf_ext_end<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
296
491
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
491
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
491
}
299
300
template <class T, class SetTy>
301
iterator_range<idf_ext_iterator<T, SetTy>> inverse_depth_first_ext(const T& G,
302
781
                                                                   SetTy &S) {
303
781
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
781
}
llvm::iterator_range<llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > > llvm::inverse_depth_first_ext<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
302
290
                                                                   SetTy &S) {
303
290
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
290
}
llvm::iterator_range<llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> > > llvm::inverse_depth_first_ext<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
302
491
                                                                   SetTy &S) {
303
491
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
491
}
305
306
} // end namespace llvm
307
308
#endif // LLVM_ADT_DEPTHFIRSTITERATOR_H