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 |
(...skipping 11 matching lines...) Expand all Loading... |
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" | 29 #include "top.h" |
30 #include "regexp-stack.h" | 30 #include "regexp-stack.h" |
31 | 31 |
32 namespace v8 { namespace internal { | 32 namespace v8 { |
| 33 namespace internal { |
33 | 34 |
34 RegExpStack::RegExpStack() { | 35 RegExpStack::RegExpStack() { |
35 // Initialize, if not already initialized. | 36 // Initialize, if not already initialized. |
36 RegExpStack::EnsureCapacity(0); | 37 RegExpStack::EnsureCapacity(0); |
37 } | 38 } |
38 | 39 |
39 | 40 |
40 RegExpStack::~RegExpStack() { | 41 RegExpStack::~RegExpStack() { |
41 // Reset the buffer if it has grown. | 42 // Reset the buffer if it has grown. |
42 RegExpStack::Reset(); | 43 RegExpStack::Reset(); |
(...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
85 thread_local_.memory_size_ = size; | 86 thread_local_.memory_size_ = size; |
86 thread_local_.limit_ = new_memory + kStackLimitSlack * kPointerSize; | 87 thread_local_.limit_ = new_memory + kStackLimitSlack * kPointerSize; |
87 } | 88 } |
88 return thread_local_.memory_ + thread_local_.memory_size_; | 89 return thread_local_.memory_ + thread_local_.memory_size_; |
89 } | 90 } |
90 | 91 |
91 | 92 |
92 RegExpStack::ThreadLocal RegExpStack::thread_local_; | 93 RegExpStack::ThreadLocal RegExpStack::thread_local_; |
93 | 94 |
94 }} // namespace v8::internal | 95 }} // namespace v8::internal |
OLD | NEW |