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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
/*
* Copyright (c) 2016-2017, Intel Corporation
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of Intel Corporation nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef ROSE_BUILD_ENGINE_BLOB_H
#define ROSE_BUILD_ENGINE_BLOB_H
#include "rose_internal.h"
#include "ue2common.h"
#include "util/alloc.h"
#include "util/bytecode_ptr.h"
#include "util/charreach.h"
#include "util/container.h"
#include "util/hash.h"
#include "util/multibit_build.h"
#include "util/noncopyable.h"
#include "util/verify_types.h"
#include "util/unordered.h"
#include <type_traits>
#include <vector>
namespace ue2 {
class RoseEngineBlob;
struct lookaround_info : noncopyable {
u32 get_offset_of(const std::vector<std::vector<CharReach>> &look,
RoseEngineBlob &blob);
u32 get_offset_of(const std::vector<CharReach> &reach,
RoseEngineBlob &blob);
u32 get_offset_of(const std::vector<s8> &look, RoseEngineBlob &blob);
private:
using Path = std::vector<CharReach>;
ue2_unordered_map<std::vector<Path>, u32> multi_cache;
ue2_unordered_map<std::vector<s8>, u32> lcache;
ue2_unordered_map<Path, u32> rcache;
};
class RoseEngineBlob : noncopyable {
public:
/** \brief Base offset of engine_blob in the Rose engine bytecode. */
static constexpr u32 base_offset = ROUNDUP_CL(sizeof(RoseEngine));
bool empty() const {
return blob.empty();
}
size_t size() const {
return blob.size();
}
u32 add(const void *a, const size_t len, const size_t align) {
pad(align);
size_t rv = base_offset + blob.size();
assert(rv >= base_offset);
DEBUG_PRINTF("write %zu bytes at offset %zu\n", len, rv);
assert(ISALIGNED_N(blob.size(), align));
blob.resize(blob.size() + len);
memcpy(&blob.back() - len + 1, a, len);
return verify_u32(rv);
}
template<typename T>
u32 add(const bytecode_ptr<T> &a) {
return add(a.get(), a.size(), a.align());
}
template<typename T>
u32 add(const T &a) {
static_assert(std::is_pod<T>::value, "should be pod");
return add(&a, sizeof(a), alignof(T));
}
template<typename T>
u32 add(const T &a, const size_t len) {
static_assert(std::is_pod<T>::value, "should be pod");
return add(&a, len, alignof(T));
}
template<typename Iter>
u32 add(Iter b, const Iter &e) {
using value_type = typename std::iterator_traits<Iter>::value_type;
static_assert(std::is_pod<value_type>::value, "should be pod");
if (b == e) {
return 0;
}
u32 offset = add(*b);
for (++b; b != e; ++b) {
add(*b);
}
return offset;
}
template<typename Range>
u32 add_range(const Range &range) {
return add(begin(range), end(range));
}
u32 add_iterator(const std::vector<mmbit_sparse_iter> &iter) {
auto cache_it = cached_iters.find(iter);
if (cache_it != cached_iters.end()) {
u32 offset = cache_it->second;
DEBUG_PRINTF("cache hit for iter at %u\n", offset);
return offset;
}
u32 offset = add(iter.begin(), iter.end());
cached_iters.emplace(iter, offset);
return offset;
}
void write_bytes(RoseEngine *engine) {
copy_bytes((char *)engine + base_offset, blob);
}
lookaround_info lookaround_cache;
private:
void pad(size_t align) {
assert(ISALIGNED_N(base_offset, align));
size_t s = blob.size();
if (ISALIGNED_N(s, align)) {
return;
}
blob.resize(s + align - s % align);
}
/** \brief Cache of previously-written sparse iterators. */
ue2_unordered_map<std::vector<mmbit_sparse_iter>, u32> cached_iters;
/**
* \brief Contents of the Rose bytecode immediately following the
* RoseEngine.
*/
std::vector<char, AlignedAllocator<char, 64>> blob;
};
} // namespace ue2
#endif // ROSE_BUILD_ENGINE_BLOB_H
|
