Stack Analysis

This analysis is a very simple analysis using semantic instruction to determine constant values (and adresses) and addresses relative to the initial stack address of the program. More...

Classes
class	otawa::StackAnalysis
	This analyzer computes accessed addresses. More...

Functions
p::feature	otawa::STACK_ANALYSIS_FEATURE ("otawa::STACK_ANALYSIS_FEATURE", new Maker< StackAnalysis >())
	This features ensure that the stack analysis has been identified. More...

Variables
Feature< StackAnalysis >	otawa::STACK_ANALYSIS_FEATURE
	This features ensure that the stack analysis has been identified. More...

Detailed Description

This analysis is a very simple analysis using semantic instruction to determine constant values (and adresses) and addresses relative to the initial stack address of the program.

An interesting property is that it can be called on each subprogram separately and provide local addresses relative to the initial address of the stack without knowing it. This analysis may also be used to determine the stack memory size used by subprograms (but only without recursive calls).

Function Documentation

p::feature otawa::STACK_ANALYSIS_FEATURE	(	"otawa::STACK_ANALYSIS_FEATURE"	,
		new Maker< StackAnalysis >	()
	)

This features ensure that the stack analysis has been identified.

Default Processor

• otawa::StackAnalysis

Variable Documentation

p::feature otawa::STACK_ANALYSIS_FEATURE

This features ensure that the stack analysis has been identified.

Default Processor

• otawa::StackAnalysis

Referenced by otawa::StackAnalysis::cleanup().