OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
11 // with the distribution. | 11 // with the distribution. |
12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
15 // | 15 // |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include <stdlib.h> | 28 // Flags: --harmony-proxies |
29 | 29 |
30 #include "v8.h" | 30 var proxy_has_x = false; |
| 31 var proxy = Proxy.create({ getPropertyDescriptor:function(key) { |
| 32 assertSame('x', key); |
| 33 if (proxy_has_x) { |
| 34 return { configurable:true, writable:false, value:19 }; |
| 35 } |
| 36 }}); |
31 | 37 |
32 #include "ast.h" | 38 // Test __lookupGetter__/__lookupSetter__ with proxy. |
33 #include "cctest.h" | 39 assertSame(undefined, Object.prototype.__lookupGetter__.call(proxy, 'foo')); |
| 40 assertSame(undefined, Object.prototype.__lookupSetter__.call(proxy, 'bar')); |
| 41 assertSame(undefined, Object.prototype.__lookupGetter__.call(proxy, '123')); |
| 42 assertSame(undefined, Object.prototype.__lookupSetter__.call(proxy, '456')); |
34 | 43 |
35 using namespace v8::internal; | 44 // Test __lookupGetter__/__lookupSetter__ with proxy in prototype chain. |
| 45 var object = Object.create(proxy); |
| 46 assertSame(undefined, Object.prototype.__lookupGetter__.call(object, 'foo')); |
| 47 assertSame(undefined, Object.prototype.__lookupSetter__.call(object, 'bar')); |
| 48 assertSame(undefined, Object.prototype.__lookupGetter__.call(object, '123')); |
| 49 assertSame(undefined, Object.prototype.__lookupSetter__.call(object, '456')); |
36 | 50 |
37 TEST(List) { | 51 // Test inline constructors with proxy as prototype. |
38 v8::internal::V8::Initialize(NULL); | 52 function f() { this.x = 23; } |
39 List<AstNode*>* list = new List<AstNode*>(0); | 53 f.prototype = proxy; |
40 CHECK_EQ(0, list->length()); | 54 proxy_has_x = false; |
| 55 assertSame(23, new f().x); |
| 56 proxy_has_x = true; |
| 57 assertSame(19, new f().x); |
41 | 58 |
42 Isolate* isolate = Isolate::Current(); | 59 // Test inline constructors with proxy in prototype chain. |
43 Zone* zone = isolate->runtime_zone(); | 60 function g() { this.x = 42; } |
44 ZoneScope zone_scope(zone, DELETE_ON_EXIT); | 61 g.prototype.__proto__ = proxy; |
45 AstNodeFactory<AstNullVisitor> factory(isolate, zone); | 62 proxy_has_x = false; |
46 AstNode* node = factory.NewEmptyStatement(); | 63 assertSame(42, new g().x); |
47 list->Add(node); | 64 proxy_has_x = true; |
48 CHECK_EQ(1, list->length()); | 65 assertSame(19, new g().x); |
49 CHECK_EQ(node, list->at(0)); | |
50 CHECK_EQ(node, list->last()); | |
51 | |
52 const int kElements = 100; | |
53 for (int i = 0; i < kElements; i++) { | |
54 list->Add(node); | |
55 } | |
56 CHECK_EQ(1 + kElements, list->length()); | |
57 | |
58 list->Clear(); | |
59 CHECK_EQ(0, list->length()); | |
60 delete list; | |
61 } | |
OLD | NEW |