• Home
  • Search
  • A linear time algorithm for placing φ-nodes
  • Cite Icon87
  • https://doi.org/10.1145/199448.199464Copy DOI Icon

A linear time algorithm for placing φ-nodes

  • Jan 1, 1995
  • Vugranam C Sreedhar +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Dataflow analysis framework based on Static Single Assignment (SSA) form and Sparse Evaluation Graphs (SEGs) demand fast computation of program points where data flow information must be merged, the so-called φ-nodes. In this paper, we present a surprisingly simple algorithm for computing φ-nodes for arbitrary flowgraphs (reducible or irreducible) that runs in linear time. We employ a novel program representation—the DJ graph—by augmenting the dominator tree of a flowgraph with edges which may lead to a potential “merge” of dataflow information. In searching for φ-nodes we never visit an edge in the DJ-graph more than once by guiding the search of nodes by their levels in the dominator tree.

Similar Papers
  • Research Article
  • Citations132

Practical improvements to the construction and destruction of static single assignment form

  • Jul 10, 1998
  • Software: Practice and Experience
  • Preston Briggs +3
  • Research Article
  • Citations38

A Functional Perspective on SSA Optimisation Algorithms

  • Apr 01, 2004
  • Electronic Notes in Theoretical Computer Science
  • Manuel M.T Chakravarty +2
  • Research Article
  • Citations41

Algorithms for computing the static single assignment form

  • May 01, 2003
  • Journal of the ACM
  • Gianfranco Bilardi +1
  • PDF
  • Dissertation
  • Citations1

Future value based single assignment program representations and optimizations

  • Jan 01, 2012
  • Shuhan Ding
  • Conference Article
  • Citations153

Array SSA form and its use in parallelization

  • Jan 01, 1998
  • Kathleen Knobe +1
  • Book Chapter
  • Citations9

If-Conversion in SSA Form

  • Jan 01, 2004
  • Arthur Stoutchinin +1
  • Conference Article
  • Citations8

Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design

  • Nov 01, 2007
  • Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design
  • Philip Brisk +2
  • Book Chapter
  • Citations4

Using the SSA-Form in a Code Generator

  • Jan 01, 2014
  • Benoît Dupont De Dinechin
  • Research Article
  • Citations1

Computing SSA Form with Matrices

  • Jul 01, 2007
  • Electronic Notes in Theoretical Computer Science
  • Quan Hoang Nguyen
  • Conference Article
  • Citations60

Linear scan register allocation on SSA form

  • Apr 24, 2010
  • Christian Wimmer +1
  • Conference Article
  • Citations13

Verified construction of static single assignment form

  • Mar 17, 2016
  • Sebastian Buchwald +2
  • Book Chapter
  • Citations18

Incremental computation of static single assignment form

  • Jan 01, 1996
  • Jong -Deok Choi +2
  • Research Article
  • Citations28

Optimal register sharing for high-level synthesis of SSA form programs

  • May 01, 2006
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • P Brisk +3
  • Conference Article
  • Citations8

A type system equivalent to static single assignment

  • Jul 10, 2006
  • Yutaka Matsuno +1
  • Conference Article
  • Citations13

Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design

  • Nov 05, 2007
  • Philip Brisk +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.