mirror of https://github.com/lukechilds/node.git
Ryan Dahl
14 years ago
99 changed files with 2691 additions and 6813 deletions
@ -1,53 +0,0 @@ |
|||||
// Copyright 2010 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.
|
|
||||
|
|
||||
// Load definitions of standard types.
|
|
||||
|
|
||||
#ifndef V8STDINT_H_ |
|
||||
#define V8STDINT_H_ |
|
||||
|
|
||||
#include <stdio.h> |
|
||||
|
|
||||
#if defined(_WIN32) && !defined(__MINGW32__) |
|
||||
|
|
||||
typedef signed char int8_t; |
|
||||
typedef unsigned char uint8_t; |
|
||||
typedef short int16_t; // NOLINT
|
|
||||
typedef unsigned short uint16_t; // NOLINT
|
|
||||
typedef int int32_t; |
|
||||
typedef unsigned int uint32_t; |
|
||||
typedef __int64 int64_t; |
|
||||
typedef unsigned __int64 uint64_t; |
|
||||
// intptr_t and friends are defined in crtdefs.h through stdio.h.
|
|
||||
|
|
||||
#else |
|
||||
|
|
||||
#include <stdint.h> |
|
||||
|
|
||||
#endif |
|
||||
|
|
||||
#endif // V8STDINT_H_
|
|
||||
@ -1,767 +0,0 @@ |
|||||
// Copyright 2010 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 "v8.h" |
|
||||
|
|
||||
#include "bignum.h" |
|
||||
#include "utils.h" |
|
||||
|
|
||||
namespace v8 { |
|
||||
namespace internal { |
|
||||
|
|
||||
Bignum::Bignum() |
|
||||
: bigits_(bigits_buffer_, kBigitCapacity), used_digits_(0), exponent_(0) { |
|
||||
for (int i = 0; i < kBigitCapacity; ++i) { |
|
||||
bigits_[i] = 0; |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
|
|
||||
template<typename S> |
|
||||
static int BitSize(S value) { |
|
||||
return 8 * sizeof(value); |
|
||||
} |
|
||||
|
|
||||
// Guaranteed to lie in one Bigit.
|
|
||||
void Bignum::AssignUInt16(uint16_t value) { |
|
||||
ASSERT(kBigitSize >= BitSize(value)); |
|
||||
Zero(); |
|
||||
if (value == 0) return; |
|
||||
|
|
||||
EnsureCapacity(1); |
|
||||
bigits_[0] = value; |
|
||||
used_digits_ = 1; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::AssignUInt64(uint64_t value) { |
|
||||
const int kUInt64Size = 64; |
|
||||
|
|
||||
Zero(); |
|
||||
if (value == 0) return; |
|
||||
|
|
||||
int needed_bigits = kUInt64Size / kBigitSize + 1; |
|
||||
EnsureCapacity(needed_bigits); |
|
||||
for (int i = 0; i < needed_bigits; ++i) { |
|
||||
bigits_[i] = value & kBigitMask; |
|
||||
value = value >> kBigitSize; |
|
||||
} |
|
||||
used_digits_ = needed_bigits; |
|
||||
Clamp(); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::AssignBignum(const Bignum& other) { |
|
||||
exponent_ = other.exponent_; |
|
||||
for (int i = 0; i < other.used_digits_; ++i) { |
|
||||
bigits_[i] = other.bigits_[i]; |
|
||||
} |
|
||||
// Clear the excess digits (if there were any).
|
|
||||
for (int i = other.used_digits_; i < used_digits_; ++i) { |
|
||||
bigits_[i] = 0; |
|
||||
} |
|
||||
used_digits_ = other.used_digits_; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
static uint64_t ReadUInt64(Vector<const char> buffer, |
|
||||
int from, |
|
||||
int digits_to_read) { |
|
||||
uint64_t result = 0; |
|
||||
for (int i = from; i < from + digits_to_read; ++i) { |
|
||||
int digit = buffer[i] - '0'; |
|
||||
ASSERT(0 <= digit && digit <= 9); |
|
||||
result = result * 10 + digit; |
|
||||
} |
|
||||
return result; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::AssignDecimalString(Vector<const char> value) { |
|
||||
// 2^64 = 18446744073709551616 > 10^19
|
|
||||
const int kMaxUint64DecimalDigits = 19; |
|
||||
Zero(); |
|
||||
int length = value.length(); |
|
||||
int pos = 0; |
|
||||
// Let's just say that each digit needs 4 bits.
|
|
||||
while (length >= kMaxUint64DecimalDigits) { |
|
||||
uint64_t digits = ReadUInt64(value, pos, kMaxUint64DecimalDigits); |
|
||||
pos += kMaxUint64DecimalDigits; |
|
||||
length -= kMaxUint64DecimalDigits; |
|
||||
MultiplyByPowerOfTen(kMaxUint64DecimalDigits); |
|
||||
AddUInt64(digits); |
|
||||
} |
|
||||
uint64_t digits = ReadUInt64(value, pos, length); |
|
||||
MultiplyByPowerOfTen(length); |
|
||||
AddUInt64(digits); |
|
||||
Clamp(); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
static int HexCharValue(char c) { |
|
||||
if ('0' <= c && c <= '9') return c - '0'; |
|
||||
if ('a' <= c && c <= 'f') return 10 + c - 'a'; |
|
||||
if ('A' <= c && c <= 'F') return 10 + c - 'A'; |
|
||||
UNREACHABLE(); |
|
||||
return 0; // To make compiler happy.
|
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::AssignHexString(Vector<const char> value) { |
|
||||
Zero(); |
|
||||
int length = value.length(); |
|
||||
|
|
||||
int needed_bigits = length * 4 / kBigitSize + 1; |
|
||||
EnsureCapacity(needed_bigits); |
|
||||
int string_index = length - 1; |
|
||||
for (int i = 0; i < needed_bigits - 1; ++i) { |
|
||||
// These bigits are guaranteed to be "full".
|
|
||||
Chunk current_bigit = 0; |
|
||||
for (int j = 0; j < kBigitSize / 4; j++) { |
|
||||
current_bigit += HexCharValue(value[string_index--]) << (j * 4); |
|
||||
} |
|
||||
bigits_[i] = current_bigit; |
|
||||
} |
|
||||
used_digits_ = needed_bigits - 1; |
|
||||
|
|
||||
Chunk most_significant_bigit = 0; // Could be = 0;
|
|
||||
for (int j = 0; j <= string_index; ++j) { |
|
||||
most_significant_bigit <<= 4; |
|
||||
most_significant_bigit += HexCharValue(value[j]); |
|
||||
} |
|
||||
if (most_significant_bigit != 0) { |
|
||||
bigits_[used_digits_] = most_significant_bigit; |
|
||||
used_digits_++; |
|
||||
} |
|
||||
Clamp(); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::AddUInt64(uint64_t operand) { |
|
||||
if (operand == 0) return; |
|
||||
Bignum other; |
|
||||
other.AssignUInt64(operand); |
|
||||
AddBignum(other); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::AddBignum(const Bignum& other) { |
|
||||
ASSERT(IsClamped()); |
|
||||
ASSERT(other.IsClamped()); |
|
||||
|
|
||||
// If this has a greater exponent than other append zero-bigits to this.
|
|
||||
// After this call exponent_ <= other.exponent_.
|
|
||||
Align(other); |
|
||||
|
|
||||
// There are two possibilities:
|
|
||||
// aaaaaaaaaaa 0000 (where the 0s represent a's exponent)
|
|
||||
// bbbbb 00000000
|
|
||||
// ----------------
|
|
||||
// ccccccccccc 0000
|
|
||||
// or
|
|
||||
// aaaaaaaaaa 0000
|
|
||||
// bbbbbbbbb 0000000
|
|
||||
// -----------------
|
|
||||
// cccccccccccc 0000
|
|
||||
// In both cases we might need a carry bigit.
|
|
||||
|
|
||||
EnsureCapacity(1 + Max(BigitLength(), other.BigitLength()) - exponent_); |
|
||||
Chunk carry = 0; |
|
||||
int bigit_pos = other.exponent_ - exponent_; |
|
||||
ASSERT(bigit_pos >= 0); |
|
||||
for (int i = 0; i < other.used_digits_; ++i) { |
|
||||
Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry; |
|
||||
bigits_[bigit_pos] = sum & kBigitMask; |
|
||||
carry = sum >> kBigitSize; |
|
||||
bigit_pos++; |
|
||||
} |
|
||||
|
|
||||
while (carry != 0) { |
|
||||
Chunk sum = bigits_[bigit_pos] + carry; |
|
||||
bigits_[bigit_pos] = sum & kBigitMask; |
|
||||
carry = sum >> kBigitSize; |
|
||||
bigit_pos++; |
|
||||
} |
|
||||
used_digits_ = Max(bigit_pos, used_digits_); |
|
||||
ASSERT(IsClamped()); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::SubtractBignum(const Bignum& other) { |
|
||||
ASSERT(IsClamped()); |
|
||||
ASSERT(other.IsClamped()); |
|
||||
// We require this to be bigger than other.
|
|
||||
ASSERT(LessEqual(other, *this)); |
|
||||
|
|
||||
Align(other); |
|
||||
|
|
||||
int offset = other.exponent_ - exponent_; |
|
||||
Chunk borrow = 0; |
|
||||
int i; |
|
||||
for (i = 0; i < other.used_digits_; ++i) { |
|
||||
ASSERT((borrow == 0) || (borrow == 1)); |
|
||||
Chunk difference = bigits_[i + offset] - other.bigits_[i] - borrow; |
|
||||
bigits_[i + offset] = difference & kBigitMask; |
|
||||
borrow = difference >> (kChunkSize - 1); |
|
||||
} |
|
||||
while (borrow != 0) { |
|
||||
Chunk difference = bigits_[i + offset] - borrow; |
|
||||
bigits_[i + offset] = difference & kBigitMask; |
|
||||
borrow = difference >> (kChunkSize - 1); |
|
||||
++i; |
|
||||
} |
|
||||
Clamp(); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::ShiftLeft(int shift_amount) { |
|
||||
if (used_digits_ == 0) return; |
|
||||
exponent_ += shift_amount / kBigitSize; |
|
||||
int local_shift = shift_amount % kBigitSize; |
|
||||
EnsureCapacity(used_digits_ + 1); |
|
||||
BigitsShiftLeft(local_shift); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::MultiplyByUInt32(uint32_t factor) { |
|
||||
if (factor == 1) return; |
|
||||
if (factor == 0) { |
|
||||
Zero(); |
|
||||
return; |
|
||||
} |
|
||||
if (used_digits_ == 0) return; |
|
||||
|
|
||||
// The product of a bigit with the factor is of size kBigitSize + 32.
|
|
||||
// Assert that this number + 1 (for the carry) fits into double chunk.
|
|
||||
ASSERT(kDoubleChunkSize >= kBigitSize + 32 + 1); |
|
||||
DoubleChunk carry = 0; |
|
||||
for (int i = 0; i < used_digits_; ++i) { |
|
||||
DoubleChunk product = static_cast<DoubleChunk>(factor) * bigits_[i] + carry; |
|
||||
bigits_[i] = static_cast<Chunk>(product & kBigitMask); |
|
||||
carry = (product >> kBigitSize); |
|
||||
} |
|
||||
while (carry != 0) { |
|
||||
EnsureCapacity(used_digits_ + 1); |
|
||||
bigits_[used_digits_] = carry & kBigitMask; |
|
||||
used_digits_++; |
|
||||
carry >>= kBigitSize; |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::MultiplyByUInt64(uint64_t factor) { |
|
||||
if (factor == 1) return; |
|
||||
if (factor == 0) { |
|
||||
Zero(); |
|
||||
return; |
|
||||
} |
|
||||
ASSERT(kBigitSize < 32); |
|
||||
uint64_t carry = 0; |
|
||||
uint64_t low = factor & 0xFFFFFFFF; |
|
||||
uint64_t high = factor >> 32; |
|
||||
for (int i = 0; i < used_digits_; ++i) { |
|
||||
uint64_t product_low = low * bigits_[i]; |
|
||||
uint64_t product_high = high * bigits_[i]; |
|
||||
uint64_t tmp = (carry & kBigitMask) + product_low; |
|
||||
bigits_[i] = tmp & kBigitMask; |
|
||||
carry = (carry >> kBigitSize) + (tmp >> kBigitSize) + |
|
||||
(product_high << (32 - kBigitSize)); |
|
||||
} |
|
||||
while (carry != 0) { |
|
||||
EnsureCapacity(used_digits_ + 1); |
|
||||
bigits_[used_digits_] = carry & kBigitMask; |
|
||||
used_digits_++; |
|
||||
carry >>= kBigitSize; |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::MultiplyByPowerOfTen(int exponent) { |
|
||||
const uint64_t kFive27 = V8_2PART_UINT64_C(0x6765c793, fa10079d); |
|
||||
const uint16_t kFive1 = 5; |
|
||||
const uint16_t kFive2 = kFive1 * 5; |
|
||||
const uint16_t kFive3 = kFive2 * 5; |
|
||||
const uint16_t kFive4 = kFive3 * 5; |
|
||||
const uint16_t kFive5 = kFive4 * 5; |
|
||||
const uint16_t kFive6 = kFive5 * 5; |
|
||||
const uint32_t kFive7 = kFive6 * 5; |
|
||||
const uint32_t kFive8 = kFive7 * 5; |
|
||||
const uint32_t kFive9 = kFive8 * 5; |
|
||||
const uint32_t kFive10 = kFive9 * 5; |
|
||||
const uint32_t kFive11 = kFive10 * 5; |
|
||||
const uint32_t kFive12 = kFive11 * 5; |
|
||||
const uint32_t kFive13 = kFive12 * 5; |
|
||||
const uint32_t kFive1_to_12[] = |
|
||||
{ kFive1, kFive2, kFive3, kFive4, kFive5, kFive6, |
|
||||
kFive7, kFive8, kFive9, kFive10, kFive11, kFive12 }; |
|
||||
|
|
||||
ASSERT(exponent >= 0); |
|
||||
if (exponent == 0) return; |
|
||||
if (used_digits_ == 0) return; |
|
||||
|
|
||||
// We shift by exponent at the end just before returning.
|
|
||||
int remaining_exponent = exponent; |
|
||||
while (remaining_exponent >= 27) { |
|
||||
MultiplyByUInt64(kFive27); |
|
||||
remaining_exponent -= 27; |
|
||||
} |
|
||||
while (remaining_exponent >= 13) { |
|
||||
MultiplyByUInt32(kFive13); |
|
||||
remaining_exponent -= 13; |
|
||||
} |
|
||||
if (remaining_exponent > 0) { |
|
||||
MultiplyByUInt32(kFive1_to_12[remaining_exponent - 1]); |
|
||||
} |
|
||||
ShiftLeft(exponent); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::Square() { |
|
||||
ASSERT(IsClamped()); |
|
||||
int product_length = 2 * used_digits_; |
|
||||
EnsureCapacity(product_length); |
|
||||
|
|
||||
// Comba multiplication: compute each column separately.
|
|
||||
// Example: r = a2a1a0 * b2b1b0.
|
|
||||
// r = 1 * a0b0 +
|
|
||||
// 10 * (a1b0 + a0b1) +
|
|
||||
// 100 * (a2b0 + a1b1 + a0b2) +
|
|
||||
// 1000 * (a2b1 + a1b2) +
|
|
||||
// 10000 * a2b2
|
|
||||
//
|
|
||||
// In the worst case we have to accumulate nb-digits products of digit*digit.
|
|
||||
//
|
|
||||
// Assert that the additional number of bits in a DoubleChunk are enough to
|
|
||||
// sum up used_digits of Bigit*Bigit.
|
|
||||
if ((1 << (2 * (kChunkSize - kBigitSize))) <= used_digits_) { |
|
||||
UNIMPLEMENTED(); |
|
||||
} |
|
||||
DoubleChunk accumulator = 0; |
|
||||
// First shift the digits so we don't overwrite them.
|
|
||||
int copy_offset = used_digits_; |
|
||||
for (int i = 0; i < used_digits_; ++i) { |
|
||||
bigits_[copy_offset + i] = bigits_[i]; |
|
||||
} |
|
||||
// We have two loops to avoid some 'if's in the loop.
|
|
||||
for (int i = 0; i < used_digits_; ++i) { |
|
||||
// Process temporary digit i with power i.
|
|
||||
// The sum of the two indices must be equal to i.
|
|
||||
int bigit_index1 = i; |
|
||||
int bigit_index2 = 0; |
|
||||
// Sum all of the sub-products.
|
|
||||
while (bigit_index1 >= 0) { |
|
||||
Chunk chunk1 = bigits_[copy_offset + bigit_index1]; |
|
||||
Chunk chunk2 = bigits_[copy_offset + bigit_index2]; |
|
||||
accumulator += static_cast<DoubleChunk>(chunk1) * chunk2; |
|
||||
bigit_index1--; |
|
||||
bigit_index2++; |
|
||||
} |
|
||||
bigits_[i] = static_cast<Chunk>(accumulator) & kBigitMask; |
|
||||
accumulator >>= kBigitSize; |
|
||||
} |
|
||||
for (int i = used_digits_; i < product_length; ++i) { |
|
||||
int bigit_index1 = used_digits_ - 1; |
|
||||
int bigit_index2 = i - bigit_index1; |
|
||||
// Invariant: sum of both indices is again equal to i.
|
|
||||
// Inner loop runs 0 times on last iteration, emptying accumulator.
|
|
||||
while (bigit_index2 < used_digits_) { |
|
||||
Chunk chunk1 = bigits_[copy_offset + bigit_index1]; |
|
||||
Chunk chunk2 = bigits_[copy_offset + bigit_index2]; |
|
||||
accumulator += static_cast<DoubleChunk>(chunk1) * chunk2; |
|
||||
bigit_index1--; |
|
||||
bigit_index2++; |
|
||||
} |
|
||||
// The overwritten bigits_[i] will never be read in further loop iterations,
|
|
||||
// because bigit_index1 and bigit_index2 are always greater
|
|
||||
// than i - used_digits_.
|
|
||||
bigits_[i] = static_cast<Chunk>(accumulator) & kBigitMask; |
|
||||
accumulator >>= kBigitSize; |
|
||||
} |
|
||||
// Since the result was guaranteed to lie inside the number the
|
|
||||
// accumulator must be 0 now.
|
|
||||
ASSERT(accumulator == 0); |
|
||||
|
|
||||
// Don't forget to update the used_digits and the exponent.
|
|
||||
used_digits_ = product_length; |
|
||||
exponent_ *= 2; |
|
||||
Clamp(); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::AssignPowerUInt16(uint16_t base, int power_exponent) { |
|
||||
ASSERT(base != 0); |
|
||||
ASSERT(power_exponent >= 0); |
|
||||
if (power_exponent == 0) { |
|
||||
AssignUInt16(1); |
|
||||
return; |
|
||||
} |
|
||||
Zero(); |
|
||||
int shifts = 0; |
|
||||
// We expect base to be in range 2-32, and most often to be 10.
|
|
||||
// It does not make much sense to implement different algorithms for counting
|
|
||||
// the bits.
|
|
||||
while ((base & 1) == 0) { |
|
||||
base >>= 1; |
|
||||
shifts++; |
|
||||
} |
|
||||
int bit_size = 0; |
|
||||
int tmp_base = base; |
|
||||
while (tmp_base != 0) { |
|
||||
tmp_base >>= 1; |
|
||||
bit_size++; |
|
||||
} |
|
||||
int final_size = bit_size * power_exponent; |
|
||||
// 1 extra bigit for the shifting, and one for rounded final_size.
|
|
||||
EnsureCapacity(final_size / kBigitSize + 2); |
|
||||
|
|
||||
// Left to Right exponentiation.
|
|
||||
int mask = 1; |
|
||||
while (power_exponent >= mask) mask <<= 1; |
|
||||
|
|
||||
// The mask is now pointing to the bit above the most significant 1-bit of
|
|
||||
// power_exponent.
|
|
||||
// Get rid of first 1-bit;
|
|
||||
mask >>= 2; |
|
||||
uint64_t this_value = base; |
|
||||
|
|
||||
bool delayed_multipliciation = false; |
|
||||
const uint64_t max_32bits = 0xFFFFFFFF; |
|
||||
while (mask != 0 && this_value <= max_32bits) { |
|
||||
this_value = this_value * this_value; |
|
||||
// Verify that there is enough space in this_value to perform the
|
|
||||
// multiplication. The first bit_size bits must be 0.
|
|
||||
if ((power_exponent & mask) != 0) { |
|
||||
uint64_t base_bits_mask = |
|
||||
~((static_cast<uint64_t>(1) << (64 - bit_size)) - 1); |
|
||||
bool high_bits_zero = (this_value & base_bits_mask) == 0; |
|
||||
if (high_bits_zero) { |
|
||||
this_value *= base; |
|
||||
} else { |
|
||||
delayed_multipliciation = true; |
|
||||
} |
|
||||
} |
|
||||
mask >>= 1; |
|
||||
} |
|
||||
AssignUInt64(this_value); |
|
||||
if (delayed_multipliciation) { |
|
||||
MultiplyByUInt32(base); |
|
||||
} |
|
||||
|
|
||||
// Now do the same thing as a bignum.
|
|
||||
while (mask != 0) { |
|
||||
Square(); |
|
||||
if ((power_exponent & mask) != 0) { |
|
||||
MultiplyByUInt32(base); |
|
||||
} |
|
||||
mask >>= 1; |
|
||||
} |
|
||||
|
|
||||
// And finally add the saved shifts.
|
|
||||
ShiftLeft(shifts * power_exponent); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
// Precondition: this/other < 16bit.
|
|
||||
uint16_t Bignum::DivideModuloIntBignum(const Bignum& other) { |
|
||||
ASSERT(IsClamped()); |
|
||||
ASSERT(other.IsClamped()); |
|
||||
ASSERT(other.used_digits_ > 0); |
|
||||
|
|
||||
// Easy case: if we have less digits than the divisor than the result is 0.
|
|
||||
// Note: this handles the case where this == 0, too.
|
|
||||
if (BigitLength() < other.BigitLength()) { |
|
||||
return 0; |
|
||||
} |
|
||||
|
|
||||
Align(other); |
|
||||
|
|
||||
uint16_t result = 0; |
|
||||
|
|
||||
// Start by removing multiples of 'other' until both numbers have the same
|
|
||||
// number of digits.
|
|
||||
while (BigitLength() > other.BigitLength()) { |
|
||||
// This naive approach is extremely inefficient if the this divided other
|
|
||||
// might be big. This function is implemented for doubleToString where
|
|
||||
// the result should be small (less than 10).
|
|
||||
ASSERT(other.bigits_[other.used_digits_ - 1] >= ((1 << kBigitSize) / 16)); |
|
||||
// Remove the multiples of the first digit.
|
|
||||
// Example this = 23 and other equals 9. -> Remove 2 multiples.
|
|
||||
result += bigits_[used_digits_ - 1]; |
|
||||
SubtractTimes(other, bigits_[used_digits_ - 1]); |
|
||||
} |
|
||||
|
|
||||
ASSERT(BigitLength() == other.BigitLength()); |
|
||||
|
|
||||
// Both bignums are at the same length now.
|
|
||||
// Since other has more than 0 digits we know that the access to
|
|
||||
// bigits_[used_digits_ - 1] is safe.
|
|
||||
Chunk this_bigit = bigits_[used_digits_ - 1]; |
|
||||
Chunk other_bigit = other.bigits_[other.used_digits_ - 1]; |
|
||||
|
|
||||
if (other.used_digits_ == 1) { |
|
||||
// Shortcut for easy (and common) case.
|
|
||||
int quotient = this_bigit / other_bigit; |
|
||||
bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient; |
|
||||
result += quotient; |
|
||||
Clamp(); |
|
||||
return result; |
|
||||
} |
|
||||
|
|
||||
int division_estimate = this_bigit / (other_bigit + 1); |
|
||||
result += division_estimate; |
|
||||
SubtractTimes(other, division_estimate); |
|
||||
|
|
||||
if (other_bigit * (division_estimate + 1) > this_bigit) { |
|
||||
// No need to even try to subtract. Even if other's remaining digits were 0
|
|
||||
// another subtraction would be too much.
|
|
||||
return result; |
|
||||
} |
|
||||
|
|
||||
while (LessEqual(other, *this)) { |
|
||||
SubtractBignum(other); |
|
||||
result++; |
|
||||
} |
|
||||
return result; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
template<typename S> |
|
||||
static int SizeInHexChars(S number) { |
|
||||
ASSERT(number > 0); |
|
||||
int result = 0; |
|
||||
while (number != 0) { |
|
||||
number >>= 4; |
|
||||
result++; |
|
||||
} |
|
||||
return result; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
static char HexCharOfValue(int value) { |
|
||||
ASSERT(0 <= value && value <= 16); |
|
||||
if (value < 10) return value + '0'; |
|
||||
return value - 10 + 'A'; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
bool Bignum::ToHexString(char* buffer, int buffer_size) const { |
|
||||
ASSERT(IsClamped()); |
|
||||
// Each bigit must be printable as separate hex-character.
|
|
||||
ASSERT(kBigitSize % 4 == 0); |
|
||||
const int kHexCharsPerBigit = kBigitSize / 4; |
|
||||
|
|
||||
if (used_digits_ == 0) { |
|
||||
if (buffer_size < 2) return false; |
|
||||
buffer[0] = '0'; |
|
||||
buffer[1] = '\0'; |
|
||||
return true; |
|
||||
} |
|
||||
// We add 1 for the terminating '\0' character.
|
|
||||
int needed_chars = (BigitLength() - 1) * kHexCharsPerBigit + |
|
||||
SizeInHexChars(bigits_[used_digits_ - 1]) + 1; |
|
||||
if (needed_chars > buffer_size) return false; |
|
||||
int string_index = needed_chars - 1; |
|
||||
buffer[string_index--] = '\0'; |
|
||||
for (int i = 0; i < exponent_; ++i) { |
|
||||
for (int j = 0; j < kHexCharsPerBigit; ++j) { |
|
||||
buffer[string_index--] = '0'; |
|
||||
} |
|
||||
} |
|
||||
for (int i = 0; i < used_digits_ - 1; ++i) { |
|
||||
Chunk current_bigit = bigits_[i]; |
|
||||
for (int j = 0; j < kHexCharsPerBigit; ++j) { |
|
||||
buffer[string_index--] = HexCharOfValue(current_bigit & 0xF); |
|
||||
current_bigit >>= 4; |
|
||||
} |
|
||||
} |
|
||||
// And finally the last bigit.
|
|
||||
Chunk most_significant_bigit = bigits_[used_digits_ - 1]; |
|
||||
while (most_significant_bigit != 0) { |
|
||||
buffer[string_index--] = HexCharOfValue(most_significant_bigit & 0xF); |
|
||||
most_significant_bigit >>= 4; |
|
||||
} |
|
||||
return true; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
Bignum::Chunk Bignum::BigitAt(int index) const { |
|
||||
if (index >= BigitLength()) return 0; |
|
||||
if (index < exponent_) return 0; |
|
||||
return bigits_[index - exponent_]; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
int Bignum::Compare(const Bignum& a, const Bignum& b) { |
|
||||
ASSERT(a.IsClamped()); |
|
||||
ASSERT(b.IsClamped()); |
|
||||
int bigit_length_a = a.BigitLength(); |
|
||||
int bigit_length_b = b.BigitLength(); |
|
||||
if (bigit_length_a < bigit_length_b) return -1; |
|
||||
if (bigit_length_a > bigit_length_b) return +1; |
|
||||
for (int i = bigit_length_a - 1; i >= Min(a.exponent_, b.exponent_); --i) { |
|
||||
Chunk bigit_a = a.BigitAt(i); |
|
||||
Chunk bigit_b = b.BigitAt(i); |
|
||||
if (bigit_a < bigit_b) return -1; |
|
||||
if (bigit_a > bigit_b) return +1; |
|
||||
// Otherwise they are equal up to this digit. Try the next digit.
|
|
||||
} |
|
||||
return 0; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
int Bignum::PlusCompare(const Bignum& a, const Bignum& b, const Bignum& c) { |
|
||||
ASSERT(a.IsClamped()); |
|
||||
ASSERT(b.IsClamped()); |
|
||||
ASSERT(c.IsClamped()); |
|
||||
if (a.BigitLength() < b.BigitLength()) { |
|
||||
return PlusCompare(b, a, c); |
|
||||
} |
|
||||
if (a.BigitLength() + 1 < c.BigitLength()) return -1; |
|
||||
if (a.BigitLength() > c.BigitLength()) return +1; |
|
||||
// The exponent encodes 0-bigits. So if there are more 0-digits in 'a' than
|
|
||||
// 'b' has digits, then the bigit-length of 'a'+'b' must be equal to the one
|
|
||||
// of 'a'.
|
|
||||
if (a.exponent_ >= b.BigitLength() && a.BigitLength() < c.BigitLength()) { |
|
||||
return -1; |
|
||||
} |
|
||||
|
|
||||
Chunk borrow = 0; |
|
||||
// Starting at min_exponent all digits are == 0. So no need to compare them.
|
|
||||
int min_exponent = Min(Min(a.exponent_, b.exponent_), c.exponent_); |
|
||||
for (int i = c.BigitLength() - 1; i >= min_exponent; --i) { |
|
||||
Chunk chunk_a = a.BigitAt(i); |
|
||||
Chunk chunk_b = b.BigitAt(i); |
|
||||
Chunk chunk_c = c.BigitAt(i); |
|
||||
Chunk sum = chunk_a + chunk_b; |
|
||||
if (sum > chunk_c + borrow) { |
|
||||
return +1; |
|
||||
} else { |
|
||||
borrow = chunk_c + borrow - sum; |
|
||||
if (borrow > 1) return -1; |
|
||||
borrow <<= kBigitSize; |
|
||||
} |
|
||||
} |
|
||||
if (borrow == 0) return 0; |
|
||||
return -1; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::Clamp() { |
|
||||
while (used_digits_ > 0 && bigits_[used_digits_ - 1] == 0) { |
|
||||
used_digits_--; |
|
||||
} |
|
||||
if (used_digits_ == 0) { |
|
||||
// Zero.
|
|
||||
exponent_ = 0; |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
|
|
||||
bool Bignum::IsClamped() const { |
|
||||
return used_digits_ == 0 || bigits_[used_digits_ - 1] != 0; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::Zero() { |
|
||||
for (int i = 0; i < used_digits_; ++i) { |
|
||||
bigits_[i] = 0; |
|
||||
} |
|
||||
used_digits_ = 0; |
|
||||
exponent_ = 0; |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::Align(const Bignum& other) { |
|
||||
if (exponent_ > other.exponent_) { |
|
||||
// If "X" represents a "hidden" digit (by the exponent) then we are in the
|
|
||||
// following case (a == this, b == other):
|
|
||||
// a: aaaaaaXXXX or a: aaaaaXXX
|
|
||||
// b: bbbbbbX b: bbbbbbbbXX
|
|
||||
// We replace some of the hidden digits (X) of a with 0 digits.
|
|
||||
// a: aaaaaa000X or a: aaaaa0XX
|
|
||||
int zero_digits = exponent_ - other.exponent_; |
|
||||
EnsureCapacity(used_digits_ + zero_digits); |
|
||||
for (int i = used_digits_ - 1; i >= 0; --i) { |
|
||||
bigits_[i + zero_digits] = bigits_[i]; |
|
||||
} |
|
||||
for (int i = 0; i < zero_digits; ++i) { |
|
||||
bigits_[i] = 0; |
|
||||
} |
|
||||
used_digits_ += zero_digits; |
|
||||
exponent_ -= zero_digits; |
|
||||
ASSERT(used_digits_ >= 0); |
|
||||
ASSERT(exponent_ >= 0); |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::BigitsShiftLeft(int shift_amount) { |
|
||||
ASSERT(shift_amount < kBigitSize); |
|
||||
ASSERT(shift_amount >= 0); |
|
||||
Chunk carry = 0; |
|
||||
for (int i = 0; i < used_digits_; ++i) { |
|
||||
Chunk new_carry = bigits_[i] >> (kBigitSize - shift_amount); |
|
||||
bigits_[i] = ((bigits_[i] << shift_amount) + carry) & kBigitMask; |
|
||||
carry = new_carry; |
|
||||
} |
|
||||
if (carry != 0) { |
|
||||
bigits_[used_digits_] = carry; |
|
||||
used_digits_++; |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
|
|
||||
void Bignum::SubtractTimes(const Bignum& other, int factor) { |
|
||||
ASSERT(exponent_ <= other.exponent_); |
|
||||
if (factor < 3) { |
|
||||
for (int i = 0; i < factor; ++i) { |
|
||||
SubtractBignum(other); |
|
||||
} |
|
||||
return; |
|
||||
} |
|
||||
Chunk borrow = 0; |
|
||||
int exponent_diff = other.exponent_ - exponent_; |
|
||||
for (int i = 0; i < other.used_digits_; ++i) { |
|
||||
DoubleChunk product = static_cast<DoubleChunk>(factor) * other.bigits_[i]; |
|
||||
DoubleChunk remove = borrow + product; |
|
||||
Chunk difference = bigits_[i + exponent_diff] - (remove & kBigitMask); |
|
||||
bigits_[i + exponent_diff] = difference & kBigitMask; |
|
||||
borrow = static_cast<Chunk>((difference >> (kChunkSize - 1)) + |
|
||||
(remove >> kBigitSize)); |
|
||||
} |
|
||||
for (int i = other.used_digits_ + exponent_diff; i < used_digits_; ++i) { |
|
||||
if (borrow == 0) return; |
|
||||
Chunk difference = bigits_[i] - borrow; |
|
||||
bigits_[i] = difference & kBigitMask; |
|
||||
borrow = difference >> (kChunkSize - 1); |
|
||||
++i; |
|
||||
} |
|
||||
Clamp(); |
|
||||
} |
|
||||
|
|
||||
|
|
||||
} } // namespace v8::internal
|
|
||||
@ -1,140 +0,0 @@ |
|||||
// Copyright 2010 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.
|
|
||||
|
|
||||
#ifndef V8_BIGNUM_H_ |
|
||||
#define V8_BIGNUM_H_ |
|
||||
|
|
||||
namespace v8 { |
|
||||
namespace internal { |
|
||||
|
|
||||
class Bignum { |
|
||||
public: |
|
||||
// 3584 = 128 * 28. We can represent 2^3584 > 10^1000 accurately.
|
|
||||
// This bignum can encode much bigger numbers, since it contains an
|
|
||||
// exponent.
|
|
||||
static const int kMaxSignificantBits = 3584; |
|
||||
|
|
||||
Bignum(); |
|
||||
void AssignUInt16(uint16_t value); |
|
||||
void AssignUInt64(uint64_t value); |
|
||||
void AssignBignum(const Bignum& other); |
|
||||
|
|
||||
void AssignDecimalString(Vector<const char> value); |
|
||||
void AssignHexString(Vector<const char> value); |
|
||||
|
|
||||
void AssignPowerUInt16(uint16_t base, int exponent); |
|
||||
|
|
||||
void AddUInt16(uint16_t operand); |
|
||||
void AddUInt64(uint64_t operand); |
|
||||
void AddBignum(const Bignum& other); |
|
||||
// Precondition: this >= other.
|
|
||||
void SubtractBignum(const Bignum& other); |
|
||||
|
|
||||
void Square(); |
|
||||
void ShiftLeft(int shift_amount); |
|
||||
void MultiplyByUInt32(uint32_t factor); |
|
||||
void MultiplyByUInt64(uint64_t factor); |
|
||||
void MultiplyByPowerOfTen(int exponent); |
|
||||
void Times10() { return MultiplyByUInt32(10); } |
|
||||
// Pseudocode:
|
|
||||
// int result = this / other;
|
|
||||
// this = this % other;
|
|
||||
// In the worst case this function is in O(this/other).
|
|
||||
uint16_t DivideModuloIntBignum(const Bignum& other); |
|
||||
|
|
||||
bool ToHexString(char* buffer, int buffer_size) const; |
|
||||
|
|
||||
static int Compare(const Bignum& a, const Bignum& b); |
|
||||
static bool Equal(const Bignum& a, const Bignum& b) { |
|
||||
return Compare(a, b) == 0; |
|
||||
} |
|
||||
static bool LessEqual(const Bignum& a, const Bignum& b) { |
|
||||
return Compare(a, b) <= 0; |
|
||||
} |
|
||||
static bool Less(const Bignum& a, const Bignum& b) { |
|
||||
return Compare(a, b) < 0; |
|
||||
} |
|
||||
// Returns Compare(a + b, c);
|
|
||||
static int PlusCompare(const Bignum& a, const Bignum& b, const Bignum& c); |
|
||||
// Returns a + b == c
|
|
||||
static bool PlusEqual(const Bignum& a, const Bignum& b, const Bignum& c) { |
|
||||
return PlusCompare(a, b, c) == 0; |
|
||||
} |
|
||||
// Returns a + b <= c
|
|
||||
static bool PlusLessEqual(const Bignum& a, const Bignum& b, const Bignum& c) { |
|
||||
return PlusCompare(a, b, c) <= 0; |
|
||||
} |
|
||||
// Returns a + b < c
|
|
||||
static bool PlusLess(const Bignum& a, const Bignum& b, const Bignum& c) { |
|
||||
return PlusCompare(a, b, c) < 0; |
|
||||
} |
|
||||
private: |
|
||||
typedef uint32_t Chunk; |
|
||||
typedef uint64_t DoubleChunk; |
|
||||
|
|
||||
static const int kChunkSize = sizeof(Chunk) * 8; |
|
||||
static const int kDoubleChunkSize = sizeof(DoubleChunk) * 8; |
|
||||
// With bigit size of 28 we loose some bits, but a double still fits easily
|
|
||||
// into two chunks, and more importantly we can use the Comba multiplication.
|
|
||||
static const int kBigitSize = 28; |
|
||||
static const Chunk kBigitMask = (1 << kBigitSize) - 1; |
|
||||
// Every instance allocates kBigitLength chunks on the stack. Bignums cannot
|
|
||||
// grow. There are no checks if the stack-allocated space is sufficient.
|
|
||||
static const int kBigitCapacity = kMaxSignificantBits / kBigitSize; |
|
||||
|
|
||||
void EnsureCapacity(int size) { |
|
||||
if (size > kBigitCapacity) { |
|
||||
UNREACHABLE(); |
|
||||
} |
|
||||
} |
|
||||
void Align(const Bignum& other); |
|
||||
void Clamp(); |
|
||||
bool IsClamped() const; |
|
||||
void Zero(); |
|
||||
// Requires this to have enough capacity (no tests done).
|
|
||||
// Updates used_digits_ if necessary.
|
|
||||
// by must be < kBigitSize.
|
|
||||
void BigitsShiftLeft(int shift_amount); |
|
||||
// BigitLength includes the "hidden" digits encoded in the exponent.
|
|
||||
int BigitLength() const { return used_digits_ + exponent_; } |
|
||||
Chunk BigitAt(int index) const; |
|
||||
void SubtractTimes(const Bignum& other, int factor); |
|
||||
|
|
||||
Chunk bigits_buffer_[kBigitCapacity]; |
|
||||
// A vector backed by bigits_buffer_. This way accesses to the array are
|
|
||||
// checked for out-of-bounds errors.
|
|
||||
Vector<Chunk> bigits_; |
|
||||
int used_digits_; |
|
||||
// The Bignum's value equals value(bigits_) * 2^(exponent_ * kBigitSize).
|
|
||||
int exponent_; |
|
||||
|
|
||||
DISALLOW_COPY_AND_ASSIGN(Bignum); |
|
||||
}; |
|
||||
|
|
||||
} } // namespace v8::internal
|
|
||||
|
|
||||
#endif // V8_BIGNUM_H_
|
|
||||
File diff suppressed because it is too large
File diff suppressed because it is too large
@ -1,167 +0,0 @@ |
|||||
// Copyright 2010 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.
|
|
||||
|
|
||||
// Features shared by parsing and pre-parsing scanners.
|
|
||||
|
|
||||
#include "scanner-base.h" |
|
||||
|
|
||||
namespace v8 { |
|
||||
namespace internal { |
|
||||
|
|
||||
// ----------------------------------------------------------------------------
|
|
||||
// Keyword Matcher
|
|
||||
|
|
||||
KeywordMatcher::FirstState KeywordMatcher::first_states_[] = { |
|
||||
{ "break", KEYWORD_PREFIX, Token::BREAK }, |
|
||||
{ NULL, C, Token::ILLEGAL }, |
|
||||
{ NULL, D, Token::ILLEGAL }, |
|
||||
{ "else", KEYWORD_PREFIX, Token::ELSE }, |
|
||||
{ NULL, F, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, I, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, N, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ "return", KEYWORD_PREFIX, Token::RETURN }, |
|
||||
{ "switch", KEYWORD_PREFIX, Token::SWITCH }, |
|
||||
{ NULL, T, Token::ILLEGAL }, |
|
||||
{ NULL, UNMATCHABLE, Token::ILLEGAL }, |
|
||||
{ NULL, V, Token::ILLEGAL }, |
|
||||
{ NULL, W, Token::ILLEGAL } |
|
||||
}; |
|
||||
|
|
||||
|
|
||||
void KeywordMatcher::Step(unibrow::uchar input) { |
|
||||
switch (state_) { |
|
||||
case INITIAL: { |
|
||||
// matching the first character is the only state with significant fanout.
|
|
||||
// Match only lower-case letters in range 'b'..'w'.
|
|
||||
unsigned int offset = input - kFirstCharRangeMin; |
|
||||
if (offset < kFirstCharRangeLength) { |
|
||||
state_ = first_states_[offset].state; |
|
||||
if (state_ == KEYWORD_PREFIX) { |
|
||||
keyword_ = first_states_[offset].keyword; |
|
||||
counter_ = 1; |
|
||||
keyword_token_ = first_states_[offset].token; |
|
||||
} |
|
||||
return; |
|
||||
} |
|
||||
break; |
|
||||
} |
|
||||
case KEYWORD_PREFIX: |
|
||||
if (static_cast<unibrow::uchar>(keyword_[counter_]) == input) { |
|
||||
counter_++; |
|
||||
if (keyword_[counter_] == '\0') { |
|
||||
state_ = KEYWORD_MATCHED; |
|
||||
token_ = keyword_token_; |
|
||||
} |
|
||||
return; |
|
||||
} |
|
||||
break; |
|
||||
case KEYWORD_MATCHED: |
|
||||
token_ = Token::IDENTIFIER; |
|
||||
break; |
|
||||
case C: |
|
||||
if (MatchState(input, 'a', CA)) return; |
|
||||
if (MatchState(input, 'o', CO)) return; |
|
||||
break; |
|
||||
case CA: |
|
||||
if (MatchKeywordStart(input, "case", 2, Token::CASE)) return; |
|
||||
if (MatchKeywordStart(input, "catch", 2, Token::CATCH)) return; |
|
||||
break; |
|
||||
case CO: |
|
||||
if (MatchState(input, 'n', CON)) return; |
|
||||
break; |
|
||||
case CON: |
|
||||
if (MatchKeywordStart(input, "const", 3, Token::CONST)) return; |
|
||||
if (MatchKeywordStart(input, "continue", 3, Token::CONTINUE)) return; |
|
||||
break; |
|
||||
case D: |
|
||||
if (MatchState(input, 'e', DE)) return; |
|
||||
if (MatchKeyword(input, 'o', KEYWORD_MATCHED, Token::DO)) return; |
|
||||
break; |
|
||||
case DE: |
|
||||
if (MatchKeywordStart(input, "debugger", 2, Token::DEBUGGER)) return; |
|
||||
if (MatchKeywordStart(input, "default", 2, Token::DEFAULT)) return; |
|
||||
if (MatchKeywordStart(input, "delete", 2, Token::DELETE)) return; |
|
||||
break; |
|
||||
case F: |
|
||||
if (MatchKeywordStart(input, "false", 1, Token::FALSE_LITERAL)) return; |
|
||||
if (MatchKeywordStart(input, "finally", 1, Token::FINALLY)) return; |
|
||||
if (MatchKeywordStart(input, "for", 1, Token::FOR)) return; |
|
||||
if (MatchKeywordStart(input, "function", 1, Token::FUNCTION)) return; |
|
||||
break; |
|
||||
case I: |
|
||||
if (MatchKeyword(input, 'f', KEYWORD_MATCHED, Token::IF)) return; |
|
||||
if (MatchKeyword(input, 'n', IN, Token::IN)) return; |
|
||||
break; |
|
||||
case IN: |
|
||||
token_ = Token::IDENTIFIER; |
|
||||
if (MatchKeywordStart(input, "instanceof", 2, Token::INSTANCEOF)) { |
|
||||
return; |
|
||||
} |
|
||||
break; |
|
||||
case N: |
|
||||
if (MatchKeywordStart(input, "native", 1, Token::NATIVE)) return; |
|
||||
if (MatchKeywordStart(input, "new", 1, Token::NEW)) return; |
|
||||
if (MatchKeywordStart(input, "null", 1, Token::NULL_LITERAL)) return; |
|
||||
break; |
|
||||
case T: |
|
||||
if (MatchState(input, 'h', TH)) return; |
|
||||
if (MatchState(input, 'r', TR)) return; |
|
||||
if (MatchKeywordStart(input, "typeof", 1, Token::TYPEOF)) return; |
|
||||
break; |
|
||||
case TH: |
|
||||
if (MatchKeywordStart(input, "this", 2, Token::THIS)) return; |
|
||||
if (MatchKeywordStart(input, "throw", 2, Token::THROW)) return; |
|
||||
break; |
|
||||
case TR: |
|
||||
if (MatchKeywordStart(input, "true", 2, Token::TRUE_LITERAL)) return; |
|
||||
if (MatchKeyword(input, 'y', KEYWORD_MATCHED, Token::TRY)) return; |
|
||||
break; |
|
||||
case V: |
|
||||
if (MatchKeywordStart(input, "var", 1, Token::VAR)) return; |
|
||||
if (MatchKeywordStart(input, "void", 1, Token::VOID)) return; |
|
||||
break; |
|
||||
case W: |
|
||||
if (MatchKeywordStart(input, "while", 1, Token::WHILE)) return; |
|
||||
if (MatchKeywordStart(input, "with", 1, Token::WITH)) return; |
|
||||
break; |
|
||||
case UNMATCHABLE: |
|
||||
break; |
|
||||
} |
|
||||
// On fallthrough, it's a failure.
|
|
||||
state_ = UNMATCHABLE; |
|
||||
} |
|
||||
|
|
||||
} } // namespace v8::internal
|
|
||||
@ -1,165 +0,0 @@ |
|||||
// Copyright 2010 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.
|
|
||||
|
|
||||
// Features shared by parsing and pre-parsing scanners.
|
|
||||
|
|
||||
#ifndef V8_SCANNER_BASE_H_ |
|
||||
#define V8_SCANNER_BASE_H_ |
|
||||
|
|
||||
#include "token.h" |
|
||||
#include "unicode.h" |
|
||||
|
|
||||
namespace v8 { |
|
||||
namespace internal { |
|
||||
|
|
||||
class KeywordMatcher { |
|
||||
// Incrementally recognize keywords.
|
|
||||
//
|
|
||||
// Recognized keywords:
|
|
||||
// break case catch const* continue debugger* default delete do else
|
|
||||
// finally false for function if in instanceof native* new null
|
|
||||
// return switch this throw true try typeof var void while with
|
|
||||
//
|
|
||||
// *: Actually "future reserved keywords". These are the only ones we
|
|
||||
// recognized, the remaining are allowed as identifiers.
|
|
||||
public: |
|
||||
KeywordMatcher() |
|
||||
: state_(INITIAL), |
|
||||
token_(Token::IDENTIFIER), |
|
||||
keyword_(NULL), |
|
||||
counter_(0), |
|
||||
keyword_token_(Token::ILLEGAL) {} |
|
||||
|
|
||||
Token::Value token() { return token_; } |
|
||||
|
|
||||
inline void AddChar(unibrow::uchar input) { |
|
||||
if (state_ != UNMATCHABLE) { |
|
||||
Step(input); |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
void Fail() { |
|
||||
token_ = Token::IDENTIFIER; |
|
||||
state_ = UNMATCHABLE; |
|
||||
} |
|
||||
|
|
||||
private: |
|
||||
enum State { |
|
||||
UNMATCHABLE, |
|
||||
INITIAL, |
|
||||
KEYWORD_PREFIX, |
|
||||
KEYWORD_MATCHED, |
|
||||
C, |
|
||||
CA, |
|
||||
CO, |
|
||||
CON, |
|
||||
D, |
|
||||
DE, |
|
||||
F, |
|
||||
I, |
|
||||
IN, |
|
||||
N, |
|
||||
T, |
|
||||
TH, |
|
||||
TR, |
|
||||
V, |
|
||||
W |
|
||||
}; |
|
||||
|
|
||||
struct FirstState { |
|
||||
const char* keyword; |
|
||||
State state; |
|
||||
Token::Value token; |
|
||||
}; |
|
||||
|
|
||||
// Range of possible first characters of a keyword.
|
|
||||
static const unsigned int kFirstCharRangeMin = 'b'; |
|
||||
static const unsigned int kFirstCharRangeMax = 'w'; |
|
||||
static const unsigned int kFirstCharRangeLength = |
|
||||
kFirstCharRangeMax - kFirstCharRangeMin + 1; |
|
||||
// State map for first keyword character range.
|
|
||||
static FirstState first_states_[kFirstCharRangeLength]; |
|
||||
|
|
||||
// If input equals keyword's character at position, continue matching keyword
|
|
||||
// from that position.
|
|
||||
inline bool MatchKeywordStart(unibrow::uchar input, |
|
||||
const char* keyword, |
|
||||
int position, |
|
||||
Token::Value token_if_match) { |
|
||||
if (input == static_cast<unibrow::uchar>(keyword[position])) { |
|
||||
state_ = KEYWORD_PREFIX; |
|
||||
this->keyword_ = keyword; |
|
||||
this->counter_ = position + 1; |
|
||||
this->keyword_token_ = token_if_match; |
|
||||
return true; |
|
||||
} |
|
||||
return false; |
|
||||
} |
|
||||
|
|
||||
// If input equals match character, transition to new state and return true.
|
|
||||
inline bool MatchState(unibrow::uchar input, char match, State new_state) { |
|
||||
if (input == static_cast<unibrow::uchar>(match)) { |
|
||||
state_ = new_state; |
|
||||
return true; |
|
||||
} |
|
||||
return false; |
|
||||
} |
|
||||
|
|
||||
inline bool MatchKeyword(unibrow::uchar input, |
|
||||
char match, |
|
||||
State new_state, |
|
||||
Token::Value keyword_token) { |
|
||||
if (input != static_cast<unibrow::uchar>(match)) { |
|
||||
return false; |
|
||||
} |
|
||||
state_ = new_state; |
|
||||
token_ = keyword_token; |
|
||||
return true; |
|
||||
} |
|
||||
|
|
||||
void Step(unibrow::uchar input); |
|
||||
|
|
||||
// Current state.
|
|
||||
State state_; |
|
||||
// Token for currently added characters.
|
|
||||
Token::Value token_; |
|
||||
|
|
||||
// Matching a specific keyword string (there is only one possible valid
|
|
||||
// keyword with the current prefix).
|
|
||||
const char* keyword_; |
|
||||
int counter_; |
|
||||
Token::Value keyword_token_; |
|
||||
}; |
|
||||
|
|
||||
|
|
||||
|
|
||||
|
|
||||
|
|
||||
|
|
||||
} } // namespace v8::internal
|
|
||||
|
|
||||
#endif // V8_SCANNER_BASE_H_
|
|
||||
@ -1,301 +0,0 @@ |
|||||
// Copyright 2010 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.
|
|
||||
|
|
||||
#ifndef V8_V8UTILS_H_ |
|
||||
#define V8_V8UTILS_H_ |
|
||||
|
|
||||
#include "utils.h" |
|
||||
|
|
||||
namespace v8 { |
|
||||
namespace internal { |
|
||||
|
|
||||
// ----------------------------------------------------------------------------
|
|
||||
// I/O support.
|
|
||||
|
|
||||
#if __GNUC__ >= 4 |
|
||||
// On gcc we can ask the compiler to check the types of %d-style format
|
|
||||
// specifiers and their associated arguments. TODO(erikcorry) fix this
|
|
||||
// so it works on MacOSX.
|
|
||||
#if defined(__MACH__) && defined(__APPLE__) |
|
||||
#define PRINTF_CHECKING |
|
||||
#else // MacOsX.
|
|
||||
#define PRINTF_CHECKING __attribute__ ((format (printf, 1, 2))) |
|
||||
#endif |
|
||||
#else |
|
||||
#define PRINTF_CHECKING |
|
||||
#endif |
|
||||
|
|
||||
// Our version of printf().
|
|
||||
void PRINTF_CHECKING PrintF(const char* format, ...); |
|
||||
|
|
||||
// Our version of fflush.
|
|
||||
void Flush(); |
|
||||
|
|
||||
|
|
||||
// Read a line of characters after printing the prompt to stdout. The resulting
|
|
||||
// char* needs to be disposed off with DeleteArray by the caller.
|
|
||||
char* ReadLine(const char* prompt); |
|
||||
|
|
||||
|
|
||||
// Read and return the raw bytes in a file. the size of the buffer is returned
|
|
||||
// in size.
|
|
||||
// The returned buffer must be freed by the caller.
|
|
||||
byte* ReadBytes(const char* filename, int* size, bool verbose = true); |
|
||||
|
|
||||
|
|
||||
// Write size chars from str to the file given by filename.
|
|
||||
// The file is overwritten. Returns the number of chars written.
|
|
||||
int WriteChars(const char* filename, |
|
||||
const char* str, |
|
||||
int size, |
|
||||
bool verbose = true); |
|
||||
|
|
||||
|
|
||||
// Write size bytes to the file given by filename.
|
|
||||
// The file is overwritten. Returns the number of bytes written.
|
|
||||
int WriteBytes(const char* filename, |
|
||||
const byte* bytes, |
|
||||
int size, |
|
||||
bool verbose = true); |
|
||||
|
|
||||
|
|
||||
// Write the C code
|
|
||||
// const char* <varname> = "<str>";
|
|
||||
// const int <varname>_len = <len>;
|
|
||||
// to the file given by filename. Only the first len chars are written.
|
|
||||
int WriteAsCFile(const char* filename, const char* varname, |
|
||||
const char* str, int size, bool verbose = true); |
|
||||
|
|
||||
|
|
||||
// Data structures
|
|
||||
|
|
||||
template <typename T> |
|
||||
inline Vector< Handle<Object> > HandleVector(v8::internal::Handle<T>* elms, |
|
||||
int length) { |
|
||||
return Vector< Handle<Object> >( |
|
||||
reinterpret_cast<v8::internal::Handle<Object>*>(elms), length); |
|
||||
} |
|
||||
|
|
||||
// Memory
|
|
||||
|
|
||||
// Copies data from |src| to |dst|. The data spans MUST not overlap.
|
|
||||
inline void CopyWords(Object** dst, Object** src, int num_words) { |
|
||||
ASSERT(Min(dst, src) + num_words <= Max(dst, src)); |
|
||||
ASSERT(num_words > 0); |
|
||||
|
|
||||
// Use block copying memcpy if the segment we're copying is
|
|
||||
// enough to justify the extra call/setup overhead.
|
|
||||
static const int kBlockCopyLimit = 16; |
|
||||
|
|
||||
if (num_words >= kBlockCopyLimit) { |
|
||||
memcpy(dst, src, num_words * kPointerSize); |
|
||||
} else { |
|
||||
int remaining = num_words; |
|
||||
do { |
|
||||
remaining--; |
|
||||
*dst++ = *src++; |
|
||||
} while (remaining > 0); |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
|
|
||||
template <typename T> |
|
||||
static inline void MemsetPointer(T** dest, T* value, int counter) { |
|
||||
#if defined(V8_HOST_ARCH_IA32) |
|
||||
#define STOS "stosl" |
|
||||
#elif defined(V8_HOST_ARCH_X64) |
|
||||
#define STOS "stosq" |
|
||||
#endif |
|
||||
|
|
||||
#if defined(__GNUC__) && defined(STOS) |
|
||||
asm volatile( |
|
||||
"cld;" |
|
||||
"rep ; " STOS |
|
||||
: "+&c" (counter), "+&D" (dest) |
|
||||
: "a" (value) |
|
||||
: "memory", "cc"); |
|
||||
#else |
|
||||
for (int i = 0; i < counter; i++) { |
|
||||
dest[i] = value; |
|
||||
} |
|
||||
#endif |
|
||||
|
|
||||
#undef STOS |
|
||||
} |
|
||||
|
|
||||
|
|
||||
// Simple wrapper that allows an ExternalString to refer to a
|
|
||||
// Vector<const char>. Doesn't assume ownership of the data.
|
|
||||
class AsciiStringAdapter: public v8::String::ExternalAsciiStringResource { |
|
||||
public: |
|
||||
explicit AsciiStringAdapter(Vector<const char> data) : data_(data) {} |
|
||||
|
|
||||
virtual const char* data() const { return data_.start(); } |
|
||||
|
|
||||
virtual size_t length() const { return data_.length(); } |
|
||||
|
|
||||
private: |
|
||||
Vector<const char> data_; |
|
||||
}; |
|
||||
|
|
||||
|
|
||||
// Simple support to read a file into a 0-terminated C-string.
|
|
||||
// The returned buffer must be freed by the caller.
|
|
||||
// On return, *exits tells whether the file existed.
|
|
||||
Vector<const char> ReadFile(const char* filename, |
|
||||
bool* exists, |
|
||||
bool verbose = true); |
|
||||
|
|
||||
|
|
||||
// Helper class for building result strings in a character buffer. The
|
|
||||
// purpose of the class is to use safe operations that checks the
|
|
||||
// buffer bounds on all operations in debug mode.
|
|
||||
class StringBuilder { |
|
||||
public: |
|
||||
// Create a string builder with a buffer of the given size. The
|
|
||||
// buffer is allocated through NewArray<char> and must be
|
|
||||
// deallocated by the caller of Finalize().
|
|
||||
explicit StringBuilder(int size); |
|
||||
|
|
||||
StringBuilder(char* buffer, int size) |
|
||||
: buffer_(buffer, size), position_(0) { } |
|
||||
|
|
||||
~StringBuilder() { if (!is_finalized()) Finalize(); } |
|
||||
|
|
||||
int size() const { return buffer_.length(); } |
|
||||
|
|
||||
// Get the current position in the builder.
|
|
||||
int position() const { |
|
||||
ASSERT(!is_finalized()); |
|
||||
return position_; |
|
||||
} |
|
||||
|
|
||||
// Reset the position.
|
|
||||
void Reset() { position_ = 0; } |
|
||||
|
|
||||
// Add a single character to the builder. It is not allowed to add
|
|
||||
// 0-characters; use the Finalize() method to terminate the string
|
|
||||
// instead.
|
|
||||
void AddCharacter(char c) { |
|
||||
ASSERT(c != '\0'); |
|
||||
ASSERT(!is_finalized() && position_ < buffer_.length()); |
|
||||
buffer_[position_++] = c; |
|
||||
} |
|
||||
|
|
||||
// Add an entire string to the builder. Uses strlen() internally to
|
|
||||
// compute the length of the input string.
|
|
||||
void AddString(const char* s); |
|
||||
|
|
||||
// Add the first 'n' characters of the given string 's' to the
|
|
||||
// builder. The input string must have enough characters.
|
|
||||
void AddSubstring(const char* s, int n); |
|
||||
|
|
||||
// Add formatted contents to the builder just like printf().
|
|
||||
void AddFormatted(const char* format, ...); |
|
||||
|
|
||||
// Add character padding to the builder. If count is non-positive,
|
|
||||
// nothing is added to the builder.
|
|
||||
void AddPadding(char c, int count); |
|
||||
|
|
||||
// Finalize the string by 0-terminating it and returning the buffer.
|
|
||||
char* Finalize(); |
|
||||
|
|
||||
private: |
|
||||
Vector<char> buffer_; |
|
||||
int position_; |
|
||||
|
|
||||
bool is_finalized() const { return position_ < 0; } |
|
||||
|
|
||||
DISALLOW_IMPLICIT_CONSTRUCTORS(StringBuilder); |
|
||||
}; |
|
||||
|
|
||||
|
|
||||
// Custom memcpy implementation for platforms where the standard version
|
|
||||
// may not be good enough.
|
|
||||
#if defined(V8_TARGET_ARCH_IA32) |
|
||||
|
|
||||
// The default memcpy on ia32 architectures is generally not as efficient
|
|
||||
// as possible. (If any further ia32 platforms are introduced where the
|
|
||||
// memcpy function is efficient, exclude them from this branch).
|
|
||||
|
|
||||
typedef void (*MemCopyFunction)(void* dest, const void* src, size_t size); |
|
||||
|
|
||||
// Implemented in codegen-<arch>.cc.
|
|
||||
MemCopyFunction CreateMemCopyFunction(); |
|
||||
|
|
||||
// Copy memory area to disjoint memory area.
|
|
||||
static inline void MemCopy(void* dest, const void* src, size_t size) { |
|
||||
static MemCopyFunction memcopy = CreateMemCopyFunction(); |
|
||||
(*memcopy)(dest, src, size); |
|
||||
#ifdef DEBUG |
|
||||
CHECK_EQ(0, memcmp(dest, src, size)); |
|
||||
#endif |
|
||||
} |
|
||||
|
|
||||
// Limit below which the extra overhead of the MemCopy function is likely
|
|
||||
// to outweigh the benefits of faster copying.
|
|
||||
static const int kMinComplexMemCopy = 64; |
|
||||
|
|
||||
#else // V8_TARGET_ARCH_IA32
|
|
||||
|
|
||||
static inline void MemCopy(void* dest, const void* src, size_t size) { |
|
||||
memcpy(dest, src, size); |
|
||||
} |
|
||||
|
|
||||
static const int kMinComplexMemCopy = 256; |
|
||||
|
|
||||
#endif // V8_TARGET_ARCH_IA32
|
|
||||
|
|
||||
|
|
||||
// Copy from ASCII/16bit chars to ASCII/16bit chars.
|
|
||||
template <typename sourcechar, typename sinkchar> |
|
||||
static inline void CopyChars(sinkchar* dest, const sourcechar* src, int chars) { |
|
||||
sinkchar* limit = dest + chars; |
|
||||
#ifdef V8_HOST_CAN_READ_UNALIGNED |
|
||||
if (sizeof(*dest) == sizeof(*src)) { |
|
||||
if (chars >= static_cast<int>(kMinComplexMemCopy / sizeof(*dest))) { |
|
||||
MemCopy(dest, src, chars * sizeof(*dest)); |
|
||||
return; |
|
||||
} |
|
||||
// Number of characters in a uintptr_t.
|
|
||||
static const int kStepSize = sizeof(uintptr_t) / sizeof(*dest); // NOLINT
|
|
||||
while (dest <= limit - kStepSize) { |
|
||||
*reinterpret_cast<uintptr_t*>(dest) = |
|
||||
*reinterpret_cast<const uintptr_t*>(src); |
|
||||
dest += kStepSize; |
|
||||
src += kStepSize; |
|
||||
} |
|
||||
} |
|
||||
#endif |
|
||||
while (dest < limit) { |
|
||||
*dest++ = static_cast<sinkchar>(*src++); |
|
||||
} |
|
||||
} |
|
||||
|
|
||||
} } // namespace v8::internal
|
|
||||
|
|
||||
#endif // V8_V8UTILS_H_
|
|
||||
File diff suppressed because it is too large
@ -1,33 +0,0 @@ |
|||||
// Copyright 2010 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.
|
|
||||
|
|
||||
function a1() { |
|
||||
var a2 = -1756315459; |
|
||||
return ((((a2 & a2) ^ 1) * a2) << -10); |
|
||||
} |
|
||||
|
|
||||
assertEquals(a1(), -2147483648); |
|
||||
@ -1,95 +0,0 @@ |
|||||
// Copyright 2010 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.
|
|
||||
|
|
||||
// Flags: --always-full-compiler
|
|
||||
|
|
||||
var functionToCatch; |
|
||||
var lineNumber; |
|
||||
|
|
||||
function catchLineNumber () { |
|
||||
var x = {}; |
|
||||
|
|
||||
Error.prepareStackTrace = function (error, stackTrace) { |
|
||||
stackTrace.some(function (frame) { |
|
||||
if (frame.getFunction() == functionToCatch) { |
|
||||
lineNumber = frame.getLineNumber(); |
|
||||
return true; |
|
||||
} |
|
||||
return false; |
|
||||
}); |
|
||||
return lineNumber; |
|
||||
}; |
|
||||
|
|
||||
Error.captureStackTrace(x); |
|
||||
return x.stack; |
|
||||
} |
|
||||
|
|
||||
function log() { |
|
||||
catchLineNumber(); |
|
||||
} |
|
||||
|
|
||||
function foo() {} |
|
||||
|
|
||||
function test1() { |
|
||||
log(foo() == foo() |
|
||||
? 'a' |
|
||||
: 'b'); |
|
||||
} |
|
||||
|
|
||||
function test2() { |
|
||||
var o = { foo: function () {}} |
|
||||
log(o.foo() == o.foo() |
|
||||
? 'a' |
|
||||
: 'b'); |
|
||||
} |
|
||||
|
|
||||
function test3() { |
|
||||
var o = { log: log, foo: function() { } }; |
|
||||
o.log(o.foo() == o.foo() |
|
||||
? 'a' |
|
||||
: 'b'); |
|
||||
|
|
||||
} |
|
||||
|
|
||||
function test(f, expectedLineNumber) { |
|
||||
functionToCatch = f; |
|
||||
f(); |
|
||||
|
|
||||
assertEquals(expectedLineNumber, lineNumber); |
|
||||
} |
|
||||
|
|
||||
test(test1, 58); |
|
||||
test(test2, 65); |
|
||||
test(test3, 72); |
|
||||
|
|
||||
eval(test1.toString() + "//@ sourceUrl=foo"); |
|
||||
eval(test2.toString() + "//@ sourceUrl=foo"); |
|
||||
eval(test3.toString() + "//@ sourceUrl=foo"); |
|
||||
|
|
||||
test(test1, 2); |
|
||||
test(test2, 3); |
|
||||
test(test3, 3); |
|
||||
Loading…
Reference in new issue