Otawa
0.10
|
#include <elm/genstruct/Vector.h>
Go to the source code of this file.
Classes | |
class | otawa::concept::DiGraph |
This concept attempts to provide a representation of a digraph that may only be traversed in the edge direction. More... | |
class | otawa::concept::DiGraph::Vertex |
Vertex class. More... | |
class | otawa::concept::DiGraph::Edge |
Opaque type for the edges. More... | |
class | otawa::concept::DiGraph::Successor |
Outing edge iterator on a node. More... | |
class | otawa::concept::DiGraphWithLoop |
A digraph that supports loop identification. More... | |
class | otawa::concept::DiGraphWithIndexedVertex |
This kind of digraph contain indexed graph. More... | |
class | otawa::concept::BiDiGraph |
Concept of directed graph with predecessor available. More... | |
class | otawa::concept::BiDiGraph::Predecessor |
Entering-in edge iterator on a node. More... | |
class | otawa::concept::DiGraphWithVertexMap |
Concept of directed graph providing a vertex map. More... | |
class | otawa::concept::DiGraphWithVertexMap::VertexMap< T > |
Efficient map for the nodes. More... | |
class | otawa::concept::DiGraphWithEdgeMap |
Concept of directed graph providing an edge map. More... | |
class | otawa::concept::DiGraphWithEdgeMap::EdgeMap< T > |
Efficient map for the edges. More... | |
class | otawa::concept::DiGraphWithEntry |
Directed graph with a unique entry point. More... | |
class | otawa::concept::DiGraphWithExit |
Directed graph with a unique entry and exit points. More... | |
class | otawa::concept::InstBlock |
An iterable block of instruction. More... | |
class | otawa::concept::InstBlock::InstIter |
Iterator on the instruction of the block. More... | |
class | otawa::concept::AbstractDomain< T, G > |
Concept used to implements AbsIntLite domain. More... | |
class | otawa::concept::IterativeDFAProblem |
Concept used to implements IterativeDFA problems. More... | |
class | otawa::ai::Graph |
Graph concept for ai module. More... | |
class | otawa::ai::Graph::Predecessor |
Iterator on the entering edges on the given vertex. More... | |
class | otawa::ai::Graph::Successor |
Iterator on the leaving edges of the given vertex. More... | |
class | otawa::ai::Graph::Iterator |
Iterator on the vertices of the graph. More... | |
class | otawa::ai::Domain |
Domain concept for ai module. More... | |
class | otawa::ai::InputIter |
Iterator on input of a vertex. More... | |
class | otawa::ai::OutputIter |
Iterator to set output values. More... | |
Namespaces | |
otawa | |
$Id$ Copyright (c) 2007, IRIT - UPS casse @iri t.fr | |
otawa::concept | |
otawa::ai | |