2 * Copyright (c) 2001, 2003-2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
31 #ifndef __INTMATH_HH__
32 #define __INTMATH_HH__
36 #include "sim/host.hh"
38 // Returns the prime number one less than n.
41 // Determine if a number is prime
51 // Don't try every odd number to prove if it is a prime.
52 // Toggle between every 2nd and 4th number.
53 // (This is because every 6th odd number is divisible by 3.)
54 for (i = 5; i*i <= n; i += 6) {
55 if (((n % i) == 0 ) || ((n % (i + 2)) == 0) ) {
74 return n != 0 && leastSigBit(n) == n;
84 if (x & 0xffff0000) { y += 16; x >>= 16; }
85 if (x & 0x0000ff00) { y += 8; x >>= 8; }
86 if (x & 0x000000f0) { y += 4; x >>= 4; }
87 if (x & 0x0000000c) { y += 2; x >>= 2; }
88 if (x & 0x00000002) { y += 1; }
94 floorLog2(unsigned long x)
100 #if defined(__LP64__)
101 if (x & ULL(0xffffffff00000000)) { y += 32; x >>= 32; }
103 if (x & 0xffff0000) { y += 16; x >>= 16; }
104 if (x & 0x0000ff00) { y += 8; x >>= 8; }
105 if (x & 0x000000f0) { y += 4; x >>= 4; }
106 if (x & 0x0000000c) { y += 2; x >>= 2; }
107 if (x & 0x00000002) { y += 1; }
113 floorLog2(unsigned long long x)
119 if (x & ULL(0xffffffff00000000)) { y += 32; x >>= 32; }
120 if (x & ULL(0x00000000ffff0000)) { y += 16; x >>= 16; }
121 if (x & ULL(0x000000000000ff00)) { y += 8; x >>= 8; }
122 if (x & ULL(0x00000000000000f0)) { y += 4; x >>= 4; }
123 if (x & ULL(0x000000000000000c)) { y += 2; x >>= 2; }
124 if (x & ULL(0x0000000000000002)) { y += 1; }
133 return floorLog2((unsigned)x);
140 return floorLog2((unsigned long)x);
144 floorLog2(long long x)
147 return floorLog2((unsigned long long)x);
157 return floorLog2(n - (T)1) + 1;
164 return (T)1 << floorLog2(n);
171 return (T)1 << ceilLog2(n);
178 return (a + b - 1) / b;
183 roundUp(T val, int align)
185 T mask = (T)align - 1;
186 return (val + mask) & ~mask;
191 roundDown(T val, int align)
193 T mask = (T)align - 1;
200 return (c >= '0' && c <= '9') ||
201 (c >= 'A' && c <= 'F') ||
202 (c >= 'a' && c <= 'f');
208 return c >= '0' && c <= '7';
214 return c >= '0' && c <= '9';
220 if (c >= '0' && c <= '9')
223 if (c >= 'A' && c <= 'F')
224 return (c - 'A') + 10;
226 if (c >= 'a' && c <= 'f')
227 return (c - 'a') + 10;
232 #endif // __INTMATH_HH__