BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-87-342
       ENTRY:: November 08, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: INTERPROCEDURAL ANALYSIS USELESS FOR CODE OPTIMIZATION
        TYPE:: Technical Report
      AUTHOR:: Richardson, S.
      AUTHOR:: Ganapathi, M.
        DATE:: November 1987
       PAGES:: 32
    ABSTRACT:: The problem of tracking data flow across procedure boundaries
               has a long history of theoretical study by people who
               believed that such information would be useful for code
               optimization. Building upon previous work, we have
               implemented an algorithm for interprocedural data flow
               analysis. The algorithm produces three flow-insensitive
               summary sets: MOD, USE, and ALIASES. The utility of the
               resulting information was investigated using an optimizing
               Pascal compiler. Over a sampling of 27 benchmarks, we found
               that additional optimizations performed as a result of
               interprocedural summary information contributed almost
               nothing to program execution speed.
       NOTES:: [Adminitrivia V1/Prg/19941108]
         END:: STAN//CSL-TR-87-342