PandA-2024.02
|
Base class for all scheduling algorithms. More...
#include "custom_map.hpp"
#include "graph.hpp"
#include "hls_function_step.hpp"
#include "strong_typedef.hpp"
Go to the source code of this file.
Data Structures | |
class | Scheduling |
Generic class managing scheduling algorithms. More... | |
Functions | |
CONSTREF_FORWARD_DECL (OpGraph) | |
REF_FORWARD_DECL (DesignFlowStep) | |
UINT_STRONG_TYPEDEF_FORWARD_DECL (ControlStep) | |
Base class for all scheduling algorithms.
This class is a pure virtual one, that has to be specilized in order to implement a particular scheduling algorithm. It has a internal attribute to check if a vertex is speculate. To specialize this class into an algorithm
Definition in file scheduling.hpp.
CONSTREF_FORWARD_DECL | ( | OpGraph | ) |
REF_FORWARD_DECL | ( | DesignFlowStep | ) |
UINT_STRONG_TYPEDEF_FORWARD_DECL | ( | ControlStep | ) |