论文部分内容阅读
Pointer analysis is a technique to identify at compile-time the porntential values of the pointer expressions in a program, which promises significantrnbenefits for optimizing and parallelizing compilers. In this paper, a new approach to rnpointer analysis for assignments is presented. In this approach, assignments are clasrnsified into three categories: pointer assignments, structure (union) assignments and rnnormal assignments which don’t affect the point-to information. Pointer analyses rnfor these three kinds of assignments respectively make up the integrated algorithm.rnWhen analyzing a pointer assignment, a new method called expression expansion rnis used to calculate both the left targets and the right targets. The integration of rnrecursive data structure analysis into pointer analysis is a significant originality of rnthis paper, which uniforms the pointer analysis for heap variables and the pointer rnanalysis for stack variables. This algorithm is implemented in Agassiz, an analyzing rntool for C programs developed by Institute of Parallel Processing, Fudan University.rnIts accuracy and effectiveness are illustrated by experimental data.