Coverage Report

Created: 2019-07-24 05:18

/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
9.04M
  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.52M
  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.50k
  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
990k
  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
4.52M
  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.07M
  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
944
  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
933k
  df_iterator_storage(SetType &VSet) : Visited(VSet) {}
59
21.0M
  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.52M
  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.50k
  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.96M
  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
4.52M
  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.30M
  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.77k
  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.73M
  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.7M
  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.82M
  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.00M
  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
563k
  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
147
  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
14.1k
  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); }
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::BasicBlock*, 8u>::insert(llvm::BasicBlock*)
Line
Count
Source
73
22.7M
  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.52M
  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
2.11k
  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.94k
  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.81M
  std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::insert(llvm::MachineBasicBlock const*)
Line
Count
Source
73
3.10M
  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.15k
  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
77.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*)
Unexecuted instantiation: llvm::df_iterator_default_set<clang::ento::ExplodedNode*, 8u>::insert(clang::ento::ExplodedNode*)
Unexecuted instantiation: llvm::df_iterator_default_set<llvm::DomTreeNodeBase<clang::CFGBlock>*, 8u>::insert(llvm::DomTreeNodeBase<clang::CFGBlock>*)
Unexecuted instantiation: llvm::df_iterator_default_set<clang::Stmt*, 8u>::insert(clang::Stmt*)
Unexecuted instantiation: llvm::df_iterator_default_set<clang::Stmt const*, 8u>::insert(clang::Stmt const*)
74
  template <typename IterT>
75
  void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); }
76
77
40.0M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::MachineBasicBlock>*)
Line
Count
Source
77
4.00M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop*, 8u>::completed(llvm::Loop*)
Line
Count
Source
77
563k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>::completed(llvm::MachineLoop*)
Line
Count
Source
77
147
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>::completed(llvm::BasicBlock*)
Line
Count
Source
77
15.3M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
77
6.57M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::DomTreeNodeBase<llvm::BasicBlock>*, 8u>::completed(llvm::DomTreeNodeBase<llvm::BasicBlock>*)
Line
Count
Source
77
7.82M
  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
11.4k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::Loop const*, 8u>::completed(llvm::Loop const*)
Line
Count
Source
77
2.11k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
77
2.41k
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>::completed(llvm::MachineBasicBlock*)
Line
Count
Source
77
2.69M
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>::completed(llvm::MachineBasicBlock const*)
Line
Count
Source
77
2.85M
  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
523
  void completed(NodeRef) {}
llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>::completed(llvm::VPBlockBase*)
Line
Count
Source
77
74.8k
  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.49M
  inline df_iterator(NodeRef Node) {
102
4.49M
    this->Visited.insert(Node);
103
4.49M
    VisitStack.push_back(StackElement(Node, None));
104
4.49M
  }
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
514k
  inline df_iterator(NodeRef Node) {
102
514k
    this->Visited.insert(Node);
103
514k
    VisitStack.push_back(StackElement(Node, None));
104
514k
  }
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
407k
  inline df_iterator(NodeRef Node) {
102
407k
    this->Visited.insert(Node);
103
407k
    VisitStack.push_back(StackElement(Node, None));
104
407k
  }
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
135
  inline df_iterator(NodeRef Node) {
102
135
    this->Visited.insert(Node);
103
135
    VisitStack.push_back(StackElement(Node, None));
104
135
  }
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.77M
  inline df_iterator(NodeRef Node) {
102
1.77M
    this->Visited.insert(Node);
103
1.77M
    VisitStack.push_back(StackElement(Node, None));
104
1.77M
  }
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
110k
  inline df_iterator(NodeRef Node) {
102
110k
    this->Visited.insert(Node);
103
110k
    VisitStack.push_back(StackElement(Node, None));
104
110k
  }
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.53M
  inline df_iterator(NodeRef Node) {
102
1.53M
    this->Visited.insert(Node);
103
1.53M
    VisitStack.push_back(StackElement(Node, None));
104
1.53M
  }
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.77k
  inline df_iterator(NodeRef Node) {
102
4.77k
    this->Visited.insert(Node);
103
4.77k
    VisitStack.push_back(StackElement(Node, None));
104
4.77k
  }
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.89k
  inline df_iterator(NodeRef Node) {
102
1.89k
    this->Visited.insert(Node);
103
1.89k
    VisitStack.push_back(StackElement(Node, None));
104
1.89k
  }
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
487
  inline df_iterator(NodeRef Node) {
102
487
    this->Visited.insert(Node);
103
487
    VisitStack.push_back(StackElement(Node, None));
104
487
  }
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
95.0k
  inline df_iterator(NodeRef Node) {
102
95.0k
    this->Visited.insert(Node);
103
95.0k
    VisitStack.push_back(StackElement(Node, None));
104
95.0k
  }
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
58.4k
  inline df_iterator(NodeRef Node) {
102
58.4k
    this->Visited.insert(Node);
103
58.4k
    VisitStack.push_back(StackElement(Node, None));
104
58.4k
  }
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.49M
  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
514k
  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
407k
  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
135
  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.77M
  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
110k
  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.53M
  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.77k
  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.89k
  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
487
  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
95.0k
  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
58.4k
  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.52M
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
4.52M
    if (this->Visited.insert(Node).second)
111
4.52M
      VisitStack.push_back(StackElement(Node, None));
112
4.52M
  }
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
2.08k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
2.08k
    if (this->Visited.insert(Node).second)
111
2.08k
      VisitStack.push_back(StackElement(Node, None));
112
2.08k
  }
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.25k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
3.25k
    if (this->Visited.insert(Node).second)
111
3.14k
      VisitStack.push_back(StackElement(Node, None));
112
3.25k
  }
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
495k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
495k
    if (this->Visited.insert(Node).second)
111
495k
      VisitStack.push_back(StackElement(Node, None));
112
495k
  }
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
2.26M
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
2.26M
    if (this->Visited.insert(Node).second)
111
2.26M
      VisitStack.push_back(StackElement(Node, None));
112
2.26M
  }
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
758k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
758k
    if (this->Visited.insert(Node).second)
111
758k
      VisitStack.push_back(StackElement(Node, None));
112
758k
  }
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::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
472
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
472
    if (this->Visited.insert(Node).second)
111
323
      VisitStack.push_back(StackElement(Node, None));
112
472
  }
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
466k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
466k
    if (this->Visited.insert(Node).second)
111
466k
      VisitStack.push_back(StackElement(Node, None));
112
466k
  }
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
537k
      : df_iterator_storage<SetType, ExtStorage>(S) {
110
537k
    if (this->Visited.insert(Node).second)
111
537k
      VisitStack.push_back(StackElement(Node, None));
112
537k
  }
113
114
  inline df_iterator(SetType &S)
115
4.52M
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
4.52M
    // End is when stack is empty
117
4.52M
  }
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
2.08k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
2.08k
    // End is when stack is empty
117
2.08k
  }
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.25k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
3.25k
    // End is when stack is empty
117
3.25k
  }
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
495k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
495k
    // End is when stack is empty
117
495k
  }
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
2.26M
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
2.26M
    // End is when stack is empty
117
2.26M
  }
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
758k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
758k
    // End is when stack is empty
117
758k
  }
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::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
472
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
472
    // End is when stack is empty
117
472
  }
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
466k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
466k
    // End is when stack is empty
117
466k
  }
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
537k
    : df_iterator_storage<SetType, ExtStorage>(S) {
116
537k
    // End is when stack is empty
117
537k
  }
118
119
42.8M
  inline void toNext() {
120
76.7M
    do {
121
76.7M
      NodeRef Node = VisitStack.back().first;
122
76.7M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
76.7M
124
76.7M
      if (!Opt)
125
42.8M
        Opt.emplace(GT::child_begin(Node));
126
76.7M
127
76.7M
      // Notice that we directly mutate *Opt here, so that
128
76.7M
      // VisitStack.back().second actually gets updated as the iterator
129
76.7M
      // increases.
130
89.7M
      while (*Opt != GT::child_end(Node)) {
131
46.8M
        NodeRef Next = *(*Opt)++;
132
46.8M
        // Has our next sibling been visited?
133
46.8M
        if (this->Visited.insert(Next).second) {
134
33.8M
          // No, do it now.
135
33.8M
          VisitStack.push_back(StackElement(Next, None));
136
33.8M
          return;
137
33.8M
        }
138
46.8M
      }
139
76.7M
      this->Visited.completed(Node);
140
42.8M
141
42.8M
      // Oops, ran out of successors... go up a level on the stack.
142
42.8M
      VisitStack.pop_back();
143
42.8M
    } while (!VisitStack.empty());
144
42.8M
  }
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.00M
  inline void toNext() {
120
7.50M
    do {
121
7.50M
      NodeRef Node = VisitStack.back().first;
122
7.50M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
7.50M
124
7.50M
      if (!Opt)
125
4.00M
        Opt.emplace(GT::child_begin(Node));
126
7.50M
127
7.50M
      // Notice that we directly mutate *Opt here, so that
128
7.50M
      // VisitStack.back().second actually gets updated as the iterator
129
7.50M
      // increases.
130
7.50M
      while (*Opt != GT::child_end(Node)) {
131
3.49M
        NodeRef Next = *(*Opt)++;
132
3.49M
        // Has our next sibling been visited?
133
3.49M
        if (this->Visited.insert(Next).second) {
134
3.49M
          // No, do it now.
135
3.49M
          VisitStack.push_back(StackElement(Next, None));
136
3.49M
          return;
137
3.49M
        }
138
3.49M
      }
139
7.50M
      this->Visited.completed(Node);
140
4.00M
141
4.00M
      // Oops, ran out of successors... go up a level on the stack.
142
4.00M
      VisitStack.pop_back();
143
4.00M
    } while (!VisitStack.empty());
144
4.00M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::toNext()
Line
Count
Source
119
563k
  inline void toNext() {
120
720k
    do {
121
720k
      NodeRef Node = VisitStack.back().first;
122
720k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
720k
124
720k
      if (!Opt)
125
563k
        Opt.emplace(GT::child_begin(Node));
126
720k
127
720k
      // Notice that we directly mutate *Opt here, so that
128
720k
      // VisitStack.back().second actually gets updated as the iterator
129
720k
      // increases.
130
720k
      while (*Opt != GT::child_end(Node)) {
131
156k
        NodeRef Next = *(*Opt)++;
132
156k
        // Has our next sibling been visited?
133
156k
        if (this->Visited.insert(Next).second) {
134
156k
          // No, do it now.
135
156k
          VisitStack.push_back(StackElement(Next, None));
136
156k
          return;
137
156k
        }
138
156k
      }
139
720k
      this->Visited.completed(Node);
140
563k
141
563k
      // Oops, ran out of successors... go up a level on the stack.
142
563k
      VisitStack.pop_back();
143
563k
    } while (!VisitStack.empty());
144
563k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::toNext()
Line
Count
Source
119
147
  inline void toNext() {
120
159
    do {
121
159
      NodeRef Node = VisitStack.back().first;
122
159
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
159
124
159
      if (!Opt)
125
147
        Opt.emplace(GT::child_begin(Node));
126
159
127
159
      // Notice that we directly mutate *Opt here, so that
128
159
      // VisitStack.back().second actually gets updated as the iterator
129
159
      // increases.
130
159
      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
159
      this->Visited.completed(Node);
140
147
141
147
      // Oops, ran out of successors... go up a level on the stack.
142
147
      VisitStack.pop_back();
143
147
    } while (!VisitStack.empty());
144
147
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::toNext()
Line
Count
Source
119
12.6M
  inline void toNext() {
120
23.5M
    do {
121
23.5M
      NodeRef Node = VisitStack.back().first;
122
23.5M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
23.5M
124
23.5M
      if (!Opt)
125
12.6M
        Opt.emplace(GT::child_begin(Node));
126
23.5M
127
23.5M
      // Notice that we directly mutate *Opt here, so that
128
23.5M
      // VisitStack.back().second actually gets updated as the iterator
129
23.5M
      // increases.
130
29.6M
      while (*Opt != GT::child_end(Node)) {
131
17.0M
        NodeRef Next = *(*Opt)++;
132
17.0M
        // Has our next sibling been visited?
133
17.0M
        if (this->Visited.insert(Next).second) {
134
10.8M
          // No, do it now.
135
10.8M
          VisitStack.push_back(StackElement(Next, None));
136
10.8M
          return;
137
10.8M
        }
138
17.0M
      }
139
23.5M
      this->Visited.completed(Node);
140
12.6M
141
12.6M
      // Oops, ran out of successors... go up a level on the stack.
142
12.6M
      VisitStack.pop_back();
143
12.6M
    } while (!VisitStack.empty());
144
12.6M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
119
1.41M
  inline void toNext() {
120
2.72M
    do {
121
2.72M
      NodeRef Node = VisitStack.back().first;
122
2.72M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
2.72M
124
2.72M
      if (!Opt)
125
1.41M
        Opt.emplace(GT::child_begin(Node));
126
2.72M
127
2.72M
      // Notice that we directly mutate *Opt here, so that
128
2.72M
      // VisitStack.back().second actually gets updated as the iterator
129
2.72M
      // increases.
130
3.51M
      while (*Opt != GT::child_end(Node)) {
131
2.09M
        NodeRef Next = *(*Opt)++;
132
2.09M
        // Has our next sibling been visited?
133
2.09M
        if (this->Visited.insert(Next).second) {
134
1.30M
          // No, do it now.
135
1.30M
          VisitStack.push_back(StackElement(Next, None));
136
1.30M
          return;
137
1.30M
        }
138
2.09M
      }
139
2.72M
      this->Visited.completed(Node);
140
1.41M
141
1.41M
      // Oops, ran out of successors... go up a level on the stack.
142
1.41M
      VisitStack.pop_back();
143
1.41M
    } while (!VisitStack.empty());
144
1.41M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
119
6.21k
  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.21k
        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.4k
      while (*Opt != GT::child_end(Node)) {
131
6.21k
        NodeRef Next = *(*Opt)++;
132
6.21k
        // Has our next sibling been visited?
133
6.21k
        if (this->Visited.insert(Next).second) {
134
4.12k
          // No, do it now.
135
4.12k
          VisitStack.push_back(StackElement(Next, None));
136
4.12k
          return;
137
4.12k
        }
138
6.21k
      }
139
10.3k
      this->Visited.completed(Node);
140
6.21k
141
6.21k
      // Oops, ran out of successors... go up a level on the stack.
142
6.21k
      VisitStack.pop_back();
143
6.21k
    } while (!VisitStack.empty());
144
6.21k
  }
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.72M
  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.72M
        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.18M
        NodeRef Next = *(*Opt)++;
132
6.18M
        // Has our next sibling been visited?
133
6.18M
        if (this->Visited.insert(Next).second) {
134
6.18M
          // No, do it now.
135
6.18M
          VisitStack.push_back(StackElement(Next, None));
136
6.18M
          return;
137
6.18M
        }
138
6.18M
      }
139
13.9M
      this->Visited.completed(Node);
140
7.72M
141
7.72M
      // Oops, ran out of successors... go up a level on the stack.
142
7.72M
      VisitStack.pop_back();
143
7.72M
    } while (!VisitStack.empty());
144
7.72M
  }
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.4k
  inline void toNext() {
120
18.8k
    do {
121
18.8k
      NodeRef Node = VisitStack.back().first;
122
18.8k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
18.8k
124
18.8k
      if (!Opt)
125
11.4k
        Opt.emplace(GT::child_begin(Node));
126
18.8k
127
18.8k
      // Notice that we directly mutate *Opt here, so that
128
18.8k
      // VisitStack.back().second actually gets updated as the iterator
129
18.8k
      // increases.
130
20.8k
      while (*Opt != GT::child_end(Node)) {
131
9.40k
        NodeRef Next = *(*Opt)++;
132
9.40k
        // Has our next sibling been visited?
133
9.40k
        if (this->Visited.insert(Next).second) {
134
7.40k
          // No, do it now.
135
7.40k
          VisitStack.push_back(StackElement(Next, None));
136
7.40k
          return;
137
7.40k
        }
138
9.40k
      }
139
18.8k
      this->Visited.completed(Node);
140
11.4k
141
11.4k
      // Oops, ran out of successors... go up a level on the stack.
142
11.4k
      VisitStack.pop_back();
143
11.4k
    } while (!VisitStack.empty());
144
11.4k
  }
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
2.11k
  inline void toNext() {
120
2.32k
    do {
121
2.32k
      NodeRef Node = VisitStack.back().first;
122
2.32k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
2.32k
124
2.32k
      if (!Opt)
125
2.11k
        Opt.emplace(GT::child_begin(Node));
126
2.32k
127
2.32k
      // Notice that we directly mutate *Opt here, so that
128
2.32k
      // VisitStack.back().second actually gets updated as the iterator
129
2.32k
      // increases.
130
2.32k
      while (*Opt != GT::child_end(Node)) {
131
219
        NodeRef Next = *(*Opt)++;
132
219
        // Has our next sibling been visited?
133
219
        if (this->Visited.insert(Next).second) {
134
219
          // No, do it now.
135
219
          VisitStack.push_back(StackElement(Next, None));
136
219
          return;
137
219
        }
138
219
      }
139
2.32k
      this->Visited.completed(Node);
140
2.11k
141
2.11k
      // Oops, ran out of successors... go up a level on the stack.
142
2.11k
      VisitStack.pop_back();
143
2.11k
    } while (!VisitStack.empty());
144
2.11k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
119
3.13k
  inline void toNext() {
120
4.99k
    do {
121
4.99k
      NodeRef Node = VisitStack.back().first;
122
4.99k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
4.99k
124
4.99k
      if (!Opt)
125
2.41k
        Opt.emplace(GT::child_begin(Node));
126
4.99k
127
4.99k
      // Notice that we directly mutate *Opt here, so that
128
4.99k
      // VisitStack.back().second actually gets updated as the iterator
129
4.99k
      // increases.
130
6.11k
      while (*Opt != GT::child_end(Node)) {
131
3.69k
        NodeRef Next = *(*Opt)++;
132
3.69k
        // Has our next sibling been visited?
133
3.69k
        if (this->Visited.insert(Next).second) {
134
2.58k
          // No, do it now.
135
2.58k
          VisitStack.push_back(StackElement(Next, None));
136
2.58k
          return;
137
2.58k
        }
138
3.69k
      }
139
4.99k
      this->Visited.completed(Node);
140
2.41k
141
2.41k
      // Oops, ran out of successors... go up a level on the stack.
142
2.41k
      VisitStack.pop_back();
143
2.41k
    } while (!VisitStack.empty());
144
3.13k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::toNext()
Line
Count
Source
119
2.69M
  inline void toNext() {
120
4.89M
    do {
121
4.89M
      NodeRef Node = VisitStack.back().first;
122
4.89M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
4.89M
124
4.89M
      if (!Opt)
125
2.69M
        Opt.emplace(GT::child_begin(Node));
126
4.89M
127
4.89M
      // Notice that we directly mutate *Opt here, so that
128
4.89M
      // VisitStack.back().second actually gets updated as the iterator
129
4.89M
      // increases.
130
6.01M
      while (*Opt != GT::child_end(Node)) {
131
3.32M
        NodeRef Next = *(*Opt)++;
132
3.32M
        // Has our next sibling been visited?
133
3.32M
        if (this->Visited.insert(Next).second) {
134
2.20M
          // No, do it now.
135
2.20M
          VisitStack.push_back(StackElement(Next, None));
136
2.20M
          return;
137
2.20M
        }
138
3.32M
      }
139
4.89M
      this->Visited.completed(Node);
140
2.69M
141
2.69M
      // Oops, ran out of successors... go up a level on the stack.
142
2.69M
      VisitStack.pop_back();
143
2.69M
    } while (!VisitStack.empty());
144
2.69M
  }
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.85M
  inline void toNext() {
120
3.44M
    do {
121
3.44M
      NodeRef Node = VisitStack.back().first;
122
3.44M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
3.44M
124
3.44M
      if (!Opt)
125
2.85M
        Opt.emplace(GT::child_begin(Node));
126
3.44M
127
3.44M
      // Notice that we directly mutate *Opt here, so that
128
3.44M
      // VisitStack.back().second actually gets updated as the iterator
129
3.44M
      // increases.
130
3.70M
      while (*Opt != GT::child_end(Node)) {
131
849k
        NodeRef Next = *(*Opt)++;
132
849k
        // Has our next sibling been visited?
133
849k
        if (this->Visited.insert(Next).second) {
134
591k
          // No, do it now.
135
591k
          VisitStack.push_back(StackElement(Next, None));
136
591k
          return;
137
591k
        }
138
849k
      }
139
3.44M
      this->Visited.completed(Node);
140
2.85M
141
2.85M
      // Oops, ran out of successors... go up a level on the stack.
142
2.85M
      VisitStack.pop_back();
143
2.85M
    } while (!VisitStack.empty());
144
2.85M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::toNext()
Line
Count
Source
119
5.15M
  inline void toNext() {
120
9.54M
    do {
121
9.54M
      NodeRef Node = VisitStack.back().first;
122
9.54M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
9.54M
124
9.54M
      if (!Opt)
125
5.15M
        Opt.emplace(GT::child_begin(Node));
126
9.54M
127
9.54M
      // Notice that we directly mutate *Opt here, so that
128
9.54M
      // VisitStack.back().second actually gets updated as the iterator
129
9.54M
      // increases.
130
11.7M
      while (*Opt != GT::child_end(Node)) {
131
6.55M
        NodeRef Next = *(*Opt)++;
132
6.55M
        // Has our next sibling been visited?
133
6.55M
        if (this->Visited.insert(Next).second) {
134
4.39M
          // No, do it now.
135
4.39M
          VisitStack.push_back(StackElement(Next, None));
136
4.39M
          return;
137
4.39M
        }
138
6.55M
      }
139
9.54M
      this->Visited.completed(Node);
140
5.15M
141
5.15M
      // Oops, ran out of successors... go up a level on the stack.
142
5.15M
      VisitStack.pop_back();
143
5.15M
    } while (!VisitStack.empty());
144
5.15M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::toNext()
Line
Count
Source
119
869
  inline void toNext() {
120
1.23k
    do {
121
1.23k
      NodeRef Node = VisitStack.back().first;
122
1.23k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
1.23k
124
1.23k
      if (!Opt)
125
869
        Opt.emplace(GT::child_begin(Node));
126
1.23k
127
1.23k
      // Notice that we directly mutate *Opt here, so that
128
1.23k
      // VisitStack.back().second actually gets updated as the iterator
129
1.23k
      // increases.
130
1.29k
      while (*Opt != GT::child_end(Node)) {
131
506
        NodeRef Next = *(*Opt)++;
132
506
        // Has our next sibling been visited?
133
506
        if (this->Visited.insert(Next).second) {
134
450
          // No, do it now.
135
450
          VisitStack.push_back(StackElement(Next, None));
136
450
          return;
137
450
        }
138
506
      }
139
1.23k
      this->Visited.completed(Node);
140
788
141
788
      // Oops, ran out of successors... go up a level on the stack.
142
788
      VisitStack.pop_back();
143
788
    } while (!VisitStack.empty());
144
869
  }
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::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::toNext()
Line
Count
Source
119
678
  inline void toNext() {
120
1.00k
    do {
121
1.00k
      NodeRef Node = VisitStack.back().first;
122
1.00k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
1.00k
124
1.00k
      if (!Opt)
125
678
        Opt.emplace(GT::child_begin(Node));
126
1.00k
127
1.00k
      // Notice that we directly mutate *Opt here, so that
128
1.00k
      // VisitStack.back().second actually gets updated as the iterator
129
1.00k
      // increases.
130
1.20k
      while (*Opt != GT::child_end(Node)) {
131
682
        NodeRef Next = *(*Opt)++;
132
682
        // Has our next sibling been visited?
133
682
        if (this->Visited.insert(Next).second) {
134
482
          // No, do it now.
135
482
          VisitStack.push_back(StackElement(Next, None));
136
482
          return;
137
482
        }
138
682
      }
139
1.00k
      this->Visited.completed(Node);
140
523
141
523
      // Oops, ran out of successors... go up a level on the stack.
142
523
      VisitStack.pop_back();
143
523
    } while (!VisitStack.empty());
144
678
  }
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.88M
  inline void toNext() {
120
5.30M
    do {
121
5.30M
      NodeRef Node = VisitStack.back().first;
122
5.30M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
5.30M
124
5.30M
      if (!Opt)
125
2.88M
        Opt.emplace(GT::child_begin(Node));
126
5.30M
127
5.30M
      // Notice that we directly mutate *Opt here, so that
128
5.30M
      // VisitStack.back().second actually gets updated as the iterator
129
5.30M
      // increases.
130
6.61M
      while (*Opt != GT::child_end(Node)) {
131
3.72M
        NodeRef Next = *(*Opt)++;
132
3.72M
        // Has our next sibling been visited?
133
3.72M
        if (this->Visited.insert(Next).second) {
134
2.42M
          // No, do it now.
135
2.42M
          VisitStack.push_back(StackElement(Next, None));
136
2.42M
          return;
137
2.42M
        }
138
3.72M
      }
139
5.30M
      this->Visited.completed(Node);
140
2.88M
141
2.88M
      // Oops, ran out of successors... go up a level on the stack.
142
2.88M
      VisitStack.pop_back();
143
2.88M
    } while (!VisitStack.empty());
144
2.88M
  }
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
107k
  inline void toNext() {
120
120k
    do {
121
120k
      NodeRef Node = VisitStack.back().first;
122
120k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
120k
124
120k
      if (!Opt)
125
107k
        Opt.emplace(GT::child_begin(Node));
126
120k
127
120k
      // Notice that we directly mutate *Opt here, so that
128
120k
      // VisitStack.back().second actually gets updated as the iterator
129
120k
      // increases.
130
120k
      while (*Opt != GT::child_end(Node)) {
131
12.7k
        NodeRef Next = *(*Opt)++;
132
12.7k
        // Has our next sibling been visited?
133
12.7k
        if (this->Visited.insert(Next).second) {
134
12.7k
          // No, do it now.
135
12.7k
          VisitStack.push_back(StackElement(Next, None));
136
12.7k
          return;
137
12.7k
        }
138
12.7k
      }
139
120k
      this->Visited.completed(Node);
140
107k
141
107k
      // Oops, ran out of successors... go up a level on the stack.
142
107k
      VisitStack.pop_back();
143
107k
    } while (!VisitStack.empty());
144
107k
  }
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.95M
    do {
121
4.95M
      NodeRef Node = VisitStack.back().first;
122
4.95M
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
4.95M
124
4.95M
      if (!Opt)
125
2.74M
        Opt.emplace(GT::child_begin(Node));
126
4.95M
127
4.95M
      // Notice that we directly mutate *Opt here, so that
128
4.95M
      // VisitStack.back().second actually gets updated as the iterator
129
4.95M
      // increases.
130
6.16M
      while (*Opt != GT::child_end(Node)) {
131
3.41M
        NodeRef Next = *(*Opt)++;
132
3.41M
        // Has our next sibling been visited?
133
3.41M
        if (this->Visited.insert(Next).second) {
134
2.20M
          // No, do it now.
135
2.20M
          VisitStack.push_back(StackElement(Next, None));
136
2.20M
          return;
137
2.20M
        }
138
3.41M
      }
139
4.95M
      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::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::toNext()
Line
Count
Source
119
74.8k
  inline void toNext() {
120
91.3k
    do {
121
91.3k
      NodeRef Node = VisitStack.back().first;
122
91.3k
      Optional<ChildItTy> &Opt = VisitStack.back().second;
123
91.3k
124
91.3k
      if (!Opt)
125
74.8k
        Opt.emplace(GT::child_begin(Node));
126
91.3k
127
91.3k
      // Notice that we directly mutate *Opt here, so that
128
91.3k
      // VisitStack.back().second actually gets updated as the iterator
129
91.3k
      // increases.
130
94.1k
      while (*Opt != GT::child_end(Node)) {
131
19.2k
        NodeRef Next = *(*Opt)++;
132
19.2k
        // Has our next sibling been visited?
133
19.2k
        if (this->Visited.insert(Next).second) {
134
16.4k
          // No, do it now.
135
16.4k
          VisitStack.push_back(StackElement(Next, None));
136
16.4k
          return;
137
16.4k
        }
138
19.2k
      }
139
91.3k
      this->Visited.completed(Node);
140
74.8k
141
74.8k
      // Oops, ran out of successors... go up a level on the stack.
142
74.8k
      VisitStack.pop_back();
143
74.8k
    } while (!VisitStack.empty());
144
74.8k
  }
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.49M
  static df_iterator begin(const GraphT &G) {
151
4.49M
    return df_iterator(GT::getEntryNode(G));
152
4.49M
  }
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.53M
  static df_iterator begin(const GraphT &G) {
151
1.53M
    return df_iterator(GT::getEntryNode(G));
152
1.53M
  }
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
514k
  static df_iterator begin(const GraphT &G) {
151
514k
    return df_iterator(GT::getEntryNode(G));
152
514k
  }
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
407k
  static df_iterator begin(const GraphT &G) {
151
407k
    return df_iterator(GT::getEntryNode(G));
152
407k
  }
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
135
  static df_iterator begin(const GraphT &G) {
151
135
    return df_iterator(GT::getEntryNode(G));
152
135
  }
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.77k
  static df_iterator begin(const GraphT &G) {
151
4.77k
    return df_iterator(GT::getEntryNode(G));
152
4.77k
  }
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::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
  }
Unexecuted instantiation: llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode const*> > >::begin(llvm::RegionNode const* const&)
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*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<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::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::MachineRegionNode const*> > >::begin(llvm::MachineRegionNode const* const&)
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::begin(llvm::BasicBlock* const&)
Line
Count
Source
150
1.77M
  static df_iterator begin(const GraphT &G) {
151
1.77M
    return df_iterator(GT::getEntryNode(G));
152
1.77M
  }
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
110k
  static df_iterator begin(const GraphT &G) {
151
110k
    return df_iterator(GT::getEntryNode(G));
152
110k
  }
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::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.89k
  static df_iterator begin(const GraphT &G) {
151
1.89k
    return df_iterator(GT::getEntryNode(G));
152
1.89k
  }
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
487
  static df_iterator begin(const GraphT &G) {
151
487
    return df_iterator(GT::getEntryNode(G));
152
487
  }
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
95.0k
  static df_iterator begin(const GraphT &G) {
151
95.0k
    return df_iterator(GT::getEntryNode(G));
152
95.0k
  }
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
58.4k
  static df_iterator begin(const GraphT &G) {
151
58.4k
    return df_iterator(GT::getEntryNode(G));
152
58.4k
  }
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&)
Unexecuted instantiation: llvm::df_iterator<clang::ento::ExplodedGraph*, llvm::df_iterator_default_set<clang::ento::ExplodedNode*, 8u>, false, llvm::GraphTraits<clang::ento::ExplodedGraph*> >::begin(clang::ento::ExplodedGraph* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::DomTreeNodeBase<clang::CFGBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<clang::CFGBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<clang::CFGBlock>*> >::begin(llvm::DomTreeNodeBase<clang::CFGBlock>* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt*, llvm::df_iterator_default_set<clang::Stmt*, 8u>, false, llvm::GraphTraits<clang::Stmt*> >::begin(clang::Stmt* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt const*, llvm::df_iterator_default_set<clang::Stmt const*, 8u>, false, llvm::GraphTraits<clang::Stmt const*> >::begin(clang::Stmt const* const&)
153
4.49M
  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.53M
  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
514k
  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
407k
  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
135
  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.77k
  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::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(); }
Unexecuted instantiation: llvm::df_iterator<llvm::RegionNode const*, llvm::df_iterator_default_set<llvm::RegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::RegionNode const*> > >::end(llvm::RegionNode const* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::MachineRegionNode*> >::end(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::MachineRegionNode*, llvm::df_iterator_default_set<llvm::MachineRegionNode*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::MachineRegionNode*> > >::end(llvm::MachineRegionNode* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::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::MachineRegionNode const*, llvm::df_iterator_default_set<llvm::MachineRegionNode const*, 8u>, false, llvm::GraphTraits<llvm::FlatIt<llvm::MachineRegionNode const*> > >::end(llvm::MachineRegionNode const* const&)
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::end(llvm::BasicBlock* const&)
Line
Count
Source
153
1.77M
  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
110k
  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::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.89k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
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
487
  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
95.0k
  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
58.4k
  static df_iterator end(const GraphT &G) { return df_iterator(); }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::end(llvm::VPBlockBase const* const&)
Unexecuted instantiation: llvm::df_iterator<clang::ento::ExplodedGraph*, llvm::df_iterator_default_set<clang::ento::ExplodedNode*, 8u>, false, llvm::GraphTraits<clang::ento::ExplodedGraph*> >::end(clang::ento::ExplodedGraph* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::DomTreeNodeBase<clang::CFGBlock>*, llvm::df_iterator_default_set<llvm::DomTreeNodeBase<clang::CFGBlock>*, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<clang::CFGBlock>*> >::end(llvm::DomTreeNodeBase<clang::CFGBlock>* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt*, llvm::df_iterator_default_set<clang::Stmt*, 8u>, false, llvm::GraphTraits<clang::Stmt*> >::end(clang::Stmt* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt const*, llvm::df_iterator_default_set<clang::Stmt const*, 8u>, false, llvm::GraphTraits<clang::Stmt const*> >::end(clang::Stmt const* const&)
154
155
  // Static begin and end methods as our public ctors for external iterators
156
4.52M
  static df_iterator begin(const GraphT &G, SetType &S) {
157
4.52M
    return df_iterator(GT::getEntryNode(G), S);
158
4.52M
  }
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
2.08k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
2.08k
    return df_iterator(GT::getEntryNode(G), S);
158
2.08k
  }
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.25k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
3.25k
    return df_iterator(GT::getEntryNode(G), S);
158
3.25k
  }
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
495k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
495k
    return df_iterator(GT::getEntryNode(G), S);
158
495k
  }
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
2.26M
  static df_iterator begin(const GraphT &G, SetType &S) {
157
2.26M
    return df_iterator(GT::getEntryNode(G), S);
158
2.26M
  }
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
758k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
758k
    return df_iterator(GT::getEntryNode(G), S);
158
758k
  }
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::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
472
  static df_iterator begin(const GraphT &G, SetType &S) {
157
472
    return df_iterator(GT::getEntryNode(G), S);
158
472
  }
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
466k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
466k
    return df_iterator(GT::getEntryNode(G), S);
158
466k
  }
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
537k
  static df_iterator begin(const GraphT &G, SetType &S) {
157
537k
    return df_iterator(GT::getEntryNode(G), S);
158
537k
  }
159
4.52M
  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
2.08k
  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.25k
  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
495k
  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
2.26M
  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
758k
  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::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
472
  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
466k
  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
537k
  static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
160
161
51.9M
  bool operator==(const df_iterator &x) const {
162
51.9M
    return VisitStack == x.VisitStack;
163
51.9M
  }
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.52M
  bool operator==(const df_iterator &x) const {
162
4.52M
    return VisitStack == x.VisitStack;
163
4.52M
  }
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
970k
  bool operator==(const df_iterator &x) const {
162
970k
    return VisitStack == x.VisitStack;
163
970k
  }
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
282
  bool operator==(const df_iterator &x) const {
162
282
    return VisitStack == x.VisitStack;
163
282
  }
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.52M
  bool operator==(const df_iterator &x) const {
162
1.52M
    return VisitStack == x.VisitStack;
163
1.52M
  }
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
8.29k
  bool operator==(const df_iterator &x) const {
162
8.29k
    return VisitStack == x.VisitStack;
163
8.29k
  }
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.25M
  bool operator==(const df_iterator &x) const {
162
9.25M
    return VisitStack == x.VisitStack;
163
9.25M
  }
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
16.2k
  bool operator==(const df_iterator &x) const {
162
16.2k
    return VisitStack == x.VisitStack;
163
16.2k
  }
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
4.00k
  bool operator==(const df_iterator &x) const {
162
4.00k
    return VisitStack == x.VisitStack;
163
4.00k
  }
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.97k
  bool operator==(const df_iterator &x) const {
162
8.97k
    return VisitStack == x.VisitStack;
163
8.97k
  }
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.19M
  bool operator==(const df_iterator &x) const {
162
3.19M
    return VisitStack == x.VisitStack;
163
3.19M
  }
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
5.11M
  bool operator==(const df_iterator &x) const {
162
5.11M
    return VisitStack == x.VisitStack;
163
5.11M
  }
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.90M
  bool operator==(const df_iterator &x) const {
162
5.90M
    return VisitStack == x.VisitStack;
163
5.90M
  }
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
1.35k
  bool operator==(const df_iterator &x) const {
162
1.35k
    return VisitStack == x.VisitStack;
163
1.35k
  }
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::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.15k
  bool operator==(const df_iterator &x) const {
162
1.15k
    return VisitStack == x.VisitStack;
163
1.15k
  }
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
202k
  bool operator==(const df_iterator &x) const {
162
202k
    return VisitStack == x.VisitStack;
163
202k
  }
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.28M
  bool operator==(const df_iterator &x) const {
162
3.28M
    return VisitStack == x.VisitStack;
163
3.28M
  }
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
133k
  bool operator==(const df_iterator &x) const {
162
133k
    return VisitStack == x.VisitStack;
163
133k
  }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator==(llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > const&) const
164
51.9M
  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.52M
  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
970k
  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
282
  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.52M
  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
8.29k
  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.25M
  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
16.2k
  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
4.00k
  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.97k
  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.19M
  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
5.11M
  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.90M
  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
1.35k
  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::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.15k
  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
202k
  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.28M
  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
133k
  bool operator!=(const df_iterator &x) const { return !(*this == x); }
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> >::operator!=(llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::VPBlockBase const*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > const&) const
165
166
42.9M
  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.00M
  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
563k
  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
166
  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.6M
  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.41M
  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.21k
  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.72M
  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
19.1k
  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
2.11k
  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.72k
  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.69M
  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.85M
  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.15M
  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
937
  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::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator*() const
Line
Count
Source
166
805
  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.88M
  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
107k
  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::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator*() const
Line
Count
Source
166
74.8k
  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
14.0k
  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
14.0k
  NodeRef operator->() const { return **this; }
173
174
42.8M
  df_iterator &operator++() { // Preincrement
175
42.8M
    toNext();
176
42.8M
    return *this;
177
42.8M
  }
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.00M
  df_iterator &operator++() { // Preincrement
175
4.00M
    toNext();
176
4.00M
    return *this;
177
4.00M
  }
llvm::df_iterator<llvm::Loop*, llvm::df_iterator_default_set<llvm::Loop*, 8u>, false, llvm::GraphTraits<llvm::Loop*> >::operator++()
Line
Count
Source
174
563k
  df_iterator &operator++() { // Preincrement
175
563k
    toNext();
176
563k
    return *this;
177
563k
  }
llvm::df_iterator<llvm::MachineLoop*, llvm::df_iterator_default_set<llvm::MachineLoop*, 8u>, false, llvm::GraphTraits<llvm::MachineLoop*> >::operator++()
Line
Count
Source
174
147
  df_iterator &operator++() { // Preincrement
175
147
    toNext();
176
147
    return *this;
177
147
  }
llvm::df_iterator<llvm::BasicBlock*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::BasicBlock*> >::operator++()
Line
Count
Source
174
12.6M
  df_iterator &operator++() { // Preincrement
175
12.6M
    toNext();
176
12.6M
    return *this;
177
12.6M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, false, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
174
1.41M
  df_iterator &operator++() { // Preincrement
175
1.41M
    toNext();
176
1.41M
    return *this;
177
1.41M
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
174
6.21k
  df_iterator &operator++() { // Preincrement
175
6.21k
    toNext();
176
6.21k
    return *this;
177
6.21k
  }
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.72M
  df_iterator &operator++() { // Preincrement
175
7.72M
    toNext();
176
7.72M
    return *this;
177
7.72M
  }
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.4k
  df_iterator &operator++() { // Preincrement
175
11.4k
    toNext();
176
11.4k
    return *this;
177
11.4k
  }
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
2.11k
  df_iterator &operator++() { // Preincrement
175
2.11k
    toNext();
176
2.11k
    return *this;
177
2.11k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
174
2.41k
  df_iterator &operator++() { // Preincrement
175
2.41k
    toNext();
176
2.41k
    return *this;
177
2.41k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 16u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::operator++()
Line
Count
Source
174
2.69M
  df_iterator &operator++() { // Preincrement
175
2.69M
    toNext();
176
2.69M
    return *this;
177
2.69M
  }
Unexecuted instantiation: llvm::df_iterator<llvm::MachineBasicBlock const*, llvm::df_iterator_default_set<llvm::MachineBasicBlock const*, 8u>, false, llvm::GraphTraits<llvm::MachineBasicBlock const*> >::operator++()
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.85M
  df_iterator &operator++() { // Preincrement
175
2.85M
    toNext();
176
2.85M
    return *this;
177
2.85M
  }
llvm::df_iterator<llvm::MachineFunction*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 8u>, true, llvm::GraphTraits<llvm::MachineFunction*> >::operator++()
Line
Count
Source
174
5.15M
  df_iterator &operator++() { // Preincrement
175
5.15M
    toNext();
176
5.15M
    return *this;
177
5.15M
  }
llvm::df_iterator<llvm::Function*, llvm::df_iterator_default_set<llvm::BasicBlock*, 8u>, false, llvm::GraphTraits<llvm::Function*> >::operator++()
Line
Count
Source
174
869
  df_iterator &operator++() { // Preincrement
175
869
    toNext();
176
869
    return *this;
177
869
  }
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::Inverse<llvm::BasicBlock*>, llvm::df_iterator_default_set<llvm::BasicBlock*, 16u>, true, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*> > >::operator++()
Line
Count
Source
174
678
  df_iterator &operator++() { // Preincrement
175
678
    toNext();
176
678
    return *this;
177
678
  }
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.88M
  df_iterator &operator++() { // Preincrement
175
2.88M
    toNext();
176
2.88M
    return *this;
177
2.88M
  }
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
107k
  df_iterator &operator++() { // Preincrement
175
107k
    toNext();
176
107k
    return *this;
177
107k
  }
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::VPBlockBase*, llvm::df_iterator_default_set<llvm::VPBlockBase*, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase*> >::operator++()
Line
Count
Source
174
74.8k
  df_iterator &operator++() { // Preincrement
175
74.8k
    toNext();
176
74.8k
    return *this;
177
74.8k
  }
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.68k
  df_iterator &skipChildren() {
184
3.68k
    VisitStack.pop_back();
185
3.68k
    if (!VisitStack.empty())
186
1.10k
      toNext();
187
3.68k
    return *this;
188
3.68k
  }
llvm::df_iterator<llvm::MachineBasicBlock*, llvm::df_iterator_default_set<llvm::MachineBasicBlock*, 9u>, true, llvm::GraphTraits<llvm::MachineBasicBlock*> >::skipChildren()
Line
Count
Source
183
3.30k
  df_iterator &skipChildren() {
184
3.30k
    VisitStack.pop_back();
185
3.30k
    if (!VisitStack.empty())
186
720
      toNext();
187
3.30k
    return *this;
188
3.30k
  }
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.62k
  bool nodeVisited(NodeRef Node) const {
201
1.62k
    return this->Visited.count(Node) != 0;
202
1.62k
  }
203
204
  /// getPathLength - Return the length of the path from the entry node to the
205
  /// current node, counting both nodes.
206
8.08M
  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
3.44M
  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.63M
  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
272
  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.78M
  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
591k
  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.18M
  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
480
  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.49M
df_iterator<T> df_begin(const T& G) {
217
4.49M
  return df_iterator<T>::begin(G);
218
4.49M
}
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.53M
df_iterator<T> df_begin(const T& G) {
217
1.53M
  return df_iterator<T>::begin(G);
218
1.53M
}
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
514k
df_iterator<T> df_begin(const T& G) {
217
514k
  return df_iterator<T>::begin(G);
218
514k
}
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
407k
df_iterator<T> df_begin(const T& G) {
217
407k
  return df_iterator<T>::begin(G);
218
407k
}
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
135
df_iterator<T> df_begin(const T& G) {
217
135
  return df_iterator<T>::begin(G);
218
135
}
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.77M
df_iterator<T> df_begin(const T& G) {
217
1.77M
  return df_iterator<T>::begin(G);
218
1.77M
}
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
110k
df_iterator<T> df_begin(const T& G) {
217
110k
  return df_iterator<T>::begin(G);
218
110k
}
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.89k
df_iterator<T> df_begin(const T& G) {
217
1.89k
  return df_iterator<T>::begin(G);
218
1.89k
}
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
487
df_iterator<T> df_begin(const T& G) {
217
487
  return df_iterator<T>::begin(G);
218
487
}
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
95.0k
df_iterator<T> df_begin(const T& G) {
217
95.0k
  return df_iterator<T>::begin(G);
218
95.0k
}
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
58.4k
df_iterator<T> df_begin(const T& G) {
217
58.4k
  return df_iterator<T>::begin(G);
218
58.4k
}
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > llvm::df_begin<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
Unexecuted instantiation: llvm::df_iterator<clang::ento::ExplodedGraph*, llvm::df_iterator_default_set<llvm::GraphTraits<clang::ento::ExplodedGraph*>::NodeRef, 8u>, false, llvm::GraphTraits<clang::ento::ExplodedGraph*> > llvm::df_begin<clang::ento::ExplodedGraph*>(clang::ento::ExplodedGraph* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::DomTreeNodeBase<clang::CFGBlock>*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DomTreeNodeBase<clang::CFGBlock>*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<clang::CFGBlock>*> > llvm::df_begin<llvm::DomTreeNodeBase<clang::CFGBlock>*>(llvm::DomTreeNodeBase<clang::CFGBlock>* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt*, llvm::df_iterator_default_set<llvm::GraphTraits<clang::Stmt*>::NodeRef, 8u>, false, llvm::GraphTraits<clang::Stmt*> > llvm::df_begin<clang::Stmt*>(clang::Stmt* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt const*, llvm::df_iterator_default_set<llvm::GraphTraits<clang::Stmt const*>::NodeRef, 8u>, false, llvm::GraphTraits<clang::Stmt const*> > llvm::df_begin<clang::Stmt const*>(clang::Stmt const* const&)
219
220
template <class T>
221
4.49M
df_iterator<T> df_end(const T& G) {
222
4.49M
  return df_iterator<T>::end(G);
223
4.49M
}
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.53M
df_iterator<T> df_end(const T& G) {
222
1.53M
  return df_iterator<T>::end(G);
223
1.53M
}
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
514k
df_iterator<T> df_end(const T& G) {
222
514k
  return df_iterator<T>::end(G);
223
514k
}
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
407k
df_iterator<T> df_end(const T& G) {
222
407k
  return df_iterator<T>::end(G);
223
407k
}
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
135
df_iterator<T> df_end(const T& G) {
222
135
  return df_iterator<T>::end(G);
223
135
}
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.77M
df_iterator<T> df_end(const T& G) {
222
1.77M
  return df_iterator<T>::end(G);
223
1.77M
}
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
110k
df_iterator<T> df_end(const T& G) {
222
110k
  return df_iterator<T>::end(G);
223
110k
}
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.89k
df_iterator<T> df_end(const T& G) {
222
1.89k
  return df_iterator<T>::end(G);
223
1.89k
}
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
487
df_iterator<T> df_end(const T& G) {
222
487
  return df_iterator<T>::end(G);
223
487
}
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
95.0k
df_iterator<T> df_end(const T& G) {
222
95.0k
  return df_iterator<T>::end(G);
223
95.0k
}
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
58.4k
df_iterator<T> df_end(const T& G) {
222
58.4k
  return df_iterator<T>::end(G);
223
58.4k
}
Unexecuted instantiation: llvm::df_iterator<llvm::VPBlockBase const*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::VPBlockBase const*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::VPBlockBase const*> > llvm::df_end<llvm::VPBlockBase const*>(llvm::VPBlockBase const* const&)
Unexecuted instantiation: llvm::df_iterator<clang::ento::ExplodedGraph*, llvm::df_iterator_default_set<llvm::GraphTraits<clang::ento::ExplodedGraph*>::NodeRef, 8u>, false, llvm::GraphTraits<clang::ento::ExplodedGraph*> > llvm::df_end<clang::ento::ExplodedGraph*>(clang::ento::ExplodedGraph* const&)
Unexecuted instantiation: llvm::df_iterator<llvm::DomTreeNodeBase<clang::CFGBlock>*, llvm::df_iterator_default_set<llvm::GraphTraits<llvm::DomTreeNodeBase<clang::CFGBlock>*>::NodeRef, 8u>, false, llvm::GraphTraits<llvm::DomTreeNodeBase<clang::CFGBlock>*> > llvm::df_end<llvm::DomTreeNodeBase<clang::CFGBlock>*>(llvm::DomTreeNodeBase<clang::CFGBlock>* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt*, llvm::df_iterator_default_set<llvm::GraphTraits<clang::Stmt*>::NodeRef, 8u>, false, llvm::GraphTraits<clang::Stmt*> > llvm::df_end<clang::Stmt*>(clang::Stmt* const&)
Unexecuted instantiation: llvm::df_iterator<clang::Stmt const*, llvm::df_iterator_default_set<llvm::GraphTraits<clang::Stmt const*>::NodeRef, 8u>, false, llvm::GraphTraits<clang::Stmt const*> > llvm::df_end<clang::Stmt const*>(clang::Stmt const* const&)
224
225
// Provide an accessor method to use them in range-based patterns.
226
template <class T>
227
4.31M
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
4.31M
  return make_range(df_begin(G), df_end(G));
229
4.31M
}
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
514k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
514k
  return make_range(df_begin(G), df_end(G));
229
514k
}
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
116
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
116
  return make_range(df_begin(G), df_end(G));
229
116
}
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
110k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
110k
  return make_range(df_begin(G), df_end(G));
229
110k
}
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
269k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
269k
  return make_range(df_begin(G), df_end(G));
229
269k
}
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.53M
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
1.53M
  return make_range(df_begin(G), df_end(G));
229
1.53M
}
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.89k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
1.89k
  return make_range(df_begin(G), df_end(G));
229
1.89k
}
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
487
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
487
  return make_range(df_begin(G), df_end(G));
229
487
}
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.72M
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
1.72M
  return make_range(df_begin(G), df_end(G));
229
1.72M
}
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
95.0k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
95.0k
  return make_range(df_begin(G), df_end(G));
229
95.0k
}
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
58.4k
iterator_range<df_iterator<T>> depth_first(const T& G) {
228
58.4k
  return make_range(df_begin(G), df_end(G));
229
58.4k
}
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
9.04M
    : 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
4.16k
    : 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.50k
    : 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
990k
    : 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
4.52M
    : 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.51M
    : 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
933k
    : 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.07M
    : df_iterator<T, SetTy, true>(V) {}
236
};
237
238
template <class T, class SetTy>
239
4.52M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
4.52M
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
4.52M
}
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
2.08k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
2.08k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
2.08k
}
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.25k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
3.25k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
3.25k
}
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
495k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
495k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
495k
}
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
2.26M
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
2.26M
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
2.26M
}
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
758k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
758k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
758k
}
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
466k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
466k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
466k
}
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
537k
df_ext_iterator<T, SetTy> df_ext_begin(const T& G, SetTy &S) {
240
537k
  return df_ext_iterator<T, SetTy>::begin(G, S);
241
537k
}
242
243
template <class T, class SetTy>
244
4.52M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
4.52M
  return df_ext_iterator<T, SetTy>::end(G, S);
246
4.52M
}
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
2.08k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
2.08k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
2.08k
}
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.25k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
3.25k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
3.25k
}
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
495k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
495k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
495k
}
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
2.26M
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
2.26M
  return df_ext_iterator<T, SetTy>::end(G, S);
246
2.26M
}
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
758k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
758k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
758k
}
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
466k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
466k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
466k
}
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
537k
df_ext_iterator<T, SetTy> df_ext_end(const T& G, SetTy &S) {
245
537k
  return df_ext_iterator<T, SetTy>::end(G, S);
246
537k
}
247
248
template <class T, class SetTy>
249
iterator_range<df_ext_iterator<T, SetTy>> depth_first_ext(const T& G,
250
2.00M
                                                          SetTy &S) {
251
2.00M
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
2.00M
}
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
2.08k
                                                          SetTy &S) {
251
2.08k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
2.08k
}
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
495k
                                                          SetTy &S) {
251
495k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
495k
}
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
498k
                                                          SetTy &S) {
251
498k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
498k
}
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
466k
                                                          SetTy &S) {
251
466k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
466k
}
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
537k
                                                          SetTy &S) {
251
537k
  return make_range(df_ext_begin(G, S), df_ext_end(G, S));
252
537k
}
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.26k
    : 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
944
    : 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.52k
    : 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
944
    : idf_iterator<T, SetTy, true>(V) {}
287
};
288
289
template <class T, class SetTy>
290
762
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
291
762
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
292
762
}
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
472
idf_ext_iterator<T, SetTy> idf_ext_begin(const T& G, SetTy &S) {
291
472
  return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
292
472
}
293
294
template <class T, class SetTy>
295
762
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
296
762
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
297
762
}
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
472
idf_ext_iterator<T, SetTy> idf_ext_end(const T& G, SetTy &S) {
296
472
  return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
297
472
}
298
299
template <class T, class SetTy>
300
iterator_range<idf_ext_iterator<T, SetTy>> inverse_depth_first_ext(const T& G,
301
762
                                                                   SetTy &S) {
302
762
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
303
762
}
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
472
                                                                   SetTy &S) {
302
472
  return make_range(idf_ext_begin(G, S), idf_ext_end(G, S));
303
472
}
304
305
} // end namespace llvm
306
307
#endif // LLVM_ADT_DEPTHFIRSTITERATOR_H