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
|
/*
* MONA
* Copyright (C) 1997-2013 Aarhus University.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Suite 500, Boston, MA 02110-1335,
* USA.
*/
#include <stdlib.h>
#include "offsets.h"
#include <time.h>
/*#warning USING RANDOM ORDERING*/
void
Offsets::insert()
{
offsetMap.push_back(offsetMap.size());
max_offset = offsetMap.size();
}
void
Offsets::reorder()
{
////// reorder offsets using BDD heuristics ///////
/*
#warning USING RANDOM ORDERING
///////////// test /////////
srandom(time(0));
for (unsigned i=0; i<offsetMap.size(); i++) {
unsigned j = ((unsigned) random()) % offsetMap.size();
unsigned t = offsetMap.get(j);
offsetMap.set(j, offsetMap.get(i));
offsetMap.set(i, t);
}
////////////////////////////
*/
max_offset = offsetMap.size();
}
|
