| 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 250 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 303 buffer_[position_] = '\0'; | 304 buffer_[position_] = '\0'; |
| 304 // Make sure nobody managed to add a 0-character to the | 305 // Make sure nobody managed to add a 0-character to the |
| 305 // buffer while building the string. | 306 // buffer while building the string. |
| 306 ASSERT(strlen(buffer_.start()) == static_cast<size_t>(position_)); | 307 ASSERT(strlen(buffer_.start()) == static_cast<size_t>(position_)); |
| 307 position_ = -1; | 308 position_ = -1; |
| 308 ASSERT(is_finalized()); | 309 ASSERT(is_finalized()); |
| 309 return buffer_.start(); | 310 return buffer_.start(); |
| 310 } | 311 } |
| 311 | 312 |
| 312 } } // namespace v8::internal | 313 } } // namespace v8::internal |
| OLD | NEW |