class Graph {
public:
- Graph();
+ Graph(bool createTopGroupIface = true);
~Graph();
// getters
inline QList<GroupBlock*> getAllGroups() { return groups; }
// methods for group blocks
- GroupBlock* createChildGroupBlock(GroupBlock* parent);
+ GroupBlock* createChildGroupBlock(GroupBlock* parent, bool createGroupIface = true);
void removeGroupBlock(GroupBlock *group);
GroupBlock* getGroupBlockByName(QString name);
// methods for functional blocks
- FunctionalBlock* createFunctionalBlock(GroupBlock *group, ReferenceBlock *ref);
+ FunctionalBlock* createFunctionalBlock(GroupBlock *group, ReferenceBlock *ref, bool createIfaces = true);
FunctionalBlock* duplicateFunctionalBlock(FunctionalBlock *block);
bool removeFunctionalBlock(FunctionalBlock* block);
FunctionalBlock* getFunctionalBlockByName(QString name, GroupBlock* parent = NULL); //! if parent = NULL, search in the whole graph
// methods for source blocks
- FunctionalBlock* createSourceBlock(ReferenceBlock *ref);
+ FunctionalBlock* createSourceBlock(ReferenceBlock *ref, bool createIfaces = true);
FunctionalBlock* duplicateSourceBlock(FunctionalBlock *block);
FunctionalBlock* getSourceBlockByName(QString name);
bool removeSourceBlock(FunctionalBlock* block);
// others
QList<AbstractInterface *> getOutsideInterfaces();
+ QList<QString> getExternalResources(); // returns the list of all external files needed for VHDL generation
+
/*!
* \brief createPatterns
* createPatterns() crosses the graph and for each functional block, it computes
void resetPatternComputed();
void computeOutputPatterns(int nbExec) throw(Exception);
-
+ void generateVHDL(const QString& path) throw(Exception);
+
private:
GroupBlock* topGroup;
QList<GroupBlock *> groups; //! usefull to avoid recursive methods to find a particular group.