Go to the documentation of this file.
33 #ifndef TTA_ASSIGNMENT_PLAN_HH
34 #define TTA_ASSIGNMENT_PLAN_HH
117 std::vector<std::pair<ResourceBroker*, SchedulingResource*> >
const TTAMachine::FunctionUnit * srcFU_
bool tryCachedAssignment(MoveNode &node, int cycle, const TTAMachine::Bus *bus, const TTAMachine::FunctionUnit *srcFU, const TTAMachine::FunctionUnit *dstFU, int immWriteCycle, const TTAMachine::ImmediateUnit *immu, int immRegIndex)
const TTAMachine::FunctionUnit * dstFU_
virtual ~AssignmentPlan()
int currentBroker_
Current broker.
std::vector< std::pair< ResourceBroker *, SchedulingResource * > > lastTestedWorkingAssignment_
cache.
void setRequest(int cycle, MoveNode &node, const TTAMachine::Bus *bus, const TTAMachine::FunctionUnit *srcFU, const TTAMachine::FunctionUnit *dstFU, int immWriteCycle, const TTAMachine::ImmediateUnit *immu, int immRegIndex)
ResourceBroker & lastBroker()
void insertBroker(ResourceBroker &broker)
const TTAMachine::ImmediateUnit * immu_
bool isTestedAssignmentPossible()
ResourceBroker & firstBroker()
MoveNode * node_
Move of current resource assignment request.
std::vector< PendingAssignment * > applicableAssignments_
Sequence of applicable pending assignments.
ResourceBroker & currentBroker()
ResourceBroker & broker(int index) const
std::vector< PendingAssignment * > assignments_
Sequence of pending assignments.
ResourceBroker & nextBroker(ResourceBroker &pos)
MoveNode * lastTriedNode_
std::vector< ResourceBroker * > brokers_
Sequence of resource brokers.
const TTAMachine::Bus * bus_
bool resourceFound_
True if a valid resource of current broker has been assigned.
int cycle_
Cycle in which current node should be placed.