Otawa
0.10
|
#include <elm/assert.h>
#include <elm/genstruct/VectorQueue.h>
#include <elm/util/BitVector.h>
#include <otawa/cfg.h>
Go to the source code of this file.
Classes | |
class | otawa::dfa::Predecessor |
This iterator is used to traverse forward a CFG in an iterative DFA analysis. More... | |
class | otawa::dfa::Successor |
This iterator is used to traverse backward a CFG in an iterative DFA analysis. More... | |
class | otawa::dfa::IterativeDFA< Problem, Set, Iter > |
This class provides a generic facility to implement iterative Data Flow Analysis (DFA) as presented in "Aho, Sethi, Ullman, Compilers:
Principles, Techniques, and Tools, Addison Wesley 1986". More... | |
Namespaces | |
otawa | |
$Id$ Copyright (c) 2007, IRIT - UPS casse @iri t.fr | |
otawa::dfa | |
Macros | |
#define | OTAWA_IDFA_TRACE(x) |
#define | OTAWA_IDFA_DUMP(m, s) |
#define OTAWA_IDFA_DUMP | ( | m, | |
s | |||
) |
Referenced by otawa::dfa::IterativeDFA< Problem, Set, Iter >::compute().
#define OTAWA_IDFA_TRACE | ( | x | ) |
Referenced by otawa::dfa::IterativeDFA< Problem, Set, Iter >::compute().