Coverage Report

Created: 2018-07-19 03:59

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/ADT/SparseMultiSet.h
Line
Count
Source (jump to first uncovered line)
1
//===- llvm/ADT/SparseMultiSet.h - Sparse multiset --------------*- C++ -*-===//
2
//
3
//                     The LLVM Compiler Infrastructure
4
//
5
// This file is distributed under the University of Illinois Open Source
6
// License. See LICENSE.TXT for details.
7
//
8
//===----------------------------------------------------------------------===//
9
//
10
// This file defines the SparseMultiSet class, which adds multiset behavior to
11
// the SparseSet.
12
//
13
// A sparse multiset holds a small number of objects identified by integer keys
14
// from a moderately sized universe. The sparse multiset uses more memory than
15
// other containers in order to provide faster operations. Any key can map to
16
// multiple values. A SparseMultiSetNode class is provided, which serves as a
17
// convenient base class for the contents of a SparseMultiSet.
18
//
19
//===----------------------------------------------------------------------===//
20
21
#ifndef LLVM_ADT_SPARSEMULTISET_H
22
#define LLVM_ADT_SPARSEMULTISET_H
23
24
#include "llvm/ADT/STLExtras.h"
25
#include "llvm/ADT/SmallVector.h"
26
#include "llvm/ADT/SparseSet.h"
27
#include <cassert>
28
#include <cstdint>
29
#include <cstdlib>
30
#include <iterator>
31
#include <limits>
32
#include <utility>
33
34
namespace llvm {
35
36
/// Fast multiset implementation for objects that can be identified by small
37
/// unsigned keys.
38
///
39
/// SparseMultiSet allocates memory proportional to the size of the key
40
/// universe, so it is not recommended for building composite data structures.
41
/// It is useful for algorithms that require a single set with fast operations.
42
///
43
/// Compared to DenseSet and DenseMap, SparseMultiSet provides constant-time
44
/// fast clear() as fast as a vector.  The find(), insert(), and erase()
45
/// operations are all constant time, and typically faster than a hash table.
46
/// The iteration order doesn't depend on numerical key values, it only depends
47
/// on the order of insert() and erase() operations.  Iteration order is the
48
/// insertion order. Iteration is only provided over elements of equivalent
49
/// keys, but iterators are bidirectional.
50
///
51
/// Compared to BitVector, SparseMultiSet<unsigned> uses 8x-40x more memory, but
52
/// offers constant-time clear() and size() operations as well as fast iteration
53
/// independent on the size of the universe.
54
///
55
/// SparseMultiSet contains a dense vector holding all the objects and a sparse
56
/// array holding indexes into the dense vector.  Most of the memory is used by
57
/// the sparse array which is the size of the key universe. The SparseT template
58
/// parameter provides a space/speed tradeoff for sets holding many elements.
59
///
60
/// When SparseT is uint32_t, find() only touches up to 3 cache lines, but the
61
/// sparse array uses 4 x Universe bytes.
62
///
63
/// When SparseT is uint8_t (the default), find() touches up to 3+[N/256] cache
64
/// lines, but the sparse array is 4x smaller.  N is the number of elements in
65
/// the set.
66
///
67
/// For sets that may grow to thousands of elements, SparseT should be set to
68
/// uint16_t or uint32_t.
69
///
70
/// Multiset behavior is provided by providing doubly linked lists for values
71
/// that are inlined in the dense vector. SparseMultiSet is a good choice when
72
/// one desires a growable number of entries per key, as it will retain the
73
/// SparseSet algorithmic properties despite being growable. Thus, it is often a
74
/// better choice than a SparseSet of growable containers or a vector of
75
/// vectors. SparseMultiSet also keeps iterators valid after erasure (provided
76
/// the iterators don't point to the element erased), allowing for more
77
/// intuitive and fast removal.
78
///
79
/// @tparam ValueT      The type of objects in the set.
80
/// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
81
/// @tparam SparseT     An unsigned integer type. See above.
82
///
83
template<typename ValueT,
84
         typename KeyFunctorT = identity<unsigned>,
85
         typename SparseT = uint8_t>
86
class SparseMultiSet {
87
  static_assert(std::numeric_limits<SparseT>::is_integer &&
88
                !std::numeric_limits<SparseT>::is_signed,
89
                "SparseT must be an unsigned integer type");
90
91
  /// The actual data that's stored, as a doubly-linked list implemented via
92
  /// indices into the DenseVector.  The doubly linked list is implemented
93
  /// circular in Prev indices, and INVALID-terminated in Next indices. This
94
  /// provides efficient access to list tails. These nodes can also be
95
  /// tombstones, in which case they are actually nodes in a single-linked
96
  /// freelist of recyclable slots.
97
  struct SMSNode {
98
    static const unsigned INVALID = ~0U;
99
100
    ValueT Data;
101
    unsigned Prev;
102
    unsigned Next;
103
104
28.8M
    SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {}
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode::SMSNode(llvm::VReg2SUnit, unsigned int, unsigned int)
Line
Count
Source
104
4.40M
    SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {}
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SMSNode::SMSNode(llvm::PhysRegSUOper, unsigned int, unsigned int)
Line
Count
Source
104
13.1M
    SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {}
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode::SMSNode(llvm::VReg2SUnitOperIdx, unsigned int, unsigned int)
Line
Count
Source
104
11.2M
    SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {}
105
106
    /// List tails have invalid Nexts.
107
37.9M
    bool isTail() const {
108
37.9M
      return Next == INVALID;
109
37.9M
    }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode::isTail() const
Line
Count
Source
107
6.24M
    bool isTail() const {
108
6.24M
      return Next == INVALID;
109
6.24M
    }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SMSNode::isTail() const
Line
Count
Source
107
23.9M
    bool isTail() const {
108
23.9M
      return Next == INVALID;
109
23.9M
    }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode::isTail() const
Line
Count
Source
107
7.69M
    bool isTail() const {
108
7.69M
      return Next == INVALID;
109
7.69M
    }
110
111
    /// Whether this node is a tombstone node, and thus is in our freelist.
112
    bool isTombstone() const {
113
      return Prev == INVALID;
114
    }
115
116
    /// Since the list is circular in Prev, all non-tombstone nodes have a valid
117
    /// Prev.
118
37.9M
    bool isValid() const { return Prev != INVALID; }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode::isValid() const
Line
Count
Source
118
6.24M
    bool isValid() const { return Prev != INVALID; }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SMSNode::isValid() const
Line
Count
Source
118
24.7M
    bool isValid() const { return Prev != INVALID; }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode::isValid() const
Line
Count
Source
118
6.95M
    bool isValid() const { return Prev != INVALID; }
119
  };
120
121
  using KeyT = typename KeyFunctorT::argument_type;
122
  using DenseT = SmallVector<SMSNode, 8>;
123
  DenseT Dense;
124
  SparseT *Sparse = nullptr;
125
  unsigned Universe = 0;
126
  KeyFunctorT KeyIndexOf;
127
  SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
128
129
  /// We have a built-in recycler for reusing tombstone slots. This recycler
130
  /// puts a singly-linked free list into tombstone slots, allowing us quick
131
  /// erasure, iterator preservation, and dense size.
132
  unsigned FreelistIdx = SMSNode::INVALID;
133
  unsigned NumFree = 0;
134
135
141M
  unsigned sparseIndex(const ValueT &Val) const {
136
141M
    assert(ValIndexOf(Val) < Universe &&
137
141M
           "Invalid key in set. Did object mutate?");
138
141M
    return ValIndexOf(Val);
139
141M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::sparseIndex(llvm::VReg2SUnit const&) const
Line
Count
Source
135
18.5M
  unsigned sparseIndex(const ValueT &Val) const {
136
18.5M
    assert(ValIndexOf(Val) < Universe &&
137
18.5M
           "Invalid key in set. Did object mutate?");
138
18.5M
    return ValIndexOf(Val);
139
18.5M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::sparseIndex(llvm::PhysRegSUOper const&) const
Line
Count
Source
135
97.1M
  unsigned sparseIndex(const ValueT &Val) const {
136
97.1M
    assert(ValIndexOf(Val) < Universe &&
137
97.1M
           "Invalid key in set. Did object mutate?");
138
97.1M
    return ValIndexOf(Val);
139
97.1M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::sparseIndex(llvm::VReg2SUnitOperIdx const&) const
Line
Count
Source
135
25.5M
  unsigned sparseIndex(const ValueT &Val) const {
136
25.5M
    assert(ValIndexOf(Val) < Universe &&
137
25.5M
           "Invalid key in set. Did object mutate?");
138
25.5M
    return ValIndexOf(Val);
139
25.5M
  }
140
112M
  unsigned sparseIndex(const SMSNode &N) const { return sparseIndex(N.Data); }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::sparseIndex(llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode const&) const
Line
Count
Source
140
14.1M
  unsigned sparseIndex(const SMSNode &N) const { return sparseIndex(N.Data); }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::sparseIndex(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SMSNode const&) const
Line
Count
Source
140
84.0M
  unsigned sparseIndex(const SMSNode &N) const { return sparseIndex(N.Data); }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::sparseIndex(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode const&) const
Line
Count
Source
140
14.2M
  unsigned sparseIndex(const SMSNode &N) const { return sparseIndex(N.Data); }
141
142
  /// Whether the given entry is the head of the list. List heads's previous
143
  /// pointers are to the tail of the list, allowing for efficient access to the
144
  /// list tail. D must be a valid entry node.
145
37.9M
  bool isHead(const SMSNode &D) const {
146
37.9M
    assert(D.isValid() && "Invalid node for head");
147
37.9M
    return Dense[D.Prev].isTail();
148
37.9M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::isHead(llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode const&) const
Line
Count
Source
145
6.24M
  bool isHead(const SMSNode &D) const {
146
6.24M
    assert(D.isValid() && "Invalid node for head");
147
6.24M
    return Dense[D.Prev].isTail();
148
6.24M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::isHead(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SMSNode const&) const
Line
Count
Source
145
23.9M
  bool isHead(const SMSNode &D) const {
146
23.9M
    assert(D.isValid() && "Invalid node for head");
147
23.9M
    return Dense[D.Prev].isTail();
148
23.9M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::isHead(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode const&) const
Line
Count
Source
145
7.68M
  bool isHead(const SMSNode &D) const {
146
7.68M
    assert(D.isValid() && "Invalid node for head");
147
7.68M
    return Dense[D.Prev].isTail();
148
7.68M
  }
149
150
  /// Whether the given entry is a singleton entry, i.e. the only entry with
151
  /// that key.
152
10.6M
  bool isSingleton(const SMSNode &N) const {
153
10.6M
    assert(N.isValid() && "Invalid node for singleton");
154
10.6M
    // Is N its own predecessor?
155
10.6M
    return &Dense[N.Prev] == &N;
156
10.6M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::isSingleton(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SMSNode const&) const
Line
Count
Source
152
5.07M
  bool isSingleton(const SMSNode &N) const {
153
5.07M
    assert(N.isValid() && "Invalid node for singleton");
154
5.07M
    // Is N its own predecessor?
155
5.07M
    return &Dense[N.Prev] == &N;
156
5.07M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::isSingleton(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode const&) const
Line
Count
Source
152
5.55M
  bool isSingleton(const SMSNode &N) const {
153
5.55M
    assert(N.isValid() && "Invalid node for singleton");
154
5.55M
    // Is N its own predecessor?
155
5.55M
    return &Dense[N.Prev] == &N;
156
5.55M
  }
157
158
  /// Add in the given SMSNode. Uses a free entry in our freelist if
159
  /// available. Returns the index of the added node.
160
28.8M
  unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) {
161
28.8M
    if (NumFree == 0) {
162
23.6M
      Dense.push_back(SMSNode(V, Prev, Next));
163
23.6M
      return Dense.size() - 1;
164
23.6M
    }
165
5.13M
166
5.13M
    // Peel off a free slot
167
5.13M
    unsigned Idx = FreelistIdx;
168
5.13M
    unsigned NextFree = Dense[Idx].Next;
169
5.13M
    assert(Dense[Idx].isTombstone() && "Non-tombstone free?");
170
5.13M
171
5.13M
    Dense[Idx] = SMSNode(V, Prev, Next);
172
5.13M
    FreelistIdx = NextFree;
173
5.13M
    --NumFree;
174
5.13M
    return Idx;
175
5.13M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::addValue(llvm::VReg2SUnit const&, unsigned int, unsigned int)
Line
Count
Source
160
4.40M
  unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) {
161
4.40M
    if (NumFree == 0) {
162
4.40M
      Dense.push_back(SMSNode(V, Prev, Next));
163
4.40M
      return Dense.size() - 1;
164
4.40M
    }
165
0
166
0
    // Peel off a free slot
167
0
    unsigned Idx = FreelistIdx;
168
0
    unsigned NextFree = Dense[Idx].Next;
169
0
    assert(Dense[Idx].isTombstone() && "Non-tombstone free?");
170
0
171
0
    Dense[Idx] = SMSNode(V, Prev, Next);
172
0
    FreelistIdx = NextFree;
173
0
    --NumFree;
174
0
    return Idx;
175
0
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::addValue(llvm::PhysRegSUOper const&, unsigned int, unsigned int)
Line
Count
Source
160
13.1M
  unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) {
161
13.1M
    if (NumFree == 0) {
162
11.6M
      Dense.push_back(SMSNode(V, Prev, Next));
163
11.6M
      return Dense.size() - 1;
164
11.6M
    }
165
1.54M
166
1.54M
    // Peel off a free slot
167
1.54M
    unsigned Idx = FreelistIdx;
168
1.54M
    unsigned NextFree = Dense[Idx].Next;
169
1.54M
    assert(Dense[Idx].isTombstone() && "Non-tombstone free?");
170
1.54M
171
1.54M
    Dense[Idx] = SMSNode(V, Prev, Next);
172
1.54M
    FreelistIdx = NextFree;
173
1.54M
    --NumFree;
174
1.54M
    return Idx;
175
1.54M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::addValue(llvm::VReg2SUnitOperIdx const&, unsigned int, unsigned int)
Line
Count
Source
160
11.2M
  unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) {
161
11.2M
    if (NumFree == 0) {
162
7.65M
      Dense.push_back(SMSNode(V, Prev, Next));
163
7.65M
      return Dense.size() - 1;
164
7.65M
    }
165
3.58M
166
3.58M
    // Peel off a free slot
167
3.58M
    unsigned Idx = FreelistIdx;
168
3.58M
    unsigned NextFree = Dense[Idx].Next;
169
3.58M
    assert(Dense[Idx].isTombstone() && "Non-tombstone free?");
170
3.58M
171
3.58M
    Dense[Idx] = SMSNode(V, Prev, Next);
172
3.58M
    FreelistIdx = NextFree;
173
3.58M
    --NumFree;
174
3.58M
    return Idx;
175
3.58M
  }
176
177
  /// Make the current index a new tombstone. Pushes it onto the freelist.
178
10.6M
  void makeTombstone(unsigned Idx) {
179
10.6M
    Dense[Idx].Prev = SMSNode::INVALID;
180
10.6M
    Dense[Idx].Next = FreelistIdx;
181
10.6M
    FreelistIdx = Idx;
182
10.6M
    ++NumFree;
183
10.6M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::makeTombstone(unsigned int)
Line
Count
Source
178
5.07M
  void makeTombstone(unsigned Idx) {
179
5.07M
    Dense[Idx].Prev = SMSNode::INVALID;
180
5.07M
    Dense[Idx].Next = FreelistIdx;
181
5.07M
    FreelistIdx = Idx;
182
5.07M
    ++NumFree;
183
5.07M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::makeTombstone(unsigned int)
Line
Count
Source
178
5.55M
  void makeTombstone(unsigned Idx) {
179
5.55M
    Dense[Idx].Prev = SMSNode::INVALID;
180
5.55M
    Dense[Idx].Next = FreelistIdx;
181
5.55M
    FreelistIdx = Idx;
182
5.55M
    ++NumFree;
183
5.55M
  }
184
185
public:
186
  using value_type = ValueT;
187
  using reference = ValueT &;
188
  using const_reference = const ValueT &;
189
  using pointer = ValueT *;
190
  using const_pointer = const ValueT *;
191
  using size_type = unsigned;
192
193
2.33M
  SparseMultiSet() = default;
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::SparseMultiSet()
Line
Count
Source
193
894k
  SparseMultiSet() = default;
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SparseMultiSet()
Line
Count
Source
193
960k
  SparseMultiSet() = default;
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SparseMultiSet()
Line
Count
Source
193
480k
  SparseMultiSet() = default;
194
  SparseMultiSet(const SparseMultiSet &) = delete;
195
  SparseMultiSet &operator=(const SparseMultiSet &) = delete;
196
2.33M
  ~SparseMultiSet() { free(Sparse); }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::~SparseMultiSet()
Line
Count
Source
196
480k
  ~SparseMultiSet() { free(Sparse); }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::~SparseMultiSet()
Line
Count
Source
196
894k
  ~SparseMultiSet() { free(Sparse); }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::~SparseMultiSet()
Line
Count
Source
196
960k
  ~SparseMultiSet() { free(Sparse); }
197
198
  /// Set the universe size which determines the largest key the set can hold.
199
  /// The universe must be sized before any elements can be added.
200
  ///
201
  /// @param U Universe size. All object keys must be less than U.
202
  ///
203
11.9M
  void setUniverse(unsigned U) {
204
11.9M
    // It's not hard to resize the universe on a non-empty set, but it doesn't
205
11.9M
    // seem like a likely use case, so we can add that code when we need it.
206
11.9M
    assert(empty() && "Can only resize universe on an empty map");
207
11.9M
    // Hysteresis prevents needless reallocations.
208
11.9M
    if (U >= Universe/4 && U <= Universe)
209
10.1M
      return;
210
1.75M
    free(Sparse);
211
1.75M
    // The Sparse array doesn't actually need to be initialized, so malloc
212
1.75M
    // would be enough here, but that will cause tools like valgrind to
213
1.75M
    // complain about branching on uninitialized data.
214
1.75M
    Sparse = static_cast<SparseT*>(safe_calloc(U, sizeof(SparseT)));
215
1.75M
    Universe = U;
216
1.75M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::setUniverse(unsigned int)
Line
Count
Source
203
3.09M
  void setUniverse(unsigned U) {
204
3.09M
    // It's not hard to resize the universe on a non-empty set, but it doesn't
205
3.09M
    // seem like a likely use case, so we can add that code when we need it.
206
3.09M
    assert(empty() && "Can only resize universe on an empty map");
207
3.09M
    // Hysteresis prevents needless reallocations.
208
3.09M
    if (U >= Universe/4 && U <= Universe)
209
2.61M
      return;
210
480k
    free(Sparse);
211
480k
    // The Sparse array doesn't actually need to be initialized, so malloc
212
480k
    // would be enough here, but that will cause tools like valgrind to
213
480k
    // complain about branching on uninitialized data.
214
480k
    Sparse = static_cast<SparseT*>(safe_calloc(U, sizeof(SparseT)));
215
480k
    Universe = U;
216
480k
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::setUniverse(unsigned int)
Line
Count
Source
203
5.90M
  void setUniverse(unsigned U) {
204
5.90M
    // It's not hard to resize the universe on a non-empty set, but it doesn't
205
5.90M
    // seem like a likely use case, so we can add that code when we need it.
206
5.90M
    assert(empty() && "Can only resize universe on an empty map");
207
5.90M
    // Hysteresis prevents needless reallocations.
208
5.90M
    if (U >= Universe/4 && U <= Universe)
209
5.01M
      return;
210
890k
    free(Sparse);
211
890k
    // The Sparse array doesn't actually need to be initialized, so malloc
212
890k
    // would be enough here, but that will cause tools like valgrind to
213
890k
    // complain about branching on uninitialized data.
214
890k
    Sparse = static_cast<SparseT*>(safe_calloc(U, sizeof(SparseT)));
215
890k
    Universe = U;
216
890k
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::setUniverse(unsigned int)
Line
Count
Source
203
2.95M
  void setUniverse(unsigned U) {
204
2.95M
    // It's not hard to resize the universe on a non-empty set, but it doesn't
205
2.95M
    // seem like a likely use case, so we can add that code when we need it.
206
2.95M
    assert(empty() && "Can only resize universe on an empty map");
207
2.95M
    // Hysteresis prevents needless reallocations.
208
2.95M
    if (U >= Universe/4 && U <= Universe)
209
2.56M
      return;
210
386k
    free(Sparse);
211
386k
    // The Sparse array doesn't actually need to be initialized, so malloc
212
386k
    // would be enough here, but that will cause tools like valgrind to
213
386k
    // complain about branching on uninitialized data.
214
386k
    Sparse = static_cast<SparseT*>(safe_calloc(U, sizeof(SparseT)));
215
386k
    Universe = U;
216
386k
  }
217
218
  /// Our iterators are iterators over the collection of objects that share a
219
  /// key.
220
  template<typename SMSPtrTy>
221
  class iterator_base : public std::iterator<std::bidirectional_iterator_tag,
222
                                             ValueT> {
223
    friend class SparseMultiSet;
224
225
    SMSPtrTy SMS;
226
    unsigned Idx;
227
    unsigned SparseIdx;
228
229
    iterator_base(SMSPtrTy P, unsigned I, unsigned SI)
230
462M
      : SMS(P), Idx(I), SparseIdx(SI) {}
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::iterator_base(llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*, unsigned int, unsigned int)
Line
Count
Source
230
72.6M
      : SMS(P), Idx(I), SparseIdx(SI) {}
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::iterator_base(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*, unsigned int, unsigned int)
Line
Count
Source
230
177M
      : SMS(P), Idx(I), SparseIdx(SI) {}
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short> const*>::iterator_base(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short> const*, unsigned int, unsigned int)
Line
Count
Source
230
159M
      : SMS(P), Idx(I), SparseIdx(SI) {}
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::iterator_base(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*, unsigned int, unsigned int)
Line
Count
Source
230
52.6M
      : SMS(P), Idx(I), SparseIdx(SI) {}
231
232
    /// Whether our iterator has fallen outside our dense vector.
233
1.10k
    bool isEnd() const {
234
1.10k
      if (Idx == SMSNode::INVALID)
235
1.10k
        return true;
236
0
237
0
      assert(Idx < SMS->Dense.size() && "Out of range, non-INVALID Idx?");
238
0
      return false;
239
0
    }
240
241
    /// Whether our iterator is properly keyed, i.e. the SparseIdx is valid
242
    bool isKeyed() const { return SparseIdx < SMS->Universe; }
243
244
4.36M
    unsigned Prev() const { return SMS->Dense[Idx].Prev; }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::Prev() const
Line
Count
Source
244
1.65M
    unsigned Prev() const { return SMS->Dense[Idx].Prev; }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::Prev() const
Line
Count
Source
244
644k
    unsigned Prev() const { return SMS->Dense[Idx].Prev; }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::Prev() const
Line
Count
Source
244
2.05M
    unsigned Prev() const { return SMS->Dense[Idx].Prev; }
245
35.1M
    unsigned Next() const { return SMS->Dense[Idx].Next; }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::Next() const
Line
Count
Source
245
26.2M
    unsigned Next() const { return SMS->Dense[Idx].Next; }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::Next() const
Line
Count
Source
245
8.68M
    unsigned Next() const { return SMS->Dense[Idx].Next; }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::Next() const
Line
Count
Source
245
147k
    unsigned Next() const { return SMS->Dense[Idx].Next; }
246
247
3.80k
    void setPrev(unsigned P) { SMS->Dense[Idx].Prev = P; }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::setPrev(unsigned int)
Line
Count
Source
247
170
    void setPrev(unsigned P) { SMS->Dense[Idx].Prev = P; }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::setPrev(unsigned int)
Line
Count
Source
247
3.63k
    void setPrev(unsigned P) { SMS->Dense[Idx].Prev = P; }
248
    void setNext(unsigned N) { SMS->Dense[Idx].Next = N; }
249
250
  public:
251
    using super = std::iterator<std::bidirectional_iterator_tag, ValueT>;
252
    using value_type = typename super::value_type;
253
    using difference_type = typename super::difference_type;
254
    using pointer = typename super::pointer;
255
    using reference = typename super::reference;
256
257
57.5M
    reference operator*() const {
258
57.5M
      assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
259
57.5M
             "Dereferencing iterator of invalid key or index");
260
57.5M
261
57.5M
      return SMS->Dense[Idx].Data;
262
57.5M
    }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator*() const
Line
Count
Source
257
26.3M
    reference operator*() const {
258
26.3M
      assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
259
26.3M
             "Dereferencing iterator of invalid key or index");
260
26.3M
261
26.3M
      return SMS->Dense[Idx].Data;
262
26.3M
    }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::operator*() const
Line
Count
Source
257
14.1M
    reference operator*() const {
258
14.1M
      assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
259
14.1M
             "Dereferencing iterator of invalid key or index");
260
14.1M
261
14.1M
      return SMS->Dense[Idx].Data;
262
14.1M
    }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator*() const
Line
Count
Source
257
17.0M
    reference operator*() const {
258
17.0M
      assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
259
17.0M
             "Dereferencing iterator of invalid key or index");
260
17.0M
261
17.0M
      return SMS->Dense[Idx].Data;
262
17.0M
    }
263
51.6M
    pointer operator->() const { return &operator*(); }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator->() const
Line
Count
Source
263
20.4M
    pointer operator->() const { return &operator*(); }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::operator->() const
Line
Count
Source
263
14.1M
    pointer operator->() const { return &operator*(); }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator->() const
Line
Count
Source
263
17.0M
    pointer operator->() const { return &operator*(); }
264
265
    /// Comparison operators
266
201M
    bool operator==(const iterator_base &RHS) const {
267
201M
      // end compares equal
268
201M
      if (
SMS == RHS.SMS201M
&& Idx == RHS.Idx) {
269
140M
        assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
270
140M
               "Same dense entry, but different keys?");
271
140M
        return true;
272
140M
      }
273
61.6M
274
61.6M
      return false;
275
61.6M
    }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator==(llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*> const&) const
Line
Count
Source
266
51.7M
    bool operator==(const iterator_base &RHS) const {
267
51.7M
      // end compares equal
268
51.7M
      if (SMS == RHS.SMS && Idx == RHS.Idx) {
269
23.7M
        assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
270
23.7M
               "Same dense entry, but different keys?");
271
23.7M
        return true;
272
23.7M
      }
273
28.0M
274
28.0M
      return false;
275
28.0M
    }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short> const*>::operator==(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short> const*> const&) const
Line
Count
Source
266
79.7M
    bool operator==(const iterator_base &RHS) const {
267
79.7M
      // end compares equal
268
79.7M
      if (SMS == RHS.SMS && Idx == RHS.Idx) {
269
68.2M
        assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
270
68.2M
               "Same dense entry, but different keys?");
271
68.2M
        return true;
272
68.2M
      }
273
11.4M
274
11.4M
      return false;
275
11.4M
    }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::operator==(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*> const&) const
Line
Count
Source
266
46.6M
    bool operator==(const iterator_base &RHS) const {
267
46.6M
      // end compares equal
268
46.6M
      if (
SMS == RHS.SMS46.6M
&& Idx == RHS.Idx) {
269
32.2M
        assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
270
32.2M
               "Same dense entry, but different keys?");
271
32.2M
        return true;
272
32.2M
      }
273
14.4M
274
14.4M
      return false;
275
14.4M
    }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator==(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*> const&) const
Line
Count
Source
266
23.6M
    bool operator==(const iterator_base &RHS) const {
267
23.6M
      // end compares equal
268
23.6M
      if (SMS == RHS.SMS && Idx == RHS.Idx) {
269
15.8M
        assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
270
15.8M
               "Same dense entry, but different keys?");
271
15.8M
        return true;
272
15.8M
      }
273
7.75M
274
7.75M
      return false;
275
7.75M
    }
276
277
169M
    bool operator!=(const iterator_base &RHS) const {
278
169M
      return !operator==(RHS);
279
169M
    }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator!=(llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*> const&) const
Line
Count
Source
277
44.2M
    bool operator!=(const iterator_base &RHS) const {
278
44.2M
      return !operator==(RHS);
279
44.2M
    }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short> const*>::operator!=(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short> const*> const&) const
Line
Count
Source
277
79.7M
    bool operator!=(const iterator_base &RHS) const {
278
79.7M
      return !operator==(RHS);
279
79.7M
    }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::operator!=(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*> const&) const
Line
Count
Source
277
33.4M
    bool operator!=(const iterator_base &RHS) const {
278
33.4M
      return !operator==(RHS);
279
33.4M
    }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator!=(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*> const&) const
Line
Count
Source
277
12.3M
    bool operator!=(const iterator_base &RHS) const {
278
12.3M
      return !operator==(RHS);
279
12.3M
    }
280
281
    /// Increment and decrement operators
282
1.10k
    iterator_base &operator--() { // predecrement - Back up
283
1.10k
      assert(isKeyed() && "Decrementing an invalid iterator");
284
1.10k
      assert((isEnd() || !SMS->isHead(SMS->Dense[Idx])) &&
285
1.10k
             "Decrementing head of list");
286
1.10k
287
1.10k
      // If we're at the end, then issue a new find()
288
1.10k
      if (isEnd())
289
1.10k
        Idx = SMS->findIndex(SparseIdx).Prev();
290
0
      else
291
0
        Idx = Prev();
292
1.10k
293
1.10k
      return *this;
294
1.10k
    }
295
35.1M
    iterator_base &operator++() { // preincrement - Advance
296
35.1M
      assert(!isEnd() && isKeyed() && "Incrementing an invalid/end iterator");
297
35.1M
      Idx = Next();
298
35.1M
      return *this;
299
35.1M
    }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator++()
Line
Count
Source
295
26.2M
    iterator_base &operator++() { // preincrement - Advance
296
26.2M
      assert(!isEnd() && isKeyed() && "Incrementing an invalid/end iterator");
297
26.2M
      Idx = Next();
298
26.2M
      return *this;
299
26.2M
    }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>::operator++()
Line
Count
Source
295
8.68M
    iterator_base &operator++() { // preincrement - Advance
296
8.68M
      assert(!isEnd() && isKeyed() && "Incrementing an invalid/end iterator");
297
8.68M
      Idx = Next();
298
8.68M
      return *this;
299
8.68M
    }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>::operator++()
Line
Count
Source
295
147k
    iterator_base &operator++() { // preincrement - Advance
296
147k
      assert(!isEnd() && isKeyed() && "Incrementing an invalid/end iterator");
297
147k
      Idx = Next();
298
147k
      return *this;
299
147k
    }
300
    iterator_base operator--(int) { // postdecrement
301
      iterator_base I(*this);
302
      --*this;
303
      return I;
304
    }
305
    iterator_base operator++(int) { // postincrement
306
      iterator_base I(*this);
307
      ++*this;
308
      return I;
309
    }
310
  };
311
312
  using iterator = iterator_base<SparseMultiSet *>;
313
  using const_iterator = iterator_base<const SparseMultiSet *>;
314
315
  // Convenience types
316
  using RangePair = std::pair<iterator, iterator>;
317
318
  /// Returns an iterator past this container. Note that such an iterator cannot
319
  /// be decremented, but will compare equal to other end iterators.
320
226M
  iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::end()
Line
Count
Source
320
62.0M
  iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::end()
Line
Count
Source
320
135M
  iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::end()
Line
Count
Source
320
29.2M
  iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); }
321
79.7M
  const_iterator end() const {
322
79.7M
    return const_iterator(this, SMSNode::INVALID, SMSNode::INVALID);
323
79.7M
  }
324
325
  /// Returns true if the set is empty.
326
  ///
327
  /// This is not the same as BitVector::empty().
328
  ///
329
  bool empty() const { return size() == 0; }
330
331
  /// Returns the number of elements in the set.
332
  ///
333
  /// This is not the same as BitVector::size() which returns the size of the
334
  /// universe.
335
  ///
336
  size_type size() const {
337
    assert(NumFree <= Dense.size() && "Out-of-bounds free entries");
338
    return Dense.size() - NumFree;
339
  }
340
341
  /// Clears the set.  This is a very fast constant time operation.
342
  ///
343
11.9M
  void clear() {
344
11.9M
    // Sparse does not need to be cleared, see find().
345
11.9M
    Dense.clear();
346
11.9M
    NumFree = 0;
347
11.9M
    FreelistIdx = SMSNode::INVALID;
348
11.9M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::clear()
Line
Count
Source
343
3.09M
  void clear() {
344
3.09M
    // Sparse does not need to be cleared, see find().
345
3.09M
    Dense.clear();
346
3.09M
    NumFree = 0;
347
3.09M
    FreelistIdx = SMSNode::INVALID;
348
3.09M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::clear()
Line
Count
Source
343
5.90M
  void clear() {
344
5.90M
    // Sparse does not need to be cleared, see find().
345
5.90M
    Dense.clear();
346
5.90M
    NumFree = 0;
347
5.90M
    FreelistIdx = SMSNode::INVALID;
348
5.90M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::clear()
Line
Count
Source
343
2.95M
  void clear() {
344
2.95M
    // Sparse does not need to be cleared, see find().
345
2.95M
    Dense.clear();
346
2.95M
    NumFree = 0;
347
2.95M
    FreelistIdx = SMSNode::INVALID;
348
2.95M
  }
349
350
  /// Find an element by its index.
351
  ///
352
  /// @param   Idx A valid index to find.
353
  /// @returns An iterator to the element identified by key, or end().
354
  ///
355
152M
  iterator findIndex(unsigned Idx) {
356
152M
    assert(Idx < Universe && "Key out of range");
357
152M
    const unsigned Stride = std::numeric_limits<SparseT>::max() + 1u;
358
227M
    for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; 
i += Stride74.5M
) {
359
111M
      const unsigned FoundIdx = sparseIndex(Dense[i]);
360
111M
      // Check that we're pointing at the correct entry and that it is the head
361
111M
      // of a valid list.
362
111M
      if (Idx == FoundIdx && 
Dense[i].isValid()37.9M
&&
isHead(Dense[i])36.6M
)
363
36.6M
        return iterator(this, i, Idx);
364
74.5M
      // Stride is 0 when SparseT >= unsigned.  We don't need to loop.
365
74.5M
      if (!Stride)
366
0
        break;
367
74.5M
    }
368
152M
    
return end()116M
;
369
152M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::findIndex(unsigned int)
Line
Count
Source
355
22.4M
  iterator findIndex(unsigned Idx) {
356
22.4M
    assert(Idx < Universe && "Key out of range");
357
22.4M
    const unsigned Stride = std::numeric_limits<SparseT>::max() + 1u;
358
30.3M
    for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; 
i += Stride7.92M
) {
359
14.1M
      const unsigned FoundIdx = sparseIndex(Dense[i]);
360
14.1M
      // Check that we're pointing at the correct entry and that it is the head
361
14.1M
      // of a valid list.
362
14.1M
      if (Idx == FoundIdx && 
Dense[i].isValid()6.24M
&&
isHead(Dense[i])6.24M
)
363
6.24M
        return iterator(this, i, Idx);
364
7.92M
      // Stride is 0 when SparseT >= unsigned.  We don't need to loop.
365
7.92M
      if (!Stride)
366
0
        break;
367
7.92M
    }
368
22.4M
    
return end()16.1M
;
369
22.4M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::findIndex(unsigned int)
Line
Count
Source
355
112M
  iterator findIndex(unsigned Idx) {
356
112M
    assert(Idx < Universe && "Key out of range");
357
112M
    const unsigned Stride = std::numeric_limits<SparseT>::max() + 1u;
358
172M
    for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; 
i += Stride60.0M
) {
359
83.8M
      const unsigned FoundIdx = sparseIndex(Dense[i]);
360
83.8M
      // Check that we're pointing at the correct entry and that it is the head
361
83.8M
      // of a valid list.
362
83.8M
      if (Idx == FoundIdx && 
Dense[i].isValid()24.7M
&&
isHead(Dense[i])23.7M
)
363
23.7M
        return iterator(this, i, Idx);
364
60.0M
      // Stride is 0 when SparseT >= unsigned.  We don't need to loop.
365
60.0M
      if (!Stride)
366
0
        break;
367
60.0M
    }
368
112M
    
return end()88.7M
;
369
112M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::findIndex(unsigned int)
Line
Count
Source
355
17.9M
  iterator findIndex(unsigned Idx) {
356
17.9M
    assert(Idx < Universe && "Key out of range");
357
17.9M
    const unsigned Stride = std::numeric_limits<SparseT>::max() + 1u;
358
24.4M
    for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; 
i += Stride6.57M
) {
359
13.2M
      const unsigned FoundIdx = sparseIndex(Dense[i]);
360
13.2M
      // Check that we're pointing at the correct entry and that it is the head
361
13.2M
      // of a valid list.
362
13.2M
      if (Idx == FoundIdx && 
Dense[i].isValid()6.95M
&&
isHead(Dense[i])6.63M
)
363
6.63M
        return iterator(this, i, Idx);
364
6.57M
      // Stride is 0 when SparseT >= unsigned.  We don't need to loop.
365
6.57M
      if (!Stride)
366
0
        break;
367
6.57M
    }
368
17.9M
    
return end()11.2M
;
369
17.9M
  }
370
371
  /// Find an element by its key.
372
  ///
373
  /// @param   Key A valid key to find.
374
  /// @returns An iterator to the element identified by key, or end().
375
  ///
376
44.3M
  iterator find(const KeyT &Key) {
377
44.3M
    return findIndex(KeyIndexOf(Key));
378
44.3M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::find(unsigned int const&)
Line
Count
Source
376
18.0M
  iterator find(const KeyT &Key) {
377
18.0M
    return findIndex(KeyIndexOf(Key));
378
18.0M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::find(unsigned int const&)
Line
Count
Source
376
19.6M
  iterator find(const KeyT &Key) {
377
19.6M
    return findIndex(KeyIndexOf(Key));
378
19.6M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::find(unsigned int const&)
Line
Count
Source
376
6.67M
  iterator find(const KeyT &Key) {
377
6.67M
    return findIndex(KeyIndexOf(Key));
378
6.67M
  }
379
380
79.7M
  const_iterator find(const KeyT &Key) const {
381
79.7M
    iterator I = const_cast<SparseMultiSet*>(this)->findIndex(KeyIndexOf(Key));
382
79.7M
    return const_iterator(I.SMS, I.Idx, KeyIndexOf(Key));
383
79.7M
  }
384
385
  /// Returns the number of elements identified by Key. This will be linear in
386
  /// the number of elements of that key.
387
  size_type count(const KeyT &Key) const {
388
    unsigned Ret = 0;
389
    for (const_iterator It = find(Key); It != end(); ++It)
390
      ++Ret;
391
392
    return Ret;
393
  }
394
395
  /// Returns true if this set contains an element identified by Key.
396
79.7M
  bool contains(const KeyT &Key) const {
397
79.7M
    return find(Key) != end();
398
79.7M
  }
399
400
  /// Return the head and tail of the subset's list, otherwise returns end().
401
  iterator getHead(const KeyT &Key) { return find(Key); }
402
  iterator getTail(const KeyT &Key) {
403
    iterator I = find(Key);
404
    if (I != end())
405
      I = iterator(this, I.Prev(), KeyIndexOf(Key));
406
    return I;
407
  }
408
409
  /// The bounds of the range of items sharing Key K. First member is the head
410
  /// of the list, and the second member is a decrementable end iterator for
411
  /// that key.
412
1.38k
  RangePair equal_range(const KeyT &K) {
413
1.38k
    iterator B = find(K);
414
1.38k
    iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx);
415
1.38k
    return make_pair(B, E);
416
1.38k
  }
417
418
  /// Insert a new element at the tail of the subset list. Returns an iterator
419
  /// to the newly added entry.
420
28.8M
  iterator insert(const ValueT &Val) {
421
28.8M
    unsigned Idx = sparseIndex(Val);
422
28.8M
    iterator I = findIndex(Idx);
423
28.8M
424
28.8M
    unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID);
425
28.8M
426
28.8M
    if (I == end()) {
427
24.4M
      // Make a singleton list
428
24.4M
      Sparse[Idx] = NodeIdx;
429
24.4M
      Dense[NodeIdx].Prev = NodeIdx;
430
24.4M
      return iterator(this, NodeIdx, Idx);
431
24.4M
    }
432
4.35M
433
4.35M
    // Stick it at the end.
434
4.35M
    unsigned HeadIdx = I.Idx;
435
4.35M
    unsigned TailIdx = I.Prev();
436
4.35M
    Dense[TailIdx].Next = NodeIdx;
437
4.35M
    Dense[HeadIdx].Prev = NodeIdx;
438
4.35M
    Dense[NodeIdx].Prev = TailIdx;
439
4.35M
440
4.35M
    return iterator(this, NodeIdx, Idx);
441
4.35M
  }
llvm::SparseMultiSet<llvm::VReg2SUnit, llvm::VirtReg2IndexFunctor, unsigned char>::insert(llvm::VReg2SUnit const&)
Line
Count
Source
420
4.40M
  iterator insert(const ValueT &Val) {
421
4.40M
    unsigned Idx = sparseIndex(Val);
422
4.40M
    iterator I = findIndex(Idx);
423
4.40M
424
4.40M
    unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID);
425
4.40M
426
4.40M
    if (I == end()) {
427
2.74M
      // Make a singleton list
428
2.74M
      Sparse[Idx] = NodeIdx;
429
2.74M
      Dense[NodeIdx].Prev = NodeIdx;
430
2.74M
      return iterator(this, NodeIdx, Idx);
431
2.74M
    }
432
1.65M
433
1.65M
    // Stick it at the end.
434
1.65M
    unsigned HeadIdx = I.Idx;
435
1.65M
    unsigned TailIdx = I.Prev();
436
1.65M
    Dense[TailIdx].Next = NodeIdx;
437
1.65M
    Dense[HeadIdx].Prev = NodeIdx;
438
1.65M
    Dense[NodeIdx].Prev = TailIdx;
439
1.65M
440
1.65M
    return iterator(this, NodeIdx, Idx);
441
1.65M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::insert(llvm::PhysRegSUOper const&)
Line
Count
Source
420
13.1M
  iterator insert(const ValueT &Val) {
421
13.1M
    unsigned Idx = sparseIndex(Val);
422
13.1M
    iterator I = findIndex(Idx);
423
13.1M
424
13.1M
    unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID);
425
13.1M
426
13.1M
    if (I == end()) {
427
12.5M
      // Make a singleton list
428
12.5M
      Sparse[Idx] = NodeIdx;
429
12.5M
      Dense[NodeIdx].Prev = NodeIdx;
430
12.5M
      return iterator(this, NodeIdx, Idx);
431
12.5M
    }
432
643k
433
643k
    // Stick it at the end.
434
643k
    unsigned HeadIdx = I.Idx;
435
643k
    unsigned TailIdx = I.Prev();
436
643k
    Dense[TailIdx].Next = NodeIdx;
437
643k
    Dense[HeadIdx].Prev = NodeIdx;
438
643k
    Dense[NodeIdx].Prev = TailIdx;
439
643k
440
643k
    return iterator(this, NodeIdx, Idx);
441
643k
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::insert(llvm::VReg2SUnitOperIdx const&)
Line
Count
Source
420
11.2M
  iterator insert(const ValueT &Val) {
421
11.2M
    unsigned Idx = sparseIndex(Val);
422
11.2M
    iterator I = findIndex(Idx);
423
11.2M
424
11.2M
    unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID);
425
11.2M
426
11.2M
    if (I == end()) {
427
9.19M
      // Make a singleton list
428
9.19M
      Sparse[Idx] = NodeIdx;
429
9.19M
      Dense[NodeIdx].Prev = NodeIdx;
430
9.19M
      return iterator(this, NodeIdx, Idx);
431
9.19M
    }
432
2.05M
433
2.05M
    // Stick it at the end.
434
2.05M
    unsigned HeadIdx = I.Idx;
435
2.05M
    unsigned TailIdx = I.Prev();
436
2.05M
    Dense[TailIdx].Next = NodeIdx;
437
2.05M
    Dense[HeadIdx].Prev = NodeIdx;
438
2.05M
    Dense[NodeIdx].Prev = TailIdx;
439
2.05M
440
2.05M
    return iterator(this, NodeIdx, Idx);
441
2.05M
  }
442
443
  /// Erases an existing element identified by a valid iterator.
444
  ///
445
  /// This invalidates iterators pointing at the same entry, but erase() returns
446
  /// an iterator pointing to the next element in the subset's list. This makes
447
  /// it possible to erase selected elements while iterating over the subset:
448
  ///
449
  ///   tie(I, E) = Set.equal_range(Key);
450
  ///   while (I != E)
451
  ///     if (test(*I))
452
  ///       I = Set.erase(I);
453
  ///     else
454
  ///       ++I;
455
  ///
456
  /// Note that if the last element in the subset list is erased, this will
457
  /// return an end iterator which can be decremented to get the new tail (if it
458
  /// exists):
459
  ///
460
  ///  tie(B, I) = Set.equal_range(Key);
461
  ///  for (bool isBegin = B == I; !isBegin; /* empty */) {
462
  ///    isBegin = (--I) == B;
463
  ///    if (test(I))
464
  ///      break;
465
  ///    I = erase(I);
466
  ///  }
467
10.6M
  iterator erase(iterator I) {
468
10.6M
    assert(I.isKeyed() && !I.isEnd() && !Dense[I.Idx].isTombstone() &&
469
10.6M
           "erasing invalid/end/tombstone iterator");
470
10.6M
471
10.6M
    // First, unlink the node from its list. Then swap the node out with the
472
10.6M
    // dense vector's last entry
473
10.6M
    iterator NextI = unlink(Dense[I.Idx]);
474
10.6M
475
10.6M
    // Put in a tombstone.
476
10.6M
    makeTombstone(I.Idx);
477
10.6M
478
10.6M
    return NextI;
479
10.6M
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::erase(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::iterator_base<llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>*>)
Line
Count
Source
467
5.07M
  iterator erase(iterator I) {
468
5.07M
    assert(I.isKeyed() && !I.isEnd() && !Dense[I.Idx].isTombstone() &&
469
5.07M
           "erasing invalid/end/tombstone iterator");
470
5.07M
471
5.07M
    // First, unlink the node from its list. Then swap the node out with the
472
5.07M
    // dense vector's last entry
473
5.07M
    iterator NextI = unlink(Dense[I.Idx]);
474
5.07M
475
5.07M
    // Put in a tombstone.
476
5.07M
    makeTombstone(I.Idx);
477
5.07M
478
5.07M
    return NextI;
479
5.07M
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::erase(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::iterator_base<llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>*>)
Line
Count
Source
467
5.55M
  iterator erase(iterator I) {
468
5.55M
    assert(I.isKeyed() && !I.isEnd() && !Dense[I.Idx].isTombstone() &&
469
5.55M
           "erasing invalid/end/tombstone iterator");
470
5.55M
471
5.55M
    // First, unlink the node from its list. Then swap the node out with the
472
5.55M
    // dense vector's last entry
473
5.55M
    iterator NextI = unlink(Dense[I.Idx]);
474
5.55M
475
5.55M
    // Put in a tombstone.
476
5.55M
    makeTombstone(I.Idx);
477
5.55M
478
5.55M
    return NextI;
479
5.55M
  }
480
481
  /// Erase all elements with the given key. This invalidates all
482
  /// iterators of that key.
483
12.8M
  void eraseAll(const KeyT &K) {
484
17.9M
    for (iterator I = find(K); I != end(); /* empty */)
485
5.07M
      I = erase(I);
486
12.8M
  }
487
488
private:
489
  /// Unlink the node from its list. Returns the next node in the list.
490
10.6M
  iterator unlink(const SMSNode &N) {
491
10.6M
    if (isSingleton(N)) {
492
9.39M
      // Singleton is already unlinked
493
9.39M
      assert(N.Next == SMSNode::INVALID && "Singleton has next?");
494
9.39M
      return iterator(this, SMSNode::INVALID, ValIndexOf(N.Data));
495
9.39M
    }
496
1.23M
497
1.23M
    if (isHead(N)) {
498
1.23M
      // If we're the head, then update the sparse array and our next.
499
1.23M
      Sparse[sparseIndex(N)] = N.Next;
500
1.23M
      Dense[N.Next].Prev = N.Prev;
501
1.23M
      return iterator(this, N.Next, ValIndexOf(N.Data));
502
1.23M
    }
503
5.46k
504
5.46k
    if (N.isTail()) {
505
3.80k
      // If we're the tail, then update our head and our previous.
506
3.80k
      findIndex(sparseIndex(N)).setPrev(N.Prev);
507
3.80k
      Dense[N.Prev].Next = N.Next;
508
3.80k
509
3.80k
      // Give back an end iterator that can be decremented
510
3.80k
      iterator I(this, N.Prev, ValIndexOf(N.Data));
511
3.80k
      return ++I;
512
3.80k
    }
513
1.65k
514
1.65k
    // Otherwise, just drop us
515
1.65k
    Dense[N.Next].Prev = N.Prev;
516
1.65k
    Dense[N.Prev].Next = N.Next;
517
1.65k
    return iterator(this, N.Next, ValIndexOf(N.Data));
518
1.65k
  }
llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::unlink(llvm::SparseMultiSet<llvm::PhysRegSUOper, llvm::identity<unsigned int>, unsigned short>::SMSNode const&)
Line
Count
Source
490
5.07M
  iterator unlink(const SMSNode &N) {
491
5.07M
    if (isSingleton(N)) {
492
4.88M
      // Singleton is already unlinked
493
4.88M
      assert(N.Next == SMSNode::INVALID && "Singleton has next?");
494
4.88M
      return iterator(this, SMSNode::INVALID, ValIndexOf(N.Data));
495
4.88M
    }
496
184k
497
184k
    if (isHead(N)) {
498
183k
      // If we're the head, then update the sparse array and our next.
499
183k
      Sparse[sparseIndex(N)] = N.Next;
500
183k
      Dense[N.Next].Prev = N.Prev;
501
183k
      return iterator(this, N.Next, ValIndexOf(N.Data));
502
183k
    }
503
171
504
171
    if (N.isTail()) {
505
170
      // If we're the tail, then update our head and our previous.
506
170
      findIndex(sparseIndex(N)).setPrev(N.Prev);
507
170
      Dense[N.Prev].Next = N.Next;
508
170
509
170
      // Give back an end iterator that can be decremented
510
170
      iterator I(this, N.Prev, ValIndexOf(N.Data));
511
170
      return ++I;
512
170
    }
513
1
514
1
    // Otherwise, just drop us
515
1
    Dense[N.Next].Prev = N.Prev;
516
1
    Dense[N.Prev].Next = N.Next;
517
1
    return iterator(this, N.Next, ValIndexOf(N.Data));
518
1
  }
llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::unlink(llvm::SparseMultiSet<llvm::VReg2SUnitOperIdx, llvm::VirtReg2IndexFunctor, unsigned char>::SMSNode const&)
Line
Count
Source
490
5.55M
  iterator unlink(const SMSNode &N) {
491
5.55M
    if (isSingleton(N)) {
492
4.50M
      // Singleton is already unlinked
493
4.50M
      assert(N.Next == SMSNode::INVALID && "Singleton has next?");
494
4.50M
      return iterator(this, SMSNode::INVALID, ValIndexOf(N.Data));
495
4.50M
    }
496
1.05M
497
1.05M
    if (isHead(N)) {
498
1.04M
      // If we're the head, then update the sparse array and our next.
499
1.04M
      Sparse[sparseIndex(N)] = N.Next;
500
1.04M
      Dense[N.Next].Prev = N.Prev;
501
1.04M
      return iterator(this, N.Next, ValIndexOf(N.Data));
502
1.04M
    }
503
5.29k
504
5.29k
    if (N.isTail()) {
505
3.63k
      // If we're the tail, then update our head and our previous.
506
3.63k
      findIndex(sparseIndex(N)).setPrev(N.Prev);
507
3.63k
      Dense[N.Prev].Next = N.Next;
508
3.63k
509
3.63k
      // Give back an end iterator that can be decremented
510
3.63k
      iterator I(this, N.Prev, ValIndexOf(N.Data));
511
3.63k
      return ++I;
512
3.63k
    }
513
1.65k
514
1.65k
    // Otherwise, just drop us
515
1.65k
    Dense[N.Next].Prev = N.Prev;
516
1.65k
    Dense[N.Prev].Next = N.Next;
517
1.65k
    return iterator(this, N.Next, ValIndexOf(N.Data));
518
1.65k
  }
519
};
520
521
} // end namespace llvm
522
523
#endif // LLVM_ADT_SPARSEMULTISET_H