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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
// -*- Mode: C++ -*-
namespace regtest {
class Mutator {
public:
virtual ~Mutator() { }
virtual void Mutate(SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand) const = 0;
};
class Change {
public:
enum Kind {
MODIFY = 1,
ADD = 2,
MOVE = 3,
DELETE = 4,
};
// Constructor for modify, add, delete.
Change(Kind kind, xoff_t size, xoff_t addr1)
: kind(kind),
size(size),
addr1(addr1) {
CHECK_NE(kind, MOVE);
}
// Constructor for move
Change(Kind kind, xoff_t size, xoff_t addr1, xoff_t addr2)
: kind(kind),
size(size),
addr1(addr1) {
CHECK_EQ(kind, MOVE);
}
Kind kind;
xoff_t size;
xoff_t addr1;
xoff_t addr2;
};
typedef list<Change> ChangeList;
class ChangeListMutator : public Mutator {
public:
ChangeListMutator(const ChangeList &cl)
: cl_(cl) { }
ChangeListMutator() { }
void Mutate(SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand) const;
static void Mutate(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand);
static void AddChange(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand);
static void ModifyChange(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand);
static void DeleteChange(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand);
static void MoveChange(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand);
ChangeList* Changes() {
return &cl_;
}
const ChangeList* Changes() const {
return &cl_;
}
private:
ChangeList cl_;
};
void ChangeListMutator::Mutate(SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand) const {
// The speed of processing gigabytes of data is so slow compared with
// these table-copy operations, no attempt to make this fast.
SegmentMap tmp;
for (ChangeList::const_iterator iter(cl_.begin()); iter != cl_.end(); ++iter) {
const Change &ch = *iter;
Mutate(ch, &tmp, source_table, rand);
tmp.swap(*table);
source_table = table;
}
}
void ChangeListMutator::Mutate(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand) {
switch (ch.kind) {
case Change::ADD:
AddChange(ch, table, source_table, rand);
break;
case Change::MODIFY:
ModifyChange(ch, table, source_table, rand);
break;
case Change::DELETE:
//DeleteChange(ch, table, source_table, rand);
break;
case Change::MOVE:
//MoveChange(ch, table, source_table, rand);
break;
}
}
void ChangeListMutator::ModifyChange(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand) {
xoff_t m_start = ch.addr1;
xoff_t m_end = m_start + ch.size;
for (SegmentMap::const_iterator iter(source_table->begin());
iter != source_table->end();
++iter) {
const Segment &seg = iter->second;
xoff_t i_start = iter->first;
xoff_t i_end = i_start + seg.length;
if (i_end <= m_start || i_start >= m_end) {
table->insert(table->end(), make_pair(i_start, seg));
continue;
}
if (i_start < m_start) {
Segment before(seg.seed, m_start - i_start, seg.seed_offset);
table->insert(table->end(), make_pair(i_start, before));
}
// Insert the entire segment, even though it may extend into later
// segments. This condition avoids inserting it during later
// segments.
if (m_start >= i_start) {
Segment part(rand->Rand32(), m_end - m_start);
table->insert(table->end(), make_pair(m_start, part));
}
if (i_end > m_end) {
Segment after(seg.seed, i_end - m_end, seg.seed_offset + (m_end - i_start));
table->insert(table->end(), make_pair(m_end, after));
}
}
}
void ChangeListMutator::AddChange(const Change &ch,
SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand) {
xoff_t m_start = ch.addr1;
for (SegmentMap::const_iterator iter(source_table->begin());
iter != source_table->end();
++iter) {
const Segment &seg = iter->second;
xoff_t i_start = iter->first;
xoff_t i_end = i_start + seg.length;
if (i_end <= m_start) {
table->insert(table->end(), make_pair(i_start, seg));
continue;
}
if (i_start > m_start) {
table->insert(table->end(), make_pair(i_start + ch.size, seg));
continue;
}
if (i_start < m_start) {
Segment before(seg.seed, m_start - i_start, seg.seed_offset);
table->insert(table->end(), make_pair(i_start, before));
}
Segment addseg(rand->Rand32(), ch.size);
table->insert(table->end(), make_pair(m_start, addseg));
if (m_start < i_end) {
Segment after(seg.seed, i_end - m_start,
seg.seed_offset + (m_start - i_start));
table->insert(table->end(), make_pair(m_start + ch.size, after));
}
}
}
class Modify1stByte : public Mutator {
public:
void Mutate(SegmentMap *table,
const SegmentMap *source_table,
MTRandom *rand) const {
ChangeListMutator::Mutate(Change(Change::MODIFY, 1, 0),
table, source_table, rand);
}
};
} // namespace regtest
|
