otawa::concept::IterativeDFAProblem Class Reference

Concept used to implements IterativeDFA problems. More...

#include </home/casse/otawa/otawa/src/prog/concepts.h>

Public Types
typedef struct Set	Set
	Type of the set of the problem. More...

Public Member Functions
Set *	empty (void)
	Build a new empty set (set constructor). More...
Set *	gen (BasicBlock *bb)
	Build the generating set for the given basic block. More...
Set *	kill (BasicBlock *bb)
	Build the killing set for the given basic block. More...
bool	equals (Set *set1, Set *set2)
	Test if two sets are equals. More...
void	reset (Set *set)
	Set to empty the given set. More...
void	merge (Set *set1, Set *set2)
	Merge two sets, as after a selection or at the entry of a loop. More...
void	set (Set *dset, Set *tset)
	Assign a set to another one. More...
void	add (Set *dset, Set *tset)
	Perform union of a set in another one (generate action). More...
void	diff (Set *dset, Set *tset)
	Makes the difference between two sets (kill action). More...
void	free (Set *set)
	Free the ressources used by the given set. More...

Detailed Description

Concept used to implements IterativeDFA problems.

Member Typedef Documentation

typedef struct Set otawa::concept::IterativeDFAProblem::Set

Type of the set of the problem.

Member Function Documentation

void otawa::concept::IterativeDFAProblem::add	(	Set *	dset,
		Set *	tset
	)

Perform union of a set in another one (generate action).

Parameters

dset	First source and destination set.
tset	Second source set.

void otawa::concept::IterativeDFAProblem::diff	(	Set *	dset,
		Set *	tset
	)

Makes the difference between two sets (kill action).

Parameters

dset	Destination and first operand set.
tset	Second operand set.

Set* otawa::concept::IterativeDFAProblem::empty

(

void

)

Build a new empty set (set constructor).

New empty set.

bool otawa::concept::IterativeDFAProblem::equals	(	Set *	set1,
		Set *	set2
	)

Test if two sets are equals.

Parameters

set1	First set to compare.
set2	Second set to compare.

Returns

True if they are equals, false else.

void otawa::concept::IterativeDFAProblem::free

(

Set *

set

)

Free the ressources used by the given set.

Parameters

set	Set to remove.

Set* otawa::concept::IterativeDFAProblem::gen

(

BasicBlock *

bb

)

Build the generating set for the given basic block.

Parameters

bb	Basic block to get generating set from.

Returns

Generating set.

Set* otawa::concept::IterativeDFAProblem::kill

(

BasicBlock *

bb

)

Build the killing set for the given basic block.

Parameters

bb	Basic block to get killing set from.

Returns

killing set.

void otawa::concept::IterativeDFAProblem::merge	(	Set *	set1,
		Set *	set2
	)

Merge two sets, as after a selection or at the entry of a loop.

Parameters

set1	First set to merge and result of the merge.
set2	Second set to merge.

void otawa::concept::IterativeDFAProblem::reset

(

Set *

set

)

Set to empty the given set.

This operation is mainly called to allow re-use of working set.

Parameters

set	Set to reset.

void otawa::concept::IterativeDFAProblem::set	(	Set *	dset,
		Set *	tset
	)

Assign a set to another one.

Parameters

dset	Destination set.
tset	Source set.

---

The documentation for this class was generated from the following file:

• src/prog/concepts.h