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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
// Copyright 2022 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_COMPILER_TURBOSHAFT_SIDETABLE_H_
#define V8_COMPILER_TURBOSHAFT_SIDETABLE_H_
#include <algorithm>
#include <iterator>
#include <limits>
#include <memory>
#include <type_traits>
#include "src/base/iterator.h"
#include "src/base/small-vector.h"
#include "src/base/vector.h"
#include "src/compiler/turboshaft/operations.h"
#include "src/zone/zone-containers.h"
namespace v8::internal::compiler::turboshaft {
// This sidetable is a conceptually infinite mapping from Turboshaft operation
// indices to values. It grows automatically and default-initializes the table
// when accessed out-of-bounds.
template <class T, class Key = OpIndex>
class GrowingSidetable {
public:
static_assert(std::is_same_v<Key, OpIndex> ||
std::is_same_v<Key, BlockIndex>);
explicit GrowingSidetable(Zone* zone) : table_(zone) {}
GrowingSidetable(size_t size, const T& initial_value, Zone* zone)
: table_(size, initial_value, zone) {}
T& operator[](Key index) {
size_t i = index.id();
if (V8_UNLIKELY(i >= table_.size())) {
table_.resize(NextSize(i));
// Make sure we also get access to potential over-allocation by
// `resize()`.
table_.resize(table_.capacity());
}
return table_[i];
}
const T& operator[](Key index) const {
size_t i = index.id();
if (V8_UNLIKELY(i >= table_.size())) {
table_.resize(NextSize(i));
// Make sure we also get access to potential over-allocation by
// `resize()`.
table_.resize(table_.capacity());
}
return table_[i];
}
// Reset by filling the table with the default value instead of shrinking to
// keep the memory for later phases.
void Reset() { std::fill(table_.begin(), table_.end(), T{}); }
// Returns `true` if the table never contained any values, even before
// `Reset()`.
bool empty() const { return table_.empty(); }
private:
mutable ZoneVector<T> table_;
size_t NextSize(size_t out_of_bounds_index) const {
DCHECK_GE(out_of_bounds_index, table_.size());
return out_of_bounds_index + out_of_bounds_index / 2 + 32;
}
};
// A fixed-size sidetable mapping from `Key` to `T`.
// Elements are default-initialized.
template <class T, class Key = OpIndex>
class FixedSidetable {
public:
static_assert(std::is_same_v<Key, OpIndex> ||
std::is_same_v<Key, BlockIndex>);
explicit FixedSidetable(size_t size, Zone* zone) : table_(size, zone) {}
FixedSidetable(size_t size, const T& default_value, Zone* zone)
: table_(size, default_value, zone) {}
T& operator[](Key op) {
DCHECK_LT(op.id(), table_.size());
return table_[op.id()];
}
const T& operator[](Key op) const {
DCHECK_LT(op.id(), table_.size());
return table_[op.id()];
}
private:
ZoneVector<T> table_;
};
template <typename T>
using GrowingBlockSidetable = GrowingSidetable<T, BlockIndex>;
template <typename T>
using FixedBlockSidetable = FixedSidetable<T, BlockIndex>;
} // namespace v8::internal::compiler::turboshaft
#endif // V8_COMPILER_TURBOSHAFT_SIDETABLE_H_
|
