Towards compiler optimization of codes based on arrays of pointers

Authors:
F. Corbera;R. Asenjo;E. L. Zapata
Affiliations:
Computer Architecture Dept., University of Malaga;Computer Architecture Dept., University of Malaga;Computer Architecture Dept., University of Malaga
Venue:
LCPC'02 Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing
Year:
2002

Citing 11
Cited 0

Dependence analysis for pointer variables

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
A general data dependence test for dynamic, pointer-based data structures

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Alias analysis of pointers in Pascal and Fortran 90: dependence analysis between pointer references

Acta Informatica
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric shape analysis via 3-valued logic

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Progressive Shape Analysis for Real C Codes

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
The Access Region Test

LCPC '99 Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing
Accurate Shape Analysis for Recursive Data Structures

LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
Analysis of Dynamic Structures for Efficient Parallel Execution

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

To successfully exploit all the possibilities of current computer/multicomputer architectures, optimization compiling techniques are a must. However, for codes based on pointers and dynamic data structures these optimization techniques have to be necessarily carried out after identifying the characteristics and properties of the data structure used in the code. In this paper we present one method able to automatically identify complex dynamic data structures used in a code even in the presence of arrays of pointers. This method has been implemented in an analyzer which symbolically executes the input code to generate a set of graphs, called RSRSG (Reduced Set of Reference Shape Graphs), for each statement. Each RSRSG accurately describes the data structure configuration at each program point. In order to deal with arrays of pointers we have introduced two main concepts: the multireference class, and instances. Our analyzer has been validated with several codes based on complex data structures containing arrays of pointers which were successfully identified.