-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathSnippets.cpp
70 lines (54 loc) · 1.54 KB
/
Snippets.cpp
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
/*
SESC: Super ESCalar simulator
Copyright (C) 2003 University of Illinois.
Contributed by Jose Renau
Milos Prvulovic
This file is part of SESC.
SESC 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, or (at your option) any later version.
SESC 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
SESC; see the file COPYING. If not, write to the Free Software Foundation, 59
Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "Snippets.h"
#include "nanassert.h"
#include <typeinfo>
short log2i(uint32_t n)
{
ulong m = 1;
ulong i = 0;
if (n==1)
return 0;
n= roundUpPower2(n);
//assume integer power of 2
I((n & (n - 1)) == 0);
while(m<n) {
i++;
m <<=1;
}
return i;
}
// this routine computes the smallest power of 2 greater than the
// parameter
uint32_t roundUpPower2(uint32_t x)
{
// efficient branchless code extracted from "Hacker's Delight" by
// Henry S. Warren, Jr.
x = x - 1;
x = x | (x >> 1);
x = x | (x >> 2);
x = x | (x >> 4);
x = x | (x >> 8);
x = x | (x >> 16);
return x + 1;
}
bool debacc = false;
void debugAccess()
{
debacc = true;
//int32_t j = rand();
}