OLD | NEW |
1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 |
11 // with the distribution. | 11 // with the distribution. |
12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
15 // | 15 // |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 "top.h" | |
30 #include "regexp-stack.h" | 29 #include "regexp-stack.h" |
31 | 30 |
32 namespace v8 { | 31 namespace v8 { |
33 namespace internal { | 32 namespace internal { |
34 | 33 |
35 RegExpStack::RegExpStack() { | 34 RegExpStackScope::RegExpStackScope(Isolate* isolate) |
| 35 : regexp_stack_(isolate->regexp_stack()) { |
36 // Initialize, if not already initialized. | 36 // Initialize, if not already initialized. |
37 RegExpStack::EnsureCapacity(0); | 37 regexp_stack_->EnsureCapacity(0); |
| 38 } |
| 39 |
| 40 |
| 41 RegExpStackScope::~RegExpStackScope() { |
| 42 ASSERT(Isolate::Current() == regexp_stack_->isolate_); |
| 43 // Reset the buffer if it has grown. |
| 44 regexp_stack_->Reset(); |
| 45 } |
| 46 |
| 47 |
| 48 RegExpStack::RegExpStack() |
| 49 : isolate_(NULL) { |
38 } | 50 } |
39 | 51 |
40 | 52 |
41 RegExpStack::~RegExpStack() { | 53 RegExpStack::~RegExpStack() { |
42 // Reset the buffer if it has grown. | |
43 RegExpStack::Reset(); | |
44 } | 54 } |
45 | 55 |
46 | 56 |
47 char* RegExpStack::ArchiveStack(char* to) { | 57 char* RegExpStack::ArchiveStack(char* to) { |
48 size_t size = sizeof(thread_local_); | 58 size_t size = sizeof(thread_local_); |
49 memcpy(reinterpret_cast<void*>(to), | 59 memcpy(reinterpret_cast<void*>(to), |
50 &thread_local_, | 60 &thread_local_, |
51 size); | 61 size); |
52 thread_local_ = ThreadLocal(); | 62 thread_local_ = ThreadLocal(); |
53 return to + size; | 63 return to + size; |
54 } | 64 } |
55 | 65 |
56 | 66 |
57 char* RegExpStack::RestoreStack(char* from) { | 67 char* RegExpStack::RestoreStack(char* from) { |
58 size_t size = sizeof(thread_local_); | 68 size_t size = sizeof(thread_local_); |
59 memcpy(&thread_local_, reinterpret_cast<void*>(from), size); | 69 memcpy(&thread_local_, reinterpret_cast<void*>(from), size); |
60 return from + size; | 70 return from + size; |
61 } | 71 } |
62 | 72 |
63 | 73 |
64 void RegExpStack::Reset() { | 74 void RegExpStack::Reset() { |
65 if (thread_local_.memory_size_ > kMinimumStackSize) { | 75 if (thread_local_.memory_size_ > kMinimumStackSize) { |
66 DeleteArray(thread_local_.memory_); | 76 DeleteArray(thread_local_.memory_); |
67 thread_local_ = ThreadLocal(); | 77 thread_local_ = ThreadLocal(); |
68 } | 78 } |
69 } | 79 } |
70 | 80 |
71 | 81 |
72 void RegExpStack::ThreadLocal::Free() { | 82 void RegExpStack::ThreadLocal::Free() { |
73 if (thread_local_.memory_size_ > 0) { | 83 if (memory_size_ > 0) { |
74 DeleteArray(thread_local_.memory_); | 84 DeleteArray(memory_); |
75 thread_local_ = ThreadLocal(); | 85 Clear(); |
76 } | 86 } |
77 } | 87 } |
78 | 88 |
79 | 89 |
80 Address RegExpStack::EnsureCapacity(size_t size) { | 90 Address RegExpStack::EnsureCapacity(size_t size) { |
81 if (size > kMaximumStackSize) return NULL; | 91 if (size > kMaximumStackSize) return NULL; |
82 if (size < kMinimumStackSize) size = kMinimumStackSize; | 92 if (size < kMinimumStackSize) size = kMinimumStackSize; |
83 if (thread_local_.memory_size_ < size) { | 93 if (thread_local_.memory_size_ < size) { |
84 Address new_memory = NewArray<byte>(static_cast<int>(size)); | 94 Address new_memory = NewArray<byte>(static_cast<int>(size)); |
85 if (thread_local_.memory_size_ > 0) { | 95 if (thread_local_.memory_size_ > 0) { |
86 // Copy original memory into top of new memory. | 96 // Copy original memory into top of new memory. |
87 memcpy(reinterpret_cast<void*>( | 97 memcpy(reinterpret_cast<void*>( |
88 new_memory + size - thread_local_.memory_size_), | 98 new_memory + size - thread_local_.memory_size_), |
89 reinterpret_cast<void*>(thread_local_.memory_), | 99 reinterpret_cast<void*>(thread_local_.memory_), |
90 thread_local_.memory_size_); | 100 thread_local_.memory_size_); |
91 DeleteArray(thread_local_.memory_); | 101 DeleteArray(thread_local_.memory_); |
92 } | 102 } |
93 thread_local_.memory_ = new_memory; | 103 thread_local_.memory_ = new_memory; |
94 thread_local_.memory_size_ = size; | 104 thread_local_.memory_size_ = size; |
95 thread_local_.limit_ = new_memory + kStackLimitSlack * kPointerSize; | 105 thread_local_.limit_ = new_memory + kStackLimitSlack * kPointerSize; |
96 } | 106 } |
97 return thread_local_.memory_ + thread_local_.memory_size_; | 107 return thread_local_.memory_ + thread_local_.memory_size_; |
98 } | 108 } |
99 | 109 |
100 | 110 |
101 RegExpStack::ThreadLocal RegExpStack::thread_local_; | |
102 | |
103 }} // namespace v8::internal | 111 }} // namespace v8::internal |
OLD | NEW |