Files
sdk/runtime/vm
srdjan@google.com 1d7d76a43b Optimizing code generator expects that every AST node is traversed once, i.e., the nodes are not reused. Unfortunately this is not the case in assignment operations with arrays (e.g. a[i] += 3).
The proper solution would be to clone array and index nodes but that would require too many changes. Long term we can't / won't use AST nodes for optimization purposes.
Short term fix is here: load array and index and release their CodeGenInfo before value is traversed so that the value computation can set its own CodeGenInfo on the same node.
Review URL: https://chromiumcodereview.appspot.com//9373025

git-svn-id: https://dart.googlecode.com/svn/branches/bleeding_edge/dart@4121 260f80e4-7a28-3924-810f-c04153c831b5
2012-02-10 08:30:53 +00:00
..
2011-10-05 05:20:07 +00:00
2012-01-10 00:32:51 +00:00
2011-10-05 05:20:07 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2011-10-05 05:20:07 +00:00
2011-11-30 17:04:45 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2011-10-05 05:20:07 +00:00
2011-12-17 00:56:02 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2011-12-22 00:21:41 +00:00
2011-12-22 00:21:41 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2011-11-30 23:12:46 +00:00
2011-11-30 23:12:46 +00:00
2011-11-30 23:12:46 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2011-12-15 22:37:35 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2012-02-02 19:05:06 +00:00
2012-02-02 19:05:06 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-06 10:14:49 +00:00
2012-02-01 18:53:40 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2012-02-07 16:40:38 +00:00
2012-02-07 23:27:51 +00:00
2012-02-07 23:27:51 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2011-12-17 00:56:02 +00:00
2012-02-02 19:05:06 +00:00
2011-10-05 05:20:07 +00:00
2012-01-10 00:32:51 +00:00
2012-01-10 00:32:51 +00:00
2011-10-05 05:20:07 +00:00
2011-10-05 05:20:07 +00:00
2012-02-02 19:05:06 +00:00
2011-10-05 05:20:07 +00:00