Coverage Report

Created: 2018-12-11 00:00

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/include/llvm/ADT/UniqueVector.h
Line
Count
Source (jump to first uncovered line)
1
//===- llvm/ADT/UniqueVector.h ----------------------------------*- 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
#ifndef LLVM_ADT_UNIQUEVECTOR_H
11
#define LLVM_ADT_UNIQUEVECTOR_H
12
13
#include <cassert>
14
#include <cstddef>
15
#include <map>
16
#include <vector>
17
18
namespace llvm {
19
20
//===----------------------------------------------------------------------===//
21
/// UniqueVector - This class produces a sequential ID number (base 1) for each
22
/// unique entry that is added.  T is the type of entries in the vector. This
23
/// class should have an implementation of operator== and of operator<.
24
/// Entries can be fetched using operator[] with the entry ID.
25
template<class T> class UniqueVector {
26
public:
27
  using VectorType = typename std::vector<T>;
28
  using iterator = typename VectorType::iterator;
29
  using const_iterator = typename VectorType::const_iterator;
30
31
private:
32
  // Map - Used to handle the correspondence of entry to ID.
33
  std::map<T, unsigned> Map;
34
35
  // Vector - ID ordered vector of entries. Entries can be indexed by ID - 1.
36
  VectorType Vector;
37
38
public:
39
  /// insert - Append entry to the vector if it doesn't already exist.  Returns
40
  /// the entry's index + 1 to be used as a unique ID.
41
1.35M
  unsigned insert(const T &Entry) {
42
1.35M
    // Check if the entry is already in the map.
43
1.35M
    unsigned &Val = Map[Entry];
44
1.35M
45
1.35M
    // See if entry exists, if so return prior ID.
46
1.35M
    if (Val) 
return Val1.63k
;
47
1.35M
48
1.35M
    // Compute ID for entry.
49
1.35M
    Val = static_cast<unsigned>(Vector.size()) + 1;
50
1.35M
51
1.35M
    // Insert in vector.
52
1.35M
    Vector.push_back(Entry);
53
1.35M
    return Val;
54
1.35M
  }
llvm::UniqueVector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::insert(std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&)
Line
Count
Source
41
1.34M
  unsigned insert(const T &Entry) {
42
1.34M
    // Check if the entry is already in the map.
43
1.34M
    unsigned &Val = Map[Entry];
44
1.34M
45
1.34M
    // See if entry exists, if so return prior ID.
46
1.34M
    if (Val) 
return Val0
;
47
1.34M
48
1.34M
    // Compute ID for entry.
49
1.34M
    Val = static_cast<unsigned>(Vector.size()) + 1;
50
1.34M
51
1.34M
    // Insert in vector.
52
1.34M
    Vector.push_back(Entry);
53
1.34M
    return Val;
54
1.34M
  }
LiveDebugValues.cpp:llvm::UniqueVector<(anonymous namespace)::LiveDebugValues::VarLoc>::insert((anonymous namespace)::LiveDebugValues::VarLoc const&)
Line
Count
Source
41
1.84k
  unsigned insert(const T &Entry) {
42
1.84k
    // Check if the entry is already in the map.
43
1.84k
    unsigned &Val = Map[Entry];
44
1.84k
45
1.84k
    // See if entry exists, if so return prior ID.
46
1.84k
    if (Val) 
return Val1.08k
;
47
755
48
755
    // Compute ID for entry.
49
755
    Val = static_cast<unsigned>(Vector.size()) + 1;
50
755
51
755
    // Insert in vector.
52
755
    Vector.push_back(Entry);
53
755
    return Val;
54
755
  }
llvm::UniqueVector<llvm::Comdat const*>::insert(llvm::Comdat const* const&)
Line
Count
Source
41
2.69k
  unsigned insert(const T &Entry) {
42
2.69k
    // Check if the entry is already in the map.
43
2.69k
    unsigned &Val = Map[Entry];
44
2.69k
45
2.69k
    // See if entry exists, if so return prior ID.
46
2.69k
    if (Val) 
return Val551
;
47
2.14k
48
2.14k
    // Compute ID for entry.
49
2.14k
    Val = static_cast<unsigned>(Vector.size()) + 1;
50
2.14k
51
2.14k
    // Insert in vector.
52
2.14k
    Vector.push_back(Entry);
53
2.14k
    return Val;
54
2.14k
  }
55
56
  /// idFor - return the ID for an existing entry.  Returns 0 if the entry is
57
  /// not found.
58
2.71k
  unsigned idFor(const T &Entry) const {
59
2.71k
    // Search for entry in the map.
60
2.71k
    typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
61
2.71k
62
2.71k
    // See if entry exists, if so return ID.
63
2.71k
    if (MI != Map.end()) return MI->second;
64
0
65
0
    // No luck.
66
0
    return 0;
67
0
  }
llvm::UniqueVector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::idFor(std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > const&) const
Line
Count
Source
58
14
  unsigned idFor(const T &Entry) const {
59
14
    // Search for entry in the map.
60
14
    typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
61
14
62
14
    // See if entry exists, if so return ID.
63
14
    if (MI != Map.end()) return MI->second;
64
0
65
0
    // No luck.
66
0
    return 0;
67
0
  }
llvm::UniqueVector<llvm::Comdat const*>::idFor(llvm::Comdat const* const&) const
Line
Count
Source
58
2.69k
  unsigned idFor(const T &Entry) const {
59
2.69k
    // Search for entry in the map.
60
2.69k
    typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
61
2.69k
62
2.69k
    // See if entry exists, if so return ID.
63
2.69k
    if (MI != Map.end()) return MI->second;
64
0
65
0
    // No luck.
66
0
    return 0;
67
0
  }
68
69
  /// operator[] - Returns a reference to the entry with the specified ID.
70
46.0k
  const T &operator[](unsigned ID) const {
71
46.0k
    assert(ID-1 < size() && "ID is 0 or out of range!");
72
46.0k
    return Vector[ID - 1];
73
46.0k
  }
LiveDebugValues.cpp:llvm::UniqueVector<(anonymous namespace)::LiveDebugValues::VarLoc>::operator[](unsigned int) const
Line
Count
Source
70
45.9k
  const T &operator[](unsigned ID) const {
71
45.9k
    assert(ID-1 < size() && "ID is 0 or out of range!");
72
45.9k
    return Vector[ID - 1];
73
45.9k
  }
llvm::UniqueVector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::operator[](unsigned int) const
Line
Count
Source
70
14
  const T &operator[](unsigned ID) const {
71
14
    assert(ID-1 < size() && "ID is 0 or out of range!");
72
14
    return Vector[ID - 1];
73
14
  }
74
75
  /// Return an iterator to the start of the vector.
76
  iterator begin() { return Vector.begin(); }
77
78
  /// Return an iterator to the start of the vector.
79
4.51k
  const_iterator begin() const { return Vector.begin(); }
llvm::UniqueVector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::begin() const
Line
Count
Source
79
1
  const_iterator begin() const { return Vector.begin(); }
llvm::UniqueVector<llvm::Comdat const*>::begin() const
Line
Count
Source
79
4.51k
  const_iterator begin() const { return Vector.begin(); }
80
81
  /// Return an iterator to the end of the vector.
82
  iterator end() { return Vector.end(); }
83
84
  /// Return an iterator to the end of the vector.
85
4.51k
  const_iterator end() const { return Vector.end(); }
llvm::UniqueVector<std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> > >::end() const
Line
Count
Source
85
1
  const_iterator end() const { return Vector.end(); }
llvm::UniqueVector<llvm::Comdat const*>::end() const
Line
Count
Source
85
4.51k
  const_iterator end() const { return Vector.end(); }
86
87
  /// size - Returns the number of entries in the vector.
88
0
  size_t size() const { return Vector.size(); }
89
90
  /// empty - Returns true if the vector is empty.
91
  bool empty() const { return Vector.empty(); }
92
93
  /// reset - Clears all the entries.
94
  void reset() {
95
    Map.clear();
96
    Vector.resize(0, 0);
97
  }
98
};
99
100
} // end namespace llvm
101
102
#endif // LLVM_ADT_UNIQUEVECTOR_H