commit 7e589feab1b35203fbb8c431213f1d2b2a4ad530
author David Brazdil <dbrazdil@google.com> Fri May 06 12:46:21 2016 +0100
committer David Brazdil <dbrazdil@google.com> Tue May 10 12:13:33 2016 +0100
tree 14e4846619d6389ce958688b5ace65a6f0ad4275
parent 6282080843ce4a05e8d36056950016ff8f0da1a6

ART: Fix dominance for irreducible loops

Computation of dominance was broken in the presence of irreducible
loops because the algorithm assumed that back edges are always
dominated by their respective headers and a fix-point iteration is
therefore unnecessary.

This is not true for irreducible loops, forcing us to revisit their
loop headers and all dependent blocks. This patch adds a fix-point
iteration if a back edge not dominated by its header is found.

Bug: 28611485
Change-Id: If84044e49d5b9c682949648033d2861628d7fe05
(cherry picked from commit 3f4a522cc39f5c651e7c718196e989bc81d8c6ef)