blob: 3d7221d4a2eee670abce3c727607aa9d5cb1defa (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
#pragma once
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#endif
//===- IndexedValuesMap.h ---------------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_DWARFLINKER_INDEXEDVALUESMAP_H
#define LLVM_DWARFLINKER_INDEXEDVALUESMAP_H
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/SmallVector.h"
#include <cstdint>
#include <utility>
namespace llvm {
namespace dwarf_linker {
/// This class stores values sequentually and assigns index to the each value.
template <typename T> class IndexedValuesMap {
public:
uint64_t getValueIndex(T Value) {
typename ValueToIndexMapTy::iterator It = ValueToIndexMap.find(Value);
if (It == ValueToIndexMap.end()) {
It = ValueToIndexMap.insert(std::make_pair(Value, Values.size())).first;
Values.push_back(Value);
}
return It->second;
}
const SmallVector<T> &getValues() const { return Values; }
void clear() {
ValueToIndexMap.clear();
Values.clear();
}
bool empty() { return Values.empty(); }
protected:
using ValueToIndexMapTy = DenseMap<T, uint64_t>;
ValueToIndexMapTy ValueToIndexMap;
SmallVector<T> Values;
};
} // end of namespace dwarf_linker
} // end of namespace llvm
#endif // LLVM_DWARFLINKER_INDEXEDVALUESMAP_H
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif
|
