2 * Copyright (c) 2001, 2003 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.
29 #ifndef __INTMATH_HH__
30 #define __INTMATH_HH__
34 #include "sim/host.hh"
36 // Returns the prime number one less than n.
39 // Determine if a number is prime
49 // Don't try every odd number to prove if it is a prime.
50 // Toggle between every 2nd and 4th number.
51 // (This is because every 6th odd number is divisible by 3.)
52 for (i = 5; i*i <= n; i += 6) {
53 if (((n % i) == 0 ) || ((n % (i + 2)) == 0) ) {
72 return n != 0 && LeastSigBit(n) == n;
82 if (x & 0xffff0000) { y += 16; x >>= 16; }
83 if (x & 0x0000ff00) { y += 8; x >>= 8; }
84 if (x & 0x000000f0) { y += 4; x >>= 4; }
85 if (x & 0x0000000c) { y += 2; x >>= 2; }
86 if (x & 0x00000002) { y += 1; }
98 if (x & ULL(0xffffffff00000000)) { y += 32; x >>= 32; }
99 if (x & ULL(0x00000000ffff0000)) { y += 16; x >>= 16; }
100 if (x & ULL(0x000000000000ff00)) { y += 8; x >>= 8; }
101 if (x & ULL(0x00000000000000f0)) { y += 4; x >>= 4; }
102 if (x & ULL(0x000000000000000c)) { y += 2; x >>= 2; }
103 if (x & ULL(0x0000000000000002)) { y += 1; }
112 return FloorLog2((uint32_t)x);
119 return FloorLog2((uint64_t)x);
129 return FloorLog2(n - (T)1) + 1;
136 return (T)1 << FloorLog2(n);
143 return (T)1 << CeilLog2(n);
150 return (a + b - 1) / b;
155 RoundUp(T val, T align)
158 return (val + mask) & ~mask;
163 RoundDown(T val, T align)
172 return c >= '0' && c <= '9' ||
173 c >= 'A' && c <= 'F' ||
174 c >= 'a' && c <= 'f';
180 return c >= '0' && c <= '7';
186 return c >= '0' && c <= '9';
192 if (c >= '0' && c <= '9')
195 if (c >= 'A' && c <= 'F')
196 return (c - 'A') + 10;
198 if (c >= 'a' && c <= 'f')
199 return (c - 'a') + 10;
204 #endif // __INTMATH_HH__