patter compat continued

[blast.git] / FunctionalBlock.h

diff --git a/FunctionalBlock.h b/FunctionalBlock.h
index b6ac65f1ee869f3f23c1ecec6ff68bd95b611895..f27bef640f5b78efcf0591910a9612f78a1c80a2 100644 (file)
--- a/FunctionalBlock.h
+++ b/FunctionalBlock.h
@@ -31,6 +31,10 @@ public:
   // getters\r
   inline ReferenceBlock* getReference() { return reference; }\r
   inline QList<int> getProductionCounter() { return productionCounter; }\r
   // getters\r
   inline ReferenceBlock* getReference() { return reference; }\r
   inline QList<int> getProductionCounter() { return productionCounter; }\r

+  inline QMap<AbstractInterface*, QList<char>* > getConsumptionPattern() { return consumptionPattern; }\r
+  inline QMap<AbstractInterface*, QList<char>* > getProductionPattern() { return productionPattern; }\r
+  inline int getConsumptionPatternLength() { return lengthCP; }\r
+  inline int getProductionPatternLength() { return lengthPP; }\r

   inline int getDelta() { return delta; }\r
   \r
   // setters\r
   inline int getDelta() { return delta; }\r
   \r
   // setters\r


@@ -52,45 +56,109 @@ public:
   QString getReferenceHashMd5();\r
   \r
   // patterns\r
   QString getReferenceHashMd5();\r
   \r
   // patterns\r

-  bool createPatterns();\r
+  bool createPatterns(); // called in Graph, before checking compatibility and computing output pattern\r
+  bool checkInputPatternCompatibility();\r
+  bool computeOutputPattern(int nbExec = -1);\r
+  \r
+private:  \r
+  // patterns\r

   bool createDelta();\r
   bool createConsumptionPattern(); // initialize a QList<char> for each interface from patterns defined in implementation\r
   bool createProductionPattern(); // initialize a QList<char> for each interface from patterns defined in implementation\r
   bool createProductionCounter(); // initialize a QList<int> from counter defined in implementation\r
   bool createDelta();\r
   bool createConsumptionPattern(); // initialize a QList<char> for each interface from patterns defined in implementation\r
   bool createProductionPattern(); // initialize a QList<char> for each interface from patterns defined in implementation\r
   bool createProductionCounter(); // initialize a QList<int> from counter defined in implementation\r

-  void initConsumptionPattern(); // initialize a char** from patterns defined for each interface\r
-  void initProductionPattern(); // initialize a char** from patterns defined for each interface\r
+  bool createAdmittance(int nbExec); // initialize a QList<char> from consumption pattern and delta\r

   void clearConsumptionPattern();\r
   void clearProductionPattern();\r
   void clearConsumptionPattern();\r
   void clearProductionPattern();\r

-  bool computeOutputPattern(int nbExec = -1);\r
+  void createInputPattern();\r
+  void clearInputPattern();\r
+  int getNumberOfExecution(); // compute number of block execution from inputPattern and delta\r

   \r
   \r

-private:  \r
-  // patterns  \r
-  bool isValidDataGroup(char** pattern, int nbPorts, int clock);\r

   double evaluateExpression(const QString& expression, bool* ok);\r
   double evaluateExpression(const QString& expression, bool* ok);\r

-  QList<char> expandPattern(const QString& pattern, bool* ok);\r
-  QList<char> expandPatternRecur(const QString& pattern, int* offset, bool* ok);\r
+  QList<char>* expandPattern(const QString& patternIn, bool* ok);\r
+  void expandPatternRecur(const QString& patternIn, int* offset, bool* ok, QList<char> *patternOut);\r
+  /*!\r
+   * \brief samePatterns\r
+   * \param patternSrc the pattern that must be tested with patternDest (is patternDest == patternDest)  \r
+   * \param srcCol the column index within patternSrc\r
+   * \param patternDest the pattern that must be tested with patternSrc\r
+   * \param destCol the column index within patternDest      \r
+   * BEWARE: this method returns as soons as there is an acces problem (i.e. out of list range, impossible combine, ...)\r
+   leaving the dest pattern in an inconsistent state. Thus, it is a good idea to call canCombine before.\r
+   */\r
+  bool samePatterns(const QMap<AbstractInterface*, QList<char>* >& patternSrc, int srcCol, const QMap<AbstractInterface*, QList<char>* >& patternDest, int destCol);\r
+  /*!\r
+   * \brief canCombinePatterns\r
+   * \param patternSrc the pattern that must be combined with patternDest (patternDest = patternDest OR patternSrc)  \r
+   * \param srcCol the column index within patternSrc\r
+   * \param patternDest the pattern that is modified by the combination (patternDest = patternDest OR patternSrc)\r
+   * \param destCol the column index within patternDest  \r
+   * \return true if the combination is possible, and false else (e.g. when X1 must be combined with 11)\r
+   * NB: if src/destCol are outside the range of the list, false is returned.   \r
+   */\r
+  bool canCombinePatterns(const QMap<AbstractInterface*, QList<char>* >& patternSrc, int srcCol, QMap<AbstractInterface*, QList<char>* > patternDest, int destCol);\r

   /*!\r
    * \brief combinePatterns\r
    * \param patternSrc the pattern that must be combined with patternDest (patternDest = patternDest OR patternSrc)  \r
    * \param srcCol the column index within patternSrc\r
    * \param patternDest the pattern that is modified by the combination (patternDest = patternDest OR patternSrc)\r
   /*!\r
    * \brief combinePatterns\r
    * \param patternSrc the pattern that must be combined with patternDest (patternDest = patternDest OR patternSrc)  \r
    * \param srcCol the column index within patternSrc\r
    * \param patternDest the pattern that is modified by the combination (patternDest = patternDest OR patternSrc)\r

-   * \param destClock the column index within patternDest\r
-   * \param nbCols the numer of columns to combine\r
-   * \param nbPorts the number of rows in both patterns\r
-   * BEWARE: no check is done if nbCols is consistent with the real length of both patterns, thus an access outside\r
-   * the patterns is possible.\r
+   * \param destCol the column index within patternDest      \r
+   * BEWARE: this method returns as soons as there is an acces problem (i.e. out of list range, impossible combine, ...)\r
+   leaving the dest pattern in an inconsistent state. Thus, it is a good idea to call canCombine before.\r

    */\r
    */\r

-  void combinePatterns(char** patternSrc, int srcCol, char** patternDest, int destCol, int nbCols, int nbPorts );\r
-\r
-  QList<int> productionCounter; //! only usefull for output interfaces\r
+  void combinePatterns(const QMap<AbstractInterface*, QList<char>* >& patternSrc, int srcCol, QMap<AbstractInterface*, QList<char>* > patternDest, int destCol);\r
+  /*!\r
+   * \brief appendToPattern\r
+   * \param patternSrc the pattern that must be appended to patternDest\r
+   * \param srcCol the column index within patternSrc\r
+   * \param patternDest the pattern that is modified by the append   \r
+   * \param nbCols the numer of columns to append   \r
+   * BEWARE: if nbCols is not consistent with the real length of src pattern, there may be less that nbCols\r
+   * that will be appended\r
+   */\r
+  void appendToPattern(const QMap<AbstractInterface*, QList<char>* >& patternSrc, int srcCol, QMap<AbstractInterface*, QList<char>* > patternDest, int nbCols);\r
+  /*!\r
+  * \brief removeDataGroup\r
+  * \param pattern the pattern for which a column is removed\r
+  * \param offset the index of the column to remove \r
+  */\r
+  void removeDataGroup(QMap<AbstractInterface*, QList<char>* >& pattern, int offset);\r
+  /*!\r
+  * \brief isValidGroup\r
+  * \param pattern the pattern to test\r
+  * \param offset the column to test\r
+  * isValidGroup checks if there is at least one 1 in the column offset of pattern.\r
+  */\r
+  bool isValidDataGroup(const QMap<AbstractInterface*, QList<char>* >& pattern, int offset);\r
+  /*!\r
+  * \brief isOnlyXGroup\r
+  * \param pattern the pattern to test\r
+  * \param offset the column to test\r
+  * isOnlyXGroup checks if there is only X in the column offset of pattern.\r
+  */\r
+  bool isOnlyXDataGroup(const QMap<AbstractInterface*, QList<char>* >& pattern, int offset);\r
+  /*!\r
+  * \brief shifRightPattern\r
+  * \param pattern the pattern to shift\r
+  * \param offset the column where to shift\r
+  * shiftRightPattern insert a null colmun in pattern, which leads to shift right the pattern at offset.\r
+  * this method is used during admittance generation\r
+  */\r
+  void shiftRightPattern(const QMap<AbstractInterface*, QList<char>* >& pattern, int offset);\r
+\r
+  QMap<AbstractInterface*, QList<char>* > consumptionPattern;\r
+  QMap<AbstractInterface*, QString > admittanceCyclic; // the admittance expressed as prologue-cyclic part-eppilogue, deduced from admittance\r
+  QMap<AbstractInterface*, QList<char>* > admittance; // the admittance taking into account nb exec.\r
+  QMap<AbstractInterface*, QList<char>* > productionPattern;\r
+  QMap<AbstractInterface*,QList<char>* > inputPattern;\r
+  QMap<AbstractInterface*, QList<char>* > outputPattern; // CAUTION: the QList<char>* must also be stored in the outputPattern attributes of AbstractInterface\r
+  QList<int> productionCounter; //! only usefull for control output interfaces\r
+  int lengthIP; // for convenience, set in createInputPattern()\r
+  int lengthCP; // for convenience, set in createConsumptionPattern()\r
+  int lengthAP; // for convenience, set in createAdmittance()\r
+  int lengthPP;  // for convenience, set in createProductionPattern()\r
+  int lengthOP;  // for convenience, set in computeOutputPattern()\r

   int delta;\r
   int delta;\r

-  \r
-  char** consumptionPattern;\r
-  int nbConsumingPorts;\r
-  int lengthCP;\r
-  char** productionPattern;\r
-  int nbProducingPorts;\r
-  int lengthPP;\r
+    \r

   ArithmeticEvaluator* evaluator;\r
   \r
   ReferenceBlock* reference;\r
   ArithmeticEvaluator* evaluator;\r
   \r
   ReferenceBlock* reference;\r