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

Side by Side Diff: test/mjsunit/elements-kind-depends.js

Issue 10170030: Implement tracking and optimizations of packed arrays (Closed) Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: ia32 ready to go Created 8 years, 7 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
OLDNEW
1 // Copyright 2011 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
(...skipping 28 matching lines...) Expand all
39 assertEquals(10, a[0]); 39 assertEquals(10, a[0]);
40 assertEquals(15.5, a[1]); 40 assertEquals(15.5, a[1]);
41 assertEquals(20, a[2]); 41 assertEquals(20, a[2]);
42 } 42 }
43 43
44 var b; 44 var b;
45 for (var i = 0; i < 3; ++i) { 45 for (var i = 0; i < 3; ++i) {
46 b = burn(); 46 b = burn();
47 check(b); // all OK 47 check(b); // all OK
48 } 48 }
49 %OptimizeFunctionOnNextCall(burn); 49 //%OptimizeFunctionOnNextCall(burn);
Jakob Kummerow 2012/05/13 21:55:27 This doesn't look intentional.
danno 2012/05/22 11:05:21 Done.
50 b = burn(); 50 b = burn();
51 check(b); // fails 51 check(b); // fails
52 52
53 53
54 function loop_test(x) { 54 function loop_test(x) {
55 for (i=0;i<3;i++) { 55 for (i=0;i<3;i++) {
56 x[i] = (i+1) * 0.5; 56 x[i] = (i+1) * 0.5;
57 } 57 }
58 } 58 }
59 59
60 function check2(b) { 60 function check2(b) {
61 assertEquals(0.5, b[0]); 61 assertEquals(0.5, b[0]);
62 assertEquals(1.0, b[1]); 62 assertEquals(1.0, b[1]);
63 assertEquals(1.5, b[2]); 63 assertEquals(1.5, b[2]);
64 } 64 }
65 65
66 for (var i = 0; i < 3; ++i) { 66 for (var i = 0; i < 3; ++i) {
67 b = [0,1,2]; 67 b = [0,1,2];
68 loop_test(b); 68 loop_test(b);
69 check2(b); 69 check2(b);
70 } 70 }
71 %OptimizeFunctionOnNextCall(loop_test); 71 %OptimizeFunctionOnNextCall(loop_test);
72 b = [0,1,2]; 72 b = [0,1,2];
73 loop_test(b); 73 loop_test(b);
74 check2(b); 74 check2(b);
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698