/
addrRange.h
647 lines (587 loc) · 17.7 KB
/
addrRange.h
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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
/*
* See the dyninst/COPYRIGHT file for copyright information.
*
* We provide the Paradyn Tools (below described as "Paradyn")
* on an AS IS basis, and do not warrant its validity or performance.
* We reserve the right to update, modify, or discontinue this
* software at any time. We shall have no obligation to supply such
* updates or modifications or any other form of support to you.
*
* By your use of Paradyn, you understand and agree that we (or any
* other person or entity with proprietary rights in Paradyn) are
* under no obligation to provide either maintenance services,
* update services, notices of latent defects, or correction of
* defects for Paradyn.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef _addrRange_h_
#define _addrRange_h_
/*******************************************************/
/* Templated header file */
/*******************************************************/
#include <assert.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include "common/src/Types.h"
/** template class for addrRangeTree. The implementation is based on red black
* tree implementation for efficiency concerns and for getting sorted
* elements easier.
* There are two template types, K (key) and V (value).
*/
/* Note: this is a near copy of BPatch_Set. That class didn't do what I needed,
so... -- bernat, 10OCT03 */
typedef enum { TREE_RED, TREE_BLACK } color_t;
class addrRange {
public:
virtual Dyninst::Address get_address() const = 0;
virtual unsigned long get_size() const = 0;
virtual std::string get_name() const {
return std::string("UNNAMED");
}
virtual ~addrRange() {
}
};
/**
* T should inherit from addrRange
**/
template <class T>
class addrRangeTree {
/** tree implementation structure. Used to implement the RB tree */
typedef struct entry {
Dyninst::Address key;
T *value;
color_t color; /* color of the node */
struct entry* left; /* left child */
struct entry* right; /* right child */
struct entry* parent; /* parent of the node */
/** constructor for structure */
entry()
: key(0), value(NULL), color(TREE_BLACK),
left(NULL), right(NULL), parent(NULL)
{
}
/** constructor used for non-nil elements
* @param e nil entry
*/
entry(entry* e) //constructor with nil entry
: key(0), value(NULL), color(TREE_RED),
left(e), right(e), parent(NULL)
{
}
/** constructor
* @param d data element
* @param e nill entry
*/
entry(Dyninst::Address key_, T *value_, entry* e)
: key(key_), value(value_), color(TREE_RED), left(e),
right(e), parent(NULL)
{
}
/** constructor
* @param e the entry structure that will be copied
*/
entry(const entry& e) : key(e.key),value(e.value),color(e.color),
left(NULL),right(NULL),parent(NULL)
{
}
} entry;
/** pointer to define the nil element of the tree NULL is not used
* since some operations need sentinel nil which may have non-nil
* parent.
*/
entry* nil;
/** size of the tree */
int setSize;
/** pointer to the tree structure */
entry* setData;
// method that implements left rotation used by RB tree for balanced
// tree construction and keeps the RBtree properties.
void leftRotate(entry* pivot)
{
if(!pivot || (pivot == nil))
return;
entry* y = pivot->right;
if(y == nil)
return;
pivot->right = y->left;
if(y->left != nil)
y->left->parent = pivot;
y->parent = pivot->parent;
if(!pivot->parent) {
setData = y;
}
else if(pivot == pivot->parent->left)
pivot->parent->left = y;
else
pivot->parent->right = y;
y->left = pivot;
pivot->parent = y;
}
// method that implements right rotattion used by RB tree for balanced
// tree construction and keeps the RBtree properties.
void rightRotate(entry *pivot)
{
if(!pivot || (pivot == nil))
return;
entry* x = pivot->left;
if(x == nil)
return;
pivot->left = x->right;
if(x->right != nil)
x->right->parent = pivot;
x->parent = pivot->parent;
if(!pivot->parent) {
setData = x;
}
else if(pivot == pivot->parent->left)
pivot->parent->left = x;
else
pivot->parent->right = x;
x->right = pivot;
pivot->parent = x;
}
// method that modifies the tree structure after deletion for keeping
// the RBtree properties.
void deleteFixup(entry *x)
{
while((x != setData) &&
(x->color == TREE_BLACK))
{
if(x == x->parent->left){
entry* w = x->parent->right;
if(w->color == TREE_RED){
w->color = TREE_BLACK;
x->parent->color = TREE_RED;
leftRotate(x->parent);
w = x->parent->right;
}
if((w->left->color == TREE_BLACK) &&
(w->right->color == TREE_BLACK)){
w->color = TREE_RED;
x = x->parent;
}
else{
if(w->right->color == TREE_BLACK){
w->left->color = TREE_BLACK;
w->color = TREE_RED;
rightRotate(w);
w = x->parent->right;
}
w->color = x->parent->color;
x->parent->color = TREE_BLACK;
w->right->color = TREE_BLACK;
leftRotate(x->parent);
x = setData;
}
}
else{
entry* w = x->parent->left;
if(w->color == TREE_RED){
w->color = TREE_BLACK;
x->parent->color = TREE_RED;
rightRotate(x->parent);
w = x->parent->left;
}
if((w->right->color == TREE_BLACK) &&
(w->left->color == TREE_BLACK)){
w->color = TREE_RED;
x = x->parent;
}
else{
if(w->left->color == TREE_BLACK){
w->right->color = TREE_BLACK;
w->color = TREE_RED;
leftRotate(w);
w = x->parent->left;
}
w->color = x->parent->color;
x->parent->color = TREE_BLACK;
w->left->color = TREE_BLACK;
rightRotate(x->parent);
x = setData;
}
}
}
x->color = TREE_BLACK;
}
// insertion to a binary search tree. It returns the new element pointer
// that is inserted. If element is already there it returns NULL
entry* treeInsert(Dyninst::Address key, T *value)
{
entry* y = NULL;
entry* x = setData;
while(x != nil){
y = x;
if (key < x->key)
x = x->left;
else if(key > x->key)
x = x->right;
else
return NULL;
}
entry* z = new entry(key, value, nil);
z->parent = y;
if(!y) {
setData = z;
}
else {
if (key < y->key)
y->left = z;
else if (key > y->key)
y->right = z;
}
setSize++;
return z;
}
// finds the elemnts in the tree that will be replaced with the element
// being deleted in the deletion. That is the element with the largest
// smallest value than the element being deleted.
entry* treeSuccessor(entry *x) const
{
if(!x || (x == nil))
return NULL;
if(x->right != nil){
entry* z = x->right;
while(z->left != nil) z = z->left;
return z;
}
entry* y = x->parent;
while(y && (x == y->right)){
x = y;
y = y->parent;
}
return y;
}
// method that returns the entry pointer for the element that is searched
//for. If the entry is not found then it retuns NULL
entry* find_internal(Dyninst::Address element) const
{
entry* x = setData;
while(x != nil){
if (element < x->key) {
x = x->left;
}
else if (element > x->key) {
x = x->right;
}
else
return x;
}
return NULL;
}
// infix traverse of the RB tree. It traverses the tree in ascending order
void traverse(T **all, entry *node, int &n) const
{
if(node == nil)
return;
if(node->left != nil)
traverse(all,node->left,n);
if(all)
all[n++] = node->value;
if(node->right != nil)
traverse(all,node->right,n);
}
// Vector version of above
// infix traverse of the RB tree. It traverses the tree in ascending order
void traverse(std::vector<T *> &all, entry*node) const
{
if(node == nil)
return;
if(node->left != nil)
traverse(all,node->left);
all.push_back(node->value);
if(node->right != nil)
traverse(all,node->right);
}
// deletes the tree structure for deconstructor.
void destroy(entry *node)
{
if(!node || (node == nil))
return;
if(node->left != nil)
destroy(node->left);
if(node->right != nil)
destroy(node->right);
delete node;
}
/** copy constructor */
addrRangeTree(const addrRangeTree &/* y */)
{
}
// Similar to precessor, but returns an entry
bool precessor_internal(Dyninst::Address key, entry * &value) const
{
entry *x = setData;
entry *last = nil;
while (x != nil) {
assert(x != NULL);
if (x->key == key) {
value = x;
return true;
}
else if (key < x->key) {
x = x->left;
}
else { // key > x->key
last = x;
x = x->right;
}
}
if (x == nil) {
// Ran out of tree to search... get the parent
assert(last != NULL);
if (last != nil) {
value = last;
return true;
}
else return false;
}
// Should never hit here
assert(0);
return false;
}
// Similar to successor, but returns an entry
bool successor_internal(Dyninst::Address key, entry * &value) const
{
entry *x = setData;
entry *last = nil;
while (x != nil) {
if (x->key == key) {
value = x;
return true;
}
else if (key > x->key) {
x = x->right;
}
else { // key < x->key
last = x;
x = x->left;
}
}
if (x == nil) {
// Ran out of tree to search... get the parent
if (last != nil) {
value = last;
return true;
}
else return false;
}
// Should never reach this point
assert(0);
return false;
}
public:
/** constructor. The default comparison structure is used */
addrRangeTree() :
setSize(0)
{
nil = new entry;
setData = nil;
}
/** destructor which deletes all tree structure and allocated entries */
virtual ~addrRangeTree()
{
destroy(setData);
delete nil;
}
/** returns the cardinality of the tree , number of elements */
int size() const
{
return setSize;
}
/** returns true if tree is empty */
bool empty() const
{
return (setData == nil);
}
/** inserts the element in the tree
* @param 1 element that will be inserted
*/
void insert(T *value)
{
entry* x = treeInsert(value->get_address(), value);
if(!x) {
// We're done.
return;
}
x->color = TREE_RED;
while((x != setData) && (x->parent->color == TREE_RED)){
if(x->parent == x->parent->parent->left){
entry* y = x->parent->parent->right;
if(y->color == TREE_RED){
x->parent->color = TREE_BLACK;
y->color = TREE_BLACK;
x->parent->parent->color = TREE_RED;
x = x->parent->parent;
}
else{
if(x == x->parent->right){
x = x->parent;
leftRotate(x);
}
x->parent->color = TREE_BLACK;
x->parent->parent->color = TREE_RED;
rightRotate(x->parent->parent);
}
}
else{
entry* y = x->parent->parent->left;
if(y->color == TREE_RED){
x->parent->color = TREE_BLACK;
y->color = TREE_BLACK;
x->parent->parent->color = TREE_RED;
x = x->parent->parent;
}
else{
if(x == x->parent->left){
x = x->parent;
rightRotate(x);
}
x->parent->color = TREE_BLACK;
x->parent->parent->color = TREE_RED;
leftRotate(x->parent->parent);
}
}
}
setData->color = TREE_BLACK;
}
/** removes the element in the tree
* @param 1 element that will be removed
*/
void remove(Dyninst::Address key)
{
entry* z = find_internal(key);
if(!z)
return;
if (z->key != key)
return;
entry* y=((z->left == nil)||(z->right == nil)) ? z : treeSuccessor(z);
entry* x=(y->left != nil) ? y->left : y->right;
x->parent = y->parent;
if(!y->parent) {
setData = x;
}
else if(y == y->parent->left)
y->parent->left = x;
else
y->parent->right = x;
if(y != z) {
z->value = y->value;
z->key = y->key;
}
if(y->color == TREE_BLACK)
deleteFixup(x);
setSize--;
delete y;
}
/** returns true if the argument is member of the addrRangeTree
* @param e the element that will be searched for
*/
virtual bool find(Dyninst::Address key, T *& value) const
{
value = NULL;
if (!precessor(key, value))
return false;
// Check to see if the range works
if (!value->get_size()) {
if(key > value->get_address())
return false;
}
else if(key >= (value->get_address() + value->get_size())) {
return false;
}
// We can also underflow
if (key < value->get_address())
return false;
return true;
}
/** Fills in the vector with all address ranges that overlap
* with the address range defined by (start, end]
*/
virtual bool find(Dyninst::Address start, Dyninst::Address end,
std::vector<T *> &ranges) const
{
entry *cur = nil;
bool result = precessor_internal(start, cur);
if (!result || cur == nil)
result = successor_internal(start, cur);
if (!result || cur == nil)
return false;
assert(cur);
if (cur->key + cur->value->get_size() < start)
cur = treeSuccessor(cur);
while (cur != NULL && cur != nil && cur->key < end)
{
ranges.push_back(cur->value);
cur = treeSuccessor(cur);
}
return (ranges.size() != 0);
}
/** Returns the largest value less than or equal to the
* key given
*/
virtual bool precessor(Dyninst::Address key, T *& value) const
{
entry *val;
bool result = precessor_internal(key, val);
if (!result)
return false;
value = val->value;
return true;
}
/** Returns the smallest value greater than or equal to the
* key given
*/
virtual bool successor(Dyninst::Address key, T *& value) const
{
entry *val;
bool result = successor_internal(key, val);
if (!result)
return false;
value = val->value;
return true;
}
/** fill an buffer array with the sorted
* elements of the addrRangeTree in ascending order according to comparison function
* if the addrRangeTree is empty it retuns NULL, other wise it returns
* the input argument.
*/
T ** elements(T ** buffer) const
{
if(setData == nil) return NULL;
if(!buffer) return NULL;
int tmp = 0;
traverse(buffer,setData,tmp);
return buffer;
}
// And vector-style
bool elements(std::vector<T *> &buffer) const
{
if(setData == nil) return false;
traverse(buffer,setData);
return true;
}
// Remove all entries in the tree
void clear()
{
if (setData == nil) return;
destroy(setData);
setData = nil;
setSize = 0;
}
};
#endif /* _addrRange_h_ */