OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 22 matching lines...) Expand all Loading... |
33 | 33 |
34 #include "sys/stat.h" | 34 #include "sys/stat.h" |
35 | 35 |
36 namespace v8 { | 36 namespace v8 { |
37 namespace internal { | 37 namespace internal { |
38 | 38 |
39 | 39 |
40 // Implementation is from "Hacker's Delight" by Henry S. Warren, Jr., | 40 // Implementation is from "Hacker's Delight" by Henry S. Warren, Jr., |
41 // figure 3-3, page 48, where the function is called clp2. | 41 // figure 3-3, page 48, where the function is called clp2. |
42 uint32_t RoundUpToPowerOf2(uint32_t x) { | 42 uint32_t RoundUpToPowerOf2(uint32_t x) { |
| 43 ASSERT(x <= 0x80000000u); |
43 x = x - 1; | 44 x = x - 1; |
44 x = x | (x >> 1); | 45 x = x | (x >> 1); |
45 x = x | (x >> 2); | 46 x = x | (x >> 2); |
46 x = x | (x >> 4); | 47 x = x | (x >> 4); |
47 x = x | (x >> 8); | 48 x = x | (x >> 8); |
48 x = x | (x >> 16); | 49 x = x | (x >> 16); |
49 return x + 1; | 50 return x + 1; |
50 } | 51 } |
51 | 52 |
52 | 53 |
(...skipping 259 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
312 | 313 |
313 int TenToThe(int exponent) { | 314 int TenToThe(int exponent) { |
314 ASSERT(exponent <= 9); | 315 ASSERT(exponent <= 9); |
315 ASSERT(exponent >= 1); | 316 ASSERT(exponent >= 1); |
316 int answer = 10; | 317 int answer = 10; |
317 for (int i = 1; i < exponent; i++) answer *= 10; | 318 for (int i = 1; i < exponent; i++) answer *= 10; |
318 return answer; | 319 return answer; |
319 } | 320 } |
320 | 321 |
321 } } // namespace v8::internal | 322 } } // namespace v8::internal |
OLD | NEW |