Coverage Report

Created: 2018-09-19 20:53

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/ADT/DepthFirstIterator.h
Line
Count
Source (jump to first uncovered line)
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
2.99M
  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
992k
  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
6.03k
  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
548k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
Unexecuted instantiation: 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>&)
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
548k
  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
978
  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
898k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
60
10.6M
  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
2.63M
  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
6.03k
  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
2.19M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
Unexecuted instantiation: 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&)
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
2.19M
  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.91k
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
ADCE.cpp:llvm::df_iterator_storage<(anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true>::df_iterator_storage(llvm::df_iterator_storage<(anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true> const&)
Line
Count
Source
60
3.59M
  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
77.6M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::insert(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
74
4.01M
  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
560k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::insert(llvm::MachineLoop*)
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::insert(llvm::BasicBlock*)
Line
Count
Source
74
31.5M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
10.1M
  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
26.6M
  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
10.4k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>::insert(llvm::RegionNode const*)
llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>::insert(llvm::BasicBlock const*)
Line
Count
Source
74
1.02M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::Loop const*, 8u>::insert(llvm::Loop const*)
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
10.6k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
3.63M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::insert(llvm::MachineRegionNode*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::insert(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::insert(llvm::MachineBasicBlock const*)
llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>::insert(llvm::BasicBlock*)
Line
Count
Source
74
1.16k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::insert(llvm::VPBlockBase*)
Line
Count
Source
74
71.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*)
75
  template <typename IterT>
76
  void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); }
77
78
62.3M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
78
4.01M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop*, 8u>::completed(llvm::Loop*)
Line
Count
Source
78
560k
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::completed(llvm::MachineLoop*)
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
21.2M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
6.84M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
78
26.6M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>::completed(llvm::BasicBlock const*)
Line
Count
Source
78
459k
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>::completed(llvm::RegionNode const*)
llvm::df_iterator_default_set<llvm::RegionNode*, 8u>::completed(llvm::RegionNode*)
Line
Count
Source
78
8.69k
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::Loop const*, 8u>::completed(llvm::Loop const*)
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
4.55k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
2.50M
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::completed(llvm::MachineBasicBlock const*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::completed(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::completed(llvm::MachineRegionNode*)
llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
549
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::completed(llvm::VPBlockBase*)
Line
Count
Source
78
69.5k
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>::completed(llvm::VPBlockBase const*)
79
};
80
81
// Generic Depth First Iterator
82
template <class GraphT,
83
          class SetType =
84
              df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
85
          bool ExtStorage = false, class GT = GraphTraits<GraphT>>
86
class df_iterator
87
    : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
88
      public df_iterator_storage<SetType, ExtStorage> {
89
  using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
90
  using NodeRef = typename GT::NodeRef;
91
  using ChildItTy = typename GT::ChildIteratorType;
92
93
  // First element is node reference, second is the 'next child' to visit.
94
  // The second child is initialized lazily to pick up graph changes during the
95
  // DFS.
96
  using StackElement = std::pair<NodeRef, Optional<ChildItTy>>;
97
98
  // VisitStack - Used to maintain the ordering.  Top = current block
99
  std::vector<StackElement> VisitStack;
100
101
private:
102
8.02M
  inline df_iterator(NodeRef Node) {
103
8.02M
    this->Visited.insert(Node);
104
8.02M
    VisitStack.push_back(StackElement(Node, None));
105
8.02M
  }
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
480k
  inline df_iterator(NodeRef Node) {
103
480k
    this->Visited.insert(Node);
104
480k
    VisitStack.push_back(StackElement(Node, None));
105
480k
  }
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
404k
  inline df_iterator(NodeRef Node) {
103
404k
    this->Visited.insert(Node);
104
404k
    VisitStack.push_back(StackElement(Node, None));
105
404k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::df_iterator(llvm::MachineLoop*)
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.59M
  inline df_iterator(NodeRef Node) {
103
2.59M
    this->Visited.insert(Node);
104
2.59M
    VisitStack.push_back(StackElement(Node, None));
105
2.59M
  }
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
69.7k
  inline df_iterator(NodeRef Node) {
103
69.7k
    this->Visited.insert(Node);
104
69.7k
    VisitStack.push_back(StackElement(Node, None));
105
69.7k
  }
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
3.96M
  inline df_iterator(NodeRef Node) {
103
3.96M
    this->Visited.insert(Node);
104
3.96M
    VisitStack.push_back(StackElement(Node, None));
105
3.96M
  }
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
2.78k
  inline df_iterator(NodeRef Node) {
103
2.78k
    this->Visited.insert(Node);
104
2.78k
    VisitStack.push_back(StackElement(Node, None));
105
2.78k
  }
Unexecuted instantiation: 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*)
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
10
  inline df_iterator(NodeRef Node) {
103
10
    this->Visited.insert(Node);
104
10
    VisitStack.push_back(StackElement(Node, None));
105
10
  }
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
  }
Unexecuted instantiation: 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*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator(llvm::MachineRegionNode*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::df_iterator(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator(llvm::MachineBasicBlock const*)
Unexecuted instantiation: llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::BasicBlock*)
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
448k
  inline df_iterator(NodeRef Node) {
103
448k
    this->Visited.insert(Node);
104
448k
    VisitStack.push_back(StackElement(Node, None));
105
448k
  }
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
6
  inline df_iterator(NodeRef Node) {
103
6
    this->Visited.insert(Node);
104
6
    VisitStack.push_back(StackElement(Node, None));
105
6
  }
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
55.2k
  inline df_iterator(NodeRef Node) {
103
55.2k
    this->Visited.insert(Node);
104
55.2k
    VisitStack.push_back(StackElement(Node, None));
105
55.2k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::df_iterator(llvm::VPBlockBase const*)
106
107
8.02M
  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
480k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::df_iterator()
Line
Count
Source
107
404k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::df_iterator()
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.59M
  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
69.7k
  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
3.96M
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::df_iterator()
Line
Count
Source
107
2.78k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::df_iterator()
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
10
  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
Unexecuted instantiation: llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator()
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::df_iterator()
Line
Count
Source
107
448k
  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
6
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::df_iterator()
Line
Count
Source
107
55.2k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::df_iterator()
108
109
  inline df_iterator(NodeRef Node, SetType &S)
110
1.49M
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
1.49M
    if (this->Visited.insert(Node).second)
112
1.49M
      VisitStack.push_back(StackElement(Node, None));
113
1.49M
  }
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
281
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
281
    if (this->Visited.insert(Node).second)
112
281
      VisitStack.push_back(StackElement(Node, None));
113
281
  }
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.01k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
3.01k
    if (this->Visited.insert(Node).second)
112
2.98k
      VisitStack.push_back(StackElement(Node, None));
113
3.01k
  }
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
274k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
274k
    if (this->Visited.insert(Node).second)
112
274k
      VisitStack.push_back(StackElement(Node, None));
113
274k
  }
Unexecuted instantiation: 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>&)
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
496k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
496k
    if (this->Visited.insert(Node).second)
112
496k
      VisitStack.push_back(StackElement(Node, None));
113
496k
  }
Unexecuted instantiation: 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>&)
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
274k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
274k
    if (this->Visited.insert(Node).second)
112
274k
      VisitStack.push_back(StackElement(Node, None));
113
274k
  }
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
489
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
489
    if (this->Visited.insert(Node).second)
112
337
      VisitStack.push_back(StackElement(Node, None));
113
489
  }
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
449k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
449k
    if (this->Visited.insert(Node).second)
112
449k
      VisitStack.push_back(StackElement(Node, None));
113
449k
  }
114
115
  inline df_iterator(SetType &S)
116
1.49M
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
1.49M
    // End is when stack is empty
118
1.49M
  }
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
281
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
281
    // End is when stack is empty
118
281
  }
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.01k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
3.01k
    // End is when stack is empty
118
3.01k
  }
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
274k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
274k
    // End is when stack is empty
118
274k
  }
Unexecuted instantiation: 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>&)
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
496k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
496k
    // End is when stack is empty
118
496k
  }
Unexecuted instantiation: 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>&)
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
274k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
274k
    // End is when stack is empty
118
274k
  }
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
489
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
489
    // End is when stack is empty
118
489
  }
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
449k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
449k
    // End is when stack is empty
118
449k
  }
119
120
65.7M
  inline void toNext() {
121
121M
    do {
122
121M
      NodeRef Node = VisitStack.back().first;
123
121M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
121M
125
121M
      if (!Opt)
126
65.3M
        Opt.emplace(GT::child_begin(Node));
127
121M
128
121M
      // Notice that we directly mutate *Opt here, so that
129
121M
      // VisitStack.back().second actually gets updated as the iterator
130
121M
      // increases.
131
137M
      while (*Opt != GT::child_end(Node)) {
132
72.3M
        NodeRef Next = *(*Opt)++;
133
72.3M
        // Has our next sibling been visited?
134
72.3M
        if (this->Visited.insert(Next).second) {
135
56.2M
          // No, do it now.
136
56.2M
          VisitStack.push_back(StackElement(Next, None));
137
56.2M
          return;
138
56.2M
        }
139
72.3M
      }
140
121M
      this->Visited.completed(Node);
141
65.2M
142
65.2M
      // Oops, ran out of successors... go up a level on the stack.
143
65.2M
      VisitStack.pop_back();
144
65.2M
    } while (!VisitStack.empty());
145
65.7M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::toNext()
Line
Count
Source
120
4.01M
  inline void toNext() {
121
7.55M
    do {
122
7.55M
      NodeRef Node = VisitStack.back().first;
123
7.55M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.55M
125
7.55M
      if (!Opt)
126
4.01M
        Opt.emplace(GT::child_begin(Node));
127
7.55M
128
7.55M
      // Notice that we directly mutate *Opt here, so that
129
7.55M
      // VisitStack.back().second actually gets updated as the iterator
130
7.55M
      // increases.
131
7.55M
      while (*Opt != GT::child_end(Node)) {
132
3.53M
        NodeRef Next = *(*Opt)++;
133
3.53M
        // Has our next sibling been visited?
134
3.53M
        if (this->Visited.insert(Next).second) {
135
3.53M
          // No, do it now.
136
3.53M
          VisitStack.push_back(StackElement(Next, None));
137
3.53M
          return;
138
3.53M
        }
139
3.53M
      }
140
7.55M
      this->Visited.completed(Node);
141
4.01M
142
4.01M
      // Oops, ran out of successors... go up a level on the stack.
143
4.01M
      VisitStack.pop_back();
144
4.01M
    } while (!VisitStack.empty());
145
4.01M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::toNext()
Line
Count
Source
120
560k
  inline void toNext() {
121
715k
    do {
122
715k
      NodeRef Node = VisitStack.back().first;
123
715k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
715k
125
715k
      if (!Opt)
126
560k
        Opt.emplace(GT::child_begin(Node));
127
715k
128
715k
      // Notice that we directly mutate *Opt here, so that
129
715k
      // VisitStack.back().second actually gets updated as the iterator
130
715k
      // increases.
131
715k
      while (*Opt != GT::child_end(Node)) {
132
155k
        NodeRef Next = *(*Opt)++;
133
155k
        // Has our next sibling been visited?
134
155k
        if (this->Visited.insert(Next).second) {
135
155k
          // No, do it now.
136
155k
          VisitStack.push_back(StackElement(Next, None));
137
155k
          return;
138
155k
        }
139
155k
      }
140
715k
      this->Visited.completed(Node);
141
560k
142
560k
      // Oops, ran out of successors... go up a level on the stack.
143
560k
      VisitStack.pop_back();
144
560k
    } while (!VisitStack.empty());
145
560k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::toNext()
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
18.7M
  inline void toNext() {
121
34.9M
    do {
122
34.9M
      NodeRef Node = VisitStack.back().first;
123
34.9M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
34.9M
125
34.9M
      if (!Opt)
126
18.7M
        Opt.emplace(GT::child_begin(Node));
127
34.9M
128
34.9M
      // Notice that we directly mutate *Opt here, so that
129
34.9M
      // VisitStack.back().second actually gets updated as the iterator
130
34.9M
      // increases.
131
44.0M
      while (*Opt != GT::child_end(Node)) {
132
25.2M
        NodeRef Next = *(*Opt)++;
133
25.2M
        // Has our next sibling been visited?
134
25.2M
        if (this->Visited.insert(Next).second) {
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.2M
      }
140
34.9M
      this->Visited.completed(Node);
141
18.7M
142
18.7M
      // Oops, ran out of successors... go up a level on the stack.
143
18.7M
      VisitStack.pop_back();
144
18.7M
    } while (!VisitStack.empty());
145
18.7M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
1.88M
  inline void toNext() {
121
3.69M
    do {
122
3.69M
      NodeRef Node = VisitStack.back().first;
123
3.69M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
3.69M
125
3.69M
      if (!Opt)
126
1.88M
        Opt.emplace(GT::child_begin(Node));
127
3.69M
128
3.69M
      // Notice that we directly mutate *Opt here, so that
129
3.69M
      // VisitStack.back().second actually gets updated as the iterator
130
3.69M
      // increases.
131
4.77M
      while (*Opt != GT::child_end(Node)) {
132
2.89M
        NodeRef Next = *(*Opt)++;
133
2.89M
        // Has our next sibling been visited?
134
2.89M
        if (this->Visited.insert(Next).second) {
135
1.81M
          // No, do it now.
136
1.81M
          VisitStack.push_back(StackElement(Next, None));
137
1.81M
          return;
138
1.81M
        }
139
2.89M
      }
140
3.69M
      this->Visited.completed(Node);
141
1.88M
142
1.88M
      // Oops, ran out of successors... go up a level on the stack.
143
1.88M
      VisitStack.pop_back();
144
1.88M
    } while (!VisitStack.empty());
145
1.88M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
5.12k
  inline void toNext() {
121
9.96k
    do {
122
9.96k
      NodeRef Node = VisitStack.back().first;
123
9.96k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
9.96k
125
9.96k
      if (!Opt)
126
5.12k
        Opt.emplace(GT::child_begin(Node));
127
9.96k
128
9.96k
      // Notice that we directly mutate *Opt here, so that
129
9.96k
      // VisitStack.back().second actually gets updated as the iterator
130
9.96k
      // increases.
131
12.5k
      while (*Opt != GT::child_end(Node)) {
132
7.39k
        NodeRef Next = *(*Opt)++;
133
7.39k
        // Has our next sibling been visited?
134
7.39k
        if (this->Visited.insert(Next).second) {
135
4.84k
          // No, do it now.
136
4.84k
          VisitStack.push_back(StackElement(Next, None));
137
4.84k
          return;
138
4.84k
        }
139
7.39k
      }
140
9.96k
      this->Visited.completed(Node);
141
5.12k
142
5.12k
      // Oops, ran out of successors... go up a level on the stack.
143
5.12k
      VisitStack.pop_back();
144
5.12k
    } while (!VisitStack.empty());
145
5.12k
  }
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
26.6M
  inline void toNext() {
121
49.3M
    do {
122
49.3M
      NodeRef Node = VisitStack.back().first;
123
49.3M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
49.3M
125
49.3M
      if (!Opt)
126
26.6M
        Opt.emplace(GT::child_begin(Node));
127
49.3M
128
49.3M
      // Notice that we directly mutate *Opt here, so that
129
49.3M
      // VisitStack.back().second actually gets updated as the iterator
130
49.3M
      // increases.
131
49.3M
      while (
*Opt != GT::child_end(Node)49.3M
) {
132
22.6M
        NodeRef Next = *(*Opt)++;
133
22.6M
        // Has our next sibling been visited?
134
22.6M
        if (
this->Visited.insert(Next).second22.6M
) {
135
22.6M
          // No, do it now.
136
22.6M
          VisitStack.push_back(StackElement(Next, None));
137
22.6M
          return;
138
22.6M
        }
139
22.6M
      }
140
49.3M
      this->Visited.completed(Node);
141
26.6M
142
26.6M
      // Oops, ran out of successors... go up a level on the stack.
143
26.6M
      VisitStack.pop_back();
144
26.6M
    } while (!VisitStack.empty());
145
26.6M
  }
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
52
  inline void toNext() {
121
94
    do {
122
94
      NodeRef Node = VisitStack.back().first;
123
94
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
94
125
94
      if (!Opt)
126
52
        Opt.emplace(GT::child_begin(Node));
127
94
128
94
      // Notice that we directly mutate *Opt here, so that
129
94
      // VisitStack.back().second actually gets updated as the iterator
130
94
      // increases.
131
118
      while (*Opt != GT::child_end(Node)) {
132
66
        NodeRef Next = *(*Opt)++;
133
66
        // Has our next sibling been visited?
134
66
        if (this->Visited.insert(Next).second) {
135
42
          // No, do it now.
136
42
          VisitStack.push_back(StackElement(Next, None));
137
42
          return;
138
42
        }
139
66
      }
140
94
      this->Visited.completed(Node);
141
52
142
52
      // Oops, ran out of successors... go up a level on the stack.
143
52
      VisitStack.pop_back();
144
52
    } while (!VisitStack.empty());
145
52
  }
Unexecuted instantiation: llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::toNext()
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::toNext()
Line
Count
Source
120
8.69k
  inline void toNext() {
121
14.5k
    do {
122
14.5k
      NodeRef Node = VisitStack.back().first;
123
14.5k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
14.5k
125
14.5k
      if (!Opt)
126
8.69k
        Opt.emplace(GT::child_begin(Node));
127
14.5k
128
14.5k
      // Notice that we directly mutate *Opt here, so that
129
14.5k
      // VisitStack.back().second actually gets updated as the iterator
130
14.5k
      // increases.
131
16.3k
      while (*Opt != GT::child_end(Node)) {
132
7.64k
        NodeRef Next = *(*Opt)++;
133
7.64k
        // Has our next sibling been visited?
134
7.64k
        if (this->Visited.insert(Next).second) {
135
5.90k
          // No, do it now.
136
5.90k
          VisitStack.push_back(StackElement(Next, None));
137
5.90k
          return;
138
5.90k
        }
139
7.64k
      }
140
14.5k
      this->Visited.completed(Node);
141
8.69k
142
8.69k
      // Oops, ran out of successors... go up a level on the stack.
143
8.69k
      VisitStack.pop_back();
144
8.69k
    } while (!VisitStack.empty());
145
8.69k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::toNext()
Line
Count
Source
120
9
  inline void toNext() {
121
17
    do {
122
17
      NodeRef Node = VisitStack.back().first;
123
17
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
17
125
17
      if (!Opt)
126
9
        Opt.emplace(GT::child_begin(Node));
127
17
128
17
      // Notice that we directly mutate *Opt here, so that
129
17
      // VisitStack.back().second actually gets updated as the iterator
130
17
      // increases.
131
19
      while (*Opt != GT::child_end(Node)) {
132
10
        NodeRef Next = *(*Opt)++;
133
10
        // Has our next sibling been visited?
134
10
        if (this->Visited.insert(Next).second) {
135
8
          // No, do it now.
136
8
          VisitStack.push_back(StackElement(Next, None));
137
8
          return;
138
8
        }
139
10
      }
140
17
      this->Visited.completed(Node);
141
9
142
9
      // Oops, ran out of successors... go up a level on the stack.
143
9
      VisitStack.pop_back();
144
9
    } while (!VisitStack.empty());
145
9
  }
Unexecuted instantiation: llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::toNext()
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
5.32k
  inline void toNext() {
121
9.46k
    do {
122
9.46k
      NodeRef Node = VisitStack.back().first;
123
9.46k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
9.46k
125
9.46k
      if (!Opt)
126
4.55k
        Opt.emplace(GT::child_begin(Node));
127
9.46k
128
9.46k
      // Notice that we directly mutate *Opt here, so that
129
9.46k
      // VisitStack.back().second actually gets updated as the iterator
130
9.46k
      // increases.
131
12.2k
      while (*Opt != GT::child_end(Node)) {
132
7.66k
        NodeRef Next = *(*Opt)++;
133
7.66k
        // Has our next sibling been visited?
134
7.66k
        if (this->Visited.insert(Next).second) {
135
4.91k
          // No, do it now.
136
4.91k
          VisitStack.push_back(StackElement(Next, None));
137
4.91k
          return;
138
4.91k
        }
139
7.66k
      }
140
9.46k
      this->Visited.completed(Node);
141
4.55k
142
4.55k
      // Oops, ran out of successors... go up a level on the stack.
143
4.55k
      VisitStack.pop_back();
144
4.55k
    } while (!VisitStack.empty());
145
5.32k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
2.50M
  inline void toNext() {
121
4.72M
    do {
122
4.72M
      NodeRef Node = VisitStack.back().first;
123
4.72M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
4.72M
125
4.72M
      if (!Opt)
126
2.50M
        Opt.emplace(GT::child_begin(Node));
127
4.72M
128
4.72M
      // Notice that we directly mutate *Opt here, so that
129
4.72M
      // VisitStack.back().second actually gets updated as the iterator
130
4.72M
      // increases.
131
5.86M
      while (*Opt != GT::child_end(Node)) {
132
3.35M
        NodeRef Next = *(*Opt)++;
133
3.35M
        // Has our next sibling been visited?
134
3.35M
        if (this->Visited.insert(Next).second) {
135
2.22M
          // No, do it now.
136
2.22M
          VisitStack.push_back(StackElement(Next, None));
137
2.22M
          return;
138
2.22M
        }
139
3.35M
      }
140
4.72M
      this->Visited.completed(Node);
141
2.50M
142
2.50M
      // Oops, ran out of successors... go up a level on the stack.
143
2.50M
      VisitStack.pop_back();
144
2.50M
    } while (!VisitStack.empty());
145
2.50M
  }
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()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::toNext()
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
4.96M
  inline void toNext() {
121
9.42M
    do {
122
9.42M
      NodeRef Node = VisitStack.back().first;
123
9.42M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
9.42M
125
9.42M
      if (!Opt)
126
4.96M
        Opt.emplace(GT::child_begin(Node));
127
9.42M
128
9.42M
      // Notice that we directly mutate *Opt here, so that
129
9.42M
      // VisitStack.back().second actually gets updated as the iterator
130
9.42M
      // increases.
131
11.6M
      while (*Opt != GT::child_end(Node)) {
132
6.66M
        NodeRef Next = *(*Opt)++;
133
6.66M
        // Has our next sibling been visited?
134
6.66M
        if (this->Visited.insert(Next).second) {
135
4.46M
          // No, do it now.
136
4.46M
          VisitStack.push_back(StackElement(Next, None));
137
4.46M
          return;
138
4.46M
        }
139
6.66M
      }
140
9.42M
      this->Visited.completed(Node);
141
4.96M
142
4.96M
      // Oops, ran out of successors... go up a level on the stack.
143
4.96M
      VisitStack.pop_back();
144
4.96M
    } while (!VisitStack.empty());
145
4.96M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::toNext()
Unexecuted instantiation: llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
120
2.47M
  inline void toNext() {
121
4.67M
    do {
122
4.67M
      NodeRef Node = VisitStack.back().first;
123
4.67M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
4.67M
125
4.67M
      if (!Opt)
126
2.47M
        Opt.emplace(GT::child_begin(Node));
127
4.67M
128
4.67M
      // Notice that we directly mutate *Opt here, so that
129
4.67M
      // VisitStack.back().second actually gets updated as the iterator
130
4.67M
      // increases.
131
5.88M
      while (*Opt != GT::child_end(Node)) {
132
3.40M
        NodeRef Next = *(*Opt)++;
133
3.40M
        // Has our next sibling been visited?
134
3.40M
        if (this->Visited.insert(Next).second) {
135
2.19M
          // No, do it now.
136
2.19M
          VisitStack.push_back(StackElement(Next, None));
137
2.19M
          return;
138
2.19M
        }
139
3.40M
      }
140
4.67M
      this->Visited.completed(Node);
141
2.47M
142
2.47M
      // Oops, ran out of successors... go up a level on the stack.
143
2.47M
      VisitStack.pop_back();
144
2.47M
    } while (!VisitStack.empty());
145
2.47M
  }
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
686
  inline void toNext() {
121
1.01k
    do {
122
1.01k
      NodeRef Node = VisitStack.back().first;
123
1.01k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.01k
125
1.01k
      if (!Opt)
126
686
        Opt.emplace(GT::child_begin(Node));
127
1.01k
128
1.01k
      // Notice that we directly mutate *Opt here, so that
129
1.01k
      // VisitStack.back().second actually gets updated as the iterator
130
1.01k
      // increases.
131
1.22k
      while (*Opt != GT::child_end(Node)) {
132
674
        NodeRef Next = *(*Opt)++;
133
674
        // Has our next sibling been visited?
134
674
        if (this->Visited.insert(Next).second) {
135
468
          // No, do it now.
136
468
          VisitStack.push_back(StackElement(Next, None));
137
468
          return;
138
468
        }
139
674
      }
140
1.01k
      this->Visited.completed(Node);
141
549
142
549
      // Oops, ran out of successors... go up a level on the stack.
143
549
      VisitStack.pop_back();
144
549
    } while (!VisitStack.empty());
145
686
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
2.89M
  inline void toNext() {
121
5.34M
    do {
122
5.34M
      NodeRef Node = VisitStack.back().first;
123
5.34M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
5.34M
125
5.34M
      if (!Opt)
126
2.89M
        Opt.emplace(GT::child_begin(Node));
127
5.34M
128
5.34M
      // Notice that we directly mutate *Opt here, so that
129
5.34M
      // VisitStack.back().second actually gets updated as the iterator
130
5.34M
      // increases.
131
6.67M
      while (*Opt != GT::child_end(Node)) {
132
3.77M
        NodeRef Next = *(*Opt)++;
133
3.77M
        // Has our next sibling been visited?
134
3.77M
        if (this->Visited.insert(Next).second) {
135
2.44M
          // No, do it now.
136
2.44M
          VisitStack.push_back(StackElement(Next, None));
137
2.44M
          return;
138
2.44M
        }
139
3.77M
      }
140
5.34M
      this->Visited.completed(Node);
141
2.89M
142
2.89M
      // Oops, ran out of successors... go up a level on the stack.
143
2.89M
      VisitStack.pop_back();
144
2.89M
    } while (!VisitStack.empty());
145
2.89M
  }
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
940k
  inline void toNext() {
121
992k
    do {
122
992k
      NodeRef Node = VisitStack.back().first;
123
992k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
992k
125
992k
      if (!Opt)
126
525k
        Opt.emplace(GT::child_begin(Node));
127
992k
128
992k
      // Notice that we directly mutate *Opt here, so that
129
992k
      // VisitStack.back().second actually gets updated as the iterator
130
992k
      // increases.
131
1.03M
      while (*Opt != GT::child_end(Node)) {
132
572k
        NodeRef Next = *(*Opt)++;
133
572k
        // Has our next sibling been visited?
134
572k
        if (this->Visited.insert(Next).second) {
135
533k
          // No, do it now.
136
533k
          VisitStack.push_back(StackElement(Next, None));
137
533k
          return;
138
533k
        }
139
572k
      }
140
992k
      this->Visited.completed(Node);
141
459k
142
459k
      // Oops, ran out of successors... go up a level on the stack.
143
459k
      VisitStack.pop_back();
144
459k
    } while (!VisitStack.empty());
145
940k
  }
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
6
  inline void toNext() {
121
6
    do {
122
6
      NodeRef Node = VisitStack.back().first;
123
6
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
6
125
6
      if (!Opt)
126
6
        Opt.emplace(GT::child_begin(Node));
127
6
128
6
      // Notice that we directly mutate *Opt here, so that
129
6
      // VisitStack.back().second actually gets updated as the iterator
130
6
      // increases.
131
6
      while (*Opt != GT::child_end(Node)) {
132
0
        NodeRef Next = *(*Opt)++;
133
0
        // Has our next sibling been visited?
134
0
        if (this->Visited.insert(Next).second) {
135
0
          // No, do it now.
136
0
          VisitStack.push_back(StackElement(Next, None));
137
0
          return;
138
0
        }
139
0
      }
140
6
      this->Visited.completed(Node);
141
6
142
6
      // Oops, ran out of successors... go up a level on the stack.
143
6
      VisitStack.pop_back();
144
6
    } while (!VisitStack.empty());
145
6
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::toNext()
Line
Count
Source
120
69.5k
  inline void toNext() {
121
83.9k
    do {
122
83.9k
      NodeRef Node = VisitStack.back().first;
123
83.9k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
83.9k
125
83.9k
      if (!Opt)
126
69.5k
        Opt.emplace(GT::child_begin(Node));
127
83.9k
128
83.9k
      // Notice that we directly mutate *Opt here, so that
129
83.9k
      // VisitStack.back().second actually gets updated as the iterator
130
83.9k
      // increases.
131
86.3k
      while (*Opt != GT::child_end(Node)) {
132
16.7k
        NodeRef Next = *(*Opt)++;
133
16.7k
        // Has our next sibling been visited?
134
16.7k
        if (this->Visited.insert(Next).second) {
135
14.3k
          // No, do it now.
136
14.3k
          VisitStack.push_back(StackElement(Next, None));
137
14.3k
          return;
138
14.3k
        }
139
16.7k
      }
140
83.9k
      this->Visited.completed(Node);
141
69.5k
142
69.5k
      // Oops, ran out of successors... go up a level on the stack.
143
69.5k
      VisitStack.pop_back();
144
69.5k
    } while (!VisitStack.empty());
145
69.5k
  }
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
8.02M
  static df_iterator begin(const GraphT &G) {
152
8.02M
    return df_iterator(GT::getEntryNode(G));
153
8.02M
  }
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
480k
  static df_iterator begin(const GraphT &G) {
152
480k
    return df_iterator(GT::getEntryNode(G));
153
480k
  }
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
404k
  static df_iterator begin(const GraphT &G) {
152
404k
    return df_iterator(GT::getEntryNode(G));
153
404k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::begin(llvm::MachineLoop* 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.59M
  static df_iterator begin(const GraphT &G) {
152
2.59M
    return df_iterator(GT::getEntryNode(G));
153
2.59M
  }
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
69.7k
  static df_iterator begin(const GraphT &G) {
152
69.7k
    return df_iterator(GT::getEntryNode(G));
153
69.7k
  }
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
3.96M
  static df_iterator begin(const GraphT &G) {
152
3.96M
    return df_iterator(GT::getEntryNode(G));
153
3.96M
  }
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
2.78k
  static df_iterator begin(const GraphT &G) {
152
2.78k
    return df_iterator(GT::getEntryNode(G));
153
2.78k
  }
Unexecuted instantiation: 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&)
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
10
  static df_iterator begin(const GraphT &G) {
152
10
    return df_iterator(GT::getEntryNode(G));
153
10
  }
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::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::begin(llvm::Loop 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&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::begin(llvm::MachineRegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::begin(llvm::MachineBasicBlock const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::begin(llvm::Function* 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*> > >::begin(llvm::Inverse<llvm::BasicBlock const*> const&)
Line
Count
Source
151
448k
  static df_iterator begin(const GraphT &G) {
152
448k
    return df_iterator(GT::getEntryNode(G));
153
448k
  }
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
6
  static df_iterator begin(const GraphT &G) {
152
6
    return df_iterator(GT::getEntryNode(G));
153
6
  }
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
55.2k
  static df_iterator begin(const GraphT &G) {
152
55.2k
    return df_iterator(GT::getEntryNode(G));
153
55.2k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::begin(llvm::VPBlockBase const* const&)
154
8.02M
  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
480k
  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
404k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::end(llvm::MachineLoop* const&)
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.59M
  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
69.7k
  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
3.96M
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::end(llvm::RegionNode* const&)
Line
Count
Source
154
2.78k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: 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&)
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
10
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::end(llvm::RegionNode* const&)
Line
Count
Source
154
1
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: 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&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::end(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::end(llvm::MachineRegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::end(llvm::MachineBasicBlock const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::end(llvm::Function* 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
448k
  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
6
  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
55.2k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::end(llvm::VPBlockBase const* const&)
155
156
  // Static begin and end methods as our public ctors for external iterators
157
1.49M
  static df_iterator begin(const GraphT &G, SetType &S) {
158
1.49M
    return df_iterator(GT::getEntryNode(G), S);
159
1.49M
  }
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
281
  static df_iterator begin(const GraphT &G, SetType &S) {
158
281
    return df_iterator(GT::getEntryNode(G), S);
159
281
  }
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.01k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
3.01k
    return df_iterator(GT::getEntryNode(G), S);
159
3.01k
  }
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
274k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
274k
    return df_iterator(GT::getEntryNode(G), S);
159
274k
  }
Unexecuted instantiation: 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>&)
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
496k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
496k
    return df_iterator(GT::getEntryNode(G), S);
159
496k
  }
Unexecuted instantiation: 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>&)
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
274k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
274k
    return df_iterator(GT::getEntryNode(G), S);
159
274k
  }
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
489
  static df_iterator begin(const GraphT &G, SetType &S) {
158
489
    return df_iterator(GT::getEntryNode(G), S);
159
489
  }
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
449k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
449k
    return df_iterator(GT::getEntryNode(G), S);
159
449k
  }
160
1.49M
  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
281
  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.01k
  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
274k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
Unexecuted instantiation: 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>&)
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
496k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
Unexecuted instantiation: 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>&)
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
274k
  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
489
  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
449k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
161
162
75.2M
  bool operator==(const df_iterator &x) const {
163
75.2M
    return VisitStack == x.VisitStack;
164
75.2M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator==(llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > const&) const
Line
Count
Source
162
4.50M
  bool operator==(const df_iterator &x) const {
163
4.50M
    return VisitStack == x.VisitStack;
164
4.50M
  }
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
965k
  bool operator==(const df_iterator &x) const {
163
965k
    return VisitStack == x.VisitStack;
164
965k
  }
Unexecuted instantiation: 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
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
21.3M
  bool operator==(const df_iterator &x) const {
163
21.3M
    return VisitStack == x.VisitStack;
164
21.3M
  }
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
1.95M
  bool operator==(const df_iterator &x) const {
163
1.95M
    return VisitStack == x.VisitStack;
164
1.95M
  }
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
5.40k
  bool operator==(const df_iterator &x) const {
163
5.40k
    return VisitStack == x.VisitStack;
164
5.40k
  }
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
30.6M
  bool operator==(const df_iterator &x) const {
163
30.6M
    return VisitStack == x.VisitStack;
164
30.6M
  }
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
62
  bool operator==(const df_iterator &x) const {
163
62
    return VisitStack == x.VisitStack;
164
62
  }
Unexecuted instantiation: 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
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
11.4k
  bool operator==(const df_iterator &x) const {
163
11.4k
    return VisitStack == x.VisitStack;
164
11.4k
  }
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
  }
Unexecuted instantiation: 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
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
10.9k
  bool operator==(const df_iterator &x) const {
163
10.9k
    return VisitStack == x.VisitStack;
164
10.9k
  }
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
2.77M
  bool operator==(const df_iterator &x) const {
163
2.77M
    return VisitStack == x.VisitStack;
164
2.77M
  }
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
Unexecuted instantiation: 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
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
5.45M
  bool operator==(const df_iterator &x) const {
163
5.45M
    return VisitStack == x.VisitStack;
164
5.45M
  }
Unexecuted instantiation: 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
Unexecuted instantiation: 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
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
2.74M
  bool operator==(const df_iterator &x) const {
163
2.74M
    return VisitStack == x.VisitStack;
164
2.74M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
162
1.17k
  bool operator==(const df_iterator &x) const {
163
1.17k
    return VisitStack == x.VisitStack;
164
1.17k
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator==(llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
162
3.34M
  bool operator==(const df_iterator &x) const {
163
3.34M
    return VisitStack == x.VisitStack;
164
3.34M
  }
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
1.38M
  bool operator==(const df_iterator &x) const {
163
1.38M
    return VisitStack == x.VisitStack;
164
1.38M
  }
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
12
  bool operator==(const df_iterator &x) const {
163
12
    return VisitStack == x.VisitStack;
164
12
  }
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
124k
  bool operator==(const df_iterator &x) const {
163
124k
    return VisitStack == x.VisitStack;
164
124k
  }
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
75.2M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator!=(llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > const&) const
Line
Count
Source
165
4.50M
  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
965k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: 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
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
21.3M
  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
1.95M
  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
5.40k
  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
30.6M
  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
62
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: 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
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
11.4k
  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); }
Unexecuted instantiation: 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
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
10.9k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
2.77M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator!=(llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator!=(llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> > const&) const
Unexecuted instantiation: 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
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
5.45M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: 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
Unexecuted instantiation: 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
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
2.74M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
165
1.17k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator!=(llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
165
3.34M
  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
1.38M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator!=(llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > const&) const
Line
Count
Source
165
12
  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
124k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator!=(llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > const&) const
166
167
65.7M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator*() const
Line
Count
Source
167
4.01M
  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
560k
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator*() const
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.7M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator*() const
Line
Count
Source
167
1.88M
  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.12k
  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
26.6M
  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
52
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator*() const
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator*() const
Line
Count
Source
167
15.6k
  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; }
Unexecuted instantiation: llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator*() const
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
7.89k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
2.50M
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator*() const
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator*() const
Line
Count
Source
167
4.96M
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator*() const
Line
Count
Source
167
2.47M
  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
805
  const NodeRef &operator*() const { return VisitStack.back().first; }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator*() const
Line
Count
Source
167
2.89M
  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
982k
  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
6
  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
69.5k
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator*() const
168
169
  // This is a nonstandard operator-> that dereferences the pointer an extra
170
  // time... so that you can actually call methods ON the Node, because
171
  // the contained type is a pointer.  This allows BBIt->getTerminator() f.e.
172
  //
173
13.8k
  NodeRef operator->() const { return **this; }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator->() const
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator->() const
Line
Count
Source
173
13.8k
  NodeRef operator->() const { return **this; }
174
175
65.3M
  df_iterator &operator++() { // Preincrement
176
65.3M
    toNext();
177
65.3M
    return *this;
178
65.3M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator++()
Line
Count
Source
175
4.01M
  df_iterator &operator++() { // Preincrement
176
4.01M
    toNext();
177
4.01M
    return *this;
178
4.01M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator++()
Line
Count
Source
175
560k
  df_iterator &operator++() { // Preincrement
176
560k
    toNext();
177
560k
    return *this;
178
560k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator++()
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
18.7M
  df_iterator &operator++() { // Preincrement
176
18.7M
    toNext();
177
18.7M
    return *this;
178
18.7M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
1.88M
  df_iterator &operator++() { // Preincrement
176
1.88M
    toNext();
177
1.88M
    return *this;
178
1.88M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
5.12k
  df_iterator &operator++() { // Preincrement
176
5.12k
    toNext();
177
5.12k
    return *this;
178
5.12k
  }
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
26.6M
  df_iterator &operator++() { // Preincrement
176
26.6M
    toNext();
177
26.6M
    return *this;
178
26.6M
  }
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
52
  df_iterator &operator++() { // Preincrement
176
52
    toNext();
177
52
    return *this;
178
52
  }
Unexecuted instantiation: 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*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator++()
Line
Count
Source
175
8.69k
  df_iterator &operator++() { // Preincrement
176
8.69k
    toNext();
177
8.69k
    return *this;
178
8.69k
  }
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
  }
Unexecuted instantiation: 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::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
4.55k
  df_iterator &operator++() { // Preincrement
176
4.55k
    toNext();
177
4.55k
    return *this;
178
4.55k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
2.50M
  df_iterator &operator++() { // Preincrement
176
2.50M
    toNext();
177
2.50M
    return *this;
178
2.50M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator++()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator++()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator++()
Unexecuted instantiation: 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*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
4.96M
  df_iterator &operator++() { // Preincrement
176
4.96M
    toNext();
177
4.96M
    return *this;
178
4.96M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator++()
Unexecuted instantiation: 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::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
175
2.47M
  df_iterator &operator++() { // Preincrement
176
2.47M
    toNext();
177
2.47M
    return *this;
178
2.47M
  }
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
686
  df_iterator &operator++() { // Preincrement
176
686
    toNext();
177
686
    return *this;
178
686
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
2.89M
  df_iterator &operator++() { // Preincrement
176
2.89M
    toNext();
177
2.89M
    return *this;
178
2.89M
  }
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
525k
  df_iterator &operator++() { // Preincrement
176
525k
    toNext();
177
525k
    return *this;
178
525k
  }
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
6
  df_iterator &operator++() { // Preincrement
176
6
    toNext();
177
6
    return *this;
178
6
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator++()
Line
Count
Source
175
69.5k
  df_iterator &operator++() { // Preincrement
176
69.5k
    toNext();
177
69.5k
    return *this;
178
69.5k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator++()
179
180
  /// Skips all children of the current node and traverses to next node
181
  ///
182
  /// Note: This function takes care of incrementing the iterator. If you
183
  /// always increment and call this function, you risk walking off the end.
184
418k
  df_iterator &skipChildren() {
185
418k
    VisitStack.pop_back();
186
418k
    if (!VisitStack.empty())
187
416k
      toNext();
188
418k
    return *this;
189
418k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::skipChildren()
Line
Count
Source
184
3.34k
  df_iterator &skipChildren() {
185
3.34k
    VisitStack.pop_back();
186
3.34k
    if (!VisitStack.empty())
187
778
      toNext();
188
3.34k
    return *this;
189
3.34k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::skipChildren()
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
415k
  df_iterator &skipChildren() {
185
415k
    VisitStack.pop_back();
186
415k
    if (!VisitStack.empty())
187
415k
      toNext();
188
415k
    return *this;
189
415k
  }
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
0
  bool nodeVisited(NodeRef Node) const {
202
0
    return this->Visited.count(Node) != 0;
203
0
  }
204
205
  /// getPathLength - Return the length of the path from the entry node to the
206
  /// current node, counting both nodes.
207
4.70M
  unsigned getPathLength() const { return VisitStack.size(); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::getPathLength() const
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::getPathLength() const
Line
Count
Source
207
4.70M
  unsigned getPathLength() const { return VisitStack.size(); }
Unexecuted instantiation: 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
208
209
  /// getPath - Return the n'th node in the path from the entry node to the
210
  /// current node.
211
2.23M
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
Unexecuted instantiation: 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
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::getPath(unsigned int) const
Line
Count
Source
211
2.23M
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
Unexecuted instantiation: 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
212
};
213
214
// Provide global constructors that automatically figure out correct types...
215
//
216
template <class T>
217
7.57M
df_iterator<T> df_begin(const T& G) {
218
7.57M
  return df_iterator<T>::begin(G);
219
7.57M
}
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
480k
df_iterator<T> df_begin(const T& G) {
218
480k
  return df_iterator<T>::begin(G);
219
480k
}
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
3.96M
df_iterator<T> df_begin(const T& G) {
218
3.96M
  return df_iterator<T>::begin(G);
219
3.96M
}
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
404k
df_iterator<T> df_begin(const T& G) {
218
404k
  return df_iterator<T>::begin(G);
219
404k
}
Unexecuted instantiation: 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&)
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.59M
df_iterator<T> df_begin(const T& G) {
218
2.59M
  return df_iterator<T>::begin(G);
219
2.59M
}
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
69.7k
df_iterator<T> df_begin(const T& G) {
218
69.7k
  return df_iterator<T>::begin(G);
219
69.7k
}
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
10
df_iterator<T> df_begin(const T& G) {
218
10
  return df_iterator<T>::begin(G);
219
10
}
Unexecuted instantiation: 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&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_begin<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_begin<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
Unexecuted instantiation: 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&)
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
6
df_iterator<T> df_begin(const T& G) {
218
6
  return df_iterator<T>::begin(G);
219
6
}
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
55.2k
df_iterator<T> df_begin(const T& G) {
218
55.2k
  return df_iterator<T>::begin(G);
219
55.2k
}
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
7.57M
df_iterator<T> df_end(const T& G) {
223
7.57M
  return df_iterator<T>::end(G);
224
7.57M
}
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
480k
df_iterator<T> df_end(const T& G) {
223
480k
  return df_iterator<T>::end(G);
224
480k
}
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
3.96M
df_iterator<T> df_end(const T& G) {
223
3.96M
  return df_iterator<T>::end(G);
224
3.96M
}
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
404k
df_iterator<T> df_end(const T& G) {
223
404k
  return df_iterator<T>::end(G);
224
404k
}
Unexecuted instantiation: 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&)
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.59M
df_iterator<T> df_end(const T& G) {
223
2.59M
  return df_iterator<T>::end(G);
224
2.59M
}
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
69.7k
df_iterator<T> df_end(const T& G) {
223
69.7k
  return df_iterator<T>::end(G);
224
69.7k
}
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
10
df_iterator<T> df_end(const T& G) {
223
10
  return df_iterator<T>::end(G);
224
10
}
Unexecuted instantiation: 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&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_end<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_end<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
Unexecuted instantiation: 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&)
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
6
df_iterator<T> df_end(const T& G) {
223
6
  return df_iterator<T>::end(G);
224
6
}
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
55.2k
df_iterator<T> df_end(const T& G) {
223
55.2k
  return df_iterator<T>::end(G);
224
55.2k
}
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > llvm::df_end<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
225
226
// Provide an accessor method to use them in range-based patterns.
227
template <class T>
228
7.41M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
7.41M
  return make_range(df_begin(G), df_end(G));
230
7.41M
}
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
480k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
480k
  return make_range(df_begin(G), df_end(G));
230
480k
}
Unexecuted instantiation: 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&)
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
69.7k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
69.7k
  return make_range(df_begin(G), df_end(G));
230
69.7k
}
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
267k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
267k
  return make_range(df_begin(G), df_end(G));
230
267k
}
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
3.96M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
3.96M
  return make_range(df_begin(G), df_end(G));
230
3.96M
}
Unexecuted instantiation: 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&)
Unexecuted instantiation: 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&)
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.57M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
2.57M
  return make_range(df_begin(G), df_end(G));
230
2.57M
}
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
6
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
6
  return make_range(df_begin(G), df_end(G));
230
6
}
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
55.2k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
55.2k
  return make_range(df_begin(G), df_end(G));
230
55.2k
}
Unexecuted instantiation: llvm::iterator_range<llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > > llvm::depth_first<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
231
232
// Provide global definitions of external depth first iterators...
233
template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
234
struct df_ext_iterator : public df_iterator<T, SetTy, true> {
235
  df_ext_iterator(const df_iterator<T, SetTy, true> &V)
236
2.99M
    : 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
562
    : 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
6.03k
    : 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
548k
    : df_iterator<T, SetTy, true>(V) {}
Unexecuted instantiation: 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&)
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
992k
    : 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
548k
    : 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
898k
    : df_iterator<T, SetTy, true>(V) {}
237
};
238
239
template <class T, class SetTy>
240
1.49M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
1.49M
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
1.49M
}
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
281
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
281
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
281
}
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.01k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
3.01k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
3.01k
}
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
274k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
274k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
274k
}
Unexecuted instantiation: 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>&)
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
496k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
496k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
496k
}
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
274k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
274k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
274k
}
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
449k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
449k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
449k
}
243
244
template <class T, class SetTy>
245
1.49M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
1.49M
  return df_ext_iterator<T, SetTy>::end(G, S);
247
1.49M
}
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
281
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
281
  return df_ext_iterator<T, SetTy>::end(G, S);
247
281
}
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.01k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
3.01k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
3.01k
}
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
274k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
274k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
274k
}
Unexecuted instantiation: 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>&)
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
496k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
496k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
496k
}
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
274k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
274k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
274k
}
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
449k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
449k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
449k
}
248
249
template <class T, class SetTy>
250
iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G,
251
1.27M
                                                          SetTy &S) {
252
1.27M
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
1.27M
}
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
281
                                                          SetTy &S) {
252
281
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
281
}
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
274k
                                                          SetTy &S) {
252
274k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
274k
}
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
274k
                                                          SetTy &S) {
252
274k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
274k
}
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
274k
                                                          SetTy &S) {
252
274k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
274k
}
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
449k
                                                          SetTy &S) {
252
449k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
449k
}
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
898k
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
Unexecuted instantiation: 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&)
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
978
    : 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
897k
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
263
};
264
265
template <class T>
266
448k
idf_iterator<T> idf_begin(const T& G) {
267
448k
  return idf_iterator<T>::begin(Inverse<T>(G));
268
448k
}
269
270
template <class T>
271
448k
idf_iterator<T> idf_end(const T& G){
272
448k
  return idf_iterator<T>::end(Inverse<T>(G));
273
448k
}
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
978
    : idf_iterator<T, SetTy, true>(V) {}
Unexecuted instantiation: 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&)
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
978
    : idf_iterator<T, SetTy, true>(V) {}
288
};
289
290
template <class T, class SetTy>
291
489
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
489
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
489
}
Unexecuted instantiation: 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>&)
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
489
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
489
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
489
}
294
295
template <class T, class SetTy>
296
489
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
489
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
489
}
Unexecuted instantiation: 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>&)
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
489
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
489
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
489
}
299
300
template <class T, class SetTy>
301
iterator_range<idf_ext_iterator<T, SetTy>> inverse_depth_first_ext(const T& G,
302
489
                                                                   SetTy &S) {
303
489
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
489
}
Unexecuted instantiation: 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>&)
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
489
                                                                   SetTy &S) {
303
489
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
489
}
305
306
} // end namespace llvm
307
308
#endif // LLVM_ADT_DEPTHFIRSTITERATOR_H