2008-09-09 20:08:45 +00:00
// Copyright 2006-2008 the V8 project authors. All rights reserved.
2008-08-22 13:33:59 +00:00
// Check that we can traverse very deep stacks of ConsStrings using
// StringInputBuffer. Check that Get(int) works on very deep stacks
// of ConsStrings. These operations may not be very fast, but they
// should be possible without getting errors due to too deep recursion.
# include <stdlib.h>
# include "v8.h"
2009-05-05 07:02:25 +00:00
# include "api.h"
2008-08-22 13:33:59 +00:00
# include "factory.h"
# include "cctest.h"
2009-03-27 00:24:49 +00:00
# include "zone-inl.h"
2008-08-22 13:33:59 +00:00
unsigned int seed = 123 ;
static uint32_t gen ( ) {
uint64_t z ;
z = seed ;
z * = 279470273 ;
z % = 4294967291U ;
seed = static_cast < unsigned int > ( z ) ;
return static_cast < uint32_t > ( seed > > 16 ) ;
}
using namespace v8 : : internal ;
static v8 : : Persistent < v8 : : Context > env ;
static void InitializeVM ( ) {
if ( env . IsEmpty ( ) ) {
v8 : : HandleScope scope ;
const char * extensions [ ] = { " v8/print " } ;
v8 : : ExtensionConfiguration config ( 1 , extensions ) ;
env = v8 : : Context : : New ( & config ) ;
}
v8 : : HandleScope scope ;
env - > Enter ( ) ;
}
static const int NUMBER_OF_BUILDING_BLOCKS = 128 ;
static const int DEEP_DEPTH = 8 * 1024 ;
static const int SUPER_DEEP_DEPTH = 80 * 1024 ;
2009-09-15 11:11:09 +00:00
class Resource : public v8 : : String : : ExternalStringResource ,
public ZoneObject {
public :
explicit Resource ( Vector < const uc16 > string ) : data_ ( string . start ( ) ) {
length_ = string . length ( ) ;
}
virtual const uint16_t * data ( ) const { return data_ ; }
virtual size_t length ( ) const { return length_ ; }
private :
const uc16 * data_ ;
size_t length_ ;
} ;
2009-12-02 12:58:10 +00:00
class AsciiResource : public v8 : : String : : ExternalAsciiStringResource ,
public ZoneObject {
public :
explicit AsciiResource ( Vector < const char > string ) : data_ ( string . start ( ) ) {
length_ = string . length ( ) ;
}
virtual const char * data ( ) const { return data_ ; }
virtual size_t length ( ) const { return length_ ; }
private :
const char * data_ ;
size_t length_ ;
} ;
2008-08-22 13:33:59 +00:00
static void InitializeBuildingBlocks (
Handle < String > building_blocks [ NUMBER_OF_BUILDING_BLOCKS ] ) {
2009-03-27 00:24:49 +00:00
// A list of pointers that we don't have any interest in cleaning up.
// If they are reachable from a root then leak detection won't complain.
2008-08-22 13:33:59 +00:00
for ( int i = 0 ; i < NUMBER_OF_BUILDING_BLOCKS ; i + + ) {
int len = gen ( ) % 16 ;
if ( len > 14 ) {
len + = 1234 ;
}
switch ( gen ( ) % 4 ) {
case 0 : {
uc16 buf [ 2000 ] ;
for ( int j = 0 ; j < len ; j + + ) {
buf [ j ] = gen ( ) % 65536 ;
}
building_blocks [ i ] =
Factory : : NewStringFromTwoByte ( Vector < const uc16 > ( buf , len ) ) ;
for ( int j = 0 ; j < len ; j + + ) {
2009-03-17 09:33:06 +00:00
CHECK_EQ ( buf [ j ] , building_blocks [ i ] - > Get ( j ) ) ;
2008-08-22 13:33:59 +00:00
}
break ;
}
case 1 : {
char buf [ 2000 ] ;
for ( int j = 0 ; j < len ; j + + ) {
buf [ j ] = gen ( ) % 128 ;
}
building_blocks [ i ] =
Factory : : NewStringFromAscii ( Vector < const char > ( buf , len ) ) ;
for ( int j = 0 ; j < len ; j + + ) {
2009-03-17 09:33:06 +00:00
CHECK_EQ ( buf [ j ] , building_blocks [ i ] - > Get ( j ) ) ;
2008-08-22 13:33:59 +00:00
}
break ;
}
case 2 : {
2009-03-27 00:24:49 +00:00
uc16 * buf = Zone : : NewArray < uc16 > ( len ) ;
2008-08-22 13:33:59 +00:00
for ( int j = 0 ; j < len ; j + + ) {
buf [ j ] = gen ( ) % 65536 ;
}
Resource * resource = new Resource ( Vector < const uc16 > ( buf , len ) ) ;
building_blocks [ i ] = Factory : : NewExternalStringFromTwoByte ( resource ) ;
for ( int j = 0 ; j < len ; j + + ) {
2009-03-17 09:33:06 +00:00
CHECK_EQ ( buf [ j ] , building_blocks [ i ] - > Get ( j ) ) ;
2008-08-22 13:33:59 +00:00
}
break ;
}
case 3 : {
char * buf = NewArray < char > ( len ) ;
for ( int j = 0 ; j < len ; j + + ) {
buf [ j ] = gen ( ) % 128 ;
}
building_blocks [ i ] =
Factory : : NewStringFromAscii ( Vector < const char > ( buf , len ) ) ;
for ( int j = 0 ; j < len ; j + + ) {
2009-03-17 09:33:06 +00:00
CHECK_EQ ( buf [ j ] , building_blocks [ i ] - > Get ( j ) ) ;
2008-08-22 13:33:59 +00:00
}
2009-03-16 07:53:20 +00:00
DeleteArray < char > ( buf ) ;
2008-08-22 13:33:59 +00:00
break ;
}
}
}
}
static Handle < String > ConstructLeft (
Handle < String > building_blocks [ NUMBER_OF_BUILDING_BLOCKS ] ,
int depth ) {
Handle < String > answer = Factory : : NewStringFromAscii ( CStrVector ( " " ) ) ;
for ( int i = 0 ; i < depth ; i + + ) {
2008-11-03 10:16:05 +00:00
answer = Factory : : NewConsString (
answer ,
2009-03-17 09:33:06 +00:00
building_blocks [ i % NUMBER_OF_BUILDING_BLOCKS ] ) ;
2008-08-22 13:33:59 +00:00
}
return answer ;
}
static Handle < String > ConstructRight (
Handle < String > building_blocks [ NUMBER_OF_BUILDING_BLOCKS ] ,
int depth ) {
Handle < String > answer = Factory : : NewStringFromAscii ( CStrVector ( " " ) ) ;
for ( int i = depth - 1 ; i > = 0 ; i - - ) {
2008-11-03 10:16:05 +00:00
answer = Factory : : NewConsString (
building_blocks [ i % NUMBER_OF_BUILDING_BLOCKS ] ,
2009-03-17 09:33:06 +00:00
answer ) ;
2008-08-22 13:33:59 +00:00
}
return answer ;
}
static Handle < String > ConstructBalancedHelper (
Handle < String > building_blocks [ NUMBER_OF_BUILDING_BLOCKS ] ,
int from ,
int to ) {
2009-04-24 14:29:42 +00:00
CHECK ( to > from ) ;
2008-08-22 13:33:59 +00:00
if ( to - from = = 1 ) {
return building_blocks [ from % NUMBER_OF_BUILDING_BLOCKS ] ;
}
if ( to - from = = 2 ) {
return Factory : : NewConsString (
building_blocks [ from % NUMBER_OF_BUILDING_BLOCKS ] ,
2009-03-17 09:33:06 +00:00
building_blocks [ ( from + 1 ) % NUMBER_OF_BUILDING_BLOCKS ] ) ;
2008-08-22 13:33:59 +00:00
}
2008-11-03 10:16:05 +00:00
Handle < String > part1 =
ConstructBalancedHelper ( building_blocks , from , from + ( ( to - from ) / 2 ) ) ;
Handle < String > part2 =
ConstructBalancedHelper ( building_blocks , from + ( ( to - from ) / 2 ) , to ) ;
2009-03-17 09:33:06 +00:00
return Factory : : NewConsString ( part1 , part2 ) ;
2008-08-22 13:33:59 +00:00
}
static Handle < String > ConstructBalanced (
Handle < String > building_blocks [ NUMBER_OF_BUILDING_BLOCKS ] ) {
return ConstructBalancedHelper ( building_blocks , 0 , DEEP_DEPTH ) ;
}
static StringInputBuffer buffer ;
static void Traverse ( Handle < String > s1 , Handle < String > s2 ) {
int i = 0 ;
buffer . Reset ( * s1 ) ;
StringInputBuffer buffer2 ( * s2 ) ;
while ( buffer . has_more ( ) ) {
CHECK ( buffer2 . has_more ( ) ) ;
uint16_t c = buffer . GetNext ( ) ;
CHECK_EQ ( c , buffer2 . GetNext ( ) ) ;
i + + ;
}
CHECK_EQ ( s1 - > length ( ) , i ) ;
CHECK_EQ ( s2 - > length ( ) , i ) ;
}
static void TraverseFirst ( Handle < String > s1 , Handle < String > s2 , int chars ) {
int i = 0 ;
buffer . Reset ( * s1 ) ;
StringInputBuffer buffer2 ( * s2 ) ;
while ( buffer . has_more ( ) & & i < chars ) {
CHECK ( buffer2 . has_more ( ) ) ;
uint16_t c = buffer . GetNext ( ) ;
CHECK_EQ ( c , buffer2 . GetNext ( ) ) ;
i + + ;
}
2009-03-17 09:33:06 +00:00
s1 - > Get ( s1 - > length ( ) - 1 ) ;
s2 - > Get ( s2 - > length ( ) - 1 ) ;
2008-08-22 13:33:59 +00:00
}
TEST ( Traverse ) {
printf ( " TestTraverse \n " ) ;
InitializeVM ( ) ;
v8 : : HandleScope scope ;
Handle < String > building_blocks [ NUMBER_OF_BUILDING_BLOCKS ] ;
2009-03-27 00:24:49 +00:00
ZoneScope zone ( DELETE_ON_EXIT ) ;
2008-08-22 13:33:59 +00:00
InitializeBuildingBlocks ( building_blocks ) ;
Handle < String > flat = ConstructBalanced ( building_blocks ) ;
FlattenString ( flat ) ;
Handle < String > left_asymmetric = ConstructLeft ( building_blocks , DEEP_DEPTH ) ;
Handle < String > right_asymmetric = ConstructRight ( building_blocks , DEEP_DEPTH ) ;
Handle < String > symmetric = ConstructBalanced ( building_blocks ) ;
printf ( " 1 \n " ) ;
Traverse ( flat , symmetric ) ;
printf ( " 2 \n " ) ;
Traverse ( flat , left_asymmetric ) ;
printf ( " 3 \n " ) ;
Traverse ( flat , right_asymmetric ) ;
printf ( " 4 \n " ) ;
Handle < String > left_deep_asymmetric =
ConstructLeft ( building_blocks , SUPER_DEEP_DEPTH ) ;
Handle < String > right_deep_asymmetric =
ConstructRight ( building_blocks , SUPER_DEEP_DEPTH ) ;
printf ( " 5 \n " ) ;
TraverseFirst ( left_asymmetric , left_deep_asymmetric , 1050 ) ;
printf ( " 6 \n " ) ;
TraverseFirst ( left_asymmetric , right_deep_asymmetric , 65536 ) ;
printf ( " 7 \n " ) ;
FlattenString ( left_asymmetric ) ;
printf ( " 10 \n " ) ;
Traverse ( flat , left_asymmetric ) ;
printf ( " 11 \n " ) ;
FlattenString ( right_asymmetric ) ;
printf ( " 12 \n " ) ;
Traverse ( flat , right_asymmetric ) ;
printf ( " 14 \n " ) ;
FlattenString ( symmetric ) ;
printf ( " 15 \n " ) ;
Traverse ( flat , symmetric ) ;
printf ( " 16 \n " ) ;
FlattenString ( left_deep_asymmetric ) ;
printf ( " 18 \n " ) ;
}
static const int DEEP_ASCII_DEPTH = 100000 ;
TEST ( DeepAscii ) {
printf ( " TestDeepAscii \n " ) ;
InitializeVM ( ) ;
v8 : : HandleScope scope ;
char * foo = NewArray < char > ( DEEP_ASCII_DEPTH ) ;
for ( int i = 0 ; i < DEEP_ASCII_DEPTH ; i + + ) {
foo [ i ] = " foo " [ i % 4 ] ;
}
Handle < String > string =
Factory : : NewStringFromAscii ( Vector < const char > ( foo , DEEP_ASCII_DEPTH ) ) ;
Handle < String > foo_string = Factory : : NewStringFromAscii ( CStrVector ( " foo " ) ) ;
for ( int i = 0 ; i < DEEP_ASCII_DEPTH ; i + = 10 ) {
2009-03-17 09:33:06 +00:00
string = Factory : : NewConsString ( string , foo_string ) ;
2008-08-22 13:33:59 +00:00
}
2009-03-17 09:33:06 +00:00
Handle < String > flat_string = Factory : : NewConsString ( string , foo_string ) ;
2008-08-22 13:33:59 +00:00
FlattenString ( flat_string ) ;
for ( int i = 0 ; i < 500 ; i + + ) {
TraverseFirst ( flat_string , string , DEEP_ASCII_DEPTH ) ;
}
2009-03-16 07:53:20 +00:00
DeleteArray < char > ( foo ) ;
2008-08-22 13:33:59 +00:00
}
2008-09-05 13:39:14 +00:00
TEST ( Utf8Conversion ) {
// Smoke test for converting strings to utf-8.
InitializeVM ( ) ;
v8 : : HandleScope handle_scope ;
// A simple ascii string
const char * ascii_string = " abcdef12345 " ;
2009-11-11 09:50:06 +00:00
int len =
v8 : : String : : New ( ascii_string ,
StrLength ( ascii_string ) ) - > Utf8Length ( ) ;
CHECK_EQ ( StrLength ( ascii_string ) , len ) ;
2008-09-05 13:39:14 +00:00
// A mixed ascii and non-ascii string
// U+02E4 -> CB A4
// U+0064 -> 64
// U+12E4 -> E1 8B A4
// U+0030 -> 30
// U+3045 -> E3 81 85
const uint16_t mixed_string [ ] = { 0x02E4 , 0x0064 , 0x12E4 , 0x0030 , 0x3045 } ;
// The characters we expect to be output
2008-09-05 15:01:10 +00:00
const unsigned char as_utf8 [ 11 ] = { 0xCB , 0xA4 , 0x64 , 0xE1 , 0x8B , 0xA4 , 0x30 ,
2008-09-05 13:39:14 +00:00
0xE3 , 0x81 , 0x85 , 0x00 } ;
// The number of bytes expected to be written for each length
const int lengths [ 12 ] = { 0 , 0 , 2 , 3 , 3 , 3 , 6 , 7 , 7 , 7 , 10 , 11 } ;
2010-04-06 17:58:43 +00:00
const int char_lengths [ 12 ] = { 0 , 0 , 1 , 2 , 2 , 2 , 3 , 4 , 4 , 4 , 5 , 5 } ;
2008-09-05 13:39:14 +00:00
v8 : : Handle < v8 : : String > mixed = v8 : : String : : New ( mixed_string , 5 ) ;
CHECK_EQ ( 10 , mixed - > Utf8Length ( ) ) ;
// Try encoding the string with all capacities
char buffer [ 11 ] ;
2008-09-06 13:42:50 +00:00
const char kNoChar = static_cast < char > ( - 1 ) ;
2008-09-05 13:39:14 +00:00
for ( int i = 0 ; i < = 11 ; i + + ) {
// Clear the buffer before reusing it
for ( int j = 0 ; j < 11 ; j + + )
2008-09-06 13:42:50 +00:00
buffer [ j ] = kNoChar ;
2010-04-06 17:58:43 +00:00
int chars_written ;
int written = mixed - > WriteUtf8 ( buffer , i , & chars_written ) ;
2008-09-05 13:39:14 +00:00
CHECK_EQ ( lengths [ i ] , written ) ;
2010-04-06 17:58:43 +00:00
CHECK_EQ ( char_lengths [ i ] , chars_written ) ;
2008-09-05 13:39:14 +00:00
// Check that the contents are correct
for ( int j = 0 ; j < lengths [ i ] ; j + + )
2008-09-05 15:01:10 +00:00
CHECK_EQ ( as_utf8 [ j ] , static_cast < unsigned char > ( buffer [ j ] ) ) ;
2008-09-05 13:39:14 +00:00
// Check that the rest of the buffer hasn't been touched
for ( int j = lengths [ i ] ; j < 11 ; j + + )
2008-09-06 13:42:50 +00:00
CHECK_EQ ( kNoChar , buffer [ j ] ) ;
2008-09-05 13:39:14 +00:00
}
}
2009-04-09 23:04:00 +00:00
2009-12-02 12:58:10 +00:00
TEST ( ExternalShortStringAdd ) {
ZoneScope zone ( DELETE_ON_EXIT ) ;
2009-05-05 07:02:25 +00:00
2009-12-02 12:58:10 +00:00
InitializeVM ( ) ;
v8 : : HandleScope handle_scope ;
2009-04-09 23:04:00 +00:00
2009-12-02 12:58:10 +00:00
// Make sure we cover all always-flat lengths and at least one above.
static const int kMaxLength = 20 ;
CHECK_GT ( kMaxLength , i : : String : : kMinNonFlatLength ) ;
// Allocate two JavaScript arrays for holding short strings.
v8 : : Handle < v8 : : Array > ascii_external_strings =
v8 : : Array : : New ( kMaxLength + 1 ) ;
v8 : : Handle < v8 : : Array > non_ascii_external_strings =
v8 : : Array : : New ( kMaxLength + 1 ) ;
// Generate short ascii and non-ascii external strings.
for ( int i = 0 ; i < = kMaxLength ; i + + ) {
char * ascii = Zone : : NewArray < char > ( i + 1 ) ;
for ( int j = 0 ; j < i ; j + + ) {
ascii [ j ] = ' a ' ;
}
// Terminating '\0' is left out on purpose. It is not required for external
// string data.
AsciiResource * ascii_resource =
new AsciiResource ( Vector < const char > ( ascii , i ) ) ;
v8 : : Local < v8 : : String > ascii_external_string =
v8 : : String : : NewExternal ( ascii_resource ) ;
ascii_external_strings - > Set ( v8 : : Integer : : New ( i ) , ascii_external_string ) ;
uc16 * non_ascii = Zone : : NewArray < uc16 > ( i + 1 ) ;
for ( int j = 0 ; j < i ; j + + ) {
2009-12-03 07:56:21 +00:00
non_ascii [ j ] = 0x1234 ;
2009-12-02 12:58:10 +00:00
}
// Terminating '\0' is left out on purpose. It is not required for external
// string data.
Resource * resource = new Resource ( Vector < const uc16 > ( non_ascii , i ) ) ;
v8 : : Local < v8 : : String > non_ascii_external_string =
v8 : : String : : NewExternal ( resource ) ;
non_ascii_external_strings - > Set ( v8 : : Integer : : New ( i ) ,
non_ascii_external_string ) ;
}
2009-04-09 23:04:00 +00:00
2009-12-02 12:58:10 +00:00
// Add the arrays with the short external strings in the global object.
v8 : : Handle < v8 : : Object > global = env - > Global ( ) ;
2009-12-03 07:56:21 +00:00
global - > Set ( v8_str ( " external_ascii " ) , ascii_external_strings ) ;
global - > Set ( v8_str ( " external_non_ascii " ) , non_ascii_external_strings ) ;
global - > Set ( v8_str ( " max_length " ) , v8 : : Integer : : New ( kMaxLength ) ) ;
2009-12-02 12:58:10 +00:00
// Add short external ascii and non-ascii strings checking the result.
static const char * source =
" function test() { "
2009-12-03 07:56:21 +00:00
" var ascii_chars = 'aaaaaaaaaaaaaaaaaaaa'; "
2009-12-03 08:32:04 +00:00
" var non_ascii_chars = ' \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234 \\ u1234'; " //NOLINT
2009-12-03 07:56:21 +00:00
" if (ascii_chars.length != max_length) return 1; "
" if (non_ascii_chars.length != max_length) return 2; "
" var ascii = Array(max_length + 1); "
" var non_ascii = Array(max_length + 1); "
" for (var i = 0; i <= max_length; i++) { "
" ascii[i] = ascii_chars.substring(0, i); "
" non_ascii[i] = non_ascii_chars.substring(0, i); "
" }; "
" for (var i = 0; i <= max_length; i++) { "
" if (ascii[i] != external_ascii[i]) return 3; "
" if (non_ascii[i] != external_non_ascii[i]) return 4; "
2009-12-02 12:58:10 +00:00
" for (var j = 0; j < i; j++) { "
2009-12-03 07:56:21 +00:00
" if (external_ascii[i] != "
" (external_ascii[j] + external_ascii[i - j])) return 5; "
" if (external_non_ascii[i] != "
" (external_non_ascii[j] + external_non_ascii[i - j])) return 6; "
" if (non_ascii[i] != (non_ascii[j] + non_ascii[i - j])) return 7; "
" if (ascii[i] != (ascii[j] + ascii[i - j])) return 8; "
" if (ascii[i] != (external_ascii[j] + ascii[i - j])) return 9; "
" if (ascii[i] != (ascii[j] + external_ascii[i - j])) return 10; "
" if (non_ascii[i] != "
" (external_non_ascii[j] + non_ascii[i - j])) return 11; "
" if (non_ascii[i] != "
" (non_ascii[j] + external_non_ascii[i - j])) return 12; "
2009-12-02 12:58:10 +00:00
" } "
" } "
2009-12-03 07:56:21 +00:00
" return 0; "
2009-12-02 12:58:10 +00:00
" }; "
" test() " ;
2009-12-03 07:56:21 +00:00
CHECK_EQ ( 0 ,
v8 : : Script : : Compile ( v8 : : String : : New ( source ) ) - > Run ( ) - > Int32Value ( ) ) ;
2009-12-02 12:58:10 +00:00
}
2010-06-02 09:31:01 +00:00
TEST ( CachedHashOverflow ) {
// We incorrectly allowed strings to be tagged as array indices even if their
// values didn't fit in the hash field.
// See http://code.google.com/p/v8/issues/detail?id=728
ZoneScope zone ( DELETE_ON_EXIT ) ;
InitializeVM ( ) ;
v8 : : HandleScope handle_scope ;
// Lines must be executed sequentially. Combining them into one script
// makes the bug go away.
const char * lines [ ] = {
" var x = []; " ,
" x[4] = 42; " ,
" var s = \" 1073741828 \" ; " ,
" x[s]; " ,
" x[s] = 37; " ,
" x[4]; " ,
" x[s]; " ,
NULL
} ;
Handle < Smi > fortytwo ( Smi : : FromInt ( 42 ) ) ;
Handle < Smi > thirtyseven ( Smi : : FromInt ( 37 ) ) ;
Handle < Object > results [ ] = {
Factory : : undefined_value ( ) ,
fortytwo ,
Factory : : undefined_value ( ) ,
Factory : : undefined_value ( ) ,
thirtyseven ,
fortytwo ,
thirtyseven // Bug yielded 42 here.
} ;
const char * line ;
for ( int i = 0 ; ( line = lines [ i ] ) ; i + + ) {
printf ( " %s \n " , line ) ;
v8 : : Local < v8 : : Value > result =
v8 : : Script : : Compile ( v8 : : String : : New ( line ) ) - > Run ( ) ;
2010-06-02 11:05:06 +00:00
CHECK_EQ ( results [ i ] - > IsUndefined ( ) , result - > IsUndefined ( ) ) ;
CHECK_EQ ( results [ i ] - > IsNumber ( ) , result - > IsNumber ( ) ) ;
2010-06-02 09:31:01 +00:00
if ( result - > IsNumber ( ) ) {
2010-06-02 11:05:06 +00:00
CHECK_EQ ( Smi : : cast ( results [ i ] - > ToSmi ( ) ) - > value ( ) ,
result - > ToInt32 ( ) - > Value ( ) ) ;
2010-06-02 09:31:01 +00:00
}
}
}