ager@chromium.org | 3291210 | 2009-01-16 10:38:43 +0000 | [diff] [blame] | 1 | // Copyright 2009 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 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. |
| 27 | |
| 28 | #include "v8.h" |
| 29 | #include "top.h" |
| 30 | #include "regexp-stack.h" |
| 31 | |
| 32 | namespace v8 { namespace internal { |
| 33 | |
| 34 | RegExpStack::RegExpStack() { |
| 35 | // Initialize, if not already initialized. |
| 36 | RegExpStack::EnsureCapacity(0); |
| 37 | } |
| 38 | |
| 39 | |
| 40 | RegExpStack::~RegExpStack() { |
| 41 | // Reset the buffer if it has grown. |
| 42 | RegExpStack::Reset(); |
| 43 | } |
| 44 | |
| 45 | |
| 46 | char* RegExpStack::ArchiveStack(char* to) { |
| 47 | size_t size = sizeof(thread_local_); |
| 48 | memcpy(reinterpret_cast<void*>(to), |
| 49 | &thread_local_, |
| 50 | size); |
| 51 | thread_local_ = ThreadLocal(); |
| 52 | return to + size; |
| 53 | } |
| 54 | |
| 55 | |
| 56 | char* RegExpStack::RestoreStack(char* from) { |
| 57 | size_t size = sizeof(thread_local_); |
| 58 | memcpy(&thread_local_, reinterpret_cast<void*>(from), size); |
| 59 | return from + size; |
| 60 | } |
| 61 | |
| 62 | |
| 63 | void RegExpStack::Reset() { |
| 64 | if (thread_local_.memory_size_ > kMinimumStackSize) { |
| 65 | DeleteArray(thread_local_.memory_); |
| 66 | thread_local_ = ThreadLocal(); |
| 67 | } |
| 68 | } |
| 69 | |
| 70 | |
| 71 | Address RegExpStack::EnsureCapacity(size_t size) { |
| 72 | if (size > kMaximumStackSize) return NULL; |
| 73 | if (size < kMinimumStackSize) size = kMinimumStackSize; |
| 74 | if (thread_local_.memory_size_ < size) { |
| 75 | Address new_memory = NewArray<byte>(size); |
| 76 | if (thread_local_.memory_size_ > 0) { |
| 77 | // Copy original memory into top of new memory. |
| 78 | memcpy(reinterpret_cast<void*>( |
| 79 | new_memory + size - thread_local_.memory_size_), |
| 80 | reinterpret_cast<void*>(thread_local_.memory_), |
| 81 | thread_local_.memory_size_); |
| 82 | DeleteArray(thread_local_.memory_); |
| 83 | } |
| 84 | thread_local_.memory_ = new_memory; |
| 85 | thread_local_.memory_size_ = size; |
| 86 | thread_local_.limit_ = new_memory + kStackLimitSlack * kPointerSize; |
| 87 | } |
| 88 | return thread_local_.memory_ + thread_local_.memory_size_; |
| 89 | } |
| 90 | |
| 91 | |
| 92 | RegExpStack::ThreadLocal RegExpStack::thread_local_; |
| 93 | |
| 94 | }} // namespace v8::internal |