blob: 5208348a0e3b5305a030bfd37f5e557441428a33 (
plain)
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
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef jit_FixedList_h
#define jit_FixedList_h
#include "mozilla/Assertions.h"
#include "mozilla/Attributes.h"
#include "mozilla/Likely.h"
#include <stddef.h>
#include "jit/JitAllocPolicy.h"
#include "js/Utility.h"
namespace js {
namespace jit {
// List of a fixed length, but the length is unknown until runtime.
template <typename T>
class FixedList {
T* list_;
size_t length_;
private:
FixedList(const FixedList&); // no copy definition.
void operator=(const FixedList*); // no assignment definition.
public:
FixedList() : list_(nullptr), length_(0) {}
// Dynamic memory allocation requires the ability to report failure.
[[nodiscard]] bool init(TempAllocator& alloc, size_t length) {
if (length == 0) {
return true;
}
list_ = alloc.allocateArray<T>(length);
if (!list_) {
return false;
}
length_ = length;
return true;
}
size_t empty() const { return length_ == 0; }
size_t length() const { return length_; }
void shrink(size_t num) {
MOZ_ASSERT(num < length_);
length_ -= num;
}
[[nodiscard]] bool growBy(TempAllocator& alloc, size_t num) {
size_t newlength = length_ + num;
if (newlength < length_) {
return false;
}
size_t bytes;
if (MOZ_UNLIKELY(!CalculateAllocSize<T>(newlength, &bytes))) {
return false;
}
T* list = (T*)alloc.allocate(bytes);
if (MOZ_UNLIKELY(!list)) {
return false;
}
for (size_t i = 0; i < length_; i++) {
list[i] = list_[i];
}
length_ += num;
list_ = list;
return true;
}
T& operator[](size_t index) {
MOZ_ASSERT(index < length_);
return list_[index];
}
const T& operator[](size_t index) const {
MOZ_ASSERT(index < length_);
return list_[index];
}
T* data() { return list_; }
T* begin() { return list_; }
T* end() { return list_ + length_; }
};
} // namespace jit
} // namespace js
#endif /* jit_FixedList_h */
|
