Coverage Report

Created: 2017-10-03 07:32

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/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.66M
  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
1.03M
  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
770
  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.23M
  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
2.30M
  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
1.18M
  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
7.79k
  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.89M
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
60
21.5M
  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.08k
  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
4.12M
  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.92M
  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
2.30M
  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
4.75M
  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
7.79k
  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
5.47M
  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
68.0M
  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
82.9k
  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*)
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::insert(llvm::Loop const*)
Line
Count
Source
74
1.56k
  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
33.3M
  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
11.0k
  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); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::insert(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::insert(llvm::MachineRegionNode*)
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::insert(llvm::MachineLoop*)
Line
Count
Source
74
122
  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
995k
  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
7.11M
  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.34k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::insert(llvm::MachineBasicBlock const*)
Line
Count
Source
74
1.57M
  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
5.80M
  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.1k
  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
14.9M
  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
3.98k
  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
4.10M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
75
  template <typename IterT>
76
  void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); }
77
78
50.4M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
22.2M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::completed(llvm::MachineLoop*)
Line
Count
Source
78
122
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop*, 8u>::completed(llvm::Loop*)
Line
Count
Source
78
995k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
78
7.11M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
10.3M
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>::completed(llvm::VPBlockBase const*)
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::completed(llvm::VPBlockBase*)
Line
Count
Source
78
82.7k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
594
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::completed(llvm::MachineRegionNode*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::completed(llvm::MachineRegionNode const*)
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::completed(llvm::MachineBasicBlock const*)
Line
Count
Source
78
1.44M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
4.09M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
6.67k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::completed(llvm::Loop const*)
Line
Count
Source
78
1.56k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::RegionNode*, 8u>::completed(llvm::RegionNode*)
Line
Count
Source
78
9.26k
  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::BasicBlock const*, 8u>::completed(llvm::BasicBlock const*)
Line
Count
Source
78
1.44k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
78
4.10M
  void completed(NodeRef) {}
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.67M
  inline df_iterator(NodeRef Node) {
103
4.67M
    this->Visited.insert(Node);
104
4.67M
    VisitStack.push_back(StackElement(Node, None));
105
4.67M
  }
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*)
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
197
  inline df_iterator(NodeRef Node) {
103
197
    this->Visited.insert(Node);
104
197
    VisitStack.push_back(StackElement(Node, None));
105
197
  }
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
79.4k
  inline df_iterator(NodeRef Node) {
103
79.4k
    this->Visited.insert(Node);
104
79.4k
    VisitStack.push_back(StackElement(Node, None));
105
79.4k
  }
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
60.1k
  inline df_iterator(NodeRef Node) {
103
60.1k
    this->Visited.insert(Node);
104
60.1k
    VisitStack.push_back(StackElement(Node, None));
105
60.1k
  }
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
318
  inline df_iterator(NodeRef Node) {
103
318
    this->Visited.insert(Node);
104
318
    VisitStack.push_back(StackElement(Node, None));
105
318
  }
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*)
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::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator(llvm::MachineRegionNode*)
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.51k
  inline df_iterator(NodeRef Node) {
103
1.51k
    this->Visited.insert(Node);
104
1.51k
    VisitStack.push_back(StackElement(Node, None));
105
1.51k
  }
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::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
912k
  inline df_iterator(NodeRef Node) {
103
912k
    this->Visited.insert(Node);
104
912k
    VisitStack.push_back(StackElement(Node, None));
105
912k
  }
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
705k
  inline df_iterator(NodeRef Node) {
103
705k
    this->Visited.insert(Node);
104
705k
    VisitStack.push_back(StackElement(Node, None));
105
705k
  }
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
110
  inline df_iterator(NodeRef Node) {
103
110
    this->Visited.insert(Node);
104
110
    VisitStack.push_back(StackElement(Node, None));
105
110
  }
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
2.11M
  inline df_iterator(NodeRef Node) {
103
2.11M
    this->Visited.insert(Node);
104
2.11M
    VisitStack.push_back(StackElement(Node, None));
105
2.11M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*)
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::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::df_iterator(llvm::MachineBasicBlock*)
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::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::df_iterator(llvm::MachineBasicBlock*)
Line
Count
Source
102
121k
  inline df_iterator(NodeRef Node) {
103
121k
    this->Visited.insert(Node);
104
121k
    VisitStack.push_back(StackElement(Node, None));
105
121k
  }
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
672k
  inline df_iterator(NodeRef Node) {
103
672k
    this->Visited.insert(Node);
104
672k
    VisitStack.push_back(StackElement(Node, None));
105
672k
  }
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
3.09k
  inline df_iterator(NodeRef Node) {
103
3.09k
    this->Visited.insert(Node);
104
3.09k
    VisitStack.push_back(StackElement(Node, None));
105
3.09k
  }
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
782
  inline df_iterator(NodeRef Node) {
103
782
    this->Visited.insert(Node);
104
782
    VisitStack.push_back(StackElement(Node, None));
105
782
  }
106
107
4.67M
  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
912k
  inline df_iterator() = default; // End is when stack is empty
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::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::df_iterator()
Line
Count
Source
107
705k
  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
110
  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
2.11M
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator()
Line
Count
Source
107
17
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::df_iterator()
Line
Count
Source
107
17
  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
121k
  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
672k
  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()
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::df_iterator()
Line
Count
Source
107
79.4k
  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
60.1k
  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
318
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator()
Line
Count
Source
107
197
  inline df_iterator() = default; // End is when stack is empty
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::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::df_iterator()
Line
Count
Source
107
3.09k
  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()
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.51k
  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::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::df_iterator()
Line
Count
Source
107
782
  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
108
109
  inline df_iterator(NodeRef Node, SetType &S)
110
3.83M
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
3.83M
    if (this->Visited.insert(Node).second)
112
3.83M
      VisitStack.push_back(StackElement(Node, None));
113
3.83M
  }
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
385
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
385
    if (this->Visited.insert(Node).second)
112
251
      VisitStack.push_back(StackElement(Node, None));
113
385
  }
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
3.89k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
3.89k
    if (this->Visited.insert(Node).second)
112
3.76k
      VisitStack.push_back(StackElement(Node, None));
113
3.89k
  }
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
594k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
594k
    if (this->Visited.insert(Node).second)
112
594k
      VisitStack.push_back(StackElement(Node, None));
113
594k
  }
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.15M
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
1.15M
    if (this->Visited.insert(Node).second)
112
1.15M
      VisitStack.push_back(StackElement(Node, None));
113
1.15M
  }
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
516k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
516k
    if (this->Visited.insert(Node).second)
112
516k
      VisitStack.push_back(StackElement(Node, None));
113
516k
  }
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
947k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
947k
    if (this->Visited.insert(Node).second)
112
947k
      VisitStack.push_back(StackElement(Node, None));
113
947k
  }
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
289
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
289
    if (this->Visited.insert(Node).second)
112
289
      VisitStack.push_back(StackElement(Node, None));
113
289
  }
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
614k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
614k
    if (this->Visited.insert(Node).second)
112
614k
      VisitStack.push_back(StackElement(Node, None));
113
614k
  }
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.18k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
1.18k
    if (this->Visited.insert(Node).second)
112
1.18k
      VisitStack.push_back(StackElement(Node, None));
113
1.18k
  }
114
115
  inline df_iterator(SetType &S)
116
3.83M
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
3.83M
    // End is when stack is empty
118
3.83M
  }
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
516k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
516k
    // End is when stack is empty
118
516k
  }
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.18k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
1.18k
    // End is when stack is empty
118
1.18k
  }
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
3.89k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
3.89k
    // End is when stack is empty
118
3.89k
  }
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
594k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
594k
    // End is when stack is empty
118
594k
  }
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.15M
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
1.15M
    // End is when stack is empty
118
1.15M
  }
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
947k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
947k
    // End is when stack is empty
118
947k
  }
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
289
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
289
    // End is when stack is empty
118
289
  }
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
614k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
614k
    // End is when stack is empty
118
614k
  }
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
385
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
385
    // End is when stack is empty
118
385
  }
119
120
54.3M
  inline void toNext() {
121
100M
    do {
122
100M
      NodeRef Node = VisitStack.back().first;
123
100M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
100M
125
100M
      if (!Opt)
126
54.3M
        Opt.emplace(GT::child_begin(Node));
127
100M
128
100M
      // Notice that we directly mutate *Opt here, so that
129
100M
      // VisitStack.back().second actually gets updated as the iterator
130
100M
      // increases.
131
119M
      while (
*Opt != GT::child_end(Node)119M
) {
132
65.3M
        NodeRef Next = *(*Opt)++;
133
65.3M
        // Has our next sibling been visited?
134
65.3M
        if (
this->Visited.insert(Next).second65.3M
) {
135
45.8M
          // No, do it now.
136
45.8M
          VisitStack.push_back(StackElement(Next, None));
137
45.8M
          return;
138
45.8M
        }
139
65.3M
      }
140
54.3M
      this->Visited.completed(Node);
141
54.3M
142
54.3M
      // Oops, ran out of successors... go up a level on the stack.
143
54.3M
      VisitStack.pop_back();
144
54.3M
    } while (!VisitStack.empty());
145
54.3M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
7.52k
  inline void toNext() {
121
13.5k
    do {
122
13.5k
      NodeRef Node = VisitStack.back().first;
123
13.5k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
13.5k
125
13.5k
      if (!Opt)
126
6.67k
        Opt.emplace(GT::child_begin(Node));
127
13.5k
128
13.5k
      // Notice that we directly mutate *Opt here, so that
129
13.5k
      // VisitStack.back().second actually gets updated as the iterator
130
13.5k
      // increases.
131
16.9k
      while (
*Opt != GT::child_end(Node)16.9k
) {
132
10.3k
        NodeRef Next = *(*Opt)++;
133
10.3k
        // Has our next sibling been visited?
134
10.3k
        if (
this->Visited.insert(Next).second10.3k
) {
135
6.91k
          // No, do it now.
136
6.91k
          VisitStack.push_back(StackElement(Next, None));
137
6.91k
          return;
138
6.91k
        }
139
10.3k
      }
140
6.67k
      this->Visited.completed(Node);
141
6.67k
142
6.67k
      // Oops, ran out of successors... go up a level on the stack.
143
6.67k
      VisitStack.pop_back();
144
7.52k
    } while (!VisitStack.empty());
145
7.52k
  }
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.56k
  inline void toNext() {
121
1.60k
    do {
122
1.60k
      NodeRef Node = VisitStack.back().first;
123
1.60k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.60k
125
1.60k
      if (!Opt)
126
1.56k
        Opt.emplace(GT::child_begin(Node));
127
1.60k
128
1.60k
      // Notice that we directly mutate *Opt here, so that
129
1.60k
      // VisitStack.back().second actually gets updated as the iterator
130
1.60k
      // increases.
131
1.60k
      while (
*Opt != GT::child_end(Node)1.60k
) {
132
45
        NodeRef Next = *(*Opt)++;
133
45
        // Has our next sibling been visited?
134
45
        if (
this->Visited.insert(Next).second45
) {
135
45
          // No, do it now.
136
45
          VisitStack.push_back(StackElement(Next, None));
137
45
          return;
138
45
        }
139
45
      }
140
1.56k
      this->Visited.completed(Node);
141
1.56k
142
1.56k
      // Oops, ran out of successors... go up a level on the stack.
143
1.56k
      VisitStack.pop_back();
144
1.56k
    } while (!VisitStack.empty());
145
1.56k
  }
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)19
) {
132
10
        NodeRef Next = *(*Opt)++;
133
10
        // Has our next sibling been visited?
134
10
        if (
this->Visited.insert(Next).second10
) {
135
8
          // No, do it now.
136
8
          VisitStack.push_back(StackElement(Next, None));
137
8
          return;
138
8
        }
139
10
      }
140
9
      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::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::toNext()
Line
Count
Source
120
9.25k
  inline void toNext() {
121
15.4k
    do {
122
15.4k
      NodeRef Node = VisitStack.back().first;
123
15.4k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
15.4k
125
15.4k
      if (!Opt)
126
9.25k
        Opt.emplace(GT::child_begin(Node));
127
15.4k
128
15.4k
      // Notice that we directly mutate *Opt here, so that
129
15.4k
      // VisitStack.back().second actually gets updated as the iterator
130
15.4k
      // increases.
131
17.1k
      while (
*Opt != GT::child_end(Node)17.1k
) {
132
7.93k
        NodeRef Next = *(*Opt)++;
133
7.93k
        // Has our next sibling been visited?
134
7.93k
        if (
this->Visited.insert(Next).second7.93k
) {
135
6.16k
          // No, do it now.
136
6.16k
          VisitStack.push_back(StackElement(Next, None));
137
6.16k
          return;
138
6.16k
        }
139
7.93k
      }
140
9.25k
      this->Visited.completed(Node);
141
9.25k
142
9.25k
      // Oops, ran out of successors... go up a level on the stack.
143
9.25k
      VisitStack.pop_back();
144
9.25k
    } while (!VisitStack.empty());
145
9.25k
  }
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)12
) {
132
4
        NodeRef Next = *(*Opt)++;
133
4
        // Has our next sibling been visited?
134
4
        if (
this->Visited.insert(Next).second4
) {
135
4
          // No, do it now.
136
4
          VisitStack.push_back(StackElement(Next, None));
137
4
          return;
138
4
        }
139
4
      }
140
8
      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::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::toNext()
Line
Count
Source
120
1.16k
  inline void toNext() {
121
1.84k
    do {
122
1.84k
      NodeRef Node = VisitStack.back().first;
123
1.84k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.84k
125
1.84k
      if (!Opt)
126
1.16k
        Opt.emplace(GT::child_begin(Node));
127
1.84k
128
1.84k
      // Notice that we directly mutate *Opt here, so that
129
1.84k
      // VisitStack.back().second actually gets updated as the iterator
130
1.84k
      // increases.
131
2.92k
      while (
*Opt != GT::child_end(Node)2.92k
) {
132
1.78k
        NodeRef Next = *(*Opt)++;
133
1.78k
        // Has our next sibling been visited?
134
1.78k
        if (
this->Visited.insert(Next).second1.78k
) {
135
703
          // No, do it now.
136
703
          VisitStack.push_back(StackElement(Next, None));
137
703
          return;
138
703
        }
139
1.78k
      }
140
1.14k
      this->Visited.completed(Node);
141
1.14k
142
1.14k
      // Oops, ran out of successors... go up a level on the stack.
143
1.14k
      VisitStack.pop_back();
144
1.16k
    } while (!VisitStack.empty());
145
1.16k
  }
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
4.03M
  inline void toNext() {
121
7.39M
    do {
122
7.39M
      NodeRef Node = VisitStack.back().first;
123
7.39M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.39M
125
7.39M
      if (!Opt)
126
4.03M
        Opt.emplace(GT::child_begin(Node));
127
7.39M
128
7.39M
      // Notice that we directly mutate *Opt here, so that
129
7.39M
      // VisitStack.back().second actually gets updated as the iterator
130
7.39M
      // increases.
131
7.39M
      while (
*Opt != GT::child_end(Node)7.39M
) {
132
3.36M
        NodeRef Next = *(*Opt)++;
133
3.36M
        // Has our next sibling been visited?
134
3.36M
        if (
this->Visited.insert(Next).second3.36M
) {
135
3.36M
          // No, do it now.
136
3.36M
          VisitStack.push_back(StackElement(Next, None));
137
3.36M
          return;
138
3.36M
        }
139
3.36M
      }
140
4.03M
      this->Visited.completed(Node);
141
4.03M
142
4.03M
      // Oops, ran out of successors... go up a level on the stack.
143
4.03M
      VisitStack.pop_back();
144
4.03M
    } while (!VisitStack.empty());
145
4.03M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
5.14k
  inline void toNext() {
121
9.11k
    do {
122
9.11k
      NodeRef Node = VisitStack.back().first;
123
9.11k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
9.11k
125
9.11k
      if (!Opt)
126
5.14k
        Opt.emplace(GT::child_begin(Node));
127
9.11k
128
9.11k
      // Notice that we directly mutate *Opt here, so that
129
9.11k
      // VisitStack.back().second actually gets updated as the iterator
130
9.11k
      // increases.
131
10.9k
      while (
*Opt != GT::child_end(Node)10.9k
) {
132
5.80k
        NodeRef Next = *(*Opt)++;
133
5.80k
        // Has our next sibling been visited?
134
5.80k
        if (
this->Visited.insert(Next).second5.80k
) {
135
3.96k
          // No, do it now.
136
3.96k
          VisitStack.push_back(StackElement(Next, None));
137
3.96k
          return;
138
3.96k
        }
139
5.80k
      }
140
5.14k
      this->Visited.completed(Node);
141
5.14k
142
5.14k
      // Oops, ran out of successors... go up a level on the stack.
143
5.14k
      VisitStack.pop_back();
144
5.14k
    } while (!VisitStack.empty());
145
5.14k
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
2.45M
  inline void toNext() {
121
4.78M
    do {
122
4.78M
      NodeRef Node = VisitStack.back().first;
123
4.78M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
4.78M
125
4.78M
      if (!Opt)
126
2.45M
        Opt.emplace(GT::child_begin(Node));
127
4.78M
128
4.78M
      // Notice that we directly mutate *Opt here, so that
129
4.78M
      // VisitStack.back().second actually gets updated as the iterator
130
4.78M
      // increases.
131
6.19M
      while (
*Opt != GT::child_end(Node)6.19M
) {
132
3.74M
        NodeRef Next = *(*Opt)++;
133
3.74M
        // Has our next sibling been visited?
134
3.74M
        if (
this->Visited.insert(Next).second3.74M
) {
135
2.33M
          // No, do it now.
136
2.33M
          VisitStack.push_back(StackElement(Next, None));
137
2.33M
          return;
138
2.33M
        }
139
3.74M
      }
140
2.45M
      this->Visited.completed(Node);
141
2.45M
142
2.45M
      // Oops, ran out of successors... go up a level on the stack.
143
2.45M
      VisitStack.pop_back();
144
2.45M
    } while (!VisitStack.empty());
145
2.45M
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::toNext()
Line
Count
Source
120
24
  inline void toNext() {
121
31
    do {
122
31
      NodeRef Node = VisitStack.back().first;
123
31
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
31
125
31
      if (!Opt)
126
24
        Opt.emplace(GT::child_begin(Node));
127
31
128
31
      // Notice that we directly mutate *Opt here, so that
129
31
      // VisitStack.back().second actually gets updated as the iterator
130
31
      // increases.
131
31
      while (
*Opt != GT::child_end(Node)31
) {
132
7
        NodeRef Next = *(*Opt)++;
133
7
        // Has our next sibling been visited?
134
7
        if (
this->Visited.insert(Next).second7
) {
135
7
          // No, do it now.
136
7
          VisitStack.push_back(StackElement(Next, None));
137
7
          return;
138
7
        }
139
7
      }
140
24
      this->Visited.completed(Node);
141
24
142
24
      // Oops, ran out of successors... go up a level on the stack.
143
24
      VisitStack.pop_back();
144
24
    } while (!VisitStack.empty());
145
24
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
28
  inline void toNext() {
121
39
    do {
122
39
      NodeRef Node = VisitStack.back().first;
123
39
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
39
125
39
      if (!Opt)
126
28
        Opt.emplace(GT::child_begin(Node));
127
39
128
39
      // Notice that we directly mutate *Opt here, so that
129
39
      // VisitStack.back().second actually gets updated as the iterator
130
39
      // increases.
131
41
      while (
*Opt != GT::child_end(Node)41
) {
132
13
        NodeRef Next = *(*Opt)++;
133
13
        // Has our next sibling been visited?
134
13
        if (
this->Visited.insert(Next).second13
) {
135
11
          // No, do it now.
136
11
          VisitStack.push_back(StackElement(Next, None));
137
11
          return;
138
11
        }
139
13
      }
140
28
      this->Visited.completed(Node);
141
28
142
28
      // Oops, ran out of successors... go up a level on the stack.
143
28
      VisitStack.pop_back();
144
28
    } while (!VisitStack.empty());
145
28
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
18.2M
  inline void toNext() {
121
34.3M
    do {
122
34.3M
      NodeRef Node = VisitStack.back().first;
123
34.3M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
34.3M
125
34.3M
      if (!Opt)
126
18.2M
        Opt.emplace(GT::child_begin(Node));
127
34.3M
128
34.3M
      // Notice that we directly mutate *Opt here, so that
129
34.3M
      // VisitStack.back().second actually gets updated as the iterator
130
34.3M
      // increases.
131
43.5M
      while (
*Opt != GT::child_end(Node)43.5M
) {
132
25.3M
        NodeRef Next = *(*Opt)++;
133
25.3M
        // Has our next sibling been visited?
134
25.3M
        if (
this->Visited.insert(Next).second25.3M
) {
135
16.1M
          // No, do it now.
136
16.1M
          VisitStack.push_back(StackElement(Next, None));
137
16.1M
          return;
138
16.1M
        }
139
25.3M
      }
140
18.2M
      this->Visited.completed(Node);
141
18.2M
142
18.2M
      // Oops, ran out of successors... go up a level on the stack.
143
18.2M
      VisitStack.pop_back();
144
18.2M
    } while (!VisitStack.empty());
145
18.2M
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::toNext()
Line
Count
Source
120
122
  inline void toNext() {
121
134
    do {
122
134
      NodeRef Node = VisitStack.back().first;
123
134
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
134
125
134
      if (!Opt)
126
122
        Opt.emplace(GT::child_begin(Node));
127
134
128
134
      // Notice that we directly mutate *Opt here, so that
129
134
      // VisitStack.back().second actually gets updated as the iterator
130
134
      // increases.
131
134
      while (
*Opt != GT::child_end(Node)134
) {
132
12
        NodeRef Next = *(*Opt)++;
133
12
        // Has our next sibling been visited?
134
12
        if (
this->Visited.insert(Next).second12
) {
135
12
          // No, do it now.
136
12
          VisitStack.push_back(StackElement(Next, None));
137
12
          return;
138
12
        }
139
12
      }
140
122
      this->Visited.completed(Node);
141
122
142
122
      // Oops, ran out of successors... go up a level on the stack.
143
122
      VisitStack.pop_back();
144
122
    } while (!VisitStack.empty());
145
122
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::toNext()
Line
Count
Source
120
995k
  inline void toNext() {
121
1.28M
    do {
122
1.28M
      NodeRef Node = VisitStack.back().first;
123
1.28M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.28M
125
1.28M
      if (!Opt)
126
995k
        Opt.emplace(GT::child_begin(Node));
127
1.28M
128
1.28M
      // Notice that we directly mutate *Opt here, so that
129
1.28M
      // VisitStack.back().second actually gets updated as the iterator
130
1.28M
      // increases.
131
1.28M
      while (
*Opt != GT::child_end(Node)1.28M
) {
132
289k
        NodeRef Next = *(*Opt)++;
133
289k
        // Has our next sibling been visited?
134
289k
        if (
this->Visited.insert(Next).second289k
) {
135
289k
          // No, do it now.
136
289k
          VisitStack.push_back(StackElement(Next, None));
137
289k
          return;
138
289k
        }
139
289k
      }
140
995k
      this->Visited.completed(Node);
141
995k
142
995k
      // Oops, ran out of successors... go up a level on the stack.
143
995k
      VisitStack.pop_back();
144
995k
    } while (!VisitStack.empty());
145
995k
  }
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
7.11M
  inline void toNext() {
121
13.3M
    do {
122
13.3M
      NodeRef Node = VisitStack.back().first;
123
13.3M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
13.3M
125
13.3M
      if (!Opt)
126
7.11M
        Opt.emplace(GT::child_begin(Node));
127
13.3M
128
13.3M
      // Notice that we directly mutate *Opt here, so that
129
13.3M
      // VisitStack.back().second actually gets updated as the iterator
130
13.3M
      // increases.
131
13.3M
      while (
*Opt != GT::child_end(Node)13.3M
) {
132
6.20M
        NodeRef Next = *(*Opt)++;
133
6.20M
        // Has our next sibling been visited?
134
6.20M
        if (
this->Visited.insert(Next).second6.20M
) {
135
6.20M
          // No, do it now.
136
6.20M
          VisitStack.push_back(StackElement(Next, None));
137
6.20M
          return;
138
6.20M
        }
139
6.20M
      }
140
7.11M
      this->Visited.completed(Node);
141
7.11M
142
7.11M
      // Oops, ran out of successors... go up a level on the stack.
143
7.11M
      VisitStack.pop_back();
144
7.11M
    } while (!VisitStack.empty());
145
7.11M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
120
4.00M
  inline void toNext() {
121
7.39M
    do {
122
7.39M
      NodeRef Node = VisitStack.back().first;
123
7.39M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.39M
125
7.39M
      if (!Opt)
126
4.00M
        Opt.emplace(GT::child_begin(Node));
127
7.39M
128
7.39M
      // Notice that we directly mutate *Opt here, so that
129
7.39M
      // VisitStack.back().second actually gets updated as the iterator
130
7.39M
      // increases.
131
9.26M
      while (
*Opt != GT::child_end(Node)9.26M
) {
132
5.25M
        NodeRef Next = *(*Opt)++;
133
5.25M
        // Has our next sibling been visited?
134
5.25M
        if (
this->Visited.insert(Next).second5.25M
) {
135
3.38M
          // No, do it now.
136
3.38M
          VisitStack.push_back(StackElement(Next, None));
137
3.38M
          return;
138
3.38M
        }
139
5.25M
      }
140
4.00M
      this->Visited.completed(Node);
141
4.00M
142
4.00M
      // Oops, ran out of successors... go up a level on the stack.
143
4.00M
      VisitStack.pop_back();
144
4.00M
    } while (!VisitStack.empty());
145
4.00M
  }
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
844
  inline void toNext() {
121
1.29k
    do {
122
1.29k
      NodeRef Node = VisitStack.back().first;
123
1.29k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.29k
125
1.29k
      if (!Opt)
126
844
        Opt.emplace(GT::child_begin(Node));
127
1.29k
128
1.29k
      // Notice that we directly mutate *Opt here, so that
129
1.29k
      // VisitStack.back().second actually gets updated as the iterator
130
1.29k
      // increases.
131
1.55k
      while (
*Opt != GT::child_end(Node)1.55k
) {
132
964
        NodeRef Next = *(*Opt)++;
133
964
        // Has our next sibling been visited?
134
964
        if (
this->Visited.insert(Next).second964
) {
135
698
          // No, do it now.
136
698
          VisitStack.push_back(StackElement(Next, None));
137
698
          return;
138
698
        }
139
964
      }
140
594
      this->Visited.completed(Node);
141
594
142
594
      // Oops, ran out of successors... go up a level on the stack.
143
594
      VisitStack.pop_back();
144
844
    } while (!VisitStack.empty());
145
844
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
3.91M
  inline void toNext() {
121
7.31M
    do {
122
7.31M
      NodeRef Node = VisitStack.back().first;
123
7.31M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.31M
125
7.31M
      if (!Opt)
126
3.91M
        Opt.emplace(GT::child_begin(Node));
127
7.31M
128
7.31M
      // Notice that we directly mutate *Opt here, so that
129
7.31M
      // VisitStack.back().second actually gets updated as the iterator
130
7.31M
      // increases.
131
9.20M
      while (
*Opt != GT::child_end(Node)9.20M
) {
132
5.28M
        NodeRef Next = *(*Opt)++;
133
5.28M
        // Has our next sibling been visited?
134
5.28M
        if (
this->Visited.insert(Next).second5.28M
) {
135
3.40M
          // No, do it now.
136
3.40M
          VisitStack.push_back(StackElement(Next, None));
137
3.40M
          return;
138
3.40M
        }
139
5.28M
      }
140
3.91M
      this->Visited.completed(Node);
141
3.91M
142
3.91M
      // Oops, ran out of successors... go up a level on the stack.
143
3.91M
      VisitStack.pop_back();
144
3.91M
    } while (!VisitStack.empty());
145
3.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
588
  inline void toNext() {
121
602
    do {
122
602
      NodeRef Node = VisitStack.back().first;
123
602
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
602
125
602
      if (!Opt)
126
303
        Opt.emplace(GT::child_begin(Node));
127
602
128
602
      // Notice that we directly mutate *Opt here, so that
129
602
      // VisitStack.back().second actually gets updated as the iterator
130
602
      // increases.
131
620
      while (
*Opt != GT::child_end(Node)620
) {
132
321
        NodeRef Next = *(*Opt)++;
133
321
        // Has our next sibling been visited?
134
321
        if (
this->Visited.insert(Next).second321
) {
135
303
          // No, do it now.
136
303
          VisitStack.push_back(StackElement(Next, None));
137
303
          return;
138
303
        }
139
321
      }
140
299
      this->Visited.completed(Node);
141
299
142
299
      // Oops, ran out of successors... go up a level on the stack.
143
299
      VisitStack.pop_back();
144
588
    } while (!VisitStack.empty());
145
588
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
4.09M
  inline void toNext() {
121
7.59M
    do {
122
7.59M
      NodeRef Node = VisitStack.back().first;
123
7.59M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.59M
125
7.59M
      if (!Opt)
126
4.09M
        Opt.emplace(GT::child_begin(Node));
127
7.59M
128
7.59M
      // Notice that we directly mutate *Opt here, so that
129
7.59M
      // VisitStack.back().second actually gets updated as the iterator
130
7.59M
      // increases.
131
9.30M
      while (
*Opt != GT::child_end(Node)9.30M
) {
132
5.20M
        NodeRef Next = *(*Opt)++;
133
5.20M
        // Has our next sibling been visited?
134
5.20M
        if (
this->Visited.insert(Next).second5.20M
) {
135
3.50M
          // No, do it now.
136
3.50M
          VisitStack.push_back(StackElement(Next, None));
137
3.50M
          return;
138
3.50M
        }
139
5.20M
      }
140
4.09M
      this->Visited.completed(Node);
141
4.09M
142
4.09M
      // Oops, ran out of successors... go up a level on the stack.
143
4.09M
      VisitStack.pop_back();
144
4.09M
    } while (!VisitStack.empty());
145
4.09M
  }
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
1.44M
  inline void toNext() {
121
1.74M
    do {
122
1.74M
      NodeRef Node = VisitStack.back().first;
123
1.74M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.74M
125
1.74M
      if (!Opt)
126
1.44M
        Opt.emplace(GT::child_begin(Node));
127
1.74M
128
1.74M
      // Notice that we directly mutate *Opt here, so that
129
1.74M
      // VisitStack.back().second actually gets updated as the iterator
130
1.74M
      // increases.
131
1.86M
      while (
*Opt != GT::child_end(Node)1.86M
) {
132
417k
        NodeRef Next = *(*Opt)++;
133
417k
        // Has our next sibling been visited?
134
417k
        if (
this->Visited.insert(Next).second417k
) {
135
293k
          // No, do it now.
136
293k
          VisitStack.push_back(StackElement(Next, None));
137
293k
          return;
138
293k
        }
139
417k
      }
140
1.44M
      this->Visited.completed(Node);
141
1.44M
142
1.44M
      // Oops, ran out of successors... go up a level on the stack.
143
1.44M
      VisitStack.pop_back();
144
1.44M
    } while (!VisitStack.empty());
145
1.44M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
7.84M
  inline void toNext() {
121
14.7M
    do {
122
14.7M
      NodeRef Node = VisitStack.back().first;
123
14.7M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
14.7M
125
14.7M
      if (!Opt)
126
7.84M
        Opt.emplace(GT::child_begin(Node));
127
14.7M
128
14.7M
      // Notice that we directly mutate *Opt here, so that
129
14.7M
      // VisitStack.back().second actually gets updated as the iterator
130
14.7M
      // increases.
131
18.0M
      while (
*Opt != GT::child_end(Node)18.0M
) {
132
10.1M
        NodeRef Next = *(*Opt)++;
133
10.1M
        // Has our next sibling been visited?
134
10.1M
        if (
this->Visited.insert(Next).second10.1M
) {
135
6.89M
          // No, do it now.
136
6.89M
          VisitStack.push_back(StackElement(Next, None));
137
6.89M
          return;
138
6.89M
        }
139
10.1M
      }
140
7.84M
      this->Visited.completed(Node);
141
7.84M
142
7.84M
      // Oops, ran out of successors... go up a level on the stack.
143
7.84M
      VisitStack.pop_back();
144
7.84M
    } while (!VisitStack.empty());
145
7.84M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
120
389
  inline void toNext() {
121
581
    do {
122
581
      NodeRef Node = VisitStack.back().first;
123
581
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
581
125
581
      if (!Opt)
126
389
        Opt.emplace(GT::child_begin(Node));
127
581
128
581
      // Notice that we directly mutate *Opt here, so that
129
581
      // VisitStack.back().second actually gets updated as the iterator
130
581
      // increases.
131
625
      while (
*Opt != GT::child_end(Node)625
) {
132
236
        NodeRef Next = *(*Opt)++;
133
236
        // Has our next sibling been visited?
134
236
        if (
this->Visited.insert(Next).second236
) {
135
192
          // No, do it now.
136
192
          VisitStack.push_back(StackElement(Next, None));
137
192
          return;
138
192
        }
139
236
      }
140
389
      this->Visited.completed(Node);
141
389
142
389
      // Oops, ran out of successors... go up a level on the stack.
143
389
      VisitStack.pop_back();
144
389
    } while (!VisitStack.empty());
145
389
  }
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.71k
  inline void toNext() {
121
7.14k
    do {
122
7.14k
      NodeRef Node = VisitStack.back().first;
123
7.14k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.14k
125
7.14k
      if (!Opt)
126
3.71k
        Opt.emplace(GT::child_begin(Node));
127
7.14k
128
7.14k
      // Notice that we directly mutate *Opt here, so that
129
7.14k
      // VisitStack.back().second actually gets updated as the iterator
130
7.14k
      // increases.
131
7.32k
      while (
*Opt != GT::child_end(Node)7.32k
) {
132
3.60k
        NodeRef Next = *(*Opt)++;
133
3.60k
        // Has our next sibling been visited?
134
3.60k
        if (
this->Visited.insert(Next).second3.60k
) {
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.60k
      }
140
3.71k
      this->Visited.completed(Node);
141
3.71k
142
3.71k
      // Oops, ran out of successors... go up a level on the stack.
143
3.71k
      VisitStack.pop_back();
144
3.71k
    } while (!VisitStack.empty());
145
3.71k
  }
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
69.3k
  inline void toNext() {
121
78.5k
    do {
122
78.5k
      NodeRef Node = VisitStack.back().first;
123
78.5k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
78.5k
125
78.5k
      if (!Opt)
126
69.3k
        Opt.emplace(GT::child_begin(Node));
127
78.5k
128
78.5k
      // Notice that we directly mutate *Opt here, so that
129
78.5k
      // VisitStack.back().second actually gets updated as the iterator
130
78.5k
      // increases.
131
78.5k
      while (
*Opt != GT::child_end(Node)78.5k
) {
132
9.22k
        NodeRef Next = *(*Opt)++;
133
9.22k
        // Has our next sibling been visited?
134
9.22k
        if (
this->Visited.insert(Next).second9.22k
) {
135
9.22k
          // No, do it now.
136
9.22k
          VisitStack.push_back(StackElement(Next, None));
137
9.22k
          return;
138
9.22k
        }
139
9.22k
      }
140
69.3k
      this->Visited.completed(Node);
141
69.3k
142
69.3k
      // Oops, ran out of successors... go up a level on the stack.
143
69.3k
      VisitStack.pop_back();
144
69.3k
    } while (!VisitStack.empty());
145
69.3k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::toNext()
Line
Count
Source
120
82.7k
  inline void toNext() {
121
85.9k
    do {
122
85.9k
      NodeRef Node = VisitStack.back().first;
123
85.9k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
85.9k
125
85.9k
      if (!Opt)
126
82.7k
        Opt.emplace(GT::child_begin(Node));
127
85.9k
128
85.9k
      // Notice that we directly mutate *Opt here, so that
129
85.9k
      // VisitStack.back().second actually gets updated as the iterator
130
85.9k
      // increases.
131
86.2k
      while (
*Opt != GT::child_end(Node)86.2k
) {
132
3.50k
        NodeRef Next = *(*Opt)++;
133
3.50k
        // Has our next sibling been visited?
134
3.50k
        if (
this->Visited.insert(Next).second3.50k
) {
135
3.24k
          // No, do it now.
136
3.24k
          VisitStack.push_back(StackElement(Next, None));
137
3.24k
          return;
138
3.24k
        }
139
3.50k
      }
140
82.7k
      this->Visited.completed(Node);
141
82.7k
142
82.7k
      // Oops, ran out of successors... go up a level on the stack.
143
82.7k
      VisitStack.pop_back();
144
82.7k
    } while (!VisitStack.empty());
145
82.7k
  }
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.67M
  static df_iterator begin(const GraphT &G) {
152
4.67M
    return df_iterator(GT::getEntryNode(G));
153
4.67M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::MachineRegionNode*> > >::begin(llvm::MachineRegionNode* const&)
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::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::begin(llvm::RegionNode* const&)
Line
Count
Source
151
3.09k
  static df_iterator begin(const GraphT &G) {
152
3.09k
    return df_iterator(GT::getEntryNode(G));
153
3.09k
  }
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::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::begin(llvm::MachineRegionNode* const&)
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
110
  static df_iterator begin(const GraphT &G) {
152
110
    return df_iterator(GT::getEntryNode(G));
153
110
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* 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::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::begin(llvm::Inverse<llvm::MachineBasicBlock*> 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::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::begin(llvm::MachineFunction* const&)
Line
Count
Source
151
121k
  static df_iterator begin(const GraphT &G) {
152
121k
    return df_iterator(GT::getEntryNode(G));
153
121k
  }
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
782
  static df_iterator begin(const GraphT &G) {
152
782
    return df_iterator(GT::getEntryNode(G));
153
782
  }
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
672k
  static df_iterator begin(const GraphT &G) {
152
672k
    return df_iterator(GT::getEntryNode(G));
153
672k
  }
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.51k
  static df_iterator begin(const GraphT &G) {
152
1.51k
    return df_iterator(GT::getEntryNode(G));
153
1.51k
  }
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&)
Unexecuted instantiation: llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode const*> > >::begin(llvm::RegionNode const* const&)
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
  }
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&)
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
912k
  static df_iterator begin(const GraphT &G) {
152
912k
    return df_iterator(GT::getEntryNode(G));
153
912k
  }
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
705k
  static df_iterator begin(const GraphT &G) {
152
705k
    return df_iterator(GT::getEntryNode(G));
153
705k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::MachineRegionNode const*> > >::begin(llvm::MachineRegionNode const* const&)
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
2.11M
  static df_iterator begin(const GraphT &G) {
152
2.11M
    return df_iterator(GT::getEntryNode(G));
153
2.11M
  }
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
79.4k
  static df_iterator begin(const GraphT &G) {
152
79.4k
    return df_iterator(GT::getEntryNode(G));
153
79.4k
  }
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
60.1k
  static df_iterator begin(const GraphT &G) {
152
60.1k
    return df_iterator(GT::getEntryNode(G));
153
60.1k
  }
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
318
  static df_iterator begin(const GraphT &G) {
152
318
    return df_iterator(GT::getEntryNode(G));
153
318
  }
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
197
  static df_iterator begin(const GraphT &G) {
152
197
    return df_iterator(GT::getEntryNode(G));
153
197
  }
154
4.67M
  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
79.4k
  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&)
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
318
  static df_iterator end(const GraphT &G) { return df_iterator(); }
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
197
  static df_iterator end(const GraphT &G) { return 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*> >::end(llvm::MachineBasicBlock const* const&)
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.51k
  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
782
  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
121k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::end(llvm::Inverse<llvm::MachineBasicBlock*> const&)
Line
Count
Source
154
17
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&)
Line
Count
Source
154
17
  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
2.11M
  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&)
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
3.09k
  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(); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::MachineRegionNode*> > >::end(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode const*> > >::end(llvm::RegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::MachineRegionNode const*> > >::end(llvm::MachineRegionNode const* const&)
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::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::end(llvm::MachineLoop* const&)
Line
Count
Source
154
110
  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
705k
  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
912k
  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
672k
  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
60.1k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
155
156
  // Static begin and end methods as our public ctors for external iterators
157
3.83M
  static df_iterator begin(const GraphT &G, SetType &S) {
158
3.83M
    return df_iterator(GT::getEntryNode(G), S);
159
3.83M
  }
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
289
  static df_iterator begin(const GraphT &G, SetType &S) {
158
289
    return df_iterator(GT::getEntryNode(G), S);
159
289
  }
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
3.89k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
3.89k
    return df_iterator(GT::getEntryNode(G), S);
159
3.89k
  }
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
516k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
516k
    return df_iterator(GT::getEntryNode(G), S);
159
516k
  }
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
385
  static df_iterator begin(const GraphT &G, SetType &S) {
158
385
    return df_iterator(GT::getEntryNode(G), S);
159
385
  }
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
614k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
614k
    return df_iterator(GT::getEntryNode(G), S);
159
614k
  }
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
947k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
947k
    return df_iterator(GT::getEntryNode(G), S);
159
947k
  }
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.15M
  static df_iterator begin(const GraphT &G, SetType &S) {
158
1.15M
    return df_iterator(GT::getEntryNode(G), S);
159
1.15M
  }
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
594k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
594k
    return df_iterator(GT::getEntryNode(G), S);
159
594k
  }
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.18k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
1.18k
    return df_iterator(GT::getEntryNode(G), S);
159
1.18k
  }
160
3.83M
  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.18k
  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
289
  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
385
  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
614k
  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
947k
  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.15M
  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
594k
  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
516k
  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
3.89k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
161
162
62.8M
  bool operator==(const df_iterator &x) const {
163
62.8M
    return VisitStack == x.VisitStack;
164
62.8M
  }
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
4.70M
  bool operator==(const df_iterator &x) const {
163
4.70M
    return VisitStack == x.VisitStack;
164
4.70M
  }
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
1.94k
  bool operator==(const df_iterator &x) const {
163
1.94k
    return VisitStack == x.VisitStack;
164
1.94k
  }
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
12.3k
  bool operator==(const df_iterator &x) const {
163
12.3k
    return VisitStack == x.VisitStack;
164
12.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::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
6.33k
  bool operator==(const df_iterator &x) const {
163
6.33k
    return VisitStack == x.VisitStack;
164
6.33k
  }
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.57M
  bool operator==(const df_iterator &x) const {
163
2.57M
    return VisitStack == x.VisitStack;
164
2.57M
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > > const&) const
Line
Count
Source
162
24
  bool operator==(const df_iterator &x) const {
163
24
    return VisitStack == x.VisitStack;
164
24
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
162
28
  bool operator==(const df_iterator &x) const {
163
28
    return VisitStack == x.VisitStack;
164
28
  }
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
20.3M
  bool operator==(const df_iterator &x) const {
163
20.3M
    return VisitStack == x.VisitStack;
164
20.3M
  }
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.07k
  bool operator==(const df_iterator &x) const {
163
3.07k
    return VisitStack == x.VisitStack;
164
3.07k
  }
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
8.02M
  bool operator==(const df_iterator &x) const {
163
8.02M
    return VisitStack == x.VisitStack;
164
8.02M
  }
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
232
  bool operator==(const df_iterator &x) const {
163
232
    return VisitStack == x.VisitStack;
164
232
  }
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
1.70M
  bool operator==(const df_iterator &x) const {
163
1.70M
    return VisitStack == x.VisitStack;
164
1.70M
  }
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
14.5k
  bool operator==(const df_iterator &x) const {
163
14.5k
    return VisitStack == x.VisitStack;
164
14.5k
  }
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
4.69M
  bool operator==(const df_iterator &x) const {
163
4.69M
    return VisitStack == x.VisitStack;
164
4.69M
  }
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
2.60M
  bool operator==(const df_iterator &x) const {
163
2.60M
    return VisitStack == x.VisitStack;
164
2.60M
  }
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
8.79M
  bool operator==(const df_iterator &x) const {
163
8.79M
    return VisitStack == x.VisitStack;
164
8.79M
  }
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
586
  bool operator==(const df_iterator &x) const {
163
586
    return VisitStack == x.VisitStack;
164
586
  }
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.00k
  bool operator==(const df_iterator &x) const {
163
4.00k
    return VisitStack == x.VisitStack;
164
4.00k
  }
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
4.61M
  bool operator==(const df_iterator &x) const {
163
4.61M
    return VisitStack == x.VisitStack;
164
4.61M
  }
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.22k
  bool operator==(const df_iterator &x) const {
163
1.22k
    return VisitStack == x.VisitStack;
164
1.22k
  }
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
4.43M
  bool operator==(const df_iterator &x) const {
163
4.43M
    return VisitStack == x.VisitStack;
164
4.43M
  }
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
927
  bool operator==(const df_iterator &x) const {
163
927
    return VisitStack == x.VisitStack;
164
927
  }
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
129k
  bool operator==(const df_iterator &x) const {
163
129k
    return VisitStack == x.VisitStack;
164
129k
  }
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
162k
  bool operator==(const df_iterator &x) const {
163
162k
    return VisitStack == x.VisitStack;
164
162k
  }
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
62.8M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > > const&) const
Line
Count
Source
165
24
  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
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
129k
  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
927
  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
4.43M
  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.22k
  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
4.61M
  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.00k
  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
586
  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
8.79M
  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
8.02M
  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
1.70M
  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
232
  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
20.3M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
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
2.60M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
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
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::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
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
4.69M
  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
14.5k
  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.07k
  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::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
162k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
28
  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.57M
  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
12.3k
  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::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
1.94k
  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
4.70M
  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
6.33k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
166
167
54.3M
  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.6k
  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::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
167
949
  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
26.7k
  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::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator*() const
Line
Count
Source
167
7.11M
  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
995k
  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
140
  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
18.2M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
11
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator*() const
Line
Count
Source
167
7
  const NodeRef &operator*() const { return VisitStack.back().first; }
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
1.44M
  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
7.84M
  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
389
  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.71k
  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
4.00M
  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
4.09M
  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
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator*() const
Line
Count
Source
167
3.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
621
  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
69.3k
  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
82.7k
  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
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
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator*() const
Line
Count
Source
167
2.45M
  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
5.14k
  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
4.03M
  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
1.48k
  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.56k
  const NodeRef &operator*() const { return VisitStack.back().first; }
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
24.1k
  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
24.1k
  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
18
  NodeRef operator->() const { return **this; }
174
175
54.3M
  df_iterator &operator++() { // Preincrement
176
54.3M
    toNext();
177
54.3M
    return *this;
178
54.3M
  }
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
1.16k
  df_iterator &operator++() { // Preincrement
176
1.16k
    toNext();
177
1.16k
    return *this;
178
1.16k
  }
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
303
  df_iterator &operator++() { // Preincrement
176
303
    toNext();
177
303
    return *this;
178
303
  }
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
69.3k
  df_iterator &operator++() { // Preincrement
176
69.3k
    toNext();
177
69.3k
    return *this;
178
69.3k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator++()
Line
Count
Source
175
82.7k
  df_iterator &operator++() { // Preincrement
176
82.7k
    toNext();
177
82.7k
    return *this;
178
82.7k
  }
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::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator++()
Line
Count
Source
175
7.11M
  df_iterator &operator++() { // Preincrement
176
7.11M
    toNext();
177
7.11M
    return *this;
178
7.11M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator++()
Line
Count
Source
175
995k
  df_iterator &operator++() { // Preincrement
176
995k
    toNext();
177
995k
    return *this;
178
995k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator++()
Line
Count
Source
175
122
  df_iterator &operator++() { // Preincrement
176
122
    toNext();
177
122
    return *this;
178
122
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
18.2M
  df_iterator &operator++() { // Preincrement
176
18.2M
    toNext();
177
18.2M
    return *this;
178
18.2M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
28
  df_iterator &operator++() { // Preincrement
176
28
    toNext();
177
28
    return *this;
178
28
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator++()
Line
Count
Source
175
24
  df_iterator &operator++() { // Preincrement
176
24
    toNext();
177
24
    return *this;
178
24
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
3.91M
  df_iterator &operator++() { // Preincrement
176
3.91M
    toNext();
177
3.91M
    return *this;
178
3.91M
  }
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
844
  df_iterator &operator++() { // Preincrement
176
844
    toNext();
177
844
    return *this;
178
844
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
175
4.00M
  df_iterator &operator++() { // Preincrement
176
4.00M
    toNext();
177
4.00M
    return *this;
178
4.00M
  }
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.71k
  df_iterator &operator++() { // Preincrement
176
3.71k
    toNext();
177
3.71k
    return *this;
178
3.71k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
175
389
  df_iterator &operator++() { // Preincrement
176
389
    toNext();
177
389
    return *this;
178
389
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
7.84M
  df_iterator &operator++() { // Preincrement
176
7.84M
    toNext();
177
7.84M
    return *this;
178
7.84M
  }
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
1.44M
  df_iterator &operator++() { // Preincrement
176
1.44M
    toNext();
177
1.44M
    return *this;
178
1.44M
  }
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::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::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
4.03M
  df_iterator &operator++() { // Preincrement
176
4.03M
    toNext();
177
4.03M
    return *this;
178
4.03M
  }
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::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator++()
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
4.09M
  df_iterator &operator++() { // Preincrement
176
4.09M
    toNext();
177
4.09M
    return *this;
178
4.09M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
6.67k
  df_iterator &operator++() { // Preincrement
176
6.67k
    toNext();
177
6.67k
    return *this;
178
6.67k
  }
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.56k
  df_iterator &operator++() { // Preincrement
176
1.56k
    toNext();
177
1.56k
    return *this;
178
1.56k
  }
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::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
2.45M
  df_iterator &operator++() { // Preincrement
176
2.45M
    toNext();
177
2.45M
    return *this;
178
2.45M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
5.14k
  df_iterator &operator++() { // Preincrement
176
5.14k
    toNext();
177
5.14k
    return *this;
178
5.14k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator++()
Line
Count
Source
175
9.25k
  df_iterator &operator++() { // Preincrement
176
9.25k
    toNext();
177
9.25k
    return *this;
178
9.25k
  }
179
180
  /// \brief 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
4.31k
  df_iterator &skipChildren() {
185
4.31k
    VisitStack.pop_back();
186
4.31k
    if (!VisitStack.empty())
187
1.13k
      toNext();
188
4.31k
    return *this;
189
4.31k
  }
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
306
  df_iterator &skipChildren() {
185
306
    VisitStack.pop_back();
186
306
    if (!VisitStack.empty())
187
285
      toNext();
188
306
    return *this;
189
306
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::skipChildren()
Line
Count
Source
184
4.00k
  df_iterator &skipChildren() {
185
4.00k
    VisitStack.pop_back();
186
4.00k
    if (!VisitStack.empty())
187
853
      toNext();
188
4.00k
    return *this;
189
4.00k
  }
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.04k
  bool nodeVisited(NodeRef Node) const {
202
1.04k
    return this->Visited.count(Node) != 0;
203
1.04k
  }
204
205
  /// getPathLength - Return the length of the path from the entry node to the
206
  /// current node, counting both nodes.
207
8.88M
  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
1.74M
  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
7.14M
  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
96
  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
3.68M
  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
142
  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
293k
  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
3.39M
  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.66M
df_iterator<T> df_begin(const T& G) {
218
4.66M
  return df_iterator<T>::begin(G);
219
4.66M
}
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
60.1k
df_iterator<T> df_begin(const T& G) {
218
60.1k
  return df_iterator<T>::begin(G);
219
60.1k
}
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
672k
df_iterator<T> df_begin(const T& G) {
218
672k
  return df_iterator<T>::begin(G);
219
672k
}
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
912k
df_iterator<T> df_begin(const T& G) {
218
912k
  return df_iterator<T>::begin(G);
219
912k
}
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
705k
df_iterator<T> df_begin(const T& G) {
218
705k
  return df_iterator<T>::begin(G);
219
705k
}
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
110
df_iterator<T> df_begin(const T& G) {
218
110
  return df_iterator<T>::begin(G);
219
110
}
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
2.11M
df_iterator<T> df_begin(const T& G) {
218
2.11M
  return df_iterator<T>::begin(G);
219
2.11M
}
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&)
Line
Count
Source
217
17
df_iterator<T> df_begin(const T& G) {
218
17
  return df_iterator<T>::begin(G);
219
17
}
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
121k
df_iterator<T> df_begin(const T& G) {
218
121k
  return df_iterator<T>::begin(G);
219
121k
}
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
782
df_iterator<T> df_begin(const T& G) {
218
782
  return df_iterator<T>::begin(G);
219
782
}
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.51k
df_iterator<T> df_begin(const T& G) {
218
1.51k
  return df_iterator<T>::begin(G);
219
1.51k
}
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
197
df_iterator<T> df_begin(const T& G) {
218
197
  return df_iterator<T>::begin(G);
219
197
}
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
79.4k
df_iterator<T> df_begin(const T& G) {
218
79.4k
  return df_iterator<T>::begin(G);
219
79.4k
}
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.66M
df_iterator<T> df_end(const T& G) {
223
4.66M
  return df_iterator<T>::end(G);
224
4.66M
}
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
79.4k
df_iterator<T> df_end(const T& G) {
223
79.4k
  return df_iterator<T>::end(G);
224
79.4k
}
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
705k
df_iterator<T> df_end(const T& G) {
223
705k
  return df_iterator<T>::end(G);
224
705k
}
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
60.1k
df_iterator<T> df_end(const T& G) {
223
60.1k
  return df_iterator<T>::end(G);
224
60.1k
}
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
197
df_iterator<T> df_end(const T& G) {
223
197
  return df_iterator<T>::end(G);
224
197
}
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::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.51k
df_iterator<T> df_end(const T& G) {
223
1.51k
  return df_iterator<T>::end(G);
224
1.51k
}
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
782
df_iterator<T> df_end(const T& G) {
223
782
  return df_iterator<T>::end(G);
224
782
}
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&)
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
121k
df_iterator<T> df_end(const T& G) {
223
121k
  return df_iterator<T>::end(G);
224
121k
}
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&)
Line
Count
Source
222
17
df_iterator<T> df_end(const T& G) {
223
17
  return df_iterator<T>::end(G);
224
17
}
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
2.11M
df_iterator<T> df_end(const T& G) {
223
2.11M
  return df_iterator<T>::end(G);
224
2.11M
}
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
110
df_iterator<T> df_end(const T& G) {
223
110
  return df_iterator<T>::end(G);
224
110
}
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
912k
df_iterator<T> df_end(const T& G) {
223
912k
  return df_iterator<T>::end(G);
224
912k
}
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
672k
df_iterator<T> df_end(const T& G) {
223
672k
  return df_iterator<T>::end(G);
224
672k
}
225
226
// Provide an accessor method to use them in range-based patterns.
227
template <class T>
228
4.39M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
4.39M
  return make_range(df_begin(G), df_end(G));
230
4.39M
}
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
60.1k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
60.1k
  return make_range(df_begin(G), df_end(G));
230
60.1k
}
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
2.08M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
2.08M
  return make_range(df_begin(G), df_end(G));
230
2.08M
}
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&)
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
197
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
197
  return make_range(df_begin(G), df_end(G));
230
197
}
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.51k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
1.51k
  return make_range(df_begin(G), df_end(G));
230
1.51k
}
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
671k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
671k
  return make_range(df_begin(G), df_end(G));
230
671k
}
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
459k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
459k
  return make_range(df_begin(G), df_end(G));
230
459k
}
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
121k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
121k
  return make_range(df_begin(G), df_end(G));
230
121k
}
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
92
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
92
  return make_range(df_begin(G), df_end(G));
230
92
}
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
912k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
912k
  return make_range(df_begin(G), df_end(G));
230
912k
}
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
79.4k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
79.4k
  return make_range(df_begin(G), df_end(G));
230
79.4k
}
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.66M
    : 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.22M
    : 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.89M
    : 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
2.30M
    : 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
1.18M
    : 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
7.79k
    : 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
2.37k
    : 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
1.03M
    : df_iterator<T, SetTy, true>(V) {}
237
};
238
239
template <class T, class SetTy>
240
3.83M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
3.83M
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
3.83M
}
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.15M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
1.15M
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
1.15M
}
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
947k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
947k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
947k
}
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
594k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
594k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
594k
}
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
3.89k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
3.89k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
3.89k
}
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.18k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
1.18k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
1.18k
}
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
516k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
516k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
516k
}
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
614k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
614k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
614k
}
243
244
template <class T, class SetTy>
245
3.83M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
3.83M
  return df_ext_iterator<T, SetTy>::end(G, S);
247
3.83M
}
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
614k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
614k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
614k
}
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.15M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
1.15M
  return df_ext_iterator<T, SetTy>::end(G, S);
247
1.15M
}
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
594k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
594k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
594k
}
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
3.89k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
3.89k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
3.89k
}
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.18k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
1.18k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
1.18k
}
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
516k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
516k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
516k
}
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
947k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
947k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
947k
}
248
249
template <class T, class SetTy>
250
iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G,
251
2.32M
                                                          SetTy &S) {
252
2.32M
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
2.32M
}
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
614k
                                                          SetTy &S) {
252
614k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
614k
}
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
594k
                                                          SetTy &S) {
252
594k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
594k
}
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.18k
                                                          SetTy &S) {
252
1.18k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
1.18k
}
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
595k
                                                          SetTy &S) {
252
595k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
595k
}
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
516k
                                                          SetTy &S) {
252
516k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
516k
}
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.03k
    : 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
636
    : 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
770
    : 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
578
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > > const&)
Line
Count
Source
262
51
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
263
};
264
265
template <class T>
266
335
idf_iterator<T> idf_begin(const T& G) {
267
335
  return idf_iterator<T>::begin(Inverse<T>(G));
268
335
}
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
318
idf_iterator<T> idf_begin(const T& G) {
267
318
  return idf_iterator<T>::begin(Inverse<T>(G));
268
318
}
llvm::idf_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false> llvm::idf_begin<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* 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
}
269
270
template <class T>
271
335
idf_iterator<T> idf_end(const T& G){
272
335
  return idf_iterator<T>::end(Inverse<T>(G));
273
335
}
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
318
idf_iterator<T> idf_end(const T& G){
272
318
  return idf_iterator<T>::end(Inverse<T>(G));
273
318
}
llvm::idf_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false> llvm::idf_end<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* 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
}
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.34k
    : 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
770
    : 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
578
    : idf_iterator<T, SetTy, true>(V) {}
288
};
289
290
template <class T, class SetTy>
291
674
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
674
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
674
}
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
289
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
289
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
289
}
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
385
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
385
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
385
}
294
295
template <class T, class SetTy>
296
674
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
674
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
674
}
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
385
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
385
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
385
}
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
289
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
289
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
289
}
299
300
template <class T, class SetTy>
301
iterator_range<idf_ext_iterator<T, SetTy>> inverse_depth_first_ext(const T& G,
302
674
                                                                   SetTy &S) {
303
674
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
674
}
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
289
                                                                   SetTy &S) {
303
289
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
289
}
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
385
                                                                   SetTy &S) {
303
385
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
385
}
305
306
} // end namespace llvm
307
308
#endif // LLVM_ADT_DEPTHFIRSTITERATOR_H