Coverage Report

Created: 2018-07-19 03:59

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/ADT/DepthFirstIterator.h
Line
Count
Source
1
//===- llvm/ADT/DepthFirstIterator.h - Depth First iterator -----*- C++ -*-===//
2
//
3
//                     The LLVM Compiler Infrastructure
4
//
5
// This file is distributed under the University of Illinois Open Source
6
// License. See LICENSE.TXT for details.
7
//
8
//===----------------------------------------------------------------------===//
9
//
10
// This file builds on the ADT/GraphTraits.h file to build generic depth
11
// first graph iterator.  This file exposes the following functions/types:
12
//
13
// df_begin/df_end/df_iterator
14
//   * Normal depth-first iteration - visit a node and then all of its children.
15
//
16
// idf_begin/idf_end/idf_iterator
17
//   * Depth-first iteration on the 'inverse' graph.
18
//
19
// df_ext_begin/df_ext_end/df_ext_iterator
20
//   * Normal depth-first iteration - visit a node and then all of its children.
21
//     This iterator stores the 'visited' set in an external set, which allows
22
//     it to be more efficient, and allows external clients to use the set for
23
//     other purposes.
24
//
25
// idf_ext_begin/idf_ext_end/idf_ext_iterator
26
//   * Depth-first iteration on the 'inverse' graph.
27
//     This iterator stores the 'visited' set in an external set, which allows
28
//     it to be more efficient, and allows external clients to use the set for
29
//     other purposes.
30
//
31
//===----------------------------------------------------------------------===//
32
33
#ifndef LLVM_ADT_DEPTHFIRSTITERATOR_H
34
#define LLVM_ADT_DEPTHFIRSTITERATOR_H
35
36
#include "llvm/ADT/GraphTraits.h"
37
#include "llvm/ADT/None.h"
38
#include "llvm/ADT/Optional.h"
39
#include "llvm/ADT/SmallPtrSet.h"
40
#include "llvm/ADT/iterator_range.h"
41
#include <iterator>
42
#include <set>
43
#include <utility>
44
#include <vector>
45
46
namespace llvm {
47
48
// df_iterator_storage - A private class which is used to figure out where to
49
// store the visited set.
50
template<class SetType, bool External>   // Non-external set
51
class df_iterator_storage {
52
public:
53
  SetType Visited;
54
};
55
56
template<class SetType>
57
class df_iterator_storage<SetType, true> {
58
public:
59
7.16M
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
59
1.43M
  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
8.80k
  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
913k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
59
2.98M
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
59
959k
  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
906
  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
865k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
60
18.1M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true> const&)
Line
Count
Source
60
4.20M
  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
8.80k
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true> const&)
Line
Count
Source
60
3.65M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true> const&)
Line
Count
Source
60
2.98M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true>::df_iterator_storage(llvm::df_iterator_storage<llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true> const&)
Line
Count
Source
60
3.83M
  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.62k
  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.46M
  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
46.4M
  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
3.94M
  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
550k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::insert(llvm::MachineLoop*)
Line
Count
Source
74
135
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::insert(llvm::BasicBlock*)
Line
Count
Source
74
22.6M
  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.2M
  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
3.13M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::RegionNode*, 8u>::insert(llvm::RegionNode*)
Line
Count
Source
74
13.0k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>::insert(llvm::RegionNode const*)
Line
Count
Source
74
8
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>::insert(llvm::BasicBlock const*)
Line
Count
Source
74
751
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::insert(llvm::Loop const*)
Line
Count
Source
74
1.85k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
14.1k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::insert(llvm::MachineBasicBlock*)
Line
Count
Source
74
3.78M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::insert(llvm::MachineRegionNode*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::insert(llvm::MachineRegionNode const*)
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::insert(llvm::MachineBasicBlock const*)
Line
Count
Source
74
2.02M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>::insert(llvm::BasicBlock*)
Line
Count
Source
74
1.12k
  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
72.8k
  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
34.5M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
78
3.94M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop*, 8u>::completed(llvm::Loop*)
Line
Count
Source
78
550k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::completed(llvm::MachineLoop*)
Line
Count
Source
78
135
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
15.2M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
6.99M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
78
3.13M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>::completed(llvm::BasicBlock const*)
Line
Count
Source
78
373
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>::completed(llvm::RegionNode const*)
Line
Count
Source
78
8
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::RegionNode*, 8u>::completed(llvm::RegionNode*)
Line
Count
Source
78
10.6k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::completed(llvm::Loop const*)
Line
Count
Source
78
1.85k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
5.93k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
78
2.67M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::completed(llvm::MachineBasicBlock const*)
Line
Count
Source
78
1.86M
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>::completed(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>::completed(llvm::MachineRegionNode*)
llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>::completed(llvm::BasicBlock*)
Line
Count
Source
78
530
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::completed(llvm::VPBlockBase*)
Line
Count
Source
78
70.4k
  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
3.45M
  inline df_iterator(NodeRef Node) {
103
3.45M
    this->Visited.insert(Node);
104
3.45M
    VisitStack.push_back(StackElement(Node, None));
105
3.45M
  }
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
503k
  inline df_iterator(NodeRef Node) {
103
503k
    this->Visited.insert(Node);
104
503k
    VisitStack.push_back(StackElement(Node, None));
105
503k
  }
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
399k
  inline df_iterator(NodeRef Node) {
103
399k
    this->Visited.insert(Node);
104
399k
    VisitStack.push_back(StackElement(Node, None));
105
399k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::df_iterator(llvm::MachineLoop*)
Line
Count
Source
102
123
  inline df_iterator(NodeRef Node) {
103
123
    this->Visited.insert(Node);
104
123
    VisitStack.push_back(StackElement(Node, None));
105
123
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::df_iterator(llvm::BasicBlock*)
Line
Count
Source
102
1.66M
  inline df_iterator(NodeRef Node) {
103
1.66M
    this->Visited.insert(Node);
104
1.66M
    VisitStack.push_back(StackElement(Node, None));
105
1.66M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*)
Line
Count
Source
102
19
  inline df_iterator(NodeRef Node) {
103
19
    this->Visited.insert(Node);
104
19
    VisitStack.push_back(StackElement(Node, None));
105
19
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::df_iterator(llvm::MachineBasicBlock*)
Line
Count
Source
102
19
  inline df_iterator(NodeRef Node) {
103
19
    this->Visited.insert(Node);
104
19
    VisitStack.push_back(StackElement(Node, None));
105
19
  }
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
111k
  inline df_iterator(NodeRef Node) {
103
111k
    this->Visited.insert(Node);
104
111k
    VisitStack.push_back(StackElement(Node, None));
105
111k
  }
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
643k
  inline df_iterator(NodeRef Node) {
103
643k
    this->Visited.insert(Node);
104
643k
    VisitStack.push_back(StackElement(Node, None));
105
643k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::df_iterator(llvm::RegionNode*)
Line
Count
Source
102
4.10k
  inline df_iterator(NodeRef Node) {
103
4.10k
    this->Visited.insert(Node);
104
4.10k
    VisitStack.push_back(StackElement(Node, None));
105
4.10k
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::df_iterator(llvm::RegionNode const*)
Line
Count
Source
102
4
  inline df_iterator(NodeRef Node) {
103
4
    this->Visited.insert(Node);
104
4
    VisitStack.push_back(StackElement(Node, None));
105
4
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::df_iterator(llvm::BasicBlock const*)
Line
Count
Source
102
14
  inline df_iterator(NodeRef Node) {
103
14
    this->Visited.insert(Node);
104
14
    VisitStack.push_back(StackElement(Node, None));
105
14
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::df_iterator(llvm::RegionNode*)
Line
Count
Source
102
1
  inline df_iterator(NodeRef Node) {
103
1
    this->Visited.insert(Node);
104
1
    VisitStack.push_back(StackElement(Node, None));
105
1
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::df_iterator(llvm::Loop const*)
Line
Count
Source
102
1.71k
  inline df_iterator(NodeRef Node) {
103
1.71k
    this->Visited.insert(Node);
104
1.71k
    VisitStack.push_back(StackElement(Node, None));
105
1.71k
  }
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 const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator(llvm::MachineBasicBlock const*)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::BasicBlock*)
Line
Count
Source
102
200
  inline df_iterator(NodeRef Node) {
103
200
    this->Visited.insert(Node);
104
200
    VisitStack.push_back(StackElement(Node, None));
105
200
  }
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
308
  inline df_iterator(NodeRef Node) {
103
308
    this->Visited.insert(Node);
104
308
    VisitStack.push_back(StackElement(Node, None));
105
308
  }
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
70.9k
  inline df_iterator(NodeRef Node) {
103
70.9k
    this->Visited.insert(Node);
104
70.9k
    VisitStack.push_back(StackElement(Node, None));
105
70.9k
  }
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.6k
  inline df_iterator(NodeRef Node) {
103
55.6k
    this->Visited.insert(Node);
104
55.6k
    VisitStack.push_back(StackElement(Node, None));
105
55.6k
  }
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
3.45M
  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
503k
  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
399k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::df_iterator()
Line
Count
Source
107
123
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::df_iterator()
Line
Count
Source
107
1.66M
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator()
Line
Count
Source
107
19
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::df_iterator()
Line
Count
Source
107
19
  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
111k
  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
643k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::df_iterator()
Line
Count
Source
107
4.10k
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::df_iterator()
Line
Count
Source
107
4
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::df_iterator()
Line
Count
Source
107
14
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::df_iterator()
Line
Count
Source
107
1
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::df_iterator()
Line
Count
Source
107
1.71k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator()
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator()
Line
Count
Source
107
200
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::df_iterator()
Line
Count
Source
107
308
  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
70.9k
  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.6k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::df_iterator()
108
109
  inline df_iterator(NodeRef Node, SetType &S)
110
3.58M
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
3.58M
    if (this->Visited.insert(Node).second)
112
3.58M
      VisitStack.push_back(StackElement(Node, None));
113
3.58M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
110
1.56k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
1.56k
    if (this->Visited.insert(Node).second)
112
1.56k
      VisitStack.push_back(StackElement(Node, None));
113
1.56k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
110
4.40k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
4.40k
    if (this->Visited.insert(Node).second)
112
4.28k
      VisitStack.push_back(StackElement(Node, None));
113
4.40k
  }
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
456k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
456k
    if (this->Visited.insert(Node).second)
112
456k
      VisitStack.push_back(StackElement(Node, None));
113
456k
  }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::df_iterator(llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
110
1.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::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
713k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
713k
    if (this->Visited.insert(Node).second)
112
713k
      VisitStack.push_back(StackElement(Node, None));
113
713k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
110
290
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
290
    if (this->Visited.insert(Node).second)
112
290
      VisitStack.push_back(StackElement(Node, None));
113
290
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
110
479k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
479k
    if (this->Visited.insert(Node).second)
112
479k
      VisitStack.push_back(StackElement(Node, None));
113
479k
  }
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
453
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
453
    if (this->Visited.insert(Node).second)
112
314
      VisitStack.push_back(StackElement(Node, None));
113
453
  }
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
432k
      : df_iterator_storage<SetType, ExtStorage>(S) {
111
432k
    if (this->Visited.insert(Node).second)
112
432k
      VisitStack.push_back(StackElement(Node, None));
113
432k
  }
114
115
  inline df_iterator(SetType &S)
116
3.58M
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
3.58M
    // End is when stack is empty
118
3.58M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
116
1.56k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
1.56k
    // End is when stack is empty
118
1.56k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
116
4.40k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
4.40k
    // End is when stack is empty
118
4.40k
  }
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
456k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
456k
    // End is when stack is empty
118
456k
  }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::df_iterator(llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
116
1.49M
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
1.49M
    // End is when stack is empty
118
1.49M
  }
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
713k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
713k
    // End is when stack is empty
118
713k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
116
290
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
290
    // End is when stack is empty
118
290
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
116
479k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
479k
    // End is when stack is empty
118
479k
  }
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
453
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
453
    // End is when stack is empty
118
453
  }
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
432k
    : df_iterator_storage<SetType, ExtStorage>(S) {
117
432k
    // End is when stack is empty
118
432k
  }
119
120
37.3M
  inline void toNext() {
121
67.6M
    do {
122
67.6M
      NodeRef Node = VisitStack.back().first;
123
67.6M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
67.6M
125
67.6M
      if (!Opt)
126
37.3M
        Opt.emplace(GT::child_begin(Node));
127
67.6M
128
67.6M
      // Notice that we directly mutate *Opt here, so that
129
67.6M
      // VisitStack.back().second actually gets updated as the iterator
130
67.6M
      // increases.
131
80.7M
      while (*Opt != GT::child_end(Node)) {
132
43.4M
        NodeRef Next = *(*Opt)++;
133
43.4M
        // Has our next sibling been visited?
134
43.4M
        if (this->Visited.insert(Next).second) {
135
30.2M
          // No, do it now.
136
30.2M
          VisitStack.push_back(StackElement(Next, None));
137
30.2M
          return;
138
30.2M
        }
139
43.4M
      }
140
67.6M
      this->Visited.completed(Node);
141
37.3M
142
37.3M
      // Oops, ran out of successors... go up a level on the stack.
143
37.3M
      VisitStack.pop_back();
144
37.3M
    } while (!VisitStack.empty());
145
37.3M
  }
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
3.94M
  inline void toNext() {
121
7.38M
    do {
122
7.38M
      NodeRef Node = VisitStack.back().first;
123
7.38M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.38M
125
7.38M
      if (!Opt)
126
3.94M
        Opt.emplace(GT::child_begin(Node));
127
7.38M
128
7.38M
      // Notice that we directly mutate *Opt here, so that
129
7.38M
      // VisitStack.back().second actually gets updated as the iterator
130
7.38M
      // increases.
131
7.38M
      while (*Opt != GT::child_end(Node)) {
132
3.43M
        NodeRef Next = *(*Opt)++;
133
3.43M
        // Has our next sibling been visited?
134
3.43M
        if (this->Visited.insert(Next).second) {
135
3.43M
          // No, do it now.
136
3.43M
          VisitStack.push_back(StackElement(Next, None));
137
3.43M
          return;
138
3.43M
        }
139
3.43M
      }
140
7.38M
      this->Visited.completed(Node);
141
3.94M
142
3.94M
      // Oops, ran out of successors... go up a level on the stack.
143
3.94M
      VisitStack.pop_back();
144
3.94M
    } while (!VisitStack.empty());
145
3.94M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::toNext()
Line
Count
Source
120
550k
  inline void toNext() {
121
701k
    do {
122
701k
      NodeRef Node = VisitStack.back().first;
123
701k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
701k
125
701k
      if (!Opt)
126
550k
        Opt.emplace(GT::child_begin(Node));
127
701k
128
701k
      // Notice that we directly mutate *Opt here, so that
129
701k
      // VisitStack.back().second actually gets updated as the iterator
130
701k
      // increases.
131
701k
      while (*Opt != GT::child_end(Node)) {
132
150k
        NodeRef Next = *(*Opt)++;
133
150k
        // Has our next sibling been visited?
134
150k
        if (this->Visited.insert(Next).second) {
135
150k
          // No, do it now.
136
150k
          VisitStack.push_back(StackElement(Next, None));
137
150k
          return;
138
150k
        }
139
150k
      }
140
701k
      this->Visited.completed(Node);
141
550k
142
550k
      // Oops, ran out of successors... go up a level on the stack.
143
550k
      VisitStack.pop_back();
144
550k
    } while (!VisitStack.empty());
145
550k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::toNext()
Line
Count
Source
120
135
  inline void toNext() {
121
147
    do {
122
147
      NodeRef Node = VisitStack.back().first;
123
147
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
147
125
147
      if (!Opt)
126
135
        Opt.emplace(GT::child_begin(Node));
127
147
128
147
      // Notice that we directly mutate *Opt here, so that
129
147
      // VisitStack.back().second actually gets updated as the iterator
130
147
      // increases.
131
147
      while (*Opt != GT::child_end(Node)) {
132
12
        NodeRef Next = *(*Opt)++;
133
12
        // Has our next sibling been visited?
134
12
        if (this->Visited.insert(Next).second) {
135
12
          // No, do it now.
136
12
          VisitStack.push_back(StackElement(Next, None));
137
12
          return;
138
12
        }
139
12
      }
140
147
      this->Visited.completed(Node);
141
135
142
135
      // Oops, ran out of successors... go up a level on the stack.
143
135
      VisitStack.pop_back();
144
135
    } while (!VisitStack.empty());
145
135
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
12.5M
  inline void toNext() {
121
23.5M
    do {
122
23.5M
      NodeRef Node = VisitStack.back().first;
123
23.5M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
23.5M
125
23.5M
      if (!Opt)
126
12.5M
        Opt.emplace(GT::child_begin(Node));
127
23.5M
128
23.5M
      // Notice that we directly mutate *Opt here, so that
129
23.5M
      // VisitStack.back().second actually gets updated as the iterator
130
23.5M
      // increases.
131
29.7M
      while (*Opt != GT::child_end(Node)) {
132
17.1M
        NodeRef Next = *(*Opt)++;
133
17.1M
        // Has our next sibling been visited?
134
17.1M
        if (this->Visited.insert(Next).second) {
135
10.9M
          // No, do it now.
136
10.9M
          VisitStack.push_back(StackElement(Next, None));
137
10.9M
          return;
138
10.9M
        }
139
17.1M
      }
140
23.5M
      this->Visited.completed(Node);
141
12.5M
142
12.5M
      // Oops, ran out of successors... go up a level on the stack.
143
12.5M
      VisitStack.pop_back();
144
12.5M
    } while (!VisitStack.empty());
145
12.5M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
32
  inline void toNext() {
121
45
    do {
122
45
      NodeRef Node = VisitStack.back().first;
123
45
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
45
125
45
      if (!Opt)
126
32
        Opt.emplace(GT::child_begin(Node));
127
45
128
45
      // Notice that we directly mutate *Opt here, so that
129
45
      // VisitStack.back().second actually gets updated as the iterator
130
45
      // increases.
131
47
      while (*Opt != GT::child_end(Node)) {
132
15
        NodeRef Next = *(*Opt)++;
133
15
        // Has our next sibling been visited?
134
15
        if (this->Visited.insert(Next).second) {
135
13
          // No, do it now.
136
13
          VisitStack.push_back(StackElement(Next, None));
137
13
          return;
138
13
        }
139
15
      }
140
45
      this->Visited.completed(Node);
141
32
142
32
      // Oops, ran out of successors... go up a level on the stack.
143
32
      VisitStack.pop_back();
144
32
    } while (!VisitStack.empty());
145
32
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::toNext()
Line
Count
Source
120
28
  inline void toNext() {
121
37
    do {
122
37
      NodeRef Node = VisitStack.back().first;
123
37
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
37
125
37
      if (!Opt)
126
28
        Opt.emplace(GT::child_begin(Node));
127
37
128
37
      // Notice that we directly mutate *Opt here, so that
129
37
      // VisitStack.back().second actually gets updated as the iterator
130
37
      // increases.
131
37
      while (*Opt != GT::child_end(Node)) {
132
9
        NodeRef Next = *(*Opt)++;
133
9
        // Has our next sibling been visited?
134
9
        if (this->Visited.insert(Next).second) {
135
9
          // No, do it now.
136
9
          VisitStack.push_back(StackElement(Next, None));
137
9
          return;
138
9
        }
139
9
      }
140
37
      this->Visited.completed(Node);
141
28
142
28
      // Oops, ran out of successors... go up a level on the stack.
143
28
      VisitStack.pop_back();
144
28
    } while (!VisitStack.empty());
145
28
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
1.85M
  inline void toNext() {
121
3.60M
    do {
122
3.60M
      NodeRef Node = VisitStack.back().first;
123
3.60M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
3.60M
125
3.60M
      if (!Opt)
126
1.85M
        Opt.emplace(GT::child_begin(Node));
127
3.60M
128
3.60M
      // Notice that we directly mutate *Opt here, so that
129
3.60M
      // VisitStack.back().second actually gets updated as the iterator
130
3.60M
      // increases.
131
4.64M
      while (*Opt != GT::child_end(Node)) {
132
2.78M
        NodeRef Next = *(*Opt)++;
133
2.78M
        // Has our next sibling been visited?
134
2.78M
        if (this->Visited.insert(Next).second) {
135
1.74M
          // No, do it now.
136
1.74M
          VisitStack.push_back(StackElement(Next, None));
137
1.74M
          return;
138
1.74M
        }
139
2.78M
      }
140
3.60M
      this->Visited.completed(Node);
141
1.85M
142
1.85M
      // Oops, ran out of successors... go up a level on the stack.
143
1.85M
      VisitStack.pop_back();
144
1.85M
    } while (!VisitStack.empty());
145
1.85M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
7.14k
  inline void toNext() {
121
12.7k
    do {
122
12.7k
      NodeRef Node = VisitStack.back().first;
123
12.7k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
12.7k
125
12.7k
      if (!Opt)
126
7.14k
        Opt.emplace(GT::child_begin(Node));
127
12.7k
128
12.7k
      // Notice that we directly mutate *Opt here, so that
129
12.7k
      // VisitStack.back().second actually gets updated as the iterator
130
12.7k
      // increases.
131
15.6k
      while (*Opt != GT::child_end(Node)) {
132
8.45k
        NodeRef Next = *(*Opt)++;
133
8.45k
        // Has our next sibling been visited?
134
8.45k
        if (this->Visited.insert(Next).second) {
135
5.57k
          // No, do it now.
136
5.57k
          VisitStack.push_back(StackElement(Next, None));
137
5.57k
          return;
138
5.57k
        }
139
8.45k
      }
140
12.7k
      this->Visited.completed(Node);
141
7.14k
142
7.14k
      // Oops, ran out of successors... go up a level on the stack.
143
7.14k
      VisitStack.pop_back();
144
7.14k
    } while (!VisitStack.empty());
145
7.14k
  }
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
3.05M
  inline void toNext() {
121
5.46M
    do {
122
5.46M
      NodeRef Node = VisitStack.back().first;
123
5.46M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
5.46M
125
5.46M
      if (!Opt)
126
3.05M
        Opt.emplace(GT::child_begin(Node));
127
5.46M
128
5.46M
      // Notice that we directly mutate *Opt here, so that
129
5.46M
      // VisitStack.back().second actually gets updated as the iterator
130
5.46M
      // increases.
131
5.46M
      while (*Opt != GT::child_end(Node)) {
132
2.40M
        NodeRef Next = *(*Opt)++;
133
2.40M
        // Has our next sibling been visited?
134
2.40M
        if (this->Visited.insert(Next).second) {
135
2.40M
          // No, do it now.
136
2.40M
          VisitStack.push_back(StackElement(Next, None));
137
2.40M
          return;
138
2.40M
        }
139
2.40M
      }
140
5.46M
      this->Visited.completed(Node);
141
3.05M
142
3.05M
      // Oops, ran out of successors... go up a level on the stack.
143
3.05M
      VisitStack.pop_back();
144
3.05M
    } while (!VisitStack.empty());
145
3.05M
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::toNext()
Line
Count
Source
120
62
  inline void toNext() {
121
110
    do {
122
110
      NodeRef Node = VisitStack.back().first;
123
110
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
110
125
110
      if (!Opt)
126
62
        Opt.emplace(GT::child_begin(Node));
127
110
128
110
      // Notice that we directly mutate *Opt here, so that
129
110
      // VisitStack.back().second actually gets updated as the iterator
130
110
      // increases.
131
144
      while (*Opt != GT::child_end(Node)) {
132
82
        NodeRef Next = *(*Opt)++;
133
82
        // Has our next sibling been visited?
134
82
        if (this->Visited.insert(Next).second) {
135
48
          // No, do it now.
136
48
          VisitStack.push_back(StackElement(Next, None));
137
48
          return;
138
48
        }
139
82
      }
140
110
      this->Visited.completed(Node);
141
62
142
62
      // Oops, ran out of successors... go up a level on the stack.
143
62
      VisitStack.pop_back();
144
62
    } while (!VisitStack.empty());
145
62
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::toNext()
Line
Count
Source
120
8
  inline void toNext() {
121
12
    do {
122
12
      NodeRef Node = VisitStack.back().first;
123
12
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
12
125
12
      if (!Opt)
126
8
        Opt.emplace(GT::child_begin(Node));
127
12
128
12
      // Notice that we directly mutate *Opt here, so that
129
12
      // VisitStack.back().second actually gets updated as the iterator
130
12
      // increases.
131
12
      while (*Opt != GT::child_end(Node)) {
132
4
        NodeRef Next = *(*Opt)++;
133
4
        // Has our next sibling been visited?
134
4
        if (this->Visited.insert(Next).second) {
135
4
          // No, do it now.
136
4
          VisitStack.push_back(StackElement(Next, None));
137
4
          return;
138
4
        }
139
4
      }
140
12
      this->Visited.completed(Node);
141
8
142
8
      // Oops, ran out of successors... go up a level on the stack.
143
8
      VisitStack.pop_back();
144
8
    } while (!VisitStack.empty());
145
8
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::toNext()
Line
Count
Source
120
10.7k
  inline void toNext() {
121
17.6k
    do {
122
17.6k
      NodeRef Node = VisitStack.back().first;
123
17.6k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
17.6k
125
17.6k
      if (!Opt)
126
10.7k
        Opt.emplace(GT::child_begin(Node));
127
17.6k
128
17.6k
      // Notice that we directly mutate *Opt here, so that
129
17.6k
      // VisitStack.back().second actually gets updated as the iterator
130
17.6k
      // increases.
131
19.6k
      while (*Opt != GT::child_end(Node)) {
132
8.91k
        NodeRef Next = *(*Opt)++;
133
8.91k
        // Has our next sibling been visited?
134
8.91k
        if (this->Visited.insert(Next).second) {
135
6.96k
          // No, do it now.
136
6.96k
          VisitStack.push_back(StackElement(Next, None));
137
6.96k
          return;
138
6.96k
        }
139
8.91k
      }
140
17.6k
      this->Visited.completed(Node);
141
10.6k
142
10.6k
      // Oops, ran out of successors... go up a level on the stack.
143
10.6k
      VisitStack.pop_back();
144
10.6k
    } while (!VisitStack.empty());
145
10.7k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::toNext()
Line
Count
Source
120
9
  inline void toNext() {
121
17
    do {
122
17
      NodeRef Node = VisitStack.back().first;
123
17
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
17
125
17
      if (!Opt)
126
9
        Opt.emplace(GT::child_begin(Node));
127
17
128
17
      // Notice that we directly mutate *Opt here, so that
129
17
      // VisitStack.back().second actually gets updated as the iterator
130
17
      // increases.
131
19
      while (*Opt != GT::child_end(Node)) {
132
10
        NodeRef Next = *(*Opt)++;
133
10
        // Has our next sibling been visited?
134
10
        if (this->Visited.insert(Next).second) {
135
8
          // No, do it now.
136
8
          VisitStack.push_back(StackElement(Next, None));
137
8
          return;
138
8
        }
139
10
      }
140
17
      this->Visited.completed(Node);
141
9
142
9
      // Oops, ran out of successors... go up a level on the stack.
143
9
      VisitStack.pop_back();
144
9
    } while (!VisitStack.empty());
145
9
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::toNext()
Line
Count
Source
120
1.85k
  inline void toNext() {
121
1.98k
    do {
122
1.98k
      NodeRef Node = VisitStack.back().first;
123
1.98k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.98k
125
1.98k
      if (!Opt)
126
1.85k
        Opt.emplace(GT::child_begin(Node));
127
1.98k
128
1.98k
      // Notice that we directly mutate *Opt here, so that
129
1.98k
      // VisitStack.back().second actually gets updated as the iterator
130
1.98k
      // increases.
131
1.98k
      while (*Opt != GT::child_end(Node)) {
132
134
        NodeRef Next = *(*Opt)++;
133
134
        // Has our next sibling been visited?
134
134
        if (this->Visited.insert(Next).second) {
135
134
          // No, do it now.
136
134
          VisitStack.push_back(StackElement(Next, None));
137
134
          return;
138
134
        }
139
134
      }
140
1.98k
      this->Visited.completed(Node);
141
1.85k
142
1.85k
      // Oops, ran out of successors... go up a level on the stack.
143
1.85k
      VisitStack.pop_back();
144
1.85k
    } while (!VisitStack.empty());
145
1.85k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
7.09k
  inline void toNext() {
121
12.3k
    do {
122
12.3k
      NodeRef Node = VisitStack.back().first;
123
12.3k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
12.3k
125
12.3k
      if (!Opt)
126
5.93k
        Opt.emplace(GT::child_begin(Node));
127
12.3k
128
12.3k
      // Notice that we directly mutate *Opt here, so that
129
12.3k
      // VisitStack.back().second actually gets updated as the iterator
130
12.3k
      // increases.
131
15.6k
      while (*Opt != GT::child_end(Node)) {
132
9.75k
        NodeRef Next = *(*Opt)++;
133
9.75k
        // Has our next sibling been visited?
134
9.75k
        if (this->Visited.insert(Next).second) {
135
6.40k
          // No, do it now.
136
6.40k
          VisitStack.push_back(StackElement(Next, None));
137
6.40k
          return;
138
6.40k
        }
139
9.75k
      }
140
12.3k
      this->Visited.completed(Node);
141
5.93k
142
5.93k
      // Oops, ran out of successors... go up a level on the stack.
143
5.93k
      VisitStack.pop_back();
144
5.93k
    } while (!VisitStack.empty());
145
7.09k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
120
2.67M
  inline void toNext() {
121
4.88M
    do {
122
4.88M
      NodeRef Node = VisitStack.back().first;
123
4.88M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
4.88M
125
4.88M
      if (!Opt)
126
2.67M
        Opt.emplace(GT::child_begin(Node));
127
4.88M
128
4.88M
      // Notice that we directly mutate *Opt here, so that
129
4.88M
      // VisitStack.back().second actually gets updated as the iterator
130
4.88M
      // increases.
131
6.00M
      while (*Opt != GT::child_end(Node)) {
132
3.33M
        NodeRef Next = *(*Opt)++;
133
3.33M
        // Has our next sibling been visited?
134
3.33M
        if (this->Visited.insert(Next).second) {
135
2.21M
          // No, do it now.
136
2.21M
          VisitStack.push_back(StackElement(Next, None));
137
2.21M
          return;
138
2.21M
        }
139
3.33M
      }
140
4.88M
      this->Visited.completed(Node);
141
2.67M
142
2.67M
      // Oops, ran out of successors... go up a level on the stack.
143
2.67M
      VisitStack.pop_back();
144
2.67M
    } while (!VisitStack.empty());
145
2.67M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::toNext()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::toNext()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::toNext()
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::toNext()
Line
Count
Source
120
1.86M
  inline void toNext() {
121
2.24M
    do {
122
2.24M
      NodeRef Node = VisitStack.back().first;
123
2.24M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
2.24M
125
2.24M
      if (!Opt)
126
1.86M
        Opt.emplace(GT::child_begin(Node));
127
2.24M
128
2.24M
      // Notice that we directly mutate *Opt here, so that
129
2.24M
      // VisitStack.back().second actually gets updated as the iterator
130
2.24M
      // increases.
131
2.39M
      while (*Opt != GT::child_end(Node)) {
132
529k
        NodeRef Next = *(*Opt)++;
133
529k
        // Has our next sibling been visited?
134
529k
        if (this->Visited.insert(Next).second) {
135
372k
          // No, do it now.
136
372k
          VisitStack.push_back(StackElement(Next, None));
137
372k
          return;
138
372k
        }
139
529k
      }
140
2.24M
      this->Visited.completed(Node);
141
1.86M
142
1.86M
      // Oops, ran out of successors... go up a level on the stack.
143
1.86M
      VisitStack.pop_back();
144
1.86M
    } while (!VisitStack.empty());
145
1.86M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
120
5.13M
  inline void toNext() {
121
9.54M
    do {
122
9.54M
      NodeRef Node = VisitStack.back().first;
123
9.54M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
9.54M
125
9.54M
      if (!Opt)
126
5.13M
        Opt.emplace(GT::child_begin(Node));
127
9.54M
128
9.54M
      // Notice that we directly mutate *Opt here, so that
129
9.54M
      // VisitStack.back().second actually gets updated as the iterator
130
9.54M
      // increases.
131
11.7M
      while (*Opt != GT::child_end(Node)) {
132
6.57M
        NodeRef Next = *(*Opt)++;
133
6.57M
        // Has our next sibling been visited?
134
6.57M
        if (this->Visited.insert(Next).second) {
135
4.41M
          // No, do it now.
136
4.41M
          VisitStack.push_back(StackElement(Next, None));
137
4.41M
          return;
138
4.41M
        }
139
6.57M
      }
140
9.54M
      this->Visited.completed(Node);
141
5.13M
142
5.13M
      // Oops, ran out of successors... go up a level on the stack.
143
5.13M
      VisitStack.pop_back();
144
5.13M
    } while (!VisitStack.empty());
145
5.13M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
120
388
  inline void toNext() {
121
576
    do {
122
576
      NodeRef Node = VisitStack.back().first;
123
576
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
576
125
576
      if (!Opt)
126
388
        Opt.emplace(GT::child_begin(Node));
127
576
128
576
      // Notice that we directly mutate *Opt here, so that
129
576
      // VisitStack.back().second actually gets updated as the iterator
130
576
      // increases.
131
620
      while (*Opt != GT::child_end(Node)) {
132
232
        NodeRef Next = *(*Opt)++;
133
232
        // Has our next sibling been visited?
134
232
        if (this->Visited.insert(Next).second) {
135
188
          // No, do it now.
136
188
          VisitStack.push_back(StackElement(Next, None));
137
188
          return;
138
188
        }
139
232
      }
140
576
      this->Visited.completed(Node);
141
388
142
388
      // Oops, ran out of successors... go up a level on the stack.
143
388
      VisitStack.pop_back();
144
388
    } while (!VisitStack.empty());
145
388
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
Line
Count
Source
120
3.72k
  inline void toNext() {
121
7.15k
    do {
122
7.15k
      NodeRef Node = VisitStack.back().first;
123
7.15k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
7.15k
125
7.15k
      if (!Opt)
126
3.72k
        Opt.emplace(GT::child_begin(Node));
127
7.15k
128
7.15k
      // Notice that we directly mutate *Opt here, so that
129
7.15k
      // VisitStack.back().second actually gets updated as the iterator
130
7.15k
      // increases.
131
7.33k
      while (*Opt != GT::child_end(Node)) {
132
3.61k
        NodeRef Next = *(*Opt)++;
133
3.61k
        // Has our next sibling been visited?
134
3.61k
        if (this->Visited.insert(Next).second) {
135
3.43k
          // No, do it now.
136
3.43k
          VisitStack.push_back(StackElement(Next, None));
137
3.43k
          return;
138
3.43k
        }
139
3.61k
      }
140
7.15k
      this->Visited.completed(Node);
141
3.72k
142
3.72k
      // Oops, ran out of successors... go up a level on the stack.
143
3.72k
      VisitStack.pop_back();
144
3.72k
    } while (!VisitStack.empty());
145
3.72k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
120
2.65M
  inline void toNext() {
121
4.83M
    do {
122
4.83M
      NodeRef Node = VisitStack.back().first;
123
4.83M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
4.83M
125
4.83M
      if (!Opt)
126
2.65M
        Opt.emplace(GT::child_begin(Node));
127
4.83M
128
4.83M
      // Notice that we directly mutate *Opt here, so that
129
4.83M
      // VisitStack.back().second actually gets updated as the iterator
130
4.83M
      // increases.
131
6.03M
      while (*Opt != GT::child_end(Node)) {
132
3.37M
        NodeRef Next = *(*Opt)++;
133
3.37M
        // Has our next sibling been visited?
134
3.37M
        if (this->Visited.insert(Next).second) {
135
2.17M
          // No, do it now.
136
2.17M
          VisitStack.push_back(StackElement(Next, None));
137
2.17M
          return;
138
2.17M
        }
139
3.37M
      }
140
4.83M
      this->Visited.completed(Node);
141
2.65M
142
2.65M
      // Oops, ran out of successors... go up a level on the stack.
143
2.65M
      VisitStack.pop_back();
144
2.65M
    } while (!VisitStack.empty());
145
2.65M
  }
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
666
  inline void toNext() {
121
1.00k
    do {
122
1.00k
      NodeRef Node = VisitStack.back().first;
123
1.00k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
1.00k
125
1.00k
      if (!Opt)
126
666
        Opt.emplace(GT::child_begin(Node));
127
1.00k
128
1.00k
      // Notice that we directly mutate *Opt here, so that
129
1.00k
      // VisitStack.back().second actually gets updated as the iterator
130
1.00k
      // increases.
131
1.20k
      while (*Opt != GT::child_end(Node)) {
132
673
        NodeRef Next = *(*Opt)++;
133
673
        // Has our next sibling been visited?
134
673
        if (this->Visited.insert(Next).second) {
135
470
          // No, do it now.
136
470
          VisitStack.push_back(StackElement(Next, None));
137
470
          return;
138
470
        }
139
673
      }
140
1.00k
      this->Visited.completed(Node);
141
530
142
530
      // Oops, ran out of successors... go up a level on the stack.
143
530
      VisitStack.pop_back();
144
530
    } while (!VisitStack.empty());
145
666
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
120
2.80M
  inline void toNext() {
121
5.18M
    do {
122
5.18M
      NodeRef Node = VisitStack.back().first;
123
5.18M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
5.18M
125
5.18M
      if (!Opt)
126
2.80M
        Opt.emplace(GT::child_begin(Node));
127
5.18M
128
5.18M
      // Notice that we directly mutate *Opt here, so that
129
5.18M
      // VisitStack.back().second actually gets updated as the iterator
130
5.18M
      // increases.
131
6.47M
      while (*Opt != GT::child_end(Node)) {
132
3.66M
        NodeRef Next = *(*Opt)++;
133
3.66M
        // Has our next sibling been visited?
134
3.66M
        if (this->Visited.insert(Next).second) {
135
2.37M
          // No, do it now.
136
2.37M
          VisitStack.push_back(StackElement(Next, None));
137
2.37M
          return;
138
2.37M
        }
139
3.66M
      }
140
5.18M
      this->Visited.completed(Node);
141
2.80M
142
2.80M
      // Oops, ran out of successors... go up a level on the stack.
143
2.80M
      VisitStack.pop_back();
144
2.80M
    } while (!VisitStack.empty());
145
2.80M
  }
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
611
  inline void toNext() {
121
626
    do {
122
626
      NodeRef Node = VisitStack.back().first;
123
626
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
626
125
626
      if (!Opt)
126
315
        Opt.emplace(GT::child_begin(Node));
127
626
128
626
      // Notice that we directly mutate *Opt here, so that
129
626
      // VisitStack.back().second actually gets updated as the iterator
130
626
      // increases.
131
644
      while (*Opt != GT::child_end(Node)) {
132
333
        NodeRef Next = *(*Opt)++;
133
333
        // Has our next sibling been visited?
134
333
        if (this->Visited.insert(Next).second) {
135
315
          // No, do it now.
136
315
          VisitStack.push_back(StackElement(Next, None));
137
315
          return;
138
315
        }
139
333
      }
140
626
      this->Visited.completed(Node);
141
311
142
311
      // Oops, ran out of successors... go up a level on the stack.
143
311
      VisitStack.pop_back();
144
311
    } while (!VisitStack.empty());
145
611
  }
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
81.1k
  inline void toNext() {
121
91.2k
    do {
122
91.2k
      NodeRef Node = VisitStack.back().first;
123
91.2k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
91.2k
125
91.2k
      if (!Opt)
126
81.1k
        Opt.emplace(GT::child_begin(Node));
127
91.2k
128
91.2k
      // Notice that we directly mutate *Opt here, so that
129
91.2k
      // VisitStack.back().second actually gets updated as the iterator
130
91.2k
      // increases.
131
91.2k
      while (*Opt != GT::child_end(Node)) {
132
10.1k
        NodeRef Next = *(*Opt)++;
133
10.1k
        // Has our next sibling been visited?
134
10.1k
        if (this->Visited.insert(Next).second) {
135
10.1k
          // No, do it now.
136
10.1k
          VisitStack.push_back(StackElement(Next, None));
137
10.1k
          return;
138
10.1k
        }
139
10.1k
      }
140
91.2k
      this->Visited.completed(Node);
141
81.1k
142
81.1k
      // Oops, ran out of successors... go up a level on the stack.
143
81.1k
      VisitStack.pop_back();
144
81.1k
    } while (!VisitStack.empty());
145
81.1k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::toNext()
Line
Count
Source
120
70.4k
  inline void toNext() {
121
85.1k
    do {
122
85.1k
      NodeRef Node = VisitStack.back().first;
123
85.1k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
124
85.1k
125
85.1k
      if (!Opt)
126
70.4k
        Opt.emplace(GT::child_begin(Node));
127
85.1k
128
85.1k
      // Notice that we directly mutate *Opt here, so that
129
85.1k
      // VisitStack.back().second actually gets updated as the iterator
130
85.1k
      // increases.
131
87.5k
      while (*Opt != GT::child_end(Node)) {
132
17.1k
        NodeRef Next = *(*Opt)++;
133
17.1k
        // Has our next sibling been visited?
134
17.1k
        if (this->Visited.insert(Next).second) {
135
14.7k
          // No, do it now.
136
14.7k
          VisitStack.push_back(StackElement(Next, None));
137
14.7k
          return;
138
14.7k
        }
139
17.1k
      }
140
85.1k
      this->Visited.completed(Node);
141
70.4k
142
70.4k
      // Oops, ran out of successors... go up a level on the stack.
143
70.4k
      VisitStack.pop_back();
144
70.4k
    } while (!VisitStack.empty());
145
70.4k
  }
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
3.45M
  static df_iterator begin(const GraphT &G) {
152
3.45M
    return df_iterator(GT::getEntryNode(G));
153
3.45M
  }
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
503k
  static df_iterator begin(const GraphT &G) {
152
503k
    return df_iterator(GT::getEntryNode(G));
153
503k
  }
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
399k
  static df_iterator begin(const GraphT &G) {
152
399k
    return df_iterator(GT::getEntryNode(G));
153
399k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::begin(llvm::MachineLoop* const&)
Line
Count
Source
151
123
  static df_iterator begin(const GraphT &G) {
152
123
    return df_iterator(GT::getEntryNode(G));
153
123
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::begin(llvm::BasicBlock* const&)
Line
Count
Source
151
1.66M
  static df_iterator begin(const GraphT &G) {
152
1.66M
    return df_iterator(GT::getEntryNode(G));
153
1.66M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&)
Line
Count
Source
151
19
  static df_iterator begin(const GraphT &G) {
152
19
    return df_iterator(GT::getEntryNode(G));
153
19
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::begin(llvm::Inverse<llvm::MachineBasicBlock*> const&)
Line
Count
Source
151
19
  static df_iterator begin(const GraphT &G) {
152
19
    return df_iterator(GT::getEntryNode(G));
153
19
  }
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
111k
  static df_iterator begin(const GraphT &G) {
152
111k
    return df_iterator(GT::getEntryNode(G));
153
111k
  }
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
643k
  static df_iterator begin(const GraphT &G) {
152
643k
    return df_iterator(GT::getEntryNode(G));
153
643k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::begin(llvm::RegionNode* const&)
Line
Count
Source
151
4.10k
  static df_iterator begin(const GraphT &G) {
152
4.10k
    return df_iterator(GT::getEntryNode(G));
153
4.10k
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::begin(llvm::RegionNode const* const&)
Line
Count
Source
151
4
  static df_iterator begin(const GraphT &G) {
152
4
    return df_iterator(GT::getEntryNode(G));
153
4
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::begin(llvm::BasicBlock const* const&)
Line
Count
Source
151
14
  static df_iterator begin(const GraphT &G) {
152
14
    return df_iterator(GT::getEntryNode(G));
153
14
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::begin(llvm::RegionNode* const&)
Line
Count
Source
151
1
  static df_iterator begin(const GraphT &G) {
152
1
    return df_iterator(GT::getEntryNode(G));
153
1
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::begin(llvm::Loop const* const&)
Line
Count
Source
151
1.71k
  static df_iterator begin(const GraphT &G) {
152
1.71k
    return df_iterator(GT::getEntryNode(G));
153
1.71k
  }
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 const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::begin(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::begin(llvm::Function* const&)
Line
Count
Source
151
200
  static df_iterator begin(const GraphT &G) {
152
200
    return df_iterator(GT::getEntryNode(G));
153
200
  }
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
308
  static df_iterator begin(const GraphT &G) {
152
308
    return df_iterator(GT::getEntryNode(G));
153
308
  }
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
70.9k
  static df_iterator begin(const GraphT &G) {
152
70.9k
    return df_iterator(GT::getEntryNode(G));
153
70.9k
  }
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.6k
  static df_iterator begin(const GraphT &G) {
152
55.6k
    return df_iterator(GT::getEntryNode(G));
153
55.6k
  }
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
3.45M
  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
503k
  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
399k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::end(llvm::MachineLoop* const&)
Line
Count
Source
154
123
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::end(llvm::BasicBlock* const&)
Line
Count
Source
154
1.66M
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&)
Line
Count
Source
154
19
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::end(llvm::Inverse<llvm::MachineBasicBlock*> const&)
Line
Count
Source
154
19
  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
111k
  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
643k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::end(llvm::RegionNode* const&)
Line
Count
Source
154
4.10k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::end(llvm::RegionNode const* const&)
Line
Count
Source
154
4
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::end(llvm::BasicBlock const* const&)
Line
Count
Source
154
14
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::end(llvm::RegionNode* const&)
Line
Count
Source
154
1
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::end(llvm::Loop const* const&)
Line
Count
Source
154
1.71k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::end(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::end(llvm::MachineRegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::end(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::end(llvm::Function* const&)
Line
Count
Source
154
200
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::end(llvm::Inverse<llvm::BasicBlock const*> const&)
Line
Count
Source
154
308
  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
70.9k
  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.6k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::end(llvm::VPBlockBase const* const&)
155
156
  // Static begin and end methods as our public ctors for external iterators
157
3.58M
  static df_iterator begin(const GraphT &G, SetType &S) {
158
3.58M
    return df_iterator(GT::getEntryNode(G), S);
159
3.58M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
157
1.56k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
1.56k
    return df_iterator(GT::getEntryNode(G), S);
159
1.56k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
157
4.40k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
4.40k
    return df_iterator(GT::getEntryNode(G), S);
159
4.40k
  }
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
456k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
456k
    return df_iterator(GT::getEntryNode(G), S);
159
456k
  }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::begin(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
157
1.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::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
713k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
713k
    return df_iterator(GT::getEntryNode(G), S);
159
713k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::begin(llvm::Inverse<llvm::BasicBlock*> const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
157
290
  static df_iterator begin(const GraphT &G, SetType &S) {
158
290
    return df_iterator(GT::getEntryNode(G), S);
159
290
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::begin(llvm::Function* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
157
479k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
479k
    return df_iterator(GT::getEntryNode(G), S);
159
479k
  }
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
453
  static df_iterator begin(const GraphT &G, SetType &S) {
158
453
    return df_iterator(GT::getEntryNode(G), S);
159
453
  }
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
432k
  static df_iterator begin(const GraphT &G, SetType &S) {
158
432k
    return df_iterator(GT::getEntryNode(G), S);
159
432k
  }
160
3.58M
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
160
1.56k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
160
4.40k
  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
456k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::end(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
160
1.49M
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::end(llvm::MachineFunction* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
160
713k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::end(llvm::Inverse<llvm::BasicBlock*> const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
160
290
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::end(llvm::Function* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
160
479k
  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
453
  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
432k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
161
162
44.3M
  bool operator==(const df_iterator &x) const {
163
44.3M
    return VisitStack == x.VisitStack;
164
44.3M
  }
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.44M
  bool operator==(const df_iterator &x) const {
163
4.44M
    return VisitStack == x.VisitStack;
164
4.44M
  }
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
949k
  bool operator==(const df_iterator &x) const {
163
949k
    return VisitStack == x.VisitStack;
164
949k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator==(llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > const&) const
Line
Count
Source
162
258
  bool operator==(const df_iterator &x) const {
163
258
    return VisitStack == x.VisitStack;
164
258
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator==(llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
162
14.2M
  bool operator==(const df_iterator &x) const {
163
14.2M
    return VisitStack == x.VisitStack;
164
14.2M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
162
32
  bool operator==(const df_iterator &x) const {
163
32
    return VisitStack == x.VisitStack;
164
32
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > > const&) const
Line
Count
Source
162
28
  bool operator==(const df_iterator &x) const {
163
28
    return VisitStack == x.VisitStack;
164
28
  }
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.96M
  bool operator==(const df_iterator &x) const {
163
1.96M
    return VisitStack == x.VisitStack;
164
1.96M
  }
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
8.70k
  bool operator==(const df_iterator &x) const {
163
8.70k
    return VisitStack == x.VisitStack;
164
8.70k
  }
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
3.69M
  bool operator==(const df_iterator &x) const {
163
3.69M
    return VisitStack == x.VisitStack;
164
3.69M
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator==(llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > const&) const
Line
Count
Source
162
76
  bool operator==(const df_iterator &x) const {
163
76
    return VisitStack == x.VisitStack;
164
76
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator==(llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> > const&) const
Line
Count
Source
162
12
  bool operator==(const df_iterator &x) const {
163
12
    return VisitStack == x.VisitStack;
164
12
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator==(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> > const&) const
Line
Count
Source
162
14.8k
  bool operator==(const df_iterator &x) const {
163
14.8k
    return VisitStack == x.VisitStack;
164
14.8k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator==(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > > const&) const
Line
Count
Source
162
10
  bool operator==(const df_iterator &x) const {
163
10
    return VisitStack == x.VisitStack;
164
10
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator==(llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > const&) const
Line
Count
Source
162
3.57k
  bool operator==(const df_iterator &x) const {
163
3.57k
    return VisitStack == x.VisitStack;
164
3.57k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
162
15.0k
  bool operator==(const df_iterator &x) const {
163
15.0k
    return VisitStack == x.VisitStack;
164
15.0k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
162
3.12M
  bool operator==(const df_iterator &x) const {
163
3.12M
    return VisitStack == x.VisitStack;
164
3.12M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator==(llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator==(llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator==(llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> > const&) const
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator==(llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> > const&) const
Line
Count
Source
162
3.36M
  bool operator==(const df_iterator &x) const {
163
3.36M
    return VisitStack == x.VisitStack;
164
3.36M
  }
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.84M
  bool operator==(const df_iterator &x) const {
163
5.84M
    return VisitStack == x.VisitStack;
164
5.84M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator==(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
162
588
  bool operator==(const df_iterator &x) const {
163
588
    return VisitStack == x.VisitStack;
164
588
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
162
4.01k
  bool operator==(const df_iterator &x) const {
163
4.01k
    return VisitStack == x.VisitStack;
164
4.01k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator==(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
162
3.13M
  bool operator==(const df_iterator &x) const {
163
3.13M
    return VisitStack == x.VisitStack;
164
3.13M
  }
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.11k
  bool operator==(const df_iterator &x) const {
163
1.11k
    return VisitStack == x.VisitStack;
164
1.11k
  }
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.24M
  bool operator==(const df_iterator &x) const {
163
3.24M
    return VisitStack == x.VisitStack;
164
3.24M
  }
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
919
  bool operator==(const df_iterator &x) const {
163
919
    return VisitStack == x.VisitStack;
164
919
  }
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
152k
  bool operator==(const df_iterator &x) const {
163
152k
    return VisitStack == x.VisitStack;
164
152k
  }
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
126k
  bool operator==(const df_iterator &x) const {
163
126k
    return VisitStack == x.VisitStack;
164
126k
  }
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
44.3M
  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.44M
  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
949k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator!=(llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > const&) const
Line
Count
Source
165
258
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator!=(llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > const&) const
Line
Count
Source
165
14.2M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
32
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > > const&) const
Line
Count
Source
165
28
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator!=(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> > const&) const
Line
Count
Source
165
1.96M
  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
8.70k
  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
3.69M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator!=(llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > const&) const
Line
Count
Source
165
76
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator!=(llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> > const&) const
Line
Count
Source
165
12
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator!=(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> > const&) const
Line
Count
Source
165
14.8k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator!=(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > > const&) const
Line
Count
Source
165
10
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator!=(llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > const&) const
Line
Count
Source
165
3.57k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
15.0k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&) const
Line
Count
Source
165
3.12M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator!=(llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator!=(llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> > const&) const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator!=(llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> > const&) const
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator!=(llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> > const&) const
Line
Count
Source
165
3.36M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator!=(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> > const&) const
Line
Count
Source
165
5.84M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator!=(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
165
588
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
165
4.01k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator!=(llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> > const&) const
Line
Count
Source
165
3.13M
  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.11k
  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.24M
  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
919
  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
152k
  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
126k
  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
37.3M
  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
3.94M
  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
550k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator*() const
Line
Count
Source
167
154
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator*() const
Line
Count
Source
167
12.5M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
13
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator*() const
Line
Count
Source
167
9
  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.85M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
7.14k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::operator*() const
Line
Count
Source
167
3.05M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator*() const
Line
Count
Source
167
62
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator*() const
Line
Count
Source
167
8
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator*() const
Line
Count
Source
167
18.0k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator*() const
Line
Count
Source
167
9
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator*() const
Line
Count
Source
167
1.85k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
10.6k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator*() const
Line
Count
Source
167
2.67M
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator*() const
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator*() const
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator*() const
Line
Count
Source
167
1.86M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator*() const
Line
Count
Source
167
5.13M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator*() const
Line
Count
Source
167
388
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
167
3.72k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator*() const
Line
Count
Source
167
2.65M
  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
784
  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.80M
  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
623
  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
81.1k
  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
70.4k
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator*() const
168
169
  // This is a nonstandard operator-> that dereferences the pointer an extra
170
  // time... so that you can actually call methods ON the Node, because
171
  // the contained type is a pointer.  This allows BBIt->getTerminator() f.e.
172
  //
173
13.8k
  NodeRef operator->() const { return **this; }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator->() const
Line
Count
Source
173
19
  NodeRef operator->() const { return **this; }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator->() const
Line
Count
Source
173
13.8k
  NodeRef operator->() const { return **this; }
174
175
37.3M
  df_iterator &operator++() { // Preincrement
176
37.3M
    toNext();
177
37.3M
    return *this;
178
37.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
3.94M
  df_iterator &operator++() { // Preincrement
176
3.94M
    toNext();
177
3.94M
    return *this;
178
3.94M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator++()
Line
Count
Source
175
550k
  df_iterator &operator++() { // Preincrement
176
550k
    toNext();
177
550k
    return *this;
178
550k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator++()
Line
Count
Source
175
135
  df_iterator &operator++() { // Preincrement
176
135
    toNext();
177
135
    return *this;
178
135
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
12.5M
  df_iterator &operator++() { // Preincrement
176
12.5M
    toNext();
177
12.5M
    return *this;
178
12.5M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
32
  df_iterator &operator++() { // Preincrement
176
32
    toNext();
177
32
    return *this;
178
32
  }
llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > >::operator++()
Line
Count
Source
175
28
  df_iterator &operator++() { // Preincrement
176
28
    toNext();
177
28
    return *this;
178
28
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
1.85M
  df_iterator &operator++() { // Preincrement
176
1.85M
    toNext();
177
1.85M
    return *this;
178
1.85M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
7.14k
  df_iterator &operator++() { // Preincrement
176
7.14k
    toNext();
177
7.14k
    return *this;
178
7.14k
  }
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
3.05M
  df_iterator &operator++() { // Preincrement
176
3.05M
    toNext();
177
3.05M
    return *this;
178
3.05M
  }
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> >::operator++()
Line
Count
Source
175
62
  df_iterator &operator++() { // Preincrement
176
62
    toNext();
177
62
    return *this;
178
62
  }
llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::RegionNode const*> >::operator++()
Line
Count
Source
175
8
  df_iterator &operator++() { // Preincrement
176
8
    toNext();
177
8
    return *this;
178
8
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator++()
Line
Count
Source
175
10.7k
  df_iterator &operator++() { // Preincrement
176
10.7k
    toNext();
177
10.7k
    return *this;
178
10.7k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator++()
Line
Count
Source
175
9
  df_iterator &operator++() { // Preincrement
176
9
    toNext();
177
9
    return *this;
178
9
  }
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::Loop const*, 8u>, false, llvm::GraphTraits<llvm::Loop const*> >::operator++()
Line
Count
Source
175
1.85k
  df_iterator &operator++() { // Preincrement
176
1.85k
    toNext();
177
1.85k
    return *this;
178
1.85k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
5.93k
  df_iterator &operator++() { // Preincrement
176
5.93k
    toNext();
177
5.93k
    return *this;
178
5.93k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
175
2.67M
  df_iterator &operator++() { // Preincrement
176
2.67M
    toNext();
177
2.67M
    return *this;
178
2.67M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator++()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::operator++()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::operator++()
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::operator++()
Line
Count
Source
175
1.86M
  df_iterator &operator++() { // Preincrement
176
1.86M
    toNext();
177
1.86M
    return *this;
178
1.86M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
175
5.13M
  df_iterator &operator++() { // Preincrement
176
5.13M
    toNext();
177
5.13M
    return *this;
178
5.13M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
175
388
  df_iterator &operator++() { // Preincrement
176
388
    toNext();
177
388
    return *this;
178
388
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
175
3.72k
  df_iterator &operator++() { // Preincrement
176
3.72k
    toNext();
177
3.72k
    return *this;
178
3.72k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
175
2.65M
  df_iterator &operator++() { // Preincrement
176
2.65M
    toNext();
177
2.65M
    return *this;
178
2.65M
  }
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
666
  df_iterator &operator++() { // Preincrement
176
666
    toNext();
177
666
    return *this;
178
666
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
175
2.80M
  df_iterator &operator++() { // Preincrement
176
2.80M
    toNext();
177
2.80M
    return *this;
178
2.80M
  }
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
315
  df_iterator &operator++() { // Preincrement
176
315
    toNext();
177
315
    return *this;
178
315
  }
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
81.1k
  df_iterator &operator++() { // Preincrement
176
81.1k
    toNext();
177
81.1k
    return *this;
178
81.1k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator++()
Line
Count
Source
175
70.4k
  df_iterator &operator++() { // Preincrement
176
70.4k
    toNext();
177
70.4k
    return *this;
178
70.4k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator++()
179
180
  /// Skips all children of the current node and traverses to next node
181
  ///
182
  /// Note: This function takes care of incrementing the iterator. If you
183
  /// always increment and call this function, you risk walking off the end.
184
5.04k
  df_iterator &skipChildren() {
185
5.04k
    VisitStack.pop_back();
186
5.04k
    if (!VisitStack.empty())
187
1.45k
      toNext();
188
5.04k
    return *this;
189
5.04k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::skipChildren()
Line
Count
Source
184
4.74k
  df_iterator &skipChildren() {
185
4.74k
    VisitStack.pop_back();
186
4.74k
    if (!VisitStack.empty())
187
1.15k
      toNext();
188
4.74k
    return *this;
189
4.74k
  }
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
296
  df_iterator &skipChildren() {
185
296
    VisitStack.pop_back();
186
296
    if (!VisitStack.empty())
187
296
      toNext();
188
296
    return *this;
189
296
  }
190
191
  df_iterator operator++(int) { // Postincrement
192
    df_iterator tmp = *this;
193
    ++*this;
194
    return tmp;
195
  }
196
197
  // nodeVisited - return true if this iterator has already visited the
198
  // specified node.  This is public, and will probably be used to iterate over
199
  // nodes that a depth first iteration did not find: ie unreachable nodes.
200
  //
201
1.14k
  bool nodeVisited(NodeRef Node) const {
202
1.14k
    return this->Visited.count(Node) != 0;
203
1.14k
  }
204
205
  /// getPathLength - Return the length of the path from the entry node to the
206
  /// current node, counting both nodes.
207
6.89M
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::getPathLength() const
Line
Count
Source
207
2.24M
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::getPathLength() const
Line
Count
Source
207
4.65M
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::getPathLength() const
Line
Count
Source
207
100
  unsigned getPathLength() const { return VisitStack.size(); }
208
209
  /// getPath - Return the n'th node in the path from the entry node to the
210
  /// current node.
211
2.57M
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> >::getPath(unsigned int) const
Line
Count
Source
211
372k
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::getPath(unsigned int) const
Line
Count
Source
211
2.20M
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> >::getPath(unsigned int) const
Line
Count
Source
211
149
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
212
};
213
214
// Provide global constructors that automatically figure out correct types...
215
//
216
template <class T>
217
3.44M
df_iterator<T> df_begin(const T& G) {
218
3.44M
  return df_iterator<T>::begin(G);
219
3.44M
}
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
503k
df_iterator<T> df_begin(const T& G) {
218
503k
  return df_iterator<T>::begin(G);
219
503k
}
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
643k
df_iterator<T> df_begin(const T& G) {
218
643k
  return df_iterator<T>::begin(G);
219
643k
}
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
399k
df_iterator<T> df_begin(const T& G) {
218
399k
  return df_iterator<T>::begin(G);
219
399k
}
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineLoop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > llvm::df_begin<llvm::MachineLoop*>(llvm::MachineLoop* const&)
Line
Count
Source
217
123
df_iterator<T> df_begin(const T& G) {
218
123
  return df_iterator<T>::begin(G);
219
123
}
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > llvm::df_begin<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
217
1.66M
df_iterator<T> df_begin(const T& G) {
218
1.66M
  return df_iterator<T>::begin(G);
219
1.66M
}
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_begin<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Line
Count
Source
217
19
df_iterator<T> df_begin(const T& G) {
218
19
  return df_iterator<T>::begin(G);
219
19
}
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
111k
df_iterator<T> df_begin(const T& G) {
218
111k
  return df_iterator<T>::begin(G);
219
111k
}
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > llvm::df_begin<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
217
14
df_iterator<T> df_begin(const T& G) {
218
14
  return df_iterator<T>::begin(G);
219
14
}
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > llvm::df_begin<llvm::Loop const*>(llvm::Loop const* const&)
Line
Count
Source
217
1.71k
df_iterator<T> df_begin(const T& G) {
218
1.71k
  return df_iterator<T>::begin(G);
219
1.71k
}
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_begin<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > llvm::df_begin<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
217
200
df_iterator<T> df_begin(const T& G) {
218
200
  return df_iterator<T>::begin(G);
219
200
}
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
70.9k
df_iterator<T> df_begin(const T& G) {
218
70.9k
  return df_iterator<T>::begin(G);
219
70.9k
}
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.6k
df_iterator<T> df_begin(const T& G) {
218
55.6k
  return df_iterator<T>::begin(G);
219
55.6k
}
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
3.44M
df_iterator<T> df_end(const T& G) {
223
3.44M
  return df_iterator<T>::end(G);
224
3.44M
}
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
503k
df_iterator<T> df_end(const T& G) {
223
503k
  return df_iterator<T>::end(G);
224
503k
}
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
643k
df_iterator<T> df_end(const T& G) {
223
643k
  return df_iterator<T>::end(G);
224
643k
}
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
399k
df_iterator<T> df_end(const T& G) {
223
399k
  return df_iterator<T>::end(G);
224
399k
}
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineLoop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > llvm::df_end<llvm::MachineLoop*>(llvm::MachineLoop* const&)
Line
Count
Source
222
123
df_iterator<T> df_end(const T& G) {
223
123
  return df_iterator<T>::end(G);
224
123
}
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > llvm::df_end<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
222
1.66M
df_iterator<T> df_end(const T& G) {
223
1.66M
  return df_iterator<T>::end(G);
224
1.66M
}
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_end<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Line
Count
Source
222
19
df_iterator<T> df_end(const T& G) {
223
19
  return df_iterator<T>::end(G);
224
19
}
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
111k
df_iterator<T> df_end(const T& G) {
223
111k
  return df_iterator<T>::end(G);
224
111k
}
llvm::df_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock const*> > llvm::df_end<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
222
14
df_iterator<T> df_end(const T& G) {
223
14
  return df_iterator<T>::end(G);
224
14
}
llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > llvm::df_end<llvm::Loop const*>(llvm::Loop const* const&)
Line
Count
Source
222
1.71k
df_iterator<T> df_end(const T& G) {
223
1.71k
  return df_iterator<T>::end(G);
224
1.71k
}
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_end<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > llvm::df_end<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
222
200
df_iterator<T> df_end(const T& G) {
223
200
  return df_iterator<T>::end(G);
224
200
}
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
70.9k
df_iterator<T> df_end(const T& G) {
223
70.9k
  return df_iterator<T>::end(G);
224
70.9k
}
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.6k
df_iterator<T> df_end(const T& G) {
223
55.6k
  return df_iterator<T>::end(G);
224
55.6k
}
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > llvm::df_end<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
225
226
// Provide an accessor method to use them in range-based patterns.
227
template <class T>
228
3.27M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
3.27M
  return make_range(df_begin(G), df_end(G));
230
3.27M
}
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
503k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
503k
  return make_range(df_begin(G), df_end(G));
230
503k
}
llvm::iterator_range<llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineLoop*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> > > llvm::depth_first<llvm::MachineLoop*>(llvm::MachineLoop* const&)
Line
Count
Source
228
104
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
104
  return make_range(df_begin(G), df_end(G));
230
104
}
llvm::iterator_range<llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineFunction*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> > > llvm::depth_first<llvm::MachineFunction*>(llvm::MachineFunction* const&)
Line
Count
Source
228
111k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
111k
  return make_range(df_begin(G), df_end(G));
230
111k
}
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
264k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
264k
  return make_range(df_begin(G), df_end(G));
230
264k
}
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
643k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
643k
  return make_range(df_begin(G), df_end(G));
230
643k
}
llvm::iterator_range<llvm::df_iterator<llvm::Loop const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Loop const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Loop const*> > > llvm::depth_first<llvm::Loop const*>(llvm::Loop const* const&)
Line
Count
Source
228
1.71k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
1.71k
  return make_range(df_begin(G), df_end(G));
230
1.71k
}
llvm::iterator_range<llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > > llvm::depth_first<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
228
200
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
200
  return make_range(df_begin(G), df_end(G));
230
200
}
llvm::iterator_range<llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > > llvm::depth_first<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
228
1.62M
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
1.62M
  return make_range(df_begin(G), df_end(G));
230
1.62M
}
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
70.9k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
70.9k
  return make_range(df_begin(G), df_end(G));
230
70.9k
}
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.6k
iterator_range<df_iterator<T>> depth_first(const T& G) {
229
55.6k
  return make_range(df_begin(G), df_end(G));
230
55.6k
}
Unexecuted instantiation: llvm::iterator_range<llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > > llvm::depth_first<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
231
232
// Provide global definitions of external depth first iterators...
233
template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
234
struct df_ext_iterator : public df_iterator<T, SetTy, true> {
235
  df_ext_iterator(const df_iterator<T, SetTy, true> &V)
236
7.16M
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> > const&)
Line
Count
Source
236
3.12k
    : 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
8.80k
    : 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
913k
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction const*> > const&)
Line
Count
Source
236
2.98M
    : df_iterator<T, SetTy, true>(V) {}
llvm::df_ext_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >::df_ext_iterator(llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> > const&)
Line
Count
Source
236
1.42M
    : 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
958k
    : 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
865k
    : df_iterator<T, SetTy, true>(V) {}
237
};
238
239
template <class T, class SetTy>
240
3.58M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
3.58M
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
3.58M
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > llvm::df_ext_begin<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
240
1.56k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
1.56k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
1.56k
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> > llvm::df_ext_begin<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
240
4.40k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
4.40k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
4.40k
}
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
456k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
456k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
456k
}
llvm::df_ext_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> > llvm::df_ext_begin<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> >(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
240
1.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::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
713k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
713k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
713k
}
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
479k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
479k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
479k
}
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
432k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
241
432k
  return df_ext_iterator<T, SetTy>::begin(G, S);
242
432k
}
243
244
template <class T, class SetTy>
245
3.58M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
3.58M
  return df_ext_iterator<T, SetTy>::end(G, S);
247
3.58M
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > llvm::df_ext_end<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
245
1.56k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
1.56k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
1.56k
}
llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> > llvm::df_ext_end<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>&)
Line
Count
Source
245
4.40k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
4.40k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
4.40k
}
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
456k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
456k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
456k
}
llvm::df_ext_iterator<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> > llvm::df_ext_end<llvm::MachineFunction const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u> >(llvm::MachineFunction const* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>&)
Line
Count
Source
245
1.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::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
713k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
713k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
713k
}
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
479k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
479k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
479k
}
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
432k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
246
432k
  return df_ext_iterator<T, SetTy>::end(G, S);
247
432k
}
248
249
template <class T, class SetTy>
250
iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G,
251
1.83M
                                                          SetTy &S) {
252
1.83M
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
1.83M
}
llvm::iterator_range<llvm::df_ext_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> > > llvm::depth_first_ext<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u> >(llvm::MachineBasicBlock* const&, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>&)
Line
Count
Source
251
1.56k
                                                          SetTy &S) {
252
1.56k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
1.56k
}
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
456k
                                                          SetTy &S) {
252
456k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
456k
}
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
479k
                                                          SetTy &S) {
252
479k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
479k
}
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
460k
                                                          SetTy &S) {
252
460k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
460k
}
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
432k
                                                          SetTy &S) {
252
432k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
253
432k
}
254
255
// Provide global definitions of inverse depth first iterators...
256
template <class T,
257
          class SetTy =
258
              df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
259
          bool External = false>
260
struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
261
  idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V)
262
2.15k
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::MachineBasicBlock*>, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*> > > const&)
Line
Count
Source
262
57
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
262
580
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
262
906
    : 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
616
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
263
};
264
265
template <class T>
266
327
idf_iterator<T> idf_begin(const T& G) {
267
327
  return idf_iterator<T>::begin(Inverse<T>(G));
268
327
}
llvm::idf_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false> llvm::idf_begin<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Line
Count
Source
266
19
idf_iterator<T> idf_begin(const T& G) {
267
19
  return idf_iterator<T>::begin(Inverse<T>(G));
268
19
}
llvm::idf_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false> llvm::idf_begin<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
266
308
idf_iterator<T> idf_begin(const T& G) {
267
308
  return idf_iterator<T>::begin(Inverse<T>(G));
268
308
}
269
270
template <class T>
271
327
idf_iterator<T> idf_end(const T& G){
272
327
  return idf_iterator<T>::end(Inverse<T>(G));
273
327
}
llvm::idf_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false> llvm::idf_end<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Line
Count
Source
271
19
idf_iterator<T> idf_end(const T& G){
272
19
  return idf_iterator<T>::end(Inverse<T>(G));
273
19
}
llvm::idf_iterator<llvm::BasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock const*>::NodeRef, 8u>, false> llvm::idf_end<llvm::BasicBlock const*>(llvm::BasicBlock const* const&)
Line
Count
Source
271
308
idf_iterator<T> idf_end(const T& G){
272
308
  return idf_iterator<T>::end(Inverse<T>(G));
273
308
}
274
275
// Provide an accessor method to use them in range-based patterns.
276
template <class T>
277
iterator_range<idf_iterator<T>> inverse_depth_first(const T& G) {
278
  return make_range(idf_begin(G), idf_end(G));
279
}
280
281
// Provide global definitions of external inverse depth first iterators...
282
template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
283
struct idf_ext_iterator : public idf_iterator<T, SetTy, true> {
284
  idf_ext_iterator(const idf_iterator<T, SetTy, true> &V)
285
    : idf_iterator<T, SetTy, true>(V) {}
286
  idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V)
287
1.48k
    : idf_iterator<T, SetTy, true>(V) {}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >::idf_ext_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
287
580
    : idf_iterator<T, SetTy, true>(V) {}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >::idf_ext_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
287
906
    : idf_iterator<T, SetTy, true>(V) {}
288
};
289
290
template <class T, class SetTy>
291
743
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
743
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
743
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > llvm::idf_ext_begin<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
291
290
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
290
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
290
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> > llvm::idf_ext_begin<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
291
453
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
292
453
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
293
453
}
294
295
template <class T, class SetTy>
296
743
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
743
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
743
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > llvm::idf_ext_end<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
296
290
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
290
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
290
}
llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> > llvm::idf_ext_end<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
296
453
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
297
453
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
298
453
}
299
300
template <class T, class SetTy>
301
iterator_range<idf_ext_iterator<T, SetTy>> inverse_depth_first_ext(const T& G,
302
743
                                                                   SetTy &S) {
303
743
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
743
}
llvm::iterator_range<llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> > > llvm::inverse_depth_first_ext<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>&)
Line
Count
Source
302
290
                                                                   SetTy &S) {
303
290
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
290
}
llvm::iterator_range<llvm::idf_ext_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> > > llvm::inverse_depth_first_ext<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u> >(llvm::BasicBlock* const&, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>&)
Line
Count
Source
302
453
                                                                   SetTy &S) {
303
453
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
304
453
}
305
306
} // end namespace llvm
307
308
#endif // LLVM_ADT_DEPTHFIRSTITERATOR_H