Revision: 11918
Author: [email protected]
Date: Mon Jun 25 02:47:40 2012
Log: Version 3.12.3
Reverted r11835 'Unify promotion and allocation limit computation' due to
V8 Splay performance regression on Mac. (Chromium issue 134183)
Fixed sharing of literal boilerplates for optimized code. (issue 2193)
Performance and stability improvements on all platforms.
http://code.google.com/p/v8/source/detail?r=11918
Added:
/trunk/test/mjsunit/debug-liveedit-double-call.js
/trunk/test/mjsunit/regress/regress-2193.js
Modified:
/trunk/ChangeLog
/trunk/src/compiler.cc
/trunk/src/debug.cc
/trunk/src/debug.h
/trunk/src/factory.cc
/trunk/src/flag-definitions.h
/trunk/src/heap.cc
/trunk/src/heap.h
/trunk/src/liveedit.cc
/trunk/src/objects.cc
/trunk/src/objects.h
/trunk/src/runtime.cc
/trunk/src/version.cc
/trunk/test/mjsunit/mjsunit.status
=======================================
--- /dev/null
+++ /trunk/test/mjsunit/debug-liveedit-double-call.js Mon Jun 25 02:47:40
2012
@@ -0,0 +1,142 @@
+// Copyright 2012 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: --expose-debug-as debug
+// Get the Debug object exposed from the debug context global object.
+
+Debug = debug.Debug
+
+
+function TestCase(test_scenario, expected_output) {
+ // Global variable, accessed from eval'd script.
+ test_output = "";
+
+ var script_text_generator = (function() {
+ var variables = { a: 1, b: 1, c: 1, d: 1, e: 1, f: 1 };
+
+ return {
+ get: function() {
+ return "(function() {\n " +
+ " function A() {\n " +
+ " test_output += 'a' + " + variables.a + ";\n " +
+ " test_output += '=';\n " +
+ " debugger;\n " +
+ " return 'Capybara';\n " +
+ " }\n " +
+ " function B(p1, p2) {\n " +
+ " test_output += 'b' + " + variables.b + ";\n " +
+ " return A();\n " +
+ " }\n " +
+ " function C() {\n " +
+ " test_output += 'c' + " + variables.c + ";\n " +
+ " // Function call with argument adaptor is
intentional.\n " +
+ " return B();\n " +
+ " }\n " +
+ " function D() {\n " +
+ " test_output += 'd' + " + variables.d + ";\n " +
+ " // Function call with argument adaptor is
intentional.\n " +
+ " return C(1, 2);\n " +
+ " }\n " +
+ " function E() {\n " +
+ " test_output += 'e' + " + variables.e + ";\n " +
+ " return D();\n " +
+ " }\n " +
+ " function F() {\n " +
+ " test_output += 'f' + " + variables.f + ";\n " +
+ " return E();\n " +
+ " }\n " +
+ " return F();\n " +
+ "})\n";
+ },
+ change: function(var_name) {
+ variables[var_name]++;
+ }
+ };
+ })();
+
+ var test_fun = eval(script_text_generator.get());
+
+ var script = Debug.findScript(test_fun);
+
+ var scenario_pos = 0;
+
+ function DebuggerStatementHandler() {
+ while (true) {
+ assertTrue(scenario_pos < test_scenario.length);
+ var change_var = test_scenario[scenario_pos++];
+ if (change_var == '=') {
+ // Continue.
+ return;
+ }
+ script_text_generator.change(change_var);
+ try {
+ Debug.LiveEdit.SetScriptSource(script, script_text_generator.get(),
+ false, []);
+ } catch (e) {
+ print("LiveEdit exception: " + e);
+ throw e;
+ }
+ }
+ }
+
+ var saved_exception = null;
+
+ function listener(event, exec_state, event_data, data) {
+ if (event == Debug.DebugEvent.Break) {
+ try {
+ DebuggerStatementHandler();
+ } catch (e) {
+ saved_exception = e;
+ }
+ } else {
+ print("Other: " + event);
+ }
+ }
+
+ Debug.setListener(listener);
+ assertEquals("Capybara", test_fun());
+ Debug.setListener(null);
+
+ if (saved_exception) {
+ print("Exception: " + saved_exception);
+ assertUnreachable();
+ }
+
+ print(test_output);
+
+ assertEquals(expected_output, test_output);
+}
+
+TestCase(['='], "f1e1d1c1b1a1=");
+
+TestCase(['c', '=', '='], "f1e1d1c1b1a1=c2b1a1=");
+
+TestCase(['b', 'c', 'd', 'e', '=', '='], "f1e1d1c1b1a1=e2d2c2b2a1=");
+
+TestCase(['b', 'c', '=', 'b', 'c', 'd', 'e', '=', '='],
"f1e1d1c1b1a1=c2b2a1=e2d2c3b3a1=");
+
+TestCase(['e', 'f', '=', '='], "f1e1d1c1b1a1=f2e2d1c1b1a1=");
=======================================
--- /dev/null
+++ /trunk/test/mjsunit/regress/regress-2193.js Mon Jun 25 02:47:40 2012
@@ -0,0 +1,58 @@
+// Copyright 2012 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: --allow-natives-syntax --cache-optimized-code
+
+function bozo() {};
+function MakeClosure() {
+ return function f(use_literals) {
+ if (use_literals) {
+ return [1,2,3,3,4,5,6,7,8,9,bozo];
+ } else {
+ return 0;
+ }
+ }
+}
+
+// Create two closures that share the same literal boilerplates.
+var closure1 = MakeClosure();
+var closure2 = MakeClosure();
+var expected = [1,2,3,3,4,5,6,7,8,9,bozo];
+
+// Make sure we generate optimized code for the first closure after
+// warming it up properly so that the literals boilerplate is generated
+// and the optimized code uses CreateArrayLiteralShallow runtime call.
+assertEquals(0, closure1(false));
+assertEquals(expected, closure1(true));
+%OptimizeFunctionOnNextCall(closure1);
+assertEquals(expected, closure1(true));
+
+// Optimize the second closure, which should reuse the optimized code
+// from the first closure with the same literal boilerplates.
+assertEquals(0, closure2(false));
+%OptimizeFunctionOnNextCall(closure2);
+assertEquals(expected, closure2(true));
=======================================
--- /trunk/ChangeLog Fri Jun 22 06:44:28 2012
+++ /trunk/ChangeLog Mon Jun 25 02:47:40 2012
@@ -1,3 +1,13 @@
+2012-06-25: Version 3.12.3
+
+ Reverted r11835 'Unify promotion and allocation limit computation'
due
+ to V8 Splay performance regression on Mac. (Chromium issue 134183)
+
+ Fixed sharing of literal boilerplates for optimized code. (issue
2193)
+
+ Performance and stability improvements on all platforms.
+
+
2012-06-22: Version 3.12.2
Made near-jump check more strict in LoadNamedFieldPolymorphic on
=======================================
--- /trunk/src/compiler.cc Wed Jun 20 04:29:00 2012
+++ /trunk/src/compiler.cc Mon Jun 25 02:47:40 2012
@@ -623,17 +623,15 @@
Handle<JSFunction> function = info->closure();
ASSERT(!function.is_null());
Handle<Context> global_context(function->context()->global_context());
- int index =
function->shared()->SearchOptimizedCodeMap(*global_context);
+ int index = shared->SearchOptimizedCodeMap(*global_context);
if (index > 0) {
if (FLAG_trace_opt) {
- PrintF(" [Found optimized code for");
+ PrintF("[found optimized code for: ");
function->PrintName();
- PrintF("\n");
- }
- Code* code = Code::cast(
- FixedArray::cast(shared->optimized_code_map())->get(index));
- ASSERT(code != NULL);
- function->ReplaceCode(code);
+ PrintF(" / %" V8PRIxPTR "]\n",
reinterpret_cast<intptr_t>(*function));
+ }
+ // Caching of optimized code enabled and optimized code found.
+ shared->InstallFromOptimizedCodeMap(*function, index);
return true;
}
}
@@ -672,20 +670,8 @@
if (FLAG_cache_optimized_code &&
code->kind() == Code::OPTIMIZED_FUNCTION) {
Handle<SharedFunctionInfo> shared(function->shared());
+ Handle<FixedArray> literals(function->literals());
Handle<Context>
global_context(function->context()->global_context());
-
- // Create literals array that will be shared for this global
context.
- int number_of_literals = shared->num_literals();
- Handle<FixedArray> literals =
- isolate->factory()->NewFixedArray(number_of_literals);
- if (number_of_literals > 0) {
- // Store the object, regexp and array functions in the literals
- // array prefix. These functions will be used when creating
- // object, regexp and array literals in this function.
- literals->set(JSFunction::kLiteralGlobalContextIndex,
- function->context()->global_context());
- }
-
SharedFunctionInfo::AddToOptimizedCodeMap(
shared, global_context, code, literals);
}
=======================================
--- /trunk/src/debug.cc Fri Jun 22 06:44:28 2012
+++ /trunk/src/debug.cc Mon Jun 25 02:47:40 2012
@@ -2331,7 +2331,9 @@
void Debug::FramesHaveBeenDropped(StackFrame::Id new_break_frame_id,
FrameDropMode mode,
Object**
restarter_frame_function_pointer) {
- thread_local_.frame_drop_mode_ = mode;
+ if (mode != CURRENTLY_SET_MODE) {
+ thread_local_.frame_drop_mode_ = mode;
+ }
thread_local_.break_frame_id_ = new_break_frame_id;
thread_local_.restarter_frame_function_pointer_ =
restarter_frame_function_pointer;
=======================================
--- /trunk/src/debug.h Fri Jun 22 06:44:28 2012
+++ /trunk/src/debug.h Mon Jun 25 02:47:40 2012
@@ -448,7 +448,8 @@
// The top JS frame had been calling some C++ function. The return
address
// gets patched automatically.
FRAME_DROPPED_IN_DIRECT_CALL,
- FRAME_DROPPED_IN_RETURN_CALL
+ FRAME_DROPPED_IN_RETURN_CALL,
+ CURRENTLY_SET_MODE
};
void FramesHaveBeenDropped(StackFrame::Id new_break_frame_id,
=======================================
--- /trunk/src/factory.cc Wed Jun 20 04:29:00 2012
+++ /trunk/src/factory.cc Mon Jun 25 02:47:40 2012
@@ -555,40 +555,23 @@
result->set_context(*context);
- int index = FLAG_cache_optimized_code
- ? function_info->SearchOptimizedCodeMap(context->global_context())
- : -1;
- if (!function_info->bound()) {
- if (index > 0) {
- FixedArray* code_map =
- FixedArray::cast(function_info->optimized_code_map());
- FixedArray* cached_literals = FixedArray::cast(code_map->get(index +
1));
- ASSERT(cached_literals != NULL);
- ASSERT(function_info->num_literals() == 0 ||
- (code_map->get(index - 1) ==
-
cached_literals->get(JSFunction::kLiteralGlobalContextIndex)));
- result->set_literals(cached_literals);
- } else {
- int number_of_literals = function_info->num_literals();
- Handle<FixedArray> literals =
- NewFixedArray(number_of_literals, pretenure);
- if (number_of_literals > 0) {
- // Store the object, regexp and array functions in the literals
- // array prefix. These functions will be used when creating
- // object, regexp and array literals in this function.
- literals->set(JSFunction::kLiteralGlobalContextIndex,
- context->global_context());
- }
- result->set_literals(*literals);
- }
+ int index =
function_info->SearchOptimizedCodeMap(context->global_context());
+ if (!function_info->bound() && index < 0) {
+ int number_of_literals = function_info->num_literals();
+ Handle<FixedArray> literals = NewFixedArray(number_of_literals,
pretenure);
+ if (number_of_literals > 0) {
+ // Store the global context in the literals array prefix. This
+ // context will be used when creating object, regexp and array
+ // literals in this function.
+ literals->set(JSFunction::kLiteralGlobalContextIndex,
+ context->global_context());
+ }
+ result->set_literals(*literals);
}
if (index > 0) {
// Caching of optimized code enabled and optimized code found.
- Code* code = Code::cast(
- FixedArray::cast(function_info->optimized_code_map())->get(index));
- ASSERT(code != NULL);
- result->ReplaceCode(code);
+ function_info->InstallFromOptimizedCodeMap(*result, index);
return result;
}
=======================================
--- /trunk/src/flag-definitions.h Fri Jun 22 06:44:28 2012
+++ /trunk/src/flag-definitions.h Mon Jun 25 02:47:40 2012
@@ -209,7 +209,7 @@
DEFINE_bool(lookup_sample_by_shared, true,
"when picking a function to optimize, watch for shared
function "
"info, not JSFunction itself")
-DEFINE_bool(cache_optimized_code, false,
+DEFINE_bool(cache_optimized_code, true,
"cache optimized code for closures")
DEFINE_bool(inline_construct, true, "inline constructor calls")
DEFINE_bool(inline_arguments, true, "inline functions with arguments
object")
=======================================
--- /trunk/src/heap.cc Fri Jun 22 06:44:28 2012
+++ /trunk/src/heap.cc Mon Jun 25 02:47:40 2012
@@ -118,8 +118,8 @@
debug_utils_(NULL),
#endif // DEBUG
new_space_high_promotion_mode_active_(false),
- old_gen_promotion_limit_(kMinPromotionLimit),
- old_gen_allocation_limit_(kMinAllocationLimit),
+ old_gen_promotion_limit_(kMinimumPromotionLimit),
+ old_gen_allocation_limit_(kMinimumAllocationLimit),
old_gen_limit_factor_(1),
size_of_old_gen_at_last_old_space_gc_(0),
external_allocation_limit_(0),
@@ -829,9 +829,9 @@
}
old_gen_promotion_limit_ =
- OldGenLimit(size_of_old_gen_at_last_old_space_gc_,
kMinPromotionLimit);
+ OldGenPromotionLimit(size_of_old_gen_at_last_old_space_gc_);
old_gen_allocation_limit_ =
- OldGenLimit(size_of_old_gen_at_last_old_space_gc_,
kMinAllocationLimit);
+ OldGenAllocationLimit(size_of_old_gen_at_last_old_space_gc_);
old_gen_exhausted_ = false;
} else {
=======================================
--- /trunk/src/heap.h Wed Jun 20 04:29:00 2012
+++ /trunk/src/heap.h Mon Jun 25 02:47:40 2012
@@ -1359,13 +1359,24 @@
return max_old_generation_size_ - PromotedTotalSize();
}
- static const intptr_t kMinPromotionLimit = 5 * Page::kPageSize;
- static const intptr_t kMinAllocationLimit =
+ static const intptr_t kMinimumPromotionLimit = 5 * Page::kPageSize;
+ static const intptr_t kMinimumAllocationLimit =
8 * (Page::kPageSize > MB ? Page::kPageSize : MB);
- intptr_t OldGenLimit(intptr_t old_gen_size, intptr_t min_limit) {
+ intptr_t OldGenPromotionLimit(intptr_t old_gen_size) {
+ const int divisor = FLAG_stress_compaction ? 10 : 3;
+ intptr_t limit =
+ Max(old_gen_size + old_gen_size / divisor, kMinimumPromotionLimit);
+ limit += new_space_.Capacity();
+ limit *= old_gen_limit_factor_;
+ intptr_t halfway_to_the_max = (old_gen_size +
max_old_generation_size_) / 2;
+ return Min(limit, halfway_to_the_max);
+ }
+
+ intptr_t OldGenAllocationLimit(intptr_t old_gen_size) {
const int divisor = FLAG_stress_compaction ? 8 : 2;
- intptr_t limit = Max(old_gen_size + old_gen_size / divisor, min_limit);
+ intptr_t limit =
+ Max(old_gen_size + old_gen_size / divisor,
kMinimumAllocationLimit);
limit += new_space_.Capacity();
limit *= old_gen_limit_factor_;
intptr_t halfway_to_the_max = (old_gen_size +
max_old_generation_size_) / 2;
=======================================
--- /trunk/src/liveedit.cc Wed Jun 20 04:29:00 2012
+++ /trunk/src/liveedit.cc Mon Jun 25 02:47:40 2012
@@ -1468,7 +1468,9 @@
isolate->builtins()->builtin(
Builtins::kFrameDropper_LiveEdit)) {
// OK, we can drop our own code.
- *mode = Debug::FRAME_DROPPED_IN_DIRECT_CALL;
+ pre_top_frame = frames[top_frame_index - 2];
+ top_frame = frames[top_frame_index - 1];
+ *mode = Debug::CURRENTLY_SET_MODE;
frame_has_padding = false;
} else if (pre_top_frame_code ==
isolate->builtins()->builtin(Builtins::kReturn_DebugBreak)) {
@@ -1483,6 +1485,15 @@
// Here the stub is CEntry, it's not debug-only and can't be padded.
// If anyone would complain, a proxy padded stub could be added.
frame_has_padding = false;
+ } else if (pre_top_frame->type() == StackFrame::ARGUMENTS_ADAPTOR) {
+ // This must be adaptor that remain from the frame dropping that
+ // is still on stack. A frame dropper frame must be above it.
+ ASSERT(frames[top_frame_index - 2]->LookupCode() ==
+ isolate->builtins()->builtin(Builtins::kFrameDropper_LiveEdit));
+ pre_top_frame = frames[top_frame_index - 3];
+ top_frame = frames[top_frame_index - 2];
+ *mode = Debug::CURRENTLY_SET_MODE;
+ frame_has_padding = false;
} else {
return "Unknown structure of stack above changing function";
}
=======================================
--- /trunk/src/objects.cc Fri Jun 22 06:44:28 2012
+++ /trunk/src/objects.cc Mon Jun 25 02:47:40 2012
@@ -7544,6 +7544,23 @@
#endif
shared->set_optimized_code_map(*new_code_map);
}
+
+
+void SharedFunctionInfo::InstallFromOptimizedCodeMap(JSFunction* function,
+ int index) {
+ ASSERT(index > 0);
+ ASSERT(optimized_code_map()->IsFixedArray());
+ FixedArray* code_map = FixedArray::cast(optimized_code_map());
+ if (!bound()) {
+ FixedArray* cached_literals = FixedArray::cast(code_map->get(index +
1));
+ ASSERT(cached_literals != NULL);
+ function->set_literals(cached_literals);
+ }
+ Code* code = Code::cast(code_map->get(index));
+ ASSERT(code != NULL);
+ ASSERT(function->context()->global_context() == code_map->get(index -
1));
+ function->ReplaceCode(code);
+}
bool JSFunction::CompileLazy(Handle<JSFunction> function,
@@ -8097,6 +8114,7 @@
int SharedFunctionInfo::SearchOptimizedCodeMap(Context* global_context) {
ASSERT(global_context->IsGlobalContext());
+ if (!FLAG_cache_optimized_code) return -1;
Object* value = optimized_code_map();
if (!value->IsSmi()) {
FixedArray* optimized_code_map = FixedArray::cast(value);
=======================================
--- /trunk/src/objects.h Wed Jun 20 04:29:00 2012
+++ /trunk/src/objects.h Mon Jun 25 02:47:40 2012
@@ -5227,6 +5227,10 @@
// Returns -1 when no matching entry is found.
int SearchOptimizedCodeMap(Context* global_context);
+ // Installs optimized code from the code map on the given closure. The
+ // index has to be consistent with a search result as defined above.
+ void InstallFromOptimizedCodeMap(JSFunction* function, int index);
+
// Clear optimized code map.
void ClearOptimizedCodeMap();
=======================================
--- /trunk/src/runtime.cc Fri Jun 22 06:44:28 2012
+++ /trunk/src/runtime.cc Mon Jun 25 02:47:40 2012
@@ -635,6 +635,7 @@
// Check if boilerplate exists. If not, create it first.
Handle<Object> boilerplate(literals->get(literals_index), isolate);
if (*boilerplate == isolate->heap()->undefined_value()) {
+ ASSERT(*elements != isolate->heap()->empty_fixed_array());
boilerplate =
Runtime::CreateArrayLiteralBoilerplate(isolate, literals,
elements);
if (boilerplate.is_null()) return Failure::Exception();
=======================================
--- /trunk/src/version.cc Fri Jun 22 06:44:28 2012
+++ /trunk/src/version.cc Mon Jun 25 02:47:40 2012
@@ -34,7 +34,7 @@
// cannot be changed without changing the SCons build script.
#define MAJOR_VERSION 3
#define MINOR_VERSION 12
-#define BUILD_NUMBER 2
+#define BUILD_NUMBER 3
#define PATCH_LEVEL 0
// Use 1 for candidates and 0 otherwise.
// (Boolean macro values are not supported by all preprocessors.)
=======================================
--- /trunk/test/mjsunit/mjsunit.status Thu Jun 21 04:16:20 2012
+++ /trunk/test/mjsunit/mjsunit.status Mon Jun 25 02:47:40 2012
@@ -125,6 +125,7 @@
debug-liveedit-check-stack: SKIP
debug-liveedit-stack-padding: SKIP
debug-liveedit-restart-frame: SKIP
+debug-liveedit-double-call: SKIP
# Currently always deopt on minus zero
math-floor-of-div-minus-zero: SKIP
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
