30a0a7de43
This issue was raised by Brett Wilson while reviewing my changelist for readability. Craig Silverstein (one of C++ SG maintainers) confirmed that we should declare one namespace per line. Our way of namespaces closing seems not violating style guides (there is no clear agreement on it), so I left it intact. Review URL: http://codereview.chromium.org/115756 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@2038 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
80 lines
3.0 KiB
C++
80 lines
3.0 KiB
C++
// Copyright 2008 the V8 project authors. All rights reserved.
|
|
// 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 <string.h>
|
|
#include "v8.h"
|
|
#include "ast.h"
|
|
#include "assembler.h"
|
|
#include "regexp-macro-assembler.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
RegExpMacroAssembler::RegExpMacroAssembler() {
|
|
}
|
|
|
|
|
|
RegExpMacroAssembler::~RegExpMacroAssembler() {
|
|
}
|
|
|
|
|
|
ByteArrayProvider::ByteArrayProvider(unsigned int initial_size)
|
|
: byte_array_size_(initial_size),
|
|
current_byte_array_(),
|
|
current_byte_array_free_offset_(initial_size) {}
|
|
|
|
|
|
ArraySlice ByteArrayProvider::GetBuffer(unsigned int size,
|
|
unsigned int elem_size) {
|
|
ASSERT(size > 0);
|
|
size_t byte_size = size * elem_size;
|
|
int free_offset = current_byte_array_free_offset_;
|
|
// align elements
|
|
free_offset += elem_size - 1;
|
|
free_offset = free_offset - (free_offset % elem_size);
|
|
|
|
if (free_offset + byte_size > byte_array_size_) {
|
|
if (byte_size > (byte_array_size_ / 2)) {
|
|
Handle<ByteArray> solo_buffer(Factory::NewByteArray(byte_size, TENURED));
|
|
return ArraySlice(solo_buffer, 0);
|
|
}
|
|
current_byte_array_ = Factory::NewByteArray(byte_array_size_, TENURED);
|
|
free_offset = 0;
|
|
}
|
|
current_byte_array_free_offset_ = free_offset + byte_size;
|
|
return ArraySlice(current_byte_array_, free_offset);
|
|
}
|
|
|
|
|
|
template <typename T>
|
|
ArraySlice ByteArrayProvider::GetBuffer(Vector<T> values) {
|
|
ArraySlice slice = GetBuffer(values.length(), sizeof(T));
|
|
memcpy(slice.location(), values.start(), values.length() * sizeof(T));
|
|
return slice;
|
|
}
|
|
} } // namespace v8::internal
|