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

Side by Side Diff: runtime/vm/hash_map_test.cc

Issue 10872035: Add a simple dominator based redundancy elimination. (Closed) Base URL: http://dart.googlecode.com/svn/branches/bleeding_edge/dart/
Patch Set: Created 8 years, 3 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
« runtime/vm/flow_graph_optimizer.cc ('K') | « runtime/vm/hash_map.h ('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 (c) 2012, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 #include "platform/assert.h" 5 #include "platform/assert.h"
6 #include "vm/unit_test.h" 6 #include "vm/unit_test.h"
7 #include "vm/hash_map.h" 7 #include "vm/hash_map.h"
8 8
9 namespace dart { 9 namespace dart {
10 10
(...skipping 12 matching lines...) Expand all
23 EXPECT(map.IsEmpty()); 23 EXPECT(map.IsEmpty());
24 TestValue v1(0); 24 TestValue v1(0);
25 TestValue v2(1); 25 TestValue v2(1);
26 TestValue v3(0); 26 TestValue v3(0);
27 map.Insert(&v1); 27 map.Insert(&v1);
28 EXPECT(map.Lookup(&v1) == &v1); 28 EXPECT(map.Lookup(&v1) == &v1);
29 map.Insert(&v2); 29 map.Insert(&v2);
30 EXPECT(map.Lookup(&v1) == &v1); 30 EXPECT(map.Lookup(&v1) == &v1);
31 EXPECT(map.Lookup(&v2) == &v2); 31 EXPECT(map.Lookup(&v2) == &v2);
32 EXPECT(map.Lookup(&v3) == &v1); 32 EXPECT(map.Lookup(&v3) == &v1);
33 DirectChainedHashMap<TestValue*> map2(map);
34 EXPECT(map2.Lookup(&v1) == &v1);
35 EXPECT(map2.Lookup(&v2) == &v2);
36 EXPECT(map2.Lookup(&v3) == &v1);
33 } 37 }
34 38
35 } // namespace dart 39 } // namespace dart
OLDNEW
« runtime/vm/flow_graph_optimizer.cc ('K') | « runtime/vm/hash_map.h ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698