Chromium Code Reviews| Index: runtime/vm/constant_propagator.cc |
| =================================================================== |
| --- runtime/vm/constant_propagator.cc (revision 43075) |
| +++ runtime/vm/constant_propagator.cc (working copy) |
| @@ -30,10 +30,10 @@ |
| graph_(graph), |
| unknown_(Object::unknown_constant()), |
| non_constant_(Object::non_constant()), |
| - reachable_(new(graph->isolate()) BitVector( |
| - graph->isolate(), graph->preorder().length())), |
| - marked_phis_(new(graph->isolate()) BitVector( |
| - graph->isolate(), graph->max_virtual_register_number())), |
| + reachable_(new(graph->zone()) BitVector( |
|
Ivan Posva
2015/01/23 19:49:24
How about defining Z in this file?
koda
2015/01/23 21:12:10
Done.
|
| + graph->zone(), graph->preorder().length())), |
| + marked_phis_(new(graph->zone()) BitVector( |
| + graph->zone(), graph->max_virtual_register_number())), |
| block_worklist_(), |
| definition_worklist_(graph, 10) {} |
| @@ -1430,7 +1430,8 @@ |
| // Canonicalize branches that have no side-effects and where true- and |
| // false-targets are the same. |
| bool changed = false; |
| - BitVector* empty_blocks = new(I) BitVector(I, graph_->preorder().length()); |
| + BitVector* empty_blocks = new(graph_->zone()) BitVector(graph_->zone(), |
| + graph_->preorder().length()); |
| for (BlockIterator b = graph_->postorder_iterator(); |
| !b.Done(); |
| b.Advance()) { |