summaryrefslogtreecommitdiff
path: root/compiler/optimizing/graph_visualizer.cc
diff options
context:
space:
mode:
authorVladimir Marko <vmarko@google.com>2014-05-23 15:16:44 +0100
committerVladimir Marko <vmarko@google.com>2014-05-23 17:12:15 +0100
commita5b8fde2d2bc3167078694fad417fddfe442a6fd (patch)
tree287942554467eb8566291f7d021549f65763f53e /compiler/optimizing/graph_visualizer.cc
parent567e9dbc65ee183cda2a052dbf224c8c4a8f9423 (diff)
Rewrite BitVector index iterator.
The BitVector::Iterator was not iterating over the bits but rather over indexes of the set bits. Therefore, we rename it to IndexIterator and provide a BitVector::Indexes() to get a container-style interface with begin() and end() for range based for loops. Also, simplify InsertPhiNodes where the tmp_blocks isn't needed since the phi_nodes and input_blocks cannot lose any blocks in subsequent iterations, so we can do the Union() directly in those bit vectors and we need to repeat the loop only if we have new input_blocks, rather than on phi_nodes change. And move the temporary bit vectors to scoped arena. Change-Id: I6cb87a2f60724eeef67c6aaa34b36ed5acde6d43
Diffstat (limited to 'compiler/optimizing/graph_visualizer.cc')
0 files changed, 0 insertions, 0 deletions