2012-04-17 07:16:19 +00:00
|
|
|
// Copyright 2012 the V8 project authors. All rights reserved.
|
2008-07-03 15:10:15 +00:00
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * Redistributions in binary form must reproduce the above
|
|
|
|
// copyright notice, this list of conditions and the following
|
|
|
|
// disclaimer in the documentation and/or other materials provided
|
|
|
|
// with the distribution.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
#include "v8.h"
|
|
|
|
|
2014-04-16 13:28:11 +00:00
|
|
|
#include "handles.h"
|
2008-07-03 15:10:15 +00:00
|
|
|
|
2009-05-25 10:05:56 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
2008-07-03 15:10:15 +00:00
|
|
|
|
|
|
|
|
2013-02-25 14:46:09 +00:00
|
|
|
int HandleScope::NumberOfHandles(Isolate* isolate) {
|
2011-03-18 20:35:07 +00:00
|
|
|
HandleScopeImplementer* impl = isolate->handle_scope_implementer();
|
|
|
|
int n = impl->blocks()->length();
|
2009-01-23 17:22:23 +00:00
|
|
|
if (n == 0) return 0;
|
2009-11-11 09:50:06 +00:00
|
|
|
return ((n - 1) * kHandleBlockSize) + static_cast<int>(
|
2011-03-18 20:35:07 +00:00
|
|
|
(isolate->handle_scope_data()->next - impl->blocks()->last()));
|
2009-01-23 17:22:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-02-25 14:46:09 +00:00
|
|
|
Object** HandleScope::Extend(Isolate* isolate) {
|
2014-01-16 08:17:40 +00:00
|
|
|
HandleScopeData* current = isolate->handle_scope_data();
|
2009-01-23 17:22:23 +00:00
|
|
|
|
2011-03-18 20:35:07 +00:00
|
|
|
Object** result = current->next;
|
|
|
|
|
|
|
|
ASSERT(result == current->limit);
|
2009-03-18 18:50:35 +00:00
|
|
|
// Make sure there's at least one scope on the stack and that the
|
|
|
|
// top of the scope stack isn't a barrier.
|
2014-01-13 09:42:23 +00:00
|
|
|
if (!Utils::ApiCheck(current->level != 0,
|
|
|
|
"v8::HandleScope::CreateHandle()",
|
|
|
|
"Cannot create a handle without a HandleScope")) {
|
2009-03-18 18:50:35 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
2011-03-18 20:35:07 +00:00
|
|
|
HandleScopeImplementer* impl = isolate->handle_scope_implementer();
|
2009-03-18 18:50:35 +00:00
|
|
|
// If there's more room in the last block, we use that. This is used
|
|
|
|
// for fast creation of scopes after scope barriers.
|
2009-09-28 12:25:21 +00:00
|
|
|
if (!impl->blocks()->is_empty()) {
|
|
|
|
Object** limit = &impl->blocks()->last()[kHandleBlockSize];
|
2011-03-18 20:35:07 +00:00
|
|
|
if (current->limit != limit) {
|
|
|
|
current->limit = limit;
|
|
|
|
ASSERT(limit - current->next < kHandleBlockSize);
|
2009-01-23 17:22:23 +00:00
|
|
|
}
|
|
|
|
}
|
2009-03-18 21:14:46 +00:00
|
|
|
|
2009-03-18 18:50:35 +00:00
|
|
|
// If we still haven't found a slot for the handle, we extend the
|
|
|
|
// current handle scope by allocating a new handle block.
|
2011-03-18 20:35:07 +00:00
|
|
|
if (result == current->limit) {
|
2009-03-18 18:50:35 +00:00
|
|
|
// If there's a spare block, use it for growing the current scope.
|
|
|
|
result = impl->GetSpareOrNewBlock();
|
|
|
|
// Add the extension to the global list of blocks, but count the
|
|
|
|
// extension as part of the current scope.
|
2009-09-28 12:25:21 +00:00
|
|
|
impl->blocks()->Add(result);
|
2011-03-18 20:35:07 +00:00
|
|
|
current->limit = &result[kHandleBlockSize];
|
2009-03-18 18:50:35 +00:00
|
|
|
}
|
2009-01-23 17:22:23 +00:00
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-03-18 20:35:07 +00:00
|
|
|
void HandleScope::DeleteExtensions(Isolate* isolate) {
|
2014-01-16 08:17:40 +00:00
|
|
|
HandleScopeData* current = isolate->handle_scope_data();
|
2011-03-18 20:35:07 +00:00
|
|
|
isolate->handle_scope_implementer()->DeleteExtensions(current->limit);
|
2009-01-23 17:22:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-09-30 11:56:52 +00:00
|
|
|
#ifdef ENABLE_HANDLE_ZAPPING
|
2009-08-26 10:33:11 +00:00
|
|
|
void HandleScope::ZapRange(Object** start, Object** end) {
|
2010-10-21 14:21:00 +00:00
|
|
|
ASSERT(end - start <= kHandleBlockSize);
|
|
|
|
for (Object** p = start; p != end; p++) {
|
2009-08-26 10:33:11 +00:00
|
|
|
*reinterpret_cast<Address*>(p) = v8::internal::kHandleZapValue;
|
2009-01-23 17:22:23 +00:00
|
|
|
}
|
|
|
|
}
|
2013-03-22 13:40:13 +00:00
|
|
|
#endif
|
2009-01-23 17:22:23 +00:00
|
|
|
|
|
|
|
|
2013-02-25 14:46:09 +00:00
|
|
|
Address HandleScope::current_level_address(Isolate* isolate) {
|
|
|
|
return reinterpret_cast<Address>(&isolate->handle_scope_data()->level);
|
2009-11-04 08:51:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-02-25 14:46:09 +00:00
|
|
|
Address HandleScope::current_next_address(Isolate* isolate) {
|
|
|
|
return reinterpret_cast<Address>(&isolate->handle_scope_data()->next);
|
2009-11-04 08:51:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-02-25 14:46:09 +00:00
|
|
|
Address HandleScope::current_limit_address(Isolate* isolate) {
|
|
|
|
return reinterpret_cast<Address>(&isolate->handle_scope_data()->limit);
|
2009-11-04 08:51:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-06 09:31:31 +00:00
|
|
|
DeferredHandleScope::DeferredHandleScope(Isolate* isolate)
|
|
|
|
: impl_(isolate->handle_scope_implementer()) {
|
|
|
|
impl_->BeginDeferredScope();
|
2014-01-16 08:17:40 +00:00
|
|
|
HandleScopeData* data = impl_->isolate()->handle_scope_data();
|
2012-07-06 09:31:31 +00:00
|
|
|
Object** new_next = impl_->GetSpareOrNewBlock();
|
|
|
|
Object** new_limit = &new_next[kHandleBlockSize];
|
2012-07-06 14:09:11 +00:00
|
|
|
ASSERT(data->limit == &impl_->blocks()->last()[kHandleBlockSize]);
|
2012-07-06 09:31:31 +00:00
|
|
|
impl_->blocks()->Add(new_next);
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
prev_level_ = data->level;
|
|
|
|
#endif
|
|
|
|
data->level++;
|
|
|
|
prev_limit_ = data->limit;
|
|
|
|
prev_next_ = data->next;
|
|
|
|
data->next = new_next;
|
|
|
|
data->limit = new_limit;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
DeferredHandleScope::~DeferredHandleScope() {
|
|
|
|
impl_->isolate()->handle_scope_data()->level--;
|
|
|
|
ASSERT(handles_detached_);
|
|
|
|
ASSERT(impl_->isolate()->handle_scope_data()->level == prev_level_);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
DeferredHandles* DeferredHandleScope::Detach() {
|
|
|
|
DeferredHandles* deferred = impl_->Detach(prev_limit_);
|
2014-01-16 08:17:40 +00:00
|
|
|
HandleScopeData* data = impl_->isolate()->handle_scope_data();
|
2012-07-06 09:31:31 +00:00
|
|
|
data->next = prev_next_;
|
|
|
|
data->limit = prev_limit_;
|
|
|
|
#ifdef DEBUG
|
|
|
|
handles_detached_ = true;
|
|
|
|
#endif
|
|
|
|
return deferred;
|
|
|
|
}
|
|
|
|
|
2008-07-03 15:10:15 +00:00
|
|
|
} } // namespace v8::internal
|