2009-01-12 13:05:23 +00:00
|
|
|
// Copyright 2009 the V8 project authors. All rights reserved.
|
2014-04-29 06:42:26 +00:00
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2014-06-03 08:12:43 +00:00
|
|
|
#include "src/v8.h"
|
2014-06-20 08:40:11 +00:00
|
|
|
|
2014-06-03 08:12:43 +00:00
|
|
|
#include "src/regexp-stack.h"
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2009-05-25 10:05:56 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2011-03-18 20:35:07 +00:00
|
|
|
RegExpStackScope::RegExpStackScope(Isolate* isolate)
|
|
|
|
: regexp_stack_(isolate->regexp_stack()) {
|
2009-01-12 13:05:23 +00:00
|
|
|
// Initialize, if not already initialized.
|
2011-03-18 20:35:07 +00:00
|
|
|
regexp_stack_->EnsureCapacity(0);
|
2011-03-18 18:49:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-03-18 20:35:07 +00:00
|
|
|
RegExpStackScope::~RegExpStackScope() {
|
2011-03-18 19:41:05 +00:00
|
|
|
// Reset the buffer if it has grown.
|
2011-03-18 20:35:07 +00:00
|
|
|
regexp_stack_->Reset();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
RegExpStack::RegExpStack()
|
|
|
|
: isolate_(NULL) {
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
RegExpStack::~RegExpStack() {
|
2012-10-29 11:45:57 +00:00
|
|
|
thread_local_.Free();
|
2009-01-12 13:05:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
char* RegExpStack::ArchiveStack(char* to) {
|
|
|
|
size_t size = sizeof(thread_local_);
|
2014-05-27 07:57:22 +00:00
|
|
|
MemCopy(reinterpret_cast<void*>(to), &thread_local_, size);
|
2009-01-12 13:05:23 +00:00
|
|
|
thread_local_ = ThreadLocal();
|
|
|
|
return to + size;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
char* RegExpStack::RestoreStack(char* from) {
|
|
|
|
size_t size = sizeof(thread_local_);
|
2014-05-27 07:57:22 +00:00
|
|
|
MemCopy(&thread_local_, reinterpret_cast<void*>(from), size);
|
2009-01-12 13:05:23 +00:00
|
|
|
return from + size;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void RegExpStack::Reset() {
|
2012-10-29 11:45:57 +00:00
|
|
|
if (thread_local_.memory_size_ > kMinimumStackSize) {
|
2009-01-12 13:05:23 +00:00
|
|
|
DeleteArray(thread_local_.memory_);
|
|
|
|
thread_local_ = ThreadLocal();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-09-28 12:25:21 +00:00
|
|
|
void RegExpStack::ThreadLocal::Free() {
|
2011-03-18 20:35:07 +00:00
|
|
|
if (memory_size_ > 0) {
|
|
|
|
DeleteArray(memory_);
|
|
|
|
Clear();
|
2009-09-28 12:25:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-01-12 13:05:23 +00:00
|
|
|
Address RegExpStack::EnsureCapacity(size_t size) {
|
|
|
|
if (size > kMaximumStackSize) return NULL;
|
|
|
|
if (size < kMinimumStackSize) size = kMinimumStackSize;
|
|
|
|
if (thread_local_.memory_size_ < size) {
|
2009-11-11 09:50:06 +00:00
|
|
|
Address new_memory = NewArray<byte>(static_cast<int>(size));
|
2009-01-12 13:05:23 +00:00
|
|
|
if (thread_local_.memory_size_ > 0) {
|
|
|
|
// Copy original memory into top of new memory.
|
2014-05-27 07:57:22 +00:00
|
|
|
MemCopy(reinterpret_cast<void*>(new_memory + size -
|
|
|
|
thread_local_.memory_size_),
|
|
|
|
reinterpret_cast<void*>(thread_local_.memory_),
|
|
|
|
thread_local_.memory_size_);
|
2009-01-12 13:05:23 +00:00
|
|
|
DeleteArray(thread_local_.memory_);
|
|
|
|
}
|
|
|
|
thread_local_.memory_ = new_memory;
|
|
|
|
thread_local_.memory_size_ = size;
|
|
|
|
thread_local_.limit_ = new_memory + kStackLimitSlack * kPointerSize;
|
|
|
|
}
|
|
|
|
return thread_local_.memory_ + thread_local_.memory_size_;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}} // namespace v8::internal
|