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 |
(...skipping 10 matching lines...) Expand all Loading... |
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 // Flags: --harmony-proxies | 28 // Flags: --harmony-proxies |
29 | 29 |
30 var proxy_has_x = false; | 30 var proxy_has_x = false; |
31 var proxy = new Proxy({}, { getPropertyDescriptor:function(key) { | 31 var proxy = new Proxy({}, { |
32 assertSame('x', key); | 32 get(t, key, receiver) { |
33 if (proxy_has_x) { | 33 assertSame('x', key); |
34 return { configurable:true, writable:false, value:19 }; | 34 if (proxy_has_x) { return 19 } |
| 35 return 8; |
35 } | 36 } |
36 }}); | 37 }); |
37 | 38 |
38 // Test __lookupGetter__/__lookupSetter__ with proxy. | 39 // Test __lookupGetter__/__lookupSetter__ with proxy. |
39 assertSame(undefined, Object.prototype.__lookupGetter__.call(proxy, 'foo')); | 40 assertSame(undefined, Object.prototype.__lookupGetter__.call(proxy, 'foo')); |
40 assertSame(undefined, Object.prototype.__lookupSetter__.call(proxy, 'bar')); | 41 assertSame(undefined, Object.prototype.__lookupSetter__.call(proxy, 'bar')); |
41 assertSame(undefined, Object.prototype.__lookupGetter__.call(proxy, '123')); | 42 assertSame(undefined, Object.prototype.__lookupGetter__.call(proxy, '123')); |
42 assertSame(undefined, Object.prototype.__lookupSetter__.call(proxy, '456')); | 43 assertSame(undefined, Object.prototype.__lookupSetter__.call(proxy, '456')); |
43 | 44 |
44 // Test __lookupGetter__/__lookupSetter__ with proxy in prototype chain. | 45 // Test __lookupGetter__/__lookupSetter__ with proxy in prototype chain. |
45 var object = Object.create(proxy); | 46 var object = Object.create(proxy); |
46 assertSame(undefined, Object.prototype.__lookupGetter__.call(object, 'foo')); | 47 assertSame(undefined, Object.prototype.__lookupGetter__.call(object, 'foo')); |
47 assertSame(undefined, Object.prototype.__lookupSetter__.call(object, 'bar')); | 48 assertSame(undefined, Object.prototype.__lookupSetter__.call(object, 'bar')); |
48 assertSame(undefined, Object.prototype.__lookupGetter__.call(object, '123')); | 49 assertSame(undefined, Object.prototype.__lookupGetter__.call(object, '123')); |
49 assertSame(undefined, Object.prototype.__lookupSetter__.call(object, '456')); | 50 assertSame(undefined, Object.prototype.__lookupSetter__.call(object, '456')); |
50 | 51 |
51 // Test inline constructors with proxy as prototype. | 52 // Test inline constructors with proxy as prototype. |
52 function f() { this.x = 23; } | 53 function F() { this.x = 42 } |
53 f.prototype = proxy; | 54 F.prototype = proxy; |
| 55 var instance = new F(); |
| 56 |
54 proxy_has_x = false; | 57 proxy_has_x = false; |
55 assertSame(23, new f().x); | 58 assertSame(42, instance.x); |
| 59 delete instance.x; |
| 60 assertSame(8, instance.x); |
| 61 |
56 proxy_has_x = true; | 62 proxy_has_x = true; |
57 assertSame(19, new f().x); | 63 assertSame(19, instance.x); |
58 | 64 |
59 // Test inline constructors with proxy in prototype chain. | 65 // Test inline constructors with proxy in prototype chain. |
60 function g() { this.x = 42; } | 66 function G() { this.x = 42; } |
61 g.prototype.__proto__ = proxy; | 67 G.prototype.__proto__ = proxy; |
| 68 instance = new G(); |
| 69 |
62 proxy_has_x = false; | 70 proxy_has_x = false; |
63 assertSame(42, new g().x); | 71 assertSame(42, instance.x); |
| 72 delete instance.x; |
| 73 assertSame(8, instance.x); |
| 74 |
64 proxy_has_x = true; | 75 proxy_has_x = true; |
65 assertSame(19, new g().x); | 76 assertSame(19, instance.x); |
OLD | NEW |