Interval Maintenance of Dynamically Changing Flow Graphs

Abstract

Many compilers incorporate an optimization phase during the development of the final object code. Most optimization phases utilize a flow graph and partition it into disjoint single entry regions to perform various global flow analyses. The interval is a commonly used single entry region and interval analyses have been developed for performing standard analyses such as live variable analysis, etc. This paper presents a technique for maintaining the interval structure as the underlying flow graph is dynamically modified. The techniques presented preserve the interval order required by many interval analyses and do not require that the underlying flow graph be reducible

    Similar works