3 Commits

Author	SHA1	Message	Date
vegorov@google.com	2f23dc4b60	Simple iterative liveness analysis over SSA. ... R=fschneider@google.com BUG= TEST= Review URL: https://chromiumcodereview.appspot.com//10666026 git-svn-id: https://dart.googlecode.com/svn/branches/bleeding_edge/dart@9069 260f80e4-7a28-3924-810f-c04153c831b5	2012-06-25 17:07:16 +00:00
fschneider@google.com	ee4a0fd042	First step to SSA construction: Phi insertion. ... This CL contains the phi insertion step of the SSA construction algorithmus: The phi instructions inserted are not functional yet. Renaming is not included yet. I based it on Kevin's CL (http://codereview.chromium.org/10388161/), rebased and fixed a bug (added missing iterator.Advance()) there. It also reintroduces the Definition IL class because Phi-instructions are also definitions that are referenced by UseVal. I also added the set of immediately dominated blocks to each basic block. This will be needed for pre-order dominator-tree traversal in the renaming pass. Review URL: https://chromiumcodereview.appspot.com//10539108 git-svn-id: https://dart.googlecode.com/svn/branches/bleeding_edge/dart@8604 260f80e4-7a28-3924-810f-c04153c831b5	2012-06-13 13:36:04 +00:00
kmillikin@google.com	e4030da968	Compute assigned variables and dominance frontiers. ... During basic block discovery, compute assigned variables in each block. After computing immediate dominators, compute dominance frontiers. Both of these will be used for SSA construction. R=fschneider@google.com,srdjan@google.com BUG= TEST= Review URL: https://chromiumcodereview.appspot.com//10377104 git-svn-id: https://dart.googlecode.com/svn/branches/bleeding_edge/dart@7685 260f80e4-7a28-3924-810f-c04153c831b5	2012-05-16 13:28:02 +00:00