Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(106)

Unified Diff: test/cctest/interpreter/test-interpreter.cc

Issue 1422033002: [Interpreter] Add support for for..in. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@master
Patch Set: Update comments. Created 5 years, 2 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: test/cctest/interpreter/test-interpreter.cc
diff --git a/test/cctest/interpreter/test-interpreter.cc b/test/cctest/interpreter/test-interpreter.cc
index 164959019ac298b8fe76fd02b127a48fc2ae1c7a..b2296881f8b8a9827b37b5b17eed5603d8072c78 100644
--- a/test/cctest/interpreter/test-interpreter.cc
+++ b/test/cctest/interpreter/test-interpreter.cc
@@ -1214,6 +1214,42 @@ TEST(InterpreterConditionalJumps) {
}
+TEST(InterpreterConditionalJumps2) {
+ // TODO(oth): Add tests for all conditional jumps near and far.
+ HandleAndZoneScope handles;
+ BytecodeArrayBuilder builder(handles.main_isolate(), handles.main_zone());
+ builder.set_locals_count(2);
+ builder.set_context_count(0);
+ builder.set_parameter_count(0);
+ Register reg(0), scratch(1);
+ BytecodeLabel label[2];
+ BytecodeLabel done, done1;
+
+ builder.LoadLiteral(Smi::FromInt(0))
+ .StoreAccumulatorInRegister(reg)
+ .LoadFalse()
+ .JumpIfFalse(&label[0]);
+ IncrementRegister(builder, reg, 1024, scratch)
+ .Bind(&label[0])
+ .LoadTrue()
+ .JumpIfFalse(&done);
+ IncrementRegister(builder, reg, 1, scratch).LoadTrue().JumpIfTrue(&label[1]);
+ IncrementRegister(builder, reg, 2048, scratch).Bind(&label[1]);
+ IncrementRegister(builder, reg, 2, scratch).LoadFalse().JumpIfTrue(&done1);
+ IncrementRegister(builder, reg, 4, scratch)
+ .LoadAccumulatorWithRegister(reg)
+ .Bind(&done)
+ .Bind(&done1)
+ .Return();
+
+ Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray();
+ InterpreterTester tester(handles.main_isolate(), bytecode_array);
+ auto callable = tester.GetCallable<>();
+ Handle<Object> return_value = callable().ToHandleChecked();
+ CHECK_EQ(Smi::cast(*return_value)->value(), 7);
+}
+
+
static const Token::Value kComparisonTypes[] = {
Token::Value::EQ, Token::Value::NE, Token::Value::EQ_STRICT,
Token::Value::NE_STRICT, Token::Value::LTE, Token::Value::LTE,
@@ -2498,3 +2534,118 @@ TEST(InterpreterGlobalDelete) {
CHECK(return_value->SameValue(*test_global_delete[i].second));
}
}
+
+
+TEST(InterpreterForIn) {
+ HandleAndZoneScope handles;
+
+ // TODO(oth): Add a test here for delete mid-loop when delete is ready.
rmcilroy 2015/10/28 13:46:22 it's now ready and landed ;)
oth 2015/10/28 22:50:40 Done.
+ std::pair<const char*, int> for_in_samples[] = {
+ {"function f() {\n"
+ " var r = -1;\n"
+ " for (var a in null) { r = a; }\n"
+ " return r;\n"
+ "}",
+ -1},
+ {"function f() {\n"
+ " var r = -1;\n"
+ " for (var a in undefined) { r = a; }\n"
+ " return r;\n"
+ "}",
+ -1},
+ {"function f() {\n"
+ " var r = 0;\n"
+ " for (var a in [0,6,7,9]) { r = r + (1 << a); }\n"
+ " return r;\n"
+ "}",
+ 0xf},
+ {"function f() {\n"
+ " var r = 0;\n"
+ " for (var a in [0,6,7,9]) { r = r + (1 << a); }\n"
+ " var r = 0;\n"
+ " for (var a in [0,6,7,9]) { r = r + (1 << a); }\n"
+ " return r;\n"
+ "}",
+ 0xf},
+ {"function f() {\n"
+ " var r = 0;\n"
+ " for (var a in 'foobar') { r = r + (1 << a); }\n"
+ " return r;\n"
+ "}",
+ 0x3f},
+ {"function f() {\n"
+ " var r = 0;\n"
+ " for (var a in {1:0, 10:1, 100:2, 1000:3}) {\n"
+ " r = r + Number(a);\n"
+ " }\n"
+ " return r;\n"
+ "}",
+ 1111},
+ {"function f() {\n"
+ " var r = 0;\n"
+ " var input = 'foobar';\n"
+ " for (var a in input) {\n"
+ " if (input[a] == 'b') break;\n"
+ " r = r + (1 << a);\n"
+ " }\n"
+ " return r;\n"
+ "}",
+ 0x7},
+ {"function f() {\n"
+ "var r = 0;\n"
+ "var input = 'foobar';\n"
+ "for (var a in input) {\n"
+ " if (input[a] == 'b') continue;\n"
+ " r = r + (1 << a);\n"
+ "}\n"
+ "return r;\n"
+ "}",
+ 0x37},
+ {"function f() {\n"
+ " var r = 0;\n"
+ " var data = {1:0, 10:1, 100:2, 1000:3};\n"
+ " for (var a in data) {\n"
+ " if (a == 10) {\n"
+ " data[10000] = 4;\n"
+ " }\n"
+ " r = r + Number(a);\n"
+ " }\n"
+ " return r;\n"
+ "}",
+ 1111},
+ {"function f() {\n"
+ " var r = [ 3 ];\n"
+ " var data = {1:0, 10:1, 100:2, 1000:3};\n"
+ " for (r[10] in data) {\n"
+ " }\n"
+ " return Number(r[10]);\n"
+ "}",
+ 1000},
+ {"function f() {\n"
+ " var r = [ 3 ];\n"
+ " var data = {1:0, 10:1, 100:2, 1000:3};\n"
+ " for (r['100'] in data) {\n"
+ " }\n"
+ " return Number(r['100']);\n"
+ "}",
+ 1000},
+ {"function f() {\n"
+ " var obj = {}\n"
+ " var descObj = new Boolean(false);\n"
+ " var accessed = 0;\n"
+ " descObj.enumerable = true;\n"
+ " Object.defineProperties(obj, { prop:descObj });\n"
+ " for (var p in obj) {\n"
+ " if (p === 'prop') { accessed = 1; }\n"
+ " }\n"
+ " return accessed;"
+ "}",
+ 1}};
+
+ for (size_t i = 0; i < arraysize(for_in_samples); i++) {
+ InterpreterTester tester(handles.main_isolate(), for_in_samples[i].first);
+ auto callable = tester.GetCallable<>();
+ Handle<Object> return_val = callable().ToHandleChecked();
+ CHECK_EQ(Handle<Smi>::cast(return_val)->value(), for_in_samples[i].second);
+ }
+}

Powered by Google App Engine
This is Rietveld 408576698