2011-05-03 08:23:58 +00:00
|
|
|
// Copyright 2011 the V8 project authors. All rights reserved.
|
2008-08-22 13:33:59 +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 <stdlib.h>
|
|
|
|
|
2014-08-05 13:23:55 +00:00
|
|
|
#include <vector>
|
|
|
|
|
2021-08-23 13:01:06 +00:00
|
|
|
#include "include/v8-initialization.h"
|
2019-05-17 12:13:44 +00:00
|
|
|
#include "src/api/api-inl.h"
|
2019-11-15 11:58:57 +00:00
|
|
|
#include "src/base/bit-field.h"
|
2014-06-30 13:25:46 +00:00
|
|
|
#include "src/base/platform/platform.h"
|
2021-08-23 13:01:06 +00:00
|
|
|
#include "src/init/v8.h"
|
2019-05-15 18:28:45 +00:00
|
|
|
#include "src/numbers/conversions.h"
|
2014-06-03 08:12:43 +00:00
|
|
|
#include "test/cctest/cctest.h"
|
2019-05-16 09:43:58 +00:00
|
|
|
#include "test/cctest/collector.h"
|
2008-08-22 13:33:59 +00:00
|
|
|
|
2017-08-11 11:22:28 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
2008-08-22 13:33:59 +00:00
|
|
|
|
|
|
|
TEST(Utils1) {
|
|
|
|
CHECK_EQ(-1000000, FastD2I(-1000000.0));
|
|
|
|
CHECK_EQ(-1, FastD2I(-1.0));
|
|
|
|
CHECK_EQ(0, FastD2I(0.0));
|
|
|
|
CHECK_EQ(1, FastD2I(1.0));
|
|
|
|
CHECK_EQ(1000000, FastD2I(1000000.0));
|
|
|
|
|
|
|
|
CHECK_EQ(-1000000, FastD2I(-1000000.123));
|
|
|
|
CHECK_EQ(-1, FastD2I(-1.234));
|
|
|
|
CHECK_EQ(0, FastD2I(0.345));
|
|
|
|
CHECK_EQ(1, FastD2I(1.234));
|
|
|
|
CHECK_EQ(1000000, FastD2I(1000000.123));
|
2009-05-29 12:14:54 +00:00
|
|
|
// Check that >> is implemented as arithmetic shift right.
|
|
|
|
// If this is not true, then ArithmeticShiftRight() must be changed,
|
|
|
|
// There are also documented right shifts in assembler.cc of
|
|
|
|
// int8_t and intptr_t signed integers.
|
|
|
|
CHECK_EQ(-2, -8 >> 2);
|
|
|
|
CHECK_EQ(-2, static_cast<int8_t>(-8) >> 2);
|
2009-09-01 15:28:31 +00:00
|
|
|
CHECK_EQ(-2, static_cast<int>(static_cast<intptr_t>(-8) >> 2));
|
2012-07-30 08:34:26 +00:00
|
|
|
|
|
|
|
CHECK_EQ(-1000000, FastD2IChecked(-1000000.0));
|
|
|
|
CHECK_EQ(-1, FastD2IChecked(-1.0));
|
|
|
|
CHECK_EQ(0, FastD2IChecked(0.0));
|
|
|
|
CHECK_EQ(1, FastD2IChecked(1.0));
|
|
|
|
CHECK_EQ(1000000, FastD2IChecked(1000000.0));
|
|
|
|
|
|
|
|
CHECK_EQ(-1000000, FastD2IChecked(-1000000.123));
|
|
|
|
CHECK_EQ(-1, FastD2IChecked(-1.234));
|
|
|
|
CHECK_EQ(0, FastD2IChecked(0.345));
|
|
|
|
CHECK_EQ(1, FastD2IChecked(1.234));
|
|
|
|
CHECK_EQ(1000000, FastD2IChecked(1000000.123));
|
|
|
|
|
|
|
|
CHECK_EQ(INT_MAX, FastD2IChecked(1.0e100));
|
|
|
|
CHECK_EQ(INT_MIN, FastD2IChecked(-1.0e100));
|
2015-01-21 14:38:49 +00:00
|
|
|
CHECK_EQ(INT_MIN, FastD2IChecked(std::numeric_limits<double>::quiet_NaN()));
|
2008-08-22 13:33:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-10-27 16:34:28 +00:00
|
|
|
TEST(BitSetComputer) {
|
2019-11-15 11:58:57 +00:00
|
|
|
using BoolComputer = base::BitSetComputer<bool, 1, kSmiValueSize, uint32_t>;
|
2014-10-27 16:34:28 +00:00
|
|
|
CHECK_EQ(0, BoolComputer::word_count(0));
|
|
|
|
CHECK_EQ(1, BoolComputer::word_count(8));
|
|
|
|
CHECK_EQ(2, BoolComputer::word_count(50));
|
|
|
|
CHECK_EQ(0, BoolComputer::index(0, 8));
|
|
|
|
CHECK_EQ(100, BoolComputer::index(100, 8));
|
|
|
|
CHECK_EQ(1, BoolComputer::index(0, 40));
|
|
|
|
uint32_t data = 0;
|
|
|
|
data = BoolComputer::encode(data, 1, true);
|
|
|
|
data = BoolComputer::encode(data, 4, true);
|
2017-02-07 14:20:02 +00:00
|
|
|
CHECK(BoolComputer::decode(data, 1));
|
|
|
|
CHECK(BoolComputer::decode(data, 4));
|
|
|
|
CHECK(!BoolComputer::decode(data, 0));
|
|
|
|
CHECK(!BoolComputer::decode(data, 2));
|
|
|
|
CHECK(!BoolComputer::decode(data, 3));
|
2014-10-27 16:34:28 +00:00
|
|
|
|
|
|
|
// Lets store 2 bits per item with 3000 items and verify the values are
|
|
|
|
// correct.
|
2019-11-15 11:58:57 +00:00
|
|
|
using TwoBits = base::BitSetComputer<unsigned char, 2, 8, unsigned char>;
|
2014-10-27 16:34:28 +00:00
|
|
|
const int words = 750;
|
|
|
|
CHECK_EQ(words, TwoBits::word_count(3000));
|
|
|
|
const int offset = 10;
|
2021-06-17 15:43:55 +00:00
|
|
|
base::Vector<unsigned char> buffer =
|
|
|
|
base::Vector<unsigned char>::New(offset + words);
|
2019-04-29 11:06:49 +00:00
|
|
|
memset(buffer.begin(), 0, sizeof(unsigned char) * buffer.length());
|
2014-10-27 16:34:28 +00:00
|
|
|
for (int i = 0; i < words; i++) {
|
|
|
|
const int index = TwoBits::index(offset, i);
|
|
|
|
unsigned char data = buffer[index];
|
|
|
|
data = TwoBits::encode(data, i, i % 4);
|
|
|
|
buffer[index] = data;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 0; i < words; i++) {
|
|
|
|
const int index = TwoBits::index(offset, i);
|
|
|
|
unsigned char data = buffer[index];
|
|
|
|
CHECK_EQ(i % 4, TwoBits::decode(data, i));
|
|
|
|
}
|
2014-10-28 08:34:11 +00:00
|
|
|
buffer.Dispose();
|
2014-10-27 16:34:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-08-22 13:33:59 +00:00
|
|
|
TEST(SNPrintF) {
|
|
|
|
// Make sure that strings that are truncated because of too small
|
|
|
|
// buffers are zero-terminated anyway.
|
|
|
|
const char* s = "the quick lazy .... oh forget it!";
|
2019-04-29 14:56:08 +00:00
|
|
|
int length = static_cast<int>(strlen(s));
|
2008-08-22 13:33:59 +00:00
|
|
|
for (int i = 1; i < length * 2; i++) {
|
|
|
|
static const char kMarker = static_cast<char>(42);
|
2021-06-17 15:43:55 +00:00
|
|
|
base::Vector<char> buffer = base::Vector<char>::New(i + 1);
|
2008-08-22 13:33:59 +00:00
|
|
|
buffer[i] = kMarker;
|
2021-06-17 15:43:55 +00:00
|
|
|
int n = SNPrintF(base::Vector<char>(buffer.begin(), i), "%s", s);
|
2008-08-22 13:33:59 +00:00
|
|
|
CHECK(n <= i);
|
|
|
|
CHECK(n == length || n == -1);
|
2019-04-29 11:06:49 +00:00
|
|
|
CHECK_EQ(0, strncmp(buffer.begin(), s, i - 1));
|
2008-08-22 13:33:59 +00:00
|
|
|
CHECK_EQ(kMarker, buffer[i]);
|
|
|
|
if (i <= length) {
|
2019-04-29 14:56:08 +00:00
|
|
|
CHECK_EQ(i - 1, strlen(buffer.begin()));
|
2008-08-22 13:33:59 +00:00
|
|
|
} else {
|
2019-04-29 14:56:08 +00:00
|
|
|
CHECK_EQ(length, strlen(buffer.begin()));
|
2008-08-22 13:33:59 +00:00
|
|
|
}
|
2009-03-16 07:53:20 +00:00
|
|
|
buffer.Dispose();
|
2008-08-22 13:33:59 +00:00
|
|
|
}
|
|
|
|
}
|
2010-06-04 11:30:55 +00:00
|
|
|
|
|
|
|
|
2013-04-16 12:30:51 +00:00
|
|
|
static const int kAreaSize = 512;
|
|
|
|
|
|
|
|
|
|
|
|
void TestMemMove(byte* area1,
|
|
|
|
byte* area2,
|
|
|
|
int src_offset,
|
|
|
|
int dest_offset,
|
|
|
|
int length) {
|
|
|
|
for (int i = 0; i < kAreaSize; i++) {
|
|
|
|
area1[i] = i & 0xFF;
|
|
|
|
area2[i] = i & 0xFF;
|
|
|
|
}
|
2014-05-27 07:57:22 +00:00
|
|
|
MemMove(area1 + dest_offset, area1 + src_offset, length);
|
2013-10-28 09:59:15 +00:00
|
|
|
memmove(area2 + dest_offset, area2 + src_offset, length);
|
|
|
|
if (memcmp(area1, area2, kAreaSize) != 0) {
|
2014-05-27 07:57:22 +00:00
|
|
|
printf("MemMove(): src_offset: %d, dest_offset: %d, length: %d\n",
|
2013-04-16 12:30:51 +00:00
|
|
|
src_offset, dest_offset, length);
|
|
|
|
for (int i = 0; i < kAreaSize; i++) {
|
2013-10-28 09:59:15 +00:00
|
|
|
if (area1[i] == area2[i]) continue;
|
2014-05-27 07:57:22 +00:00
|
|
|
printf("diff at offset %d (%p): is %d, should be %d\n", i,
|
|
|
|
reinterpret_cast<void*>(area1 + i), area1[i], area2[i]);
|
2013-04-16 12:30:51 +00:00
|
|
|
}
|
2017-12-19 11:39:50 +00:00
|
|
|
FATAL("memmove error");
|
2010-06-04 11:30:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-04-16 12:30:51 +00:00
|
|
|
TEST(MemMove) {
|
2011-03-31 16:17:37 +00:00
|
|
|
v8::V8::Initialize();
|
2013-04-16 12:30:51 +00:00
|
|
|
byte* area1 = new byte[kAreaSize];
|
|
|
|
byte* area2 = new byte[kAreaSize];
|
|
|
|
|
|
|
|
static const int kMinOffset = 32;
|
|
|
|
static const int kMaxOffset = 64;
|
|
|
|
static const int kMaxLength = 128;
|
|
|
|
STATIC_ASSERT(kMaxOffset + kMaxLength < kAreaSize);
|
|
|
|
|
|
|
|
for (int src_offset = kMinOffset; src_offset <= kMaxOffset; src_offset++) {
|
|
|
|
for (int dst_offset = kMinOffset; dst_offset <= kMaxOffset; dst_offset++) {
|
|
|
|
for (int length = 0; length <= kMaxLength; length++) {
|
2013-10-28 09:59:15 +00:00
|
|
|
TestMemMove(area1, area2, src_offset, dst_offset, length);
|
2013-04-16 12:30:51 +00:00
|
|
|
}
|
2010-06-04 11:30:55 +00:00
|
|
|
}
|
|
|
|
}
|
2013-04-16 12:30:51 +00:00
|
|
|
delete[] area1;
|
|
|
|
delete[] area2;
|
2010-06-04 11:30:55 +00:00
|
|
|
}
|
2010-08-24 10:53:44 +00:00
|
|
|
|
|
|
|
|
|
|
|
TEST(Collector) {
|
|
|
|
Collector<int> collector(8);
|
|
|
|
const int kLoops = 5;
|
|
|
|
const int kSequentialSize = 1000;
|
|
|
|
const int kBlockSize = 7;
|
|
|
|
for (int loop = 0; loop < kLoops; loop++) {
|
2021-06-17 15:43:55 +00:00
|
|
|
base::Vector<int> block = collector.AddBlock(7, 0xBADCAFE);
|
2010-08-24 10:53:44 +00:00
|
|
|
for (int i = 0; i < kSequentialSize; i++) {
|
|
|
|
collector.Add(i);
|
|
|
|
}
|
|
|
|
for (int i = 0; i < kBlockSize - 1; i++) {
|
|
|
|
block[i] = i * 7;
|
|
|
|
}
|
|
|
|
}
|
2021-06-17 15:43:55 +00:00
|
|
|
base::Vector<int> result = collector.ToVector();
|
2010-08-24 10:53:44 +00:00
|
|
|
CHECK_EQ(kLoops * (kBlockSize + kSequentialSize), result.length());
|
|
|
|
for (int i = 0; i < kLoops; i++) {
|
|
|
|
int offset = i * (kSequentialSize + kBlockSize);
|
|
|
|
for (int j = 0; j < kBlockSize - 1; j++) {
|
|
|
|
CHECK_EQ(j * 7, result[offset + j]);
|
|
|
|
}
|
2017-12-02 00:30:37 +00:00
|
|
|
CHECK_EQ(0xBADCAFE, result[offset + kBlockSize - 1]);
|
2010-08-24 10:53:44 +00:00
|
|
|
for (int j = 0; j < kSequentialSize; j++) {
|
|
|
|
CHECK_EQ(j, result[offset + kBlockSize + j]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
result.Dispose();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
TEST(SequenceCollector) {
|
|
|
|
SequenceCollector<int> collector(8);
|
|
|
|
const int kLoops = 5000;
|
|
|
|
const int kMaxSequenceSize = 13;
|
|
|
|
int total_length = 0;
|
|
|
|
for (int loop = 0; loop < kLoops; loop++) {
|
|
|
|
int seq_length = loop % kMaxSequenceSize;
|
|
|
|
collector.StartSequence();
|
|
|
|
for (int j = 0; j < seq_length; j++) {
|
|
|
|
collector.Add(j);
|
|
|
|
}
|
2021-06-17 15:43:55 +00:00
|
|
|
base::Vector<int> sequence = collector.EndSequence();
|
2010-08-24 10:53:44 +00:00
|
|
|
for (int j = 0; j < seq_length; j++) {
|
|
|
|
CHECK_EQ(j, sequence[j]);
|
|
|
|
}
|
|
|
|
total_length += seq_length;
|
|
|
|
}
|
2021-06-17 15:43:55 +00:00
|
|
|
base::Vector<int> result = collector.ToVector();
|
2010-08-24 10:53:44 +00:00
|
|
|
CHECK_EQ(total_length, result.length());
|
|
|
|
int offset = 0;
|
|
|
|
for (int loop = 0; loop < kLoops; loop++) {
|
|
|
|
int seq_length = loop % kMaxSequenceSize;
|
|
|
|
for (int j = 0; j < seq_length; j++) {
|
|
|
|
CHECK_EQ(j, result[offset]);
|
|
|
|
offset++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
result.Dispose();
|
|
|
|
}
|
2011-09-08 13:44:11 +00:00
|
|
|
|
|
|
|
|
|
|
|
TEST(SequenceCollectorRegression) {
|
|
|
|
SequenceCollector<char> collector(16);
|
|
|
|
collector.StartSequence();
|
|
|
|
collector.Add('0');
|
|
|
|
collector.AddBlock(
|
2021-06-17 15:43:55 +00:00
|
|
|
base::Vector<const char>("12345678901234567890123456789012", 32));
|
|
|
|
base::Vector<char> seq = collector.EndSequence();
|
2019-04-29 11:06:49 +00:00
|
|
|
CHECK_EQ(0, strncmp("0123456789012345678901234567890123", seq.begin(),
|
|
|
|
seq.length()));
|
2011-09-08 13:44:11 +00:00
|
|
|
}
|
2014-08-05 13:23:55 +00:00
|
|
|
|
|
|
|
|
|
|
|
TEST(CPlusPlus11Features) {
|
|
|
|
struct S {
|
|
|
|
bool x;
|
|
|
|
struct T {
|
|
|
|
double y;
|
|
|
|
int z[3];
|
|
|
|
} t;
|
|
|
|
};
|
|
|
|
S s{true, {3.1415, {1, 2, 3}}};
|
|
|
|
CHECK_EQ(2, s.t.z[1]);
|
|
|
|
|
|
|
|
std::vector<int> vec{11, 22, 33, 44};
|
|
|
|
vec.push_back(55);
|
|
|
|
vec.push_back(66);
|
|
|
|
for (auto& i : vec) {
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
int j = 12;
|
|
|
|
for (auto i : vec) {
|
|
|
|
CHECK_EQ(j, i);
|
|
|
|
j += 11;
|
|
|
|
}
|
|
|
|
}
|
2017-08-11 11:22:28 +00:00
|
|
|
|
|
|
|
} // namespace internal
|
|
|
|
} // namespace v8
|