Coverage Report

Created: 2019-02-15 18: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
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4
// See https://llvm.org/LICENSE.txt for license information.
5
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6
//
7
//===----------------------------------------------------------------------===//
8
//
9
// This file builds on the ADT/GraphTraits.h file to build generic depth
10
// first graph iterator.  This file exposes the following functions/types:
11
//
12
// df_begin/df_end/df_iterator
13
//   * Normal depth-first iteration - visit a node and then all of its children.
14
//
15
// idf_begin/idf_end/idf_iterator
16
//   * Depth-first iteration on the 'inverse' graph.
17
//
18
// df_ext_begin/df_ext_end/df_ext_iterator
19
//   * Normal depth-first iteration - visit a node and then all of its children.
20
//     This iterator stores the 'visited' set in an external set, which allows
21
//     it to be more efficient, and allows external clients to use the set for
22
//     other purposes.
23
//
24
// idf_ext_begin/idf_ext_end/idf_ext_iterator
25
//   * Depth-first iteration on the 'inverse' graph.
26
//     This iterator stores the 'visited' set in an external set, which allows
27
//     it to be more efficient, and allows external clients to use the set for
28
//     other purposes.
29
//
30
//===----------------------------------------------------------------------===//
31
32
#ifndef LLVM_ADT_DEPTHFIRSTITERATOR_H
33
#define LLVM_ADT_DEPTHFIRSTITERATOR_H
34
35
#include "llvm/ADT/GraphTraits.h"
36
#include "llvm/ADT/None.h"
37
#include "llvm/ADT/Optional.h"
38
#include "llvm/ADT/SmallPtrSet.h"
39
#include "llvm/ADT/iterator_range.h"
40
#include <iterator>
41
#include <set>
42
#include <utility>
43
#include <vector>
44
45
namespace llvm {
46
47
// df_iterator_storage - A private class which is used to figure out where to
48
// store the visited set.
49
template<class SetType, bool External>   // Non-external set
50
class df_iterator_storage {
51
public:
52
  SetType Visited;
53
};
54
55
template<class SetType>
56
class df_iterator_storage<SetType, true> {
57
public:
58
8.08M
  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
58
1.46M
  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
58
6.07k
  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
58
943k
  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
58
3.73M
  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
58
1.01M
  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
58
960
  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
58
915k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
59
19.5M
  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
59
4.32M
  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
59
6.07k
  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
59
3.77M
  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
59
3.73M
  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
59
4.06M
  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
59
3.84k
  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
59
3.66M
  df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
60
61
  SetType &Visited;
62
};
63
64
// The visited stated for the iteration is a simple set augmented with
65
// one more method, completed, which is invoked when all children of a
66
// node have been processed. It is intended to distinguish of back and
67
// cross edges in the spanning tree but is not used in the common case.
68
template <typename NodeRef, unsigned SmallSize=8>
69
struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> {
70
  using BaseSet = SmallPtrSet<NodeRef, SmallSize>;
71
  using iterator = typename BaseSet::iterator;
72
73
51.8M
  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
73
4.04M
  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
73
561k
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::insert(llvm::MachineLoop*)
Line
Count
Source
73
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
73
23.0M
  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
73
9.88M
  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
73
7.80M
  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
73
13.5k
  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
73
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
73
779
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::insert(llvm::Loop const*)
Line
Count
Source
73
1.93k
  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
73
6.43k
  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
73
3.85M
  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
73
2.57M
  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
73
1.17k
  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
73
75.7k
  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*)
74
  template <typename IterT>
75
  void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); }
76
77
39.8M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
77
4.04M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop*, 8u>::completed(llvm::Loop*)
Line
Count
Source
77
561k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::completed(llvm::MachineLoop*)
Line
Count
Source
77
135
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::completed(llvm::BasicBlock*)
Line
Count
Source
77
15.5M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
77
6.78M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
77
7.80M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>::completed(llvm::BasicBlock const*)
Line
Count
Source
77
388
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>::completed(llvm::RegionNode const*)
Line
Count
Source
77
8
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::RegionNode*, 8u>::completed(llvm::RegionNode*)
Line
Count
Source
77
10.9k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::completed(llvm::Loop const*)
Line
Count
Source
77
1.93k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
77
2.22k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
77
2.71M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::completed(llvm::MachineBasicBlock const*)
Line
Count
Source
77
2.35M
  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
77
535
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::completed(llvm::VPBlockBase*)
Line
Count
Source
77
73.1k
  void completed(NodeRef) {}
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>::completed(llvm::VPBlockBase const*)
78
};
79
80
// Generic Depth First Iterator
81
template <class GraphT,
82
          class SetType =
83
              df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
84
          bool ExtStorage = false, class GT = GraphTraits<GraphT>>
85
class df_iterator
86
    : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
87
      public df_iterator_storage<SetType, ExtStorage> {
88
  using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
89
  using NodeRef = typename GT::NodeRef;
90
  using ChildItTy = typename GT::ChildIteratorType;
91
92
  // First element is node reference, second is the 'next child' to visit.
93
  // The second child is initialized lazily to pick up graph changes during the
94
  // DFS.
95
  using StackElement = std::pair<NodeRef, Optional<ChildItTy>>;
96
97
  // VisitStack - Used to maintain the ordering.  Top = current block
98
  std::vector<StackElement> VisitStack;
99
100
private:
101
4.41M
  inline df_iterator(NodeRef Node) {
102
4.41M
    this->Visited.insert(Node);
103
4.41M
    VisitStack.push_back(StackElement(Node, None));
104
4.41M
  }
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
101
511k
  inline df_iterator(NodeRef Node) {
102
511k
    this->Visited.insert(Node);
103
511k
    VisitStack.push_back(StackElement(Node, None));
104
511k
  }
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
101
405k
  inline df_iterator(NodeRef Node) {
102
405k
    this->Visited.insert(Node);
103
405k
    VisitStack.push_back(StackElement(Node, None));
104
405k
  }
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
101
123
  inline df_iterator(NodeRef Node) {
102
123
    this->Visited.insert(Node);
103
123
    VisitStack.push_back(StackElement(Node, None));
104
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
101
1.73M
  inline df_iterator(NodeRef Node) {
102
1.73M
    this->Visited.insert(Node);
103
1.73M
    VisitStack.push_back(StackElement(Node, None));
104
1.73M
  }
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
101
101k
  inline df_iterator(NodeRef Node) {
102
101k
    this->Visited.insert(Node);
103
101k
    VisitStack.push_back(StackElement(Node, None));
104
101k
  }
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
101
1.51M
  inline df_iterator(NodeRef Node) {
102
1.51M
    this->Visited.insert(Node);
103
1.51M
    VisitStack.push_back(StackElement(Node, None));
104
1.51M
  }
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
101
4.42k
  inline df_iterator(NodeRef Node) {
102
4.42k
    this->Visited.insert(Node);
103
4.42k
    VisitStack.push_back(StackElement(Node, None));
104
4.42k
  }
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
101
4
  inline df_iterator(NodeRef Node) {
102
4
    this->Visited.insert(Node);
103
4
    VisitStack.push_back(StackElement(Node, None));
104
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
101
14
  inline df_iterator(NodeRef Node) {
102
14
    this->Visited.insert(Node);
103
14
    VisitStack.push_back(StackElement(Node, None));
104
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
101
1
  inline df_iterator(NodeRef Node) {
102
1
    this->Visited.insert(Node);
103
1
    VisitStack.push_back(StackElement(Node, None));
104
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
101
1.78k
  inline df_iterator(NodeRef Node) {
102
1.78k
    this->Visited.insert(Node);
103
1.78k
    VisitStack.push_back(StackElement(Node, None));
104
1.78k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator(llvm::MachineRegionNode*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::df_iterator(llvm::MachineRegionNode const*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator(llvm::MachineBasicBlock*)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator(llvm::MachineBasicBlock const*)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator(llvm::BasicBlock*)
Line
Count
Source
101
205
  inline df_iterator(NodeRef Node) {
102
205
    this->Visited.insert(Node);
103
205
    VisitStack.push_back(StackElement(Node, None));
104
205
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator(llvm::BasicBlock*)
Line
Count
Source
101
50
  inline df_iterator(NodeRef Node) {
102
50
    this->Visited.insert(Node);
103
50
    VisitStack.push_back(StackElement(Node, None));
104
50
  }
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
101
319
  inline df_iterator(NodeRef Node) {
102
319
    this->Visited.insert(Node);
103
319
    VisitStack.push_back(StackElement(Node, None));
104
319
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::df_iterator(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
101
81.4k
  inline df_iterator(NodeRef Node) {
102
81.4k
    this->Visited.insert(Node);
103
81.4k
    VisitStack.push_back(StackElement(Node, None));
104
81.4k
  }
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
101
57.3k
  inline df_iterator(NodeRef Node) {
102
57.3k
    this->Visited.insert(Node);
103
57.3k
    VisitStack.push_back(StackElement(Node, None));
104
57.3k
  }
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*)
105
106
4.41M
  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
106
511k
  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
106
405k
  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
106
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
106
1.73M
  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
106
101k
  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
106
1.51M
  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
106
4.42k
  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
106
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
106
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
106
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
106
1.78k
  inline df_iterator() = default; // End is when stack is empty
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::df_iterator()
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::df_iterator()
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::df_iterator()
Line
Count
Source
106
205
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::df_iterator()
Line
Count
Source
106
50
  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
106
319
  inline df_iterator() = default; // End is when stack is empty
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::df_iterator()
Line
Count
Source
106
81.4k
  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
106
57.3k
  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()
107
108
  inline df_iterator(NodeRef Node, SetType &S)
109
4.04M
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
4.04M
    if (this->Visited.insert(Node).second)
111
4.04M
      VisitStack.push_back(StackElement(Node, None));
112
4.04M
  }
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
109
1.87k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
1.87k
    if (this->Visited.insert(Node).second)
111
1.87k
      VisitStack.push_back(StackElement(Node, None));
112
1.87k
  }
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
109
3.03k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
3.03k
    if (this->Visited.insert(Node).second)
111
2.94k
      VisitStack.push_back(StackElement(Node, None));
112
3.03k
  }
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
109
471k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
471k
    if (this->Visited.insert(Node).second)
111
471k
      VisitStack.push_back(StackElement(Node, None));
112
471k
  }
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
109
1.86M
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
1.86M
    if (this->Visited.insert(Node).second)
111
1.86M
      VisitStack.push_back(StackElement(Node, None));
112
1.86M
  }
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
109
731k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
731k
    if (this->Visited.insert(Node).second)
111
731k
      VisitStack.push_back(StackElement(Node, None));
112
731k
  }
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
109
290
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
290
    if (this->Visited.insert(Node).second)
111
290
      VisitStack.push_back(StackElement(Node, None));
112
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
109
508k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
508k
    if (this->Visited.insert(Node).second)
111
508k
      VisitStack.push_back(StackElement(Node, None));
112
508k
  }
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
109
480
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
480
    if (this->Visited.insert(Node).second)
111
331
      VisitStack.push_back(StackElement(Node, None));
112
480
  }
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
109
457k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
457k
    if (this->Visited.insert(Node).second)
111
457k
      VisitStack.push_back(StackElement(Node, None));
112
457k
  }
113
114
  inline df_iterator(SetType &S)
115
4.04M
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
4.04M
    // End is when stack is empty
117
4.04M
  }
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
115
1.87k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
1.87k
    // End is when stack is empty
117
1.87k
  }
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
115
3.03k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
3.03k
    // End is when stack is empty
117
3.03k
  }
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
115
471k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
471k
    // End is when stack is empty
117
471k
  }
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
115
1.86M
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
1.86M
    // End is when stack is empty
117
1.86M
  }
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
115
731k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
731k
    // End is when stack is empty
117
731k
  }
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
115
290
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
290
    // End is when stack is empty
117
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
115
508k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
508k
    // End is when stack is empty
117
508k
  }
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
115
480
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
480
    // End is when stack is empty
117
480
  }
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
115
457k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
457k
    // End is when stack is empty
117
457k
  }
118
119
42.7M
  inline void toNext() {
120
77.0M
    do {
121
77.0M
      NodeRef Node = VisitStack.back().first;
122
77.0M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
77.0M
124
77.0M
      if (!Opt)
125
42.7M
        Opt.emplace(GT::child_begin(Node));
126
77.0M
127
77.0M
      // Notice that we directly mutate *Opt here, so that
128
77.0M
      // VisitStack.back().second actually gets updated as the iterator
129
77.0M
      // increases.
130
90.3M
      while (*Opt != GT::child_end(Node)) {
131
47.5M
        NodeRef Next = *(*Opt)++;
132
47.5M
        // Has our next sibling been visited?
133
47.5M
        if (this->Visited.insert(Next).second) {
134
34.3M
          // No, do it now.
135
34.3M
          VisitStack.push_back(StackElement(Next, None));
136
34.3M
          return;
137
34.3M
        }
138
47.5M
      }
139
77.0M
      this->Visited.completed(Node);
140
42.7M
141
42.7M
      // Oops, ran out of successors... go up a level on the stack.
142
42.7M
      VisitStack.pop_back();
143
42.7M
    } while (!VisitStack.empty());
144
42.7M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::toNext()
Line
Count
Source
119
4.04M
  inline void toNext() {
120
7.58M
    do {
121
7.58M
      NodeRef Node = VisitStack.back().first;
122
7.58M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
7.58M
124
7.58M
      if (!Opt)
125
4.04M
        Opt.emplace(GT::child_begin(Node));
126
7.58M
127
7.58M
      // Notice that we directly mutate *Opt here, so that
128
7.58M
      // VisitStack.back().second actually gets updated as the iterator
129
7.58M
      // increases.
130
7.58M
      while (*Opt != GT::child_end(Node)) {
131
3.53M
        NodeRef Next = *(*Opt)++;
132
3.53M
        // Has our next sibling been visited?
133
3.53M
        if (this->Visited.insert(Next).second) {
134
3.53M
          // No, do it now.
135
3.53M
          VisitStack.push_back(StackElement(Next, None));
136
3.53M
          return;
137
3.53M
        }
138
3.53M
      }
139
7.58M
      this->Visited.completed(Node);
140
4.04M
141
4.04M
      // Oops, ran out of successors... go up a level on the stack.
142
4.04M
      VisitStack.pop_back();
143
4.04M
    } while (!VisitStack.empty());
144
4.04M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::toNext()
Line
Count
Source
119
561k
  inline void toNext() {
120
716k
    do {
121
716k
      NodeRef Node = VisitStack.back().first;
122
716k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
716k
124
716k
      if (!Opt)
125
561k
        Opt.emplace(GT::child_begin(Node));
126
716k
127
716k
      // Notice that we directly mutate *Opt here, so that
128
716k
      // VisitStack.back().second actually gets updated as the iterator
129
716k
      // increases.
130
716k
      while (*Opt != GT::child_end(Node)) {
131
155k
        NodeRef Next = *(*Opt)++;
132
155k
        // Has our next sibling been visited?
133
155k
        if (this->Visited.insert(Next).second) {
134
155k
          // No, do it now.
135
155k
          VisitStack.push_back(StackElement(Next, None));
136
155k
          return;
137
155k
        }
138
155k
      }
139
716k
      this->Visited.completed(Node);
140
561k
141
561k
      // Oops, ran out of successors... go up a level on the stack.
142
561k
      VisitStack.pop_back();
143
561k
    } while (!VisitStack.empty());
144
561k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::toNext()
Line
Count
Source
119
135
  inline void toNext() {
120
147
    do {
121
147
      NodeRef Node = VisitStack.back().first;
122
147
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
147
124
147
      if (!Opt)
125
135
        Opt.emplace(GT::child_begin(Node));
126
147
127
147
      // Notice that we directly mutate *Opt here, so that
128
147
      // VisitStack.back().second actually gets updated as the iterator
129
147
      // increases.
130
147
      while (*Opt != GT::child_end(Node)) {
131
12
        NodeRef Next = *(*Opt)++;
132
12
        // Has our next sibling been visited?
133
12
        if (this->Visited.insert(Next).second) {
134
12
          // No, do it now.
135
12
          VisitStack.push_back(StackElement(Next, None));
136
12
          return;
137
12
        }
138
12
      }
139
147
      this->Visited.completed(Node);
140
135
141
135
      // Oops, ran out of successors... go up a level on the stack.
142
135
      VisitStack.pop_back();
143
135
    } while (!VisitStack.empty());
144
135
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
119
12.7M
  inline void toNext() {
120
23.7M
    do {
121
23.7M
      NodeRef Node = VisitStack.back().first;
122
23.7M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
23.7M
124
23.7M
      if (!Opt)
125
12.7M
        Opt.emplace(GT::child_begin(Node));
126
23.7M
127
23.7M
      // Notice that we directly mutate *Opt here, so that
128
23.7M
      // VisitStack.back().second actually gets updated as the iterator
129
23.7M
      // increases.
130
30.0M
      while (*Opt != GT::child_end(Node)) {
131
17.2M
        NodeRef Next = *(*Opt)++;
132
17.2M
        // Has our next sibling been visited?
133
17.2M
        if (this->Visited.insert(Next).second) {
134
11.0M
          // No, do it now.
135
11.0M
          VisitStack.push_back(StackElement(Next, None));
136
11.0M
          return;
137
11.0M
        }
138
17.2M
      }
139
23.7M
      this->Visited.completed(Node);
140
12.7M
141
12.7M
      // Oops, ran out of successors... go up a level on the stack.
142
12.7M
      VisitStack.pop_back();
143
12.7M
    } while (!VisitStack.empty());
144
12.7M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
119
1.57M
  inline void toNext() {
120
3.04M
    do {
121
3.04M
      NodeRef Node = VisitStack.back().first;
122
3.04M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
3.04M
124
3.04M
      if (!Opt)
125
1.57M
        Opt.emplace(GT::child_begin(Node));
126
3.04M
127
3.04M
      // Notice that we directly mutate *Opt here, so that
128
3.04M
      // VisitStack.back().second actually gets updated as the iterator
129
3.04M
      // increases.
130
3.93M
      while (*Opt != GT::child_end(Node)) {
131
2.35M
        NodeRef Next = *(*Opt)++;
132
2.35M
        // Has our next sibling been visited?
133
2.35M
        if (this->Visited.insert(Next).second) {
134
1.47M
          // No, do it now.
135
1.47M
          VisitStack.push_back(StackElement(Next, None));
136
1.47M
          return;
137
1.47M
        }
138
2.35M
      }
139
3.04M
      this->Visited.completed(Node);
140
1.57M
141
1.57M
      // Oops, ran out of successors... go up a level on the stack.
142
1.57M
      VisitStack.pop_back();
143
1.57M
    } while (!VisitStack.empty());
144
1.57M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
119
6.10k
  inline void toNext() {
120
10.3k
    do {
121
10.3k
      NodeRef Node = VisitStack.back().first;
122
10.3k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
10.3k
124
10.3k
      if (!Opt)
125
6.10k
        Opt.emplace(GT::child_begin(Node));
126
10.3k
127
10.3k
      // Notice that we directly mutate *Opt here, so that
128
10.3k
      // VisitStack.back().second actually gets updated as the iterator
129
10.3k
      // increases.
130
12.5k
      while (*Opt != GT::child_end(Node)) {
131
6.40k
        NodeRef Next = *(*Opt)++;
132
6.40k
        // Has our next sibling been visited?
133
6.40k
        if (this->Visited.insert(Next).second) {
134
4.22k
          // No, do it now.
135
4.22k
          VisitStack.push_back(StackElement(Next, None));
136
4.22k
          return;
137
4.22k
        }
138
6.40k
      }
139
10.3k
      this->Visited.completed(Node);
140
6.10k
141
6.10k
      // Oops, ran out of successors... go up a level on the stack.
142
6.10k
      VisitStack.pop_back();
143
6.10k
    } while (!VisitStack.empty());
144
6.10k
  }
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
119
7.71M
  inline void toNext() {
120
13.9M
    do {
121
13.9M
      NodeRef Node = VisitStack.back().first;
122
13.9M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
13.9M
124
13.9M
      if (!Opt)
125
7.71M
        Opt.emplace(GT::child_begin(Node));
126
13.9M
127
13.9M
      // Notice that we directly mutate *Opt here, so that
128
13.9M
      // VisitStack.back().second actually gets updated as the iterator
129
13.9M
      // increases.
130
13.9M
      while (*Opt != GT::child_end(Node)) {
131
6.20M
        NodeRef Next = *(*Opt)++;
132
6.20M
        // Has our next sibling been visited?
133
6.20M
        if (this->Visited.insert(Next).second) {
134
6.20M
          // No, do it now.
135
6.20M
          VisitStack.push_back(StackElement(Next, None));
136
6.20M
          return;
137
6.20M
        }
138
6.20M
      }
139
13.9M
      this->Visited.completed(Node);
140
7.71M
141
7.71M
      // Oops, ran out of successors... go up a level on the stack.
142
7.71M
      VisitStack.pop_back();
143
7.71M
    } while (!VisitStack.empty());
144
7.71M
  }
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
119
62
  inline void toNext() {
120
110
    do {
121
110
      NodeRef Node = VisitStack.back().first;
122
110
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
110
124
110
      if (!Opt)
125
62
        Opt.emplace(GT::child_begin(Node));
126
110
127
110
      // Notice that we directly mutate *Opt here, so that
128
110
      // VisitStack.back().second actually gets updated as the iterator
129
110
      // increases.
130
144
      while (*Opt != GT::child_end(Node)) {
131
82
        NodeRef Next = *(*Opt)++;
132
82
        // Has our next sibling been visited?
133
82
        if (this->Visited.insert(Next).second) {
134
48
          // No, do it now.
135
48
          VisitStack.push_back(StackElement(Next, None));
136
48
          return;
137
48
        }
138
82
      }
139
110
      this->Visited.completed(Node);
140
62
141
62
      // Oops, ran out of successors... go up a level on the stack.
142
62
      VisitStack.pop_back();
143
62
    } while (!VisitStack.empty());
144
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
119
8
  inline void toNext() {
120
12
    do {
121
12
      NodeRef Node = VisitStack.back().first;
122
12
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
12
124
12
      if (!Opt)
125
8
        Opt.emplace(GT::child_begin(Node));
126
12
127
12
      // Notice that we directly mutate *Opt here, so that
128
12
      // VisitStack.back().second actually gets updated as the iterator
129
12
      // increases.
130
12
      while (*Opt != GT::child_end(Node)) {
131
4
        NodeRef Next = *(*Opt)++;
132
4
        // Has our next sibling been visited?
133
4
        if (this->Visited.insert(Next).second) {
134
4
          // No, do it now.
135
4
          VisitStack.push_back(StackElement(Next, None));
136
4
          return;
137
4
        }
138
4
      }
139
12
      this->Visited.completed(Node);
140
8
141
8
      // Oops, ran out of successors... go up a level on the stack.
142
8
      VisitStack.pop_back();
143
8
    } while (!VisitStack.empty());
144
8
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::toNext()
Line
Count
Source
119
11.0k
  inline void toNext() {
120
18.0k
    do {
121
18.0k
      NodeRef Node = VisitStack.back().first;
122
18.0k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
18.0k
124
18.0k
      if (!Opt)
125
11.0k
        Opt.emplace(GT::child_begin(Node));
126
18.0k
127
18.0k
      // Notice that we directly mutate *Opt here, so that
128
18.0k
      // VisitStack.back().second actually gets updated as the iterator
129
18.0k
      // increases.
130
20.0k
      while (*Opt != GT::child_end(Node)) {
131
9.08k
        NodeRef Next = *(*Opt)++;
132
9.08k
        // Has our next sibling been visited?
133
9.08k
        if (this->Visited.insert(Next).second) {
134
7.12k
          // No, do it now.
135
7.12k
          VisitStack.push_back(StackElement(Next, None));
136
7.12k
          return;
137
7.12k
        }
138
9.08k
      }
139
18.0k
      this->Visited.completed(Node);
140
10.9k
141
10.9k
      // Oops, ran out of successors... go up a level on the stack.
142
10.9k
      VisitStack.pop_back();
143
10.9k
    } while (!VisitStack.empty());
144
11.0k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::toNext()
Line
Count
Source
119
9
  inline void toNext() {
120
17
    do {
121
17
      NodeRef Node = VisitStack.back().first;
122
17
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
17
124
17
      if (!Opt)
125
9
        Opt.emplace(GT::child_begin(Node));
126
17
127
17
      // Notice that we directly mutate *Opt here, so that
128
17
      // VisitStack.back().second actually gets updated as the iterator
129
17
      // increases.
130
19
      while (*Opt != GT::child_end(Node)) {
131
10
        NodeRef Next = *(*Opt)++;
132
10
        // Has our next sibling been visited?
133
10
        if (this->Visited.insert(Next).second) {
134
8
          // No, do it now.
135
8
          VisitStack.push_back(StackElement(Next, None));
136
8
          return;
137
8
        }
138
10
      }
139
17
      this->Visited.completed(Node);
140
9
141
9
      // Oops, ran out of successors... go up a level on the stack.
142
9
      VisitStack.pop_back();
143
9
    } while (!VisitStack.empty());
144
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
119
1.93k
  inline void toNext() {
120
2.09k
    do {
121
2.09k
      NodeRef Node = VisitStack.back().first;
122
2.09k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
2.09k
124
2.09k
      if (!Opt)
125
1.93k
        Opt.emplace(GT::child_begin(Node));
126
2.09k
127
2.09k
      // Notice that we directly mutate *Opt here, so that
128
2.09k
      // VisitStack.back().second actually gets updated as the iterator
129
2.09k
      // increases.
130
2.09k
      while (*Opt != GT::child_end(Node)) {
131
155
        NodeRef Next = *(*Opt)++;
132
155
        // Has our next sibling been visited?
133
155
        if (this->Visited.insert(Next).second) {
134
155
          // No, do it now.
135
155
          VisitStack.push_back(StackElement(Next, None));
136
155
          return;
137
155
        }
138
155
      }
139
2.09k
      this->Visited.completed(Node);
140
1.93k
141
1.93k
      // Oops, ran out of successors... go up a level on the stack.
142
1.93k
      VisitStack.pop_back();
143
1.93k
    } while (!VisitStack.empty());
144
1.93k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
119
2.85k
  inline void toNext() {
120
4.61k
    do {
121
4.61k
      NodeRef Node = VisitStack.back().first;
122
4.61k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
4.61k
124
4.61k
      if (!Opt)
125
2.22k
        Opt.emplace(GT::child_begin(Node));
126
4.61k
127
4.61k
      // Notice that we directly mutate *Opt here, so that
128
4.61k
      // VisitStack.back().second actually gets updated as the iterator
129
4.61k
      // increases.
130
5.62k
      while (*Opt != GT::child_end(Node)) {
131
3.39k
        NodeRef Next = *(*Opt)++;
132
3.39k
        // Has our next sibling been visited?
133
3.39k
        if (this->Visited.insert(Next).second) {
134
2.38k
          // No, do it now.
135
2.38k
          VisitStack.push_back(StackElement(Next, None));
136
2.38k
          return;
137
2.38k
        }
138
3.39k
      }
139
4.61k
      this->Visited.completed(Node);
140
2.22k
141
2.22k
      // Oops, ran out of successors... go up a level on the stack.
142
2.22k
      VisitStack.pop_back();
143
2.22k
    } while (!VisitStack.empty());
144
2.85k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
119
2.71M
  inline void toNext() {
120
4.94M
    do {
121
4.94M
      NodeRef Node = VisitStack.back().first;
122
4.94M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
4.94M
124
4.94M
      if (!Opt)
125
2.71M
        Opt.emplace(GT::child_begin(Node));
126
4.94M
127
4.94M
      // Notice that we directly mutate *Opt here, so that
128
4.94M
      // VisitStack.back().second actually gets updated as the iterator
129
4.94M
      // increases.
130
6.09M
      while (*Opt != GT::child_end(Node)) {
131
3.38M
        NodeRef Next = *(*Opt)++;
132
3.38M
        // Has our next sibling been visited?
133
3.38M
        if (this->Visited.insert(Next).second) {
134
2.23M
          // No, do it now.
135
2.23M
          VisitStack.push_back(StackElement(Next, None));
136
2.23M
          return;
137
2.23M
        }
138
3.38M
      }
139
4.94M
      this->Visited.completed(Node);
140
2.71M
141
2.71M
      // Oops, ran out of successors... go up a level on the stack.
142
2.71M
      VisitStack.pop_back();
143
2.71M
    } while (!VisitStack.empty());
144
2.71M
  }
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
119
2.35M
  inline void toNext() {
120
2.84M
    do {
121
2.84M
      NodeRef Node = VisitStack.back().first;
122
2.84M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
2.84M
124
2.84M
      if (!Opt)
125
2.35M
        Opt.emplace(GT::child_begin(Node));
126
2.84M
127
2.84M
      // Notice that we directly mutate *Opt here, so that
128
2.84M
      // VisitStack.back().second actually gets updated as the iterator
129
2.84M
      // increases.
130
3.06M
      while (*Opt != GT::child_end(Node)) {
131
706k
        NodeRef Next = *(*Opt)++;
132
706k
        // Has our next sibling been visited?
133
706k
        if (this->Visited.insert(Next).second) {
134
490k
          // No, do it now.
135
490k
          VisitStack.push_back(StackElement(Next, None));
136
490k
          return;
137
490k
        }
138
706k
      }
139
2.84M
      this->Visited.completed(Node);
140
2.35M
141
2.35M
      // Oops, ran out of successors... go up a level on the stack.
142
2.35M
      VisitStack.pop_back();
143
2.35M
    } while (!VisitStack.empty());
144
2.35M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
119
5.20M
  inline void toNext() {
120
9.68M
    do {
121
9.68M
      NodeRef Node = VisitStack.back().first;
122
9.68M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
9.68M
124
9.68M
      if (!Opt)
125
5.20M
        Opt.emplace(GT::child_begin(Node));
126
9.68M
127
9.68M
      // Notice that we directly mutate *Opt here, so that
128
9.68M
      // VisitStack.back().second actually gets updated as the iterator
129
9.68M
      // increases.
130
11.8M
      while (*Opt != GT::child_end(Node)) {
131
6.68M
        NodeRef Next = *(*Opt)++;
132
6.68M
        // Has our next sibling been visited?
133
6.68M
        if (this->Visited.insert(Next).second) {
134
4.47M
          // No, do it now.
135
4.47M
          VisitStack.push_back(StackElement(Next, None));
136
4.47M
          return;
137
4.47M
        }
138
6.68M
      }
139
9.68M
      this->Visited.completed(Node);
140
5.20M
141
5.20M
      // Oops, ran out of successors... go up a level on the stack.
142
5.20M
      VisitStack.pop_back();
143
5.20M
    } while (!VisitStack.empty());
144
5.20M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
119
395
  inline void toNext() {
120
585
    do {
121
585
      NodeRef Node = VisitStack.back().first;
122
585
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
585
124
585
      if (!Opt)
125
395
        Opt.emplace(GT::child_begin(Node));
126
585
127
585
      // Notice that we directly mutate *Opt here, so that
128
585
      // VisitStack.back().second actually gets updated as the iterator
129
585
      // increases.
130
629
      while (*Opt != GT::child_end(Node)) {
131
234
        NodeRef Next = *(*Opt)++;
132
234
        // Has our next sibling been visited?
133
234
        if (this->Visited.insert(Next).second) {
134
190
          // No, do it now.
135
190
          VisitStack.push_back(StackElement(Next, None));
136
190
          return;
137
190
        }
138
234
      }
139
585
      this->Visited.completed(Node);
140
395
141
395
      // Oops, ran out of successors... go up a level on the stack.
142
395
      VisitStack.pop_back();
143
395
    } while (!VisitStack.empty());
144
395
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
Line
Count
Source
119
3.72k
  inline void toNext() {
120
7.15k
    do {
121
7.15k
      NodeRef Node = VisitStack.back().first;
122
7.15k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
7.15k
124
7.15k
      if (!Opt)
125
3.72k
        Opt.emplace(GT::child_begin(Node));
126
7.15k
127
7.15k
      // Notice that we directly mutate *Opt here, so that
128
7.15k
      // VisitStack.back().second actually gets updated as the iterator
129
7.15k
      // increases.
130
7.33k
      while (*Opt != GT::child_end(Node)) {
131
3.61k
        NodeRef Next = *(*Opt)++;
132
3.61k
        // Has our next sibling been visited?
133
3.61k
        if (this->Visited.insert(Next).second) {
134
3.43k
          // No, do it now.
135
3.43k
          VisitStack.push_back(StackElement(Next, None));
136
3.43k
          return;
137
3.43k
        }
138
3.61k
      }
139
7.15k
      this->Visited.completed(Node);
140
3.72k
141
3.72k
      // Oops, ran out of successors... go up a level on the stack.
142
3.72k
      VisitStack.pop_back();
143
3.72k
    } while (!VisitStack.empty());
144
3.72k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
119
2.74M
  inline void toNext() {
120
4.97M
    do {
121
4.97M
      NodeRef Node = VisitStack.back().first;
122
4.97M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
4.97M
124
4.97M
      if (!Opt)
125
2.74M
        Opt.emplace(GT::child_begin(Node));
126
4.97M
127
4.97M
      // Notice that we directly mutate *Opt here, so that
128
4.97M
      // VisitStack.back().second actually gets updated as the iterator
129
4.97M
      // increases.
130
6.20M
      while (*Opt != GT::child_end(Node)) {
131
3.46M
        NodeRef Next = *(*Opt)++;
132
3.46M
        // Has our next sibling been visited?
133
3.46M
        if (this->Visited.insert(Next).second) {
134
2.23M
          // No, do it now.
135
2.23M
          VisitStack.push_back(StackElement(Next, None));
136
2.23M
          return;
137
2.23M
        }
138
3.46M
      }
139
4.97M
      this->Visited.completed(Node);
140
2.74M
141
2.74M
      // Oops, ran out of successors... go up a level on the stack.
142
2.74M
      VisitStack.pop_back();
143
2.74M
    } while (!VisitStack.empty());
144
2.74M
  }
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
119
690
  inline void toNext() {
120
1.02k
    do {
121
1.02k
      NodeRef Node = VisitStack.back().first;
122
1.02k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
1.02k
124
1.02k
      if (!Opt)
125
690
        Opt.emplace(GT::child_begin(Node));
126
1.02k
127
1.02k
      // Notice that we directly mutate *Opt here, so that
128
1.02k
      // VisitStack.back().second actually gets updated as the iterator
129
1.02k
      // increases.
130
1.22k
      while (*Opt != GT::child_end(Node)) {
131
690
        NodeRef Next = *(*Opt)++;
132
690
        // Has our next sibling been visited?
133
690
        if (this->Visited.insert(Next).second) {
134
486
          // No, do it now.
135
486
          VisitStack.push_back(StackElement(Next, None));
136
486
          return;
137
486
        }
138
690
      }
139
1.02k
      this->Visited.completed(Node);
140
535
141
535
      // Oops, ran out of successors... go up a level on the stack.
142
535
      VisitStack.pop_back();
143
535
    } while (!VisitStack.empty());
144
690
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
Line
Count
Source
119
137
  inline void toNext() {
120
172
    do {
121
172
      NodeRef Node = VisitStack.back().first;
122
172
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
172
124
172
      if (!Opt)
125
86
        Opt.emplace(GT::child_begin(Node));
126
172
127
172
      // Notice that we directly mutate *Opt here, so that
128
172
      // VisitStack.back().second actually gets updated as the iterator
129
172
      // increases.
130
183
      while (*Opt != GT::child_end(Node)) {
131
100
        NodeRef Next = *(*Opt)++;
132
100
        // Has our next sibling been visited?
133
100
        if (this->Visited.insert(Next).second) {
134
89
          // No, do it now.
135
89
          VisitStack.push_back(StackElement(Next, None));
136
89
          return;
137
89
        }
138
100
      }
139
172
      this->Visited.completed(Node);
140
83
141
83
      // Oops, ran out of successors... go up a level on the stack.
142
83
      VisitStack.pop_back();
143
83
    } while (!VisitStack.empty());
144
137
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
119
2.89M
  inline void toNext() {
120
5.34M
    do {
121
5.34M
      NodeRef Node = VisitStack.back().first;
122
5.34M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
5.34M
124
5.34M
      if (!Opt)
125
2.89M
        Opt.emplace(GT::child_begin(Node));
126
5.34M
127
5.34M
      // Notice that we directly mutate *Opt here, so that
128
5.34M
      // VisitStack.back().second actually gets updated as the iterator
129
5.34M
      // increases.
130
6.67M
      while (*Opt != GT::child_end(Node)) {
131
3.77M
        NodeRef Next = *(*Opt)++;
132
3.77M
        // Has our next sibling been visited?
133
3.77M
        if (this->Visited.insert(Next).second) {
134
2.44M
          // No, do it now.
135
2.44M
          VisitStack.push_back(StackElement(Next, None));
136
2.44M
          return;
137
2.44M
        }
138
3.77M
      }
139
5.34M
      this->Visited.completed(Node);
140
2.89M
141
2.89M
      // Oops, ran out of successors... go up a level on the stack.
142
2.89M
      VisitStack.pop_back();
143
2.89M
    } while (!VisitStack.empty());
144
2.89M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::toNext()
Line
Count
Source
119
637
  inline void toNext() {
120
656
    do {
121
656
      NodeRef Node = VisitStack.back().first;
122
656
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
656
124
656
      if (!Opt)
125
330
        Opt.emplace(GT::child_begin(Node));
126
656
127
656
      // Notice that we directly mutate *Opt here, so that
128
656
      // VisitStack.back().second actually gets updated as the iterator
129
656
      // increases.
130
676
      while (*Opt != GT::child_end(Node)) {
131
350
        NodeRef Next = *(*Opt)++;
132
350
        // Has our next sibling been visited?
133
350
        if (this->Visited.insert(Next).second) {
134
330
          // No, do it now.
135
330
          VisitStack.push_back(StackElement(Next, None));
136
330
          return;
137
330
        }
138
350
      }
139
656
      this->Visited.completed(Node);
140
326
141
326
      // Oops, ran out of successors... go up a level on the stack.
142
326
      VisitStack.pop_back();
143
326
    } while (!VisitStack.empty());
144
637
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::toNext()
Line
Count
Source
119
92.4k
  inline void toNext() {
120
103k
    do {
121
103k
      NodeRef Node = VisitStack.back().first;
122
103k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
103k
124
103k
      if (!Opt)
125
92.4k
        Opt.emplace(GT::child_begin(Node));
126
103k
127
103k
      // Notice that we directly mutate *Opt here, so that
128
103k
      // VisitStack.back().second actually gets updated as the iterator
129
103k
      // increases.
130
103k
      while (*Opt != GT::child_end(Node)) {
131
11.0k
        NodeRef Next = *(*Opt)++;
132
11.0k
        // Has our next sibling been visited?
133
11.0k
        if (this->Visited.insert(Next).second) {
134
11.0k
          // No, do it now.
135
11.0k
          VisitStack.push_back(StackElement(Next, None));
136
11.0k
          return;
137
11.0k
        }
138
11.0k
      }
139
103k
      this->Visited.completed(Node);
140
92.4k
141
92.4k
      // Oops, ran out of successors... go up a level on the stack.
142
92.4k
      VisitStack.pop_back();
143
92.4k
    } while (!VisitStack.empty());
144
92.4k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::toNext()
Line
Count
Source
119
73.1k
  inline void toNext() {
120
88.8k
    do {
121
88.8k
      NodeRef Node = VisitStack.back().first;
122
88.8k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
88.8k
124
88.8k
      if (!Opt)
125
73.1k
        Opt.emplace(GT::child_begin(Node));
126
88.8k
127
88.8k
      // Notice that we directly mutate *Opt here, so that
128
88.8k
      // VisitStack.back().second actually gets updated as the iterator
129
88.8k
      // increases.
130
91.5k
      while (*Opt != GT::child_end(Node)) {
131
18.4k
        NodeRef Next = *(*Opt)++;
132
18.4k
        // Has our next sibling been visited?
133
18.4k
        if (this->Visited.insert(Next).second) {
134
15.7k
          // No, do it now.
135
15.7k
          VisitStack.push_back(StackElement(Next, None));
136
15.7k
          return;
137
15.7k
        }
138
18.4k
      }
139
88.8k
      this->Visited.completed(Node);
140
73.1k
141
73.1k
      // Oops, ran out of successors... go up a level on the stack.
142
73.1k
      VisitStack.pop_back();
143
73.1k
    } while (!VisitStack.empty());
144
73.1k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::toNext()
145
146
public:
147
  using pointer = typename super::pointer;
148
149
  // Provide static begin and end methods as our public "constructors"
150
4.41M
  static df_iterator begin(const GraphT &G) {
151
4.41M
    return df_iterator(GT::getEntryNode(G));
152
4.41M
  }
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
150
511k
  static df_iterator begin(const GraphT &G) {
151
511k
    return df_iterator(GT::getEntryNode(G));
152
511k
  }
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
150
405k
  static df_iterator begin(const GraphT &G) {
151
405k
    return df_iterator(GT::getEntryNode(G));
152
405k
  }
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
150
123
  static df_iterator begin(const GraphT &G) {
151
123
    return df_iterator(GT::getEntryNode(G));
152
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
150
1.73M
  static df_iterator begin(const GraphT &G) {
151
1.73M
    return df_iterator(GT::getEntryNode(G));
152
1.73M
  }
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
150
101k
  static df_iterator begin(const GraphT &G) {
151
101k
    return df_iterator(GT::getEntryNode(G));
152
101k
  }
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
150
1.51M
  static df_iterator begin(const GraphT &G) {
151
1.51M
    return df_iterator(GT::getEntryNode(G));
152
1.51M
  }
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
150
4.42k
  static df_iterator begin(const GraphT &G) {
151
4.42k
    return df_iterator(GT::getEntryNode(G));
152
4.42k
  }
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
150
4
  static df_iterator begin(const GraphT &G) {
151
4
    return df_iterator(GT::getEntryNode(G));
152
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
150
14
  static df_iterator begin(const GraphT &G) {
151
14
    return df_iterator(GT::getEntryNode(G));
152
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
150
1
  static df_iterator begin(const GraphT &G) {
151
1
    return df_iterator(GT::getEntryNode(G));
152
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
150
1.78k
  static df_iterator begin(const GraphT &G) {
151
1.78k
    return df_iterator(GT::getEntryNode(G));
152
1.78k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::begin(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::begin(llvm::MachineRegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::begin(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::begin(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::begin(llvm::Function* const&)
Line
Count
Source
150
205
  static df_iterator begin(const GraphT &G) {
151
205
    return df_iterator(GT::getEntryNode(G));
152
205
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::begin(llvm::Inverse<llvm::BasicBlock*> const&)
Line
Count
Source
150
50
  static df_iterator begin(const GraphT &G) {
151
50
    return df_iterator(GT::getEntryNode(G));
152
50
  }
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
150
319
  static df_iterator begin(const GraphT &G) {
151
319
    return df_iterator(GT::getEntryNode(G));
152
319
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::begin(llvm::DominatorTree* const&)
Line
Count
Source
150
81.4k
  static df_iterator begin(const GraphT &G) {
151
81.4k
    return df_iterator(GT::getEntryNode(G));
152
81.4k
  }
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
150
57.3k
  static df_iterator begin(const GraphT &G) {
151
57.3k
    return df_iterator(GT::getEntryNode(G));
152
57.3k
  }
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&)
153
4.41M
  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
153
511k
  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
153
405k
  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
153
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
153
1.73M
  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
153
101k
  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
153
1.51M
  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
153
4.42k
  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
153
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
153
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
153
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
153
1.78k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::end(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode const*> >::end(llvm::MachineRegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> >::end(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::end(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::end(llvm::Function* const&)
Line
Count
Source
153
205
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::end(llvm::Inverse<llvm::BasicBlock*> const&)
Line
Count
Source
153
50
  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
153
319
  static df_iterator end(const GraphT &G) { return df_iterator(); }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::end(llvm::DominatorTree* const&)
Line
Count
Source
153
81.4k
  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
153
57.3k
  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&)
154
155
  // Static begin and end methods as our public ctors for external iterators
156
4.04M
  static df_iterator begin(const GraphT &G, SetType &S) {
157
4.04M
    return df_iterator(GT::getEntryNode(G), S);
158
4.04M
  }
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
156
1.87k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
1.87k
    return df_iterator(GT::getEntryNode(G), S);
158
1.87k
  }
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
156
3.03k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
3.03k
    return df_iterator(GT::getEntryNode(G), S);
158
3.03k
  }
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
156
471k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
471k
    return df_iterator(GT::getEntryNode(G), S);
158
471k
  }
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
156
1.86M
  static df_iterator begin(const GraphT &G, SetType &S) {
157
1.86M
    return df_iterator(GT::getEntryNode(G), S);
158
1.86M
  }
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
156
731k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
731k
    return df_iterator(GT::getEntryNode(G), S);
158
731k
  }
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
156
290
  static df_iterator begin(const GraphT &G, SetType &S) {
157
290
    return df_iterator(GT::getEntryNode(G), S);
158
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
156
508k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
508k
    return df_iterator(GT::getEntryNode(G), S);
158
508k
  }
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
156
480
  static df_iterator begin(const GraphT &G, SetType &S) {
157
480
    return df_iterator(GT::getEntryNode(G), S);
158
480
  }
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
156
457k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
457k
    return df_iterator(GT::getEntryNode(G), S);
158
457k
  }
159
4.04M
  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
159
1.87k
  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
159
3.03k
  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
159
471k
  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
159
1.86M
  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
159
731k
  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
159
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
159
508k
  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
159
480
  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
159
457k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
160
161
51.2M
  bool operator==(const df_iterator &x) const {
162
51.2M
    return VisitStack == x.VisitStack;
163
51.2M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator==(llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > const&) const
Line
Count
Source
161
4.55M
  bool operator==(const df_iterator &x) const {
162
4.55M
    return VisitStack == x.VisitStack;
163
4.55M
  }
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
161
966k
  bool operator==(const df_iterator &x) const {
162
966k
    return VisitStack == x.VisitStack;
163
966k
  }
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
161
258
  bool operator==(const df_iterator &x) const {
162
258
    return VisitStack == x.VisitStack;
163
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
161
14.4M
  bool operator==(const df_iterator &x) const {
162
14.4M
    return VisitStack == x.VisitStack;
163
14.4M
  }
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
161
1.67M
  bool operator==(const df_iterator &x) const {
162
1.67M
    return VisitStack == x.VisitStack;
163
1.67M
  }
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
161
7.97k
  bool operator==(const df_iterator &x) const {
162
7.97k
    return VisitStack == x.VisitStack;
163
7.97k
  }
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
161
9.22M
  bool operator==(const df_iterator &x) const {
162
9.22M
    return VisitStack == x.VisitStack;
163
9.22M
  }
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
161
76
  bool operator==(const df_iterator &x) const {
162
76
    return VisitStack == x.VisitStack;
163
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
161
12
  bool operator==(const df_iterator &x) const {
162
12
    return VisitStack == x.VisitStack;
163
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
161
15.4k
  bool operator==(const df_iterator &x) const {
162
15.4k
    return VisitStack == x.VisitStack;
163
15.4k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator==(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > > const&) const
Line
Count
Source
161
10
  bool operator==(const df_iterator &x) const {
162
10
    return VisitStack == x.VisitStack;
163
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
161
3.72k
  bool operator==(const df_iterator &x) const {
162
3.72k
    return VisitStack == x.VisitStack;
163
3.72k
  }
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
161
8.36k
  bool operator==(const df_iterator &x) const {
162
8.36k
    return VisitStack == x.VisitStack;
163
8.36k
  }
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
161
3.18M
  bool operator==(const df_iterator &x) const {
162
3.18M
    return VisitStack == x.VisitStack;
163
3.18M
  }
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
161
4.22M
  bool operator==(const df_iterator &x) const {
162
4.22M
    return VisitStack == x.VisitStack;
163
4.22M
  }
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
161
5.93M
  bool operator==(const df_iterator &x) const {
162
5.93M
    return VisitStack == x.VisitStack;
163
5.93M
  }
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
161
600
  bool operator==(const df_iterator &x) const {
162
600
    return VisitStack == x.VisitStack;
163
600
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
161
4.01k
  bool operator==(const df_iterator &x) const {
162
4.01k
    return VisitStack == x.VisitStack;
163
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
161
3.25M
  bool operator==(const df_iterator &x) const {
162
3.25M
    return VisitStack == x.VisitStack;
163
3.25M
  }
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
161
1.17k
  bool operator==(const df_iterator &x) const {
162
1.17k
    return VisitStack == x.VisitStack;
163
1.17k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator==(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
161
137
  bool operator==(const df_iterator &x) const {
162
137
    return VisitStack == x.VisitStack;
163
137
  }
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
161
3.35M
  bool operator==(const df_iterator &x) const {
162
3.35M
    return VisitStack == x.VisitStack;
163
3.35M
  }
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
161
956
  bool operator==(const df_iterator &x) const {
162
956
    return VisitStack == x.VisitStack;
163
956
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator==(llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > const&) const
Line
Count
Source
161
173k
  bool operator==(const df_iterator &x) const {
162
173k
    return VisitStack == x.VisitStack;
163
173k
  }
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
161
130k
  bool operator==(const df_iterator &x) const {
162
130k
    return VisitStack == x.VisitStack;
163
130k
  }
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
164
51.2M
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator!=(llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> > const&) const
Line
Count
Source
164
4.55M
  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
164
966k
  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
164
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
164
14.4M
  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
164
1.67M
  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
164
7.97k
  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
164
9.22M
  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
164
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
164
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
164
15.4k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator!=(llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > > const&) const
Line
Count
Source
164
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
164
3.72k
  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
164
8.36k
  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
164
3.18M
  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
164
4.22M
  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
164
5.93M
  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
164
600
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
164
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
164
3.25M
  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
164
1.17k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator!=(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&) const
Line
Count
Source
164
137
  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
164
3.35M
  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
164
956
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator!=(llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > const&) const
Line
Count
Source
164
173k
  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
164
130k
  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
165
166
42.7M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator*() const
Line
Count
Source
166
4.04M
  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
166
561k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator*() const
Line
Count
Source
166
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
166
12.7M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator*() const
Line
Count
Source
166
1.57M
  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
166
6.10k
  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
166
7.71M
  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
166
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
166
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
166
18.4k
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator*() const
Line
Count
Source
166
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
166
1.93k
  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
166
5.32k
  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
166
2.71M
  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
166
2.35M
  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
166
5.20M
  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
166
395
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
166
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
166
2.74M
  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
166
817
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
166
89
  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
166
2.89M
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::operator*() const
Line
Count
Source
166
649
  const NodeRef &operator*() const { return VisitStack.back().first; }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator*() const
Line
Count
Source
166
92.4k
  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
166
73.1k
  const NodeRef &operator*() const { return VisitStack.back().first; }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator*() const
167
168
  // This is a nonstandard operator-> that dereferences the pointer an extra
169
  // time... so that you can actually call methods ON the Node, because
170
  // the contained type is a pointer.  This allows BBIt->getTerminator() f.e.
171
  //
172
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
172
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
172
13.8k
  NodeRef operator->() const { return **this; }
173
174
42.7M
  df_iterator &operator++() { // Preincrement
175
42.7M
    toNext();
176
42.7M
    return *this;
177
42.7M
  }
llvm::df_iterator<llvm::MachineDominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::MachineDominatorTree*> >::operator++()
Line
Count
Source
174
4.04M
  df_iterator &operator++() { // Preincrement
175
4.04M
    toNext();
176
4.04M
    return *this;
177
4.04M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator++()
Line
Count
Source
174
561k
  df_iterator &operator++() { // Preincrement
175
561k
    toNext();
176
561k
    return *this;
177
561k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator++()
Line
Count
Source
174
135
  df_iterator &operator++() { // Preincrement
175
135
    toNext();
176
135
    return *this;
177
135
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
174
12.7M
  df_iterator &operator++() { // Preincrement
175
12.7M
    toNext();
176
12.7M
    return *this;
177
12.7M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
174
1.57M
  df_iterator &operator++() { // Preincrement
175
1.57M
    toNext();
176
1.57M
    return *this;
177
1.57M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
174
6.10k
  df_iterator &operator++() { // Preincrement
175
6.10k
    toNext();
176
6.10k
    return *this;
177
6.10k
  }
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
174
7.71M
  df_iterator &operator++() { // Preincrement
175
7.71M
    toNext();
176
7.71M
    return *this;
177
7.71M
  }
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
174
62
  df_iterator &operator++() { // Preincrement
175
62
    toNext();
176
62
    return *this;
177
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
174
8
  df_iterator &operator++() { // Preincrement
175
8
    toNext();
176
8
    return *this;
177
8
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::RegionNode*> >::operator++()
Line
Count
Source
174
11.0k
  df_iterator &operator++() { // Preincrement
175
11.0k
    toNext();
176
11.0k
    return *this;
177
11.0k
  }
llvm::df_iterator<llvm::RegionNode*, llvm::df_iterator_default_set<llvm::RegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode*> > >::operator++()
Line
Count
Source
174
9
  df_iterator &operator++() { // Preincrement
175
9
    toNext();
176
9
    return *this;
177
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
174
1.93k
  df_iterator &operator++() { // Preincrement
175
1.93k
    toNext();
176
1.93k
    return *this;
177
1.93k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
174
2.22k
  df_iterator &operator++() { // Preincrement
175
2.22k
    toNext();
176
2.22k
    return *this;
177
2.22k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
174
2.71M
  df_iterator &operator++() { // Preincrement
175
2.71M
    toNext();
176
2.71M
    return *this;
177
2.71M
  }
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
174
2.35M
  df_iterator &operator++() { // Preincrement
175
2.35M
    toNext();
176
2.35M
    return *this;
177
2.35M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
174
5.20M
  df_iterator &operator++() { // Preincrement
175
5.20M
    toNext();
176
5.20M
    return *this;
177
5.20M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
174
395
  df_iterator &operator++() { // Preincrement
175
395
    toNext();
176
395
    return *this;
177
395
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
174
3.72k
  df_iterator &operator++() { // Preincrement
175
3.72k
    toNext();
176
3.72k
    return *this;
177
3.72k
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, true, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
174
2.74M
  df_iterator &operator++() { // Preincrement
175
2.74M
    toNext();
176
2.74M
    return *this;
177
2.74M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
174
690
  df_iterator &operator++() { // Preincrement
175
690
    toNext();
176
690
    return *this;
177
690
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
174
86
  df_iterator &operator++() { // Preincrement
175
86
    toNext();
176
86
    return *this;
177
86
  }
ADCE.cpp:llvm::df_iterator<llvm::BasicBlock*, (anonymous namespace)::AggressiveDeadCodeElimination::initialize()::DFState, true, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
174
2.89M
  df_iterator &operator++() { // Preincrement
175
2.89M
    toNext();
176
2.89M
    return *this;
177
2.89M
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock const*>, llvm::df_iterator_default_set<llvm::BasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock const*> > >::operator++()
Line
Count
Source
174
330
  df_iterator &operator++() { // Preincrement
175
330
    toNext();
176
330
    return *this;
177
330
  }
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> >::operator++()
Line
Count
Source
174
92.4k
  df_iterator &operator++() { // Preincrement
175
92.4k
    toNext();
176
92.4k
    return *this;
177
92.4k
  }
llvm::df_iterator<llvm::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator++()
Line
Count
Source
174
73.1k
  df_iterator &operator++() { // Preincrement
175
73.1k
    toNext();
176
73.1k
    return *this;
177
73.1k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator++()
178
179
  /// Skips all children of the current node and traverses to next node
180
  ///
181
  /// Note: This function takes care of incrementing the iterator. If you
182
  /// always increment and call this function, you risk walking off the end.
183
3.48k
  df_iterator &skipChildren() {
184
3.48k
    VisitStack.pop_back();
185
3.48k
    if (!VisitStack.empty())
186
1.01k
      toNext();
187
3.48k
    return *this;
188
3.48k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::skipChildren()
Line
Count
Source
183
3.09k
  df_iterator &skipChildren() {
184
3.09k
    VisitStack.pop_back();
185
3.09k
    if (!VisitStack.empty())
186
627
      toNext();
187
3.09k
    return *this;
188
3.09k
  }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::skipChildren()
Line
Count
Source
183
51
  df_iterator &skipChildren() {
184
51
    VisitStack.pop_back();
185
51
    if (!VisitStack.empty())
186
51
      toNext();
187
51
    return *this;
188
51
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::skipChildren()
Line
Count
Source
183
28
  df_iterator &skipChildren() {
184
28
    VisitStack.pop_back();
185
28
    if (!VisitStack.empty())
186
28
      toNext();
187
28
    return *this;
188
28
  }
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
183
307
  df_iterator &skipChildren() {
184
307
    VisitStack.pop_back();
185
307
    if (!VisitStack.empty())
186
307
      toNext();
187
307
    return *this;
188
307
  }
189
190
  df_iterator operator++(int) { // Postincrement
191
    df_iterator tmp = *this;
192
    ++*this;
193
    return tmp;
194
  }
195
196
  // nodeVisited - return true if this iterator has already visited the
197
  // specified node.  This is public, and will probably be used to iterate over
198
  // nodes that a depth first iteration did not find: ie unreachable nodes.
199
  //
200
1.35k
  bool nodeVisited(NodeRef Node) const {
201
1.35k
    return this->Visited.count(Node) != 0;
202
1.35k
  }
203
204
  /// getPathLength - Return the length of the path from the entry node to the
205
  /// current node, counting both nodes.
206
7.57M
  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
206
2.84M
  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
206
4.72M
  unsigned getPathLength() const { return VisitStack.size(); }
llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::getPathLength() const
Line
Count
Source
206
36
  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
206
252
  unsigned getPathLength() const { return VisitStack.size(); }
207
208
  /// getPath - Return the n'th node in the path from the entry node to the
209
  /// current node.
210
2.72M
  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
210
490k
  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
210
2.23M
  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
210
440
  NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
211
};
212
213
// Provide global constructors that automatically figure out correct types...
214
//
215
template <class T>
216
4.40M
df_iterator<T> df_begin(const T& G) {
217
4.40M
  return df_iterator<T>::begin(G);
218
4.40M
}
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
216
511k
df_iterator<T> df_begin(const T& G) {
217
511k
  return df_iterator<T>::begin(G);
218
511k
}
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
216
1.51M
df_iterator<T> df_begin(const T& G) {
217
1.51M
  return df_iterator<T>::begin(G);
218
1.51M
}
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
216
405k
df_iterator<T> df_begin(const T& G) {
217
405k
  return df_iterator<T>::begin(G);
218
405k
}
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
216
123
df_iterator<T> df_begin(const T& G) {
217
123
  return df_iterator<T>::begin(G);
218
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
216
1.73M
df_iterator<T> df_begin(const T& G) {
217
1.73M
  return df_iterator<T>::begin(G);
218
1.73M
}
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
216
101k
df_iterator<T> df_begin(const T& G) {
217
101k
  return df_iterator<T>::begin(G);
218
101k
}
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
216
14
df_iterator<T> df_begin(const T& G) {
217
14
  return df_iterator<T>::begin(G);
218
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
216
1.78k
df_iterator<T> df_begin(const T& G) {
217
1.78k
  return df_iterator<T>::begin(G);
218
1.78k
}
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_begin<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_begin<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > llvm::df_begin<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
216
205
df_iterator<T> df_begin(const T& G) {
217
205
  return df_iterator<T>::begin(G);
218
205
}
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > llvm::df_begin<llvm::DominatorTree*>(llvm::DominatorTree* const&)
Line
Count
Source
216
81.4k
df_iterator<T> df_begin(const T& G) {
217
81.4k
  return df_iterator<T>::begin(G);
218
81.4k
}
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
216
57.3k
df_iterator<T> df_begin(const T& G) {
217
57.3k
  return df_iterator<T>::begin(G);
218
57.3k
}
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&)
219
220
template <class T>
221
4.40M
df_iterator<T> df_end(const T& G) {
222
4.40M
  return df_iterator<T>::end(G);
223
4.40M
}
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
221
511k
df_iterator<T> df_end(const T& G) {
222
511k
  return df_iterator<T>::end(G);
223
511k
}
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
221
1.51M
df_iterator<T> df_end(const T& G) {
222
1.51M
  return df_iterator<T>::end(G);
223
1.51M
}
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
221
405k
df_iterator<T> df_end(const T& G) {
222
405k
  return df_iterator<T>::end(G);
223
405k
}
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
221
123
df_iterator<T> df_end(const T& G) {
222
123
  return df_iterator<T>::end(G);
223
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
221
1.73M
df_iterator<T> df_end(const T& G) {
222
1.73M
  return df_iterator<T>::end(G);
223
1.73M
}
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
221
101k
df_iterator<T> df_end(const T& G) {
222
101k
  return df_iterator<T>::end(G);
223
101k
}
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
221
14
df_iterator<T> df_end(const T& G) {
222
14
  return df_iterator<T>::end(G);
223
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
221
1.78k
df_iterator<T> df_end(const T& G) {
222
1.78k
  return df_iterator<T>::end(G);
223
1.78k
}
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock*> > llvm::df_end<llvm::MachineBasicBlock*>(llvm::MachineBasicBlock* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::MachineBasicBlock const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> > llvm::df_end<llvm::MachineBasicBlock const*>(llvm::MachineBasicBlock const* const&)
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::Function*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::Function*> > llvm::df_end<llvm::Function*>(llvm::Function* const&)
Line
Count
Source
221
205
df_iterator<T> df_end(const T& G) {
222
205
  return df_iterator<T>::end(G);
223
205
}
llvm::df_iterator<llvm::DominatorTree*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DominatorTree*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DominatorTree*> > llvm::df_end<llvm::DominatorTree*>(llvm::DominatorTree* const&)
Line
Count
Source
221
81.4k
df_iterator<T> df_end(const T& G) {
222
81.4k
  return df_iterator<T>::end(G);
223
81.4k
}
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
221
57.3k
df_iterator<T> df_end(const T& G) {
222
57.3k
  return df_iterator<T>::end(G);
223
57.3k
}
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&)
224
225
// Provide an accessor method to use them in range-based patterns.
226
template <class T>
227
4.23M
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
4.23M
  return make_range(df_begin(G), df_end(G));
229
4.23M
}
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
227
511k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
511k
  return make_range(df_begin(G), df_end(G));
229
511k
}
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
227
104
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
104
  return make_range(df_begin(G), df_end(G));
229
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
227
101k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
101k
  return make_range(df_begin(G), df_end(G));
229
101k
}
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
227
267k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
267k
  return make_range(df_begin(G), df_end(G));
229
267k
}
llvm::iterator_range<llvm::df_iterator<llvm::DomTreeNodeBase<llvm::BasicBlock>*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<llvm::BasicBlock>*> > > llvm::depth_first<llvm::DomTreeNodeBase<llvm::BasicBlock>*>(llvm::DomTreeNodeBase<llvm::BasicBlock>* const&)
Line
Count
Source
227
1.51M
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
1.51M
  return make_range(df_begin(G), df_end(G));
229
1.51M
}
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
227
1.78k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
1.78k
  return make_range(df_begin(G), df_end(G));
229
1.78k
}
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
227
205
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
205
  return make_range(df_begin(G), df_end(G));
229
205
}
llvm::iterator_range<llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> > > llvm::depth_first<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
227
1.69M
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
1.69M
  return make_range(df_begin(G), df_end(G));
229
1.69M
}
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
227
81.4k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
81.4k
  return make_range(df_begin(G), df_end(G));
229
81.4k
}
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
227
57.3k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
57.3k
  return make_range(df_begin(G), df_end(G));
229
57.3k
}
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&)
230
231
// Provide global definitions of external depth first iterators...
232
template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
233
struct df_ext_iterator : public df_iterator<T, SetTy, true> {
234
  df_ext_iterator(const df_iterator<T, SetTy, true> &V)
235
8.08M
    : 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
235
3.74k
    : 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
235
6.07k
    : 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
235
943k
    : 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
235
3.73M
    : 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
235
1.46M
    : 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
235
1.01M
    : 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
235
915k
    : df_iterator<T, SetTy, true>(V) {}
236
};
237
238
template <class T, class SetTy>
239
4.04M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
4.04M
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
4.04M
}
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
239
1.87k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
1.87k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
1.87k
}
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
239
3.03k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
3.03k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
3.03k
}
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
239
471k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
471k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
471k
}
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
239
1.86M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
1.86M
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
1.86M
}
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
239
731k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
731k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
731k
}
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
239
508k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
508k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
508k
}
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
239
457k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
457k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
457k
}
242
243
template <class T, class SetTy>
244
4.04M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
4.04M
  return df_ext_iterator<T, SetTy>::end(G, S);
246
4.04M
}
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
244
1.87k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
1.87k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
1.87k
}
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
244
3.03k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
3.03k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
3.03k
}
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
244
471k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
471k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
471k
}
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
244
1.86M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
1.86M
  return df_ext_iterator<T, SetTy>::end(G, S);
246
1.86M
}
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
244
731k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
731k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
731k
}
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
244
508k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
508k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
508k
}
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
244
457k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
457k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
457k
}
247
248
template <class T, class SetTy>
249
iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G,
250
1.91M
                                                          SetTy &S) {
251
1.91M
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
1.91M
}
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
250
1.87k
                                                          SetTy &S) {
251
1.87k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
1.87k
}
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
250
471k
                                                          SetTy &S) {
251
471k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
471k
}
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
250
508k
                                                          SetTy &S) {
251
508k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
508k
}
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
250
475k
                                                          SetTy &S) {
251
475k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
475k
}
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
250
457k
                                                          SetTy &S) {
251
457k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
457k
}
253
254
// Provide global definitions of inverse depth first iterators...
255
template <class T,
256
          class SetTy =
257
              df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
258
          bool External = false>
259
struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
260
  idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V)
261
2.27k
    : 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
261
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
261
960
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false>::idf_iterator(llvm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > > const&)
Line
Count
Source
261
100
    : 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
261
638
    : df_iterator<Inverse<T>, SetTy, External>(V) {}
262
};
263
264
template <class T>
265
369
idf_iterator<T> idf_begin(const T& G) {
266
369
  return idf_iterator<T>::begin(Inverse<T>(G));
267
369
}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false> llvm::idf_begin<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
265
50
idf_iterator<T> idf_begin(const T& G) {
266
50
  return idf_iterator<T>::begin(Inverse<T>(G));
267
50
}
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
265
319
idf_iterator<T> idf_begin(const T& G) {
266
319
  return idf_iterator<T>::begin(Inverse<T>(G));
267
319
}
268
269
template <class T>
270
369
idf_iterator<T> idf_end(const T& G){
271
369
  return idf_iterator<T>::end(Inverse<T>(G));
272
369
}
llvm::idf_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::BasicBlock*>::NodeRef, 8u>, false> llvm::idf_end<llvm::BasicBlock*>(llvm::BasicBlock* const&)
Line
Count
Source
270
50
idf_iterator<T> idf_end(const T& G){
271
50
  return idf_iterator<T>::end(Inverse<T>(G));
272
50
}
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
270
319
idf_iterator<T> idf_end(const T& G){
271
319
  return idf_iterator<T>::end(Inverse<T>(G));
272
319
}
273
274
// Provide an accessor method to use them in range-based patterns.
275
template <class T>
276
iterator_range<idf_iterator<T>> inverse_depth_first(const T& G) {
277
  return make_range(idf_begin(G), idf_end(G));
278
}
279
280
// Provide global definitions of external inverse depth first iterators...
281
template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
282
struct idf_ext_iterator : public idf_iterator<T, SetTy, true> {
283
  idf_ext_iterator(const idf_iterator<T, SetTy, true> &V)
284
    : idf_iterator<T, SetTy, true>(V) {}
285
  idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V)
286
1.54k
    : 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
286
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
286
960
    : idf_iterator<T, SetTy, true>(V) {}
287
};
288
289
template <class T, class SetTy>
290
770
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
291
770
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
292
770
}
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
290
290
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
291
290
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
292
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
290
480
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
291
480
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
292
480
}
293
294
template <class T, class SetTy>
295
770
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
296
770
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
297
770
}
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
295
290
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
296
290
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
297
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
295
480
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
296
480
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
297
480
}
298
299
template <class T, class SetTy>
300
iterator_range<idf_ext_iterator<T, SetTy>> inverse_depth_first_ext(const T& G,
301
770
                                                                   SetTy &S) {
302
770
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
303
770
}
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
301
290
                                                                   SetTy &S) {
302
290
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
303
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
301
480
                                                                   SetTy &S) {
302
480
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
303
480
}
304
305
} // end namespace llvm
306
307
#endif // LLVM_ADT_DEPTHFIRSTITERATOR_H