| OLD | NEW |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 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 14 matching lines...) Expand all Loading... |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "v8.h" | 28 #include "v8.h" |
| 29 #include "regexp-macro-assembler.h" | 29 #include "regexp-macro-assembler.h" |
| 30 | 30 |
| 31 namespace v8 { namespace internal { | 31 namespace v8 { namespace internal { |
| 32 | 32 |
| 33 | 33 |
| 34 ByteArrayProvider::ByteArrayProvider(int initial_size) | 34 ByteArrayProvider::ByteArrayProvider(int initial_size) |
| 35 : byte_array_size_(initial_size), | 35 : byte_array_size_(initial_size), |
| 36 current_byte_array_(NULL), | 36 current_byte_array_(NULL), |
| 37 current_byte_array_free_offset_(initial_size) {} | 37 current_byte_array_free_offset_(initial_size) {} |
| 38 | 38 |
| 39 | 39 |
| 40 template <typename T> | 40 template <typename T> |
| 41 ArraySlice<T> ByteArrayProvider::GetBuffer(int size) { | 41 ArraySlice<T> ByteArrayProvider::GetBuffer(int size) { |
| 42 ASSERT(sze > 0); | 42 ASSERT(sze > 0); |
| 43 size_t elem_size = sizeof(T); | 43 size_t elem_size = sizeof(T); |
| 44 size_t byte_size = size * elem_size; | 44 size_t byte_size = size * elem_size; |
| 45 int free_offset = current_byte_array_free_offset_; | 45 int free_offset = current_byte_array_free_offset_; |
| 46 // align elements | 46 // align elements |
| 47 free_offset += elem_size - 1; | 47 free_offset += elem_size - 1; |
| 48 free_offset = free_offset - (free_offset % elem_size); | 48 free_offset = free_offset - (free_offset % elem_size); |
| 49 | 49 |
| 50 if (free_offset + byte_size > byte_array_size_) { | 50 if (free_offset + byte_size > byte_array_size_) { |
| 51 if (byte_size > (byte_array_size_ / 2)) { | 51 if (byte_size > (byte_array_size_ / 2)) { |
| 52 Handle<ByteArray> solo_buffer = Factory::NewByteArray(byte_size, TENURED); | 52 Handle<ByteArray> solo_buffer = Factory::NewByteArray(byte_size, TENURED); |
| 53 return ArraySlice<T>(solo_buffer, 0); | 53 return ArraySlice<T>(solo_buffer, 0); |
| 54 } | 54 } |
| 55 current_byte_array_ = Factory::NewByteArray(byte_array_size_, TENURED); | 55 current_byte_array_ = Factory::NewByteArray(byte_array_size_, TENURED); |
| 56 free_offset = 0; | 56 free_offset = 0; |
| 57 } | 57 } |
| 58 current_byte_array_free_offset_ = free_offset + size; | 58 current_byte_array_free_offset_ = free_offset + size; |
| 59 return ArraySlice<T>(current_byte_array_, free_offset); | 59 return ArraySlice<T>(current_byte_array_, free_offset); |
| 60 } | 60 } |
| 61 | |
| 62 }} | 61 }} |
| OLD | NEW |