21 #ifndef OTAWA_CCG_CCGDFA_H
22 #define OTAWA_CCG_CCGDFA_H
78 #endif // OTAWA_CCG_CCGDFA_H
void meet(Domain *d)
Definition: DFA.h:45
Domain(int size)
Definition: DFA.h:42
Problem(LBlockSet *_ccggraph, int _size, const hard::Cache *_cach, WorkSpace *_fw)
Definition: DFA.h:54
Domain * gen(CFG *cfg, BasicBlock *bb)
Definition: ccg_DFA.cpp:47
void reset(void)
Definition: DFA.h:43
void empty(void)
Remove all items from the bit set.
Definition: BitSet.h:109
void join(Domain *d)
Definition: DFA.h:44
WorkSpace * fw
Definition: DFA.h:73
static int vars
Definition: DFA.h:71
This class implements a set as a bit vector.
Definition: BitSet.h:82
LBlockSet * ccggraph
Definition: DFA.h:69
BitSet(void)
Definition: BitSet.h:101
dtd::Element bb(dtd::make("bb", _BB).attr(id).attr(address).attr(size))
Control Flow Graph representation.
Definition: CFG.h:42
const hard::Cache * cach
Definition: DFA.h:70
Domain domain_t
Definition: DFA.h:52
void mask(const BitSet &set)
Keep only in this set the items also containted in the given one (performs intersection operation)...
Definition: BitSet.h:122
Domain * preserve(CFG *cfg, BasicBlock *bb)
Definition: ccg_DFA.cpp:75
A workspace represents a program, its run-time and all information about WCET computation or any othe...
Definition: WorkSpace.h:67
bool equals(Domain *d)
Definition: DFA.h:46
This class contains the configuration of a level of cache of processor.
Definition: Cache.h:34
bool equals(const BitSet &set) const
Test if two bit sets are equals.
Definition: BitSet.h:115
Domain * empty(void)
Definition: DFA.h:57
dtd::Element cfg(dtd::make("cfg", _CFG).attr(id).content((entry,*bb, exit,*edge)))
This class represents the list of l-blocks of a task for a chosen cache row.
Definition: features.h:75
This is the minimal definition of a basic block.
Definition: BasicBlock.h:43
int size
Definition: DFA.h:72
void free(Domain *d)
Definition: DFA.h:66
void add(int index)
Add an item to the bit set.
Definition: BitSet.h:112