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

Side by Side Diff: test/mjsunit/regress/regress-1436.js

Issue 7044054: Fix Array.prototype.{reduce,reduceRight} to pass undefined as receiver (Closed) Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: Just fix the issue. :-) Created 9 years, 6 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 unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « src/v8natives.js ('k') | no next file » | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2010 the V8 project authors. All rights reserved. 1 // Copyright 2011 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 #ifndef V8_PREPARSE_DATA_FORMAT_H_ 28 // Check that reduce and reduceRight call the callback function with
29 #define V8_PREPARSE_DATA_FORMAT_H_ 29 // undefined as the receiver (which for non-strict functions is
30 // transformed to the global object).
30 31
31 namespace v8 { 32 // Check receiver for reduce and reduceRight.
32 namespace internal {
33 33
34 // Generic and general data used by preparse data recorders and readers. 34 var global = this;
35 function non_strict(){ assertEquals(global, this); }
36 function strict(){ "use strict"; assertEquals(void 0, this); }
35 37
36 struct PreparseDataConstants { 38 [2, 3].reduce(non_strict);
37 public: 39 [2, 3].reduceRight(non_strict);
38 // Layout and constants of the preparse data exchange format. 40 [2, 3].reduce(strict);
Lasse Reichstein 2011/06/09 08:57:02 Group by function called, like below (i.e., both r
Mads Ager (chromium) 2011/06/09 09:05:03 Done.
39 static const unsigned kMagicNumber = 0xBadDead; 41 [2, 3].reduceRight(strict);
40 static const unsigned kCurrentVersion = 6;
41
42 static const int kMagicOffset = 0;
43 static const int kVersionOffset = 1;
44 static const int kHasErrorOffset = 2;
45 static const int kFunctionsSizeOffset = 3;
46 static const int kSymbolCountOffset = 4;
47 static const int kSizeOffset = 5;
48 static const int kHeaderSize = 6;
49
50 // If encoding a message, the following positions are fixed.
51 static const int kMessageStartPos = 0;
52 static const int kMessageEndPos = 1;
53 static const int kMessageArgCountPos = 2;
54 static const int kMessageTextPos = 3;
55
56 static const unsigned char kNumberTerminator = 0x80u;
57 };
58 42
59 43
60 } } // namespace v8::internal. 44 // Check the receiver for callbacks in other array methods.
61 45 [2, 3].filter(non_strict);
62 #endif // V8_PREPARSE_DATA_FORMAT_H_ 46 [2, 3].filter(strict);
47 [2, 3].forEach(non_strict);
48 [2, 3].forEach(strict);
49 [2, 3].some(non_strict);
50 [2, 3].some(strict);
51 [2, 3].every(non_strict);
52 [2, 3].every(strict);
53 [2, 3].map(non_strict);
54 [2, 3].map(strict);
Lasse Reichstein 2011/06/09 08:57:02 How about putting them in alphabetic order. Matbe
Mads Ager (chromium) 2011/06/09 09:05:03 Done.
OLDNEW
« no previous file with comments | « src/v8natives.js ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698