OSDN Git Service

ART: Topological Sort Traversal Implementation
authorJean Christophe Beyler <jean.christophe.beyler@intel.com>
Tue, 29 Apr 2014 21:40:41 +0000 (14:40 -0700)
committerJean Christophe Beyler <jean.christophe.beyler@intel.com>
Thu, 22 May 2014 18:29:01 +0000 (11:29 -0700)
commit44e5bdec17d0528b90cc0773be2beb76dcafdc5b
tree5d683f023d070f62d9355cc452c24920553fb9a4
parentb8033db2a8dc6f7c7e29b1552177542964f56e44
ART: Topological Sort Traversal Implementation

- Added a topological sort implementation for traversal.
  - Useful for traversals that require traversing the predecessors first.
- Added a function to BasicBlock to detect if it is an exception block.

Change-Id: I573da1768a635c6fd0259573dbb46b112132e129
Signed-off-by: Jean Christophe Beyler <jean.christophe.beyler@intel.com>
Signed-off-by: Razvan A Lupusoru <razvan.a.lupusoru@intel.com>
Signed-off-by: Yixin Shou <yixin.shou@intel.com>
Signed-off-by: Chao-ying Fu <chao-ying.fu@intel.com>
Signed-off-by: Udayan Banerji <udayan.banerji@intel.com>
compiler/dex/dataflow_iterator.h
compiler/dex/mir_graph.cc
compiler/dex/mir_graph.h
compiler/dex/pass.h
compiler/dex/pass_driver.cc
compiler/dex/pass_me.h