moved clocks list to graph

[blast.git] / FunctionalBlock.cpp

diff --git a/FunctionalBlock.cpp b/FunctionalBlock.cpp
index ccaa7b2c8ead70bc09165e0ac451ce2ee039ecf1..0fb38c39881ec64c9a45d84eac3a2b09fae95d9b 100644 (file)
--- a/FunctionalBlock.cpp
+++ b/FunctionalBlock.cpp
@@ -65,7 +65,7 @@ bool FunctionalBlock::isFunctionalBlock() {
   return true;\r
 }\r
 \r
   return true;\r
 }\r
 \r

-bool FunctionalBlock::isSourceBlock() {\r
+bool FunctionalBlock::isStimuliBlock() {\r

   if (parent == NULL) return true;\r
   return false;\r
 }\r
   if (parent == NULL) return true;\r
   return false;\r
 }\r


@@ -146,7 +146,7 @@ void FunctionalBlock::createPatterns() throw(Exception) {
   \r
   cout << "create patterns for block " << qPrintable(name) << endl;\r
   if (evaluator == NULL) evaluator = new ArithmeticEvaluator();\r
   \r
   cout << "create patterns for block " << qPrintable(name) << endl;\r
   if (evaluator == NULL) evaluator = new ArithmeticEvaluator();\r

-  if (! isGeneratorBlock()) {\r
+  if (! isSourceBlock()) {\r

     try {\r
       createDelta();\r
       createConsumptionPattern();    \r
     try {\r
       createDelta();\r
       createConsumptionPattern();    \r


@@ -846,125 +846,113 @@ void FunctionalBlock::computeOutputPattern(int nbExec) throw(Exception) {
 \r
   clearOutputPattern();\r
 \r
 \r
   clearOutputPattern();\r
 \r

-  /* case 1: the block is a generator for which output pattern\r
-     must be computed for a nbExec following executions\r
-  */\r
+  if (specialType != NotSpecial) {\r
+    cerr << "Abnormal case: the block is special and output pattern is computed normally" << endl;\r
+    throw(Exception(INVALID_FUNBLOCK_USE,this));\r
+  }\r

 \r
 \r

-  if (nbExec > 0) {\r
-    cout << "computing output pattern of " << qPrintable(name) << " for " << nbExec << " executions" << endl;\r
-    foreach(AbstractInterface* iface, getControlOutputs()) {\r
-      FunctionalInterface* connIface = AI_TO_FUN(iface);\r
-      // create output pattern\r
-      QList<char>* pp = productionPattern.value(connIface);\r
-      QList<char>* pattern = new QList<char>(*pp);\r
-      for(int i=1;i<nbExec;i++) pattern->append(*pp);\r
-      // assign pattern to interface\r
-      connIface->setOutputPattern(pattern);\r
-      // store it in QMap\r
-      outputPattern.insert(connIface,pattern);      \r
+  cout << "computing output pattern of " << qPrintable(name) << endl;\r
+\r
+  // in case of inputPattern not created, do it\r
+  if (lengthIP <= 0) {\r
+\r
+    cout << "Strange case: input pattern is not created while it is time to compute output pattern !" << endl;\r
+    // collect the input patterns for each input\r
+    try {\r
+      createInputPattern();\r

     }\r
     }\r

+    catch(Exception e) {\r
+      throw(e);\r
+    }\r
+    cout << "input pattern array initialized with min. len " << lengthIP << endl;\r

   }\r
   }\r

-  else {\r
-    cout << "computing output pattern of " << qPrintable(name) << endl;\r
-    \r
-    // in case of inputPattern not created, do it\r
-    if (lengthIP <= 0) {\r

 \r
 \r

-      cout << "Strange case: input pattern is not created while it is time to compute output pattern !" << endl;\r
-      // collect the input patterns for each input    \r
-      try {\r
-        createInputPattern();\r
-      }\r
-      catch(Exception e) {\r
-        throw(e);\r
+  // initialize the output pattern\r
+  lengthOP = 0;\r
+  foreach(AbstractInterface* iface, getControlOutputs()) {\r
+    FunctionalInterface* connIface = AI_TO_FUN(iface);\r
+    lengthOP = lengthIP+productionPattern.value(connIface)->size();\r
+    QList<char>* pattern = new QList<char>();\r
+    for(int i=0;i<lengthOP;i++) pattern->append(0);\r
+    connIface->setOutputPattern(pattern);\r
+    outputPattern.insert(connIface,pattern);\r
+  }\r
+  cout << "output pattern array initialized" << endl;\r
+\r
+  int clock = 0;\r
+  nbExec = 0;\r
+  // search for the beginning of the first execution.\r
+  while ((clock < lengthIP) && (! isValidDataGroup(inputPattern,clock))) clock++;\r
+  cout << "found 1st exec clock: " << clock << endl;\r
+\r
+  while (clock < lengthIP) {\r
+    // initialize counters for current execution.\r
+    int p = 0; // index in production pattern\r
+    int o = 0; // clock+o will give the clock cycle of each output group\r
+    int cip = 0; // clock+cip give the clock cycle of an input group\r
+    int ccp = 0; // ccp give a column in the consumptio pattern\r
+    int nip = 0; // number of input data groups already consumed during the current execution, used while exploring IP\r
+    int ncp = 0; // number of input data groups already consumed during the current execution, used while exploring CP\r
+    bool cannotCompleteExec = false;\r
+    for(int m=0;m<productionCounter.size();m++) {\r
+      // search for the first production in PP\r
+      while (!isValidDataGroup(productionPattern,p)) {\r
+        p += 1;\r
+        o += 1;\r

       }\r
       }\r

-      cout << "input pattern array initialized with min. len " << lengthIP << endl;\r
-    }\r
-    \r
-    // initialize the output pattern    \r
-    lengthOP = 0;\r
-    foreach(AbstractInterface* iface, getControlOutputs()) {\r
-      FunctionalInterface* connIface = AI_TO_FUN(iface);      \r
-      lengthOP = lengthIP+productionPattern.value(connIface)->size();\r
-      QList<char>* pattern = new QList<char>();\r
-      for(int i=0;i<lengthOP;i++) pattern->append(0);\r
-      connIface->setOutputPattern(pattern);\r
-      outputPattern.insert(connIface,pattern);\r
-    }\r
-    cout << "output pattern array initialized" << endl;\r
-    \r
-    int clock = 0;\r
-    nbExec = 0;\r
-    // search for the beginning of the first execution.\r
-    while ((clock < lengthIP) && (! isValidDataGroup(inputPattern,clock))) clock++;\r
-    cout << "found 1st exec clock: " << clock << endl;\r
-    \r
-    while (clock < lengthIP) {\r
-      // initialize counters for current execution.\r
-      int p = 0; // index in production pattern\r
-      int o = 0; // clock+o will give the clock cycle of each output group\r
-      int cip = 0; // clock+cip give the clock cycle of an input group\r
-      int ccp = 0; // ccp give a column in the consumptio pattern\r
-      int nip = 0; // number of input data groups already consumed during the current execution, used while exploring IP\r
-      int ncp = 0; // number of input data groups already consumed during the current execution, used while exploring CP\r
-      bool cannotCompleteExec = false;\r
-      for(int m=0;m<productionCounter.size();m++) {\r
-        // search for the first production in PP\r
-        while (!isValidDataGroup(productionPattern,p)) {\r
-          p += 1;\r
-          o += 1;\r
+      int gap = 0; // count the number of extra null columns\r
+      // search for PC(m) valid input group in IP\r
+      while (nip < productionCounter.at(m)) {\r
+        if (clock+cip < lengthIP) {\r
+          if (isValidDataGroup(inputPattern,clock+cip)) nip += 1;\r
+          cip += 1;\r
+          gap += 1;\r

         }\r
         }\r

-        int gap = 0; // count the number of extra null columns\r
-        // search for PC(m) valid input group in IP\r
-        while (nip < productionCounter.at(m)) {\r
-          if (clock+cip < lengthIP) {\r
-            if (isValidDataGroup(inputPattern,clock+cip)) nip += 1;\r
-            cip += 1;\r
-            gap += 1;\r
-          }\r
-          else {\r
-            cannotCompleteExec = true;\r
-            break;\r
-          }        \r
-        }        \r
-        \r
-        if (cannotCompleteExec) break; // no need to go further since the next search of input data group will lead to go outside inputPattern\r
-        \r
-        // search for PC(m) valid input group in IP\r
-        while (ncp < productionCounter.at(m)) {\r
-          if (isValidDataGroup(consumptionPattern,ccp)) ncp += 1;\r
-          ccp += 1;\r
-          gap -= 1;\r
+        else {\r
+          cannotCompleteExec = true;\r
+          break;\r

         }\r
         }\r

-        o += gap; // to take into acocunt of extra null columns\r
-        combinePatterns(productionPattern,p,outputPattern,clock+o);\r
-        p += 1;\r
-        o += 1;\r

       }\r
       }\r

-      \r
+\r

       if (cannotCompleteExec) break; // no need to go further since the next search of input data group will lead to go outside inputPattern\r
       if (cannotCompleteExec) break; // no need to go further since the next search of input data group will lead to go outside inputPattern\r

-      \r
-      // current exec. taken into accunt\r
-      nbExec += 1;\r
-      \r
-      // search for the next exec.\r
-      clock += 1;      \r
-      nip = 0;\r
-      while ((clock < lengthIP) && (nip < delta)) {\r
-        if (isValidDataGroup(inputPattern,clock)) nip += 1;\r
-        if (nip < delta) clock += 1;\r
+\r
+      // search for PC(m) valid input group in IP\r
+      while (ncp < productionCounter.at(m)) {\r
+        if (isValidDataGroup(consumptionPattern,ccp)) ncp += 1;\r
+        ccp += 1;\r
+        gap -= 1;\r

       }\r
       }\r

-      cout << "found exec " << nbExec << " at clock: " << clock << endl;\r
+      o += gap; // to take into acocunt of extra null columns\r
+      combinePatterns(productionPattern,p,outputPattern,clock+o);\r
+      p += 1;\r
+      o += 1;\r

     }\r
     }\r

-    // find the last valid output data group\r
-    while(! isValidDataGroup(outputPattern,lengthOP-1)) {\r
-      removeDataGroup(outputPattern,lengthOP-1);\r
-      lengthOP -= 1;\r
+\r
+    if (cannotCompleteExec) break; // no need to go further since the next search of input data group will lead to go outside inputPattern\r
+\r
+    // current exec. taken into accunt\r
+    nbExec += 1;\r
+\r
+    // search for the next exec.\r
+    clock += 1;\r
+    nip = 0;\r
+    while ((clock < lengthIP) && (nip < delta)) {\r
+      if (isValidDataGroup(inputPattern,clock)) nip += 1;\r
+      if (nip < delta) clock += 1;\r

     }\r
     }\r

+    cout << "found exec " << nbExec << " at clock: " << clock << endl;\r
+  }\r
+  // find the last valid output data group\r
+  while(! isValidDataGroup(outputPattern,lengthOP-1)) {\r
+    removeDataGroup(outputPattern,lengthOP-1);\r
+    lengthOP -= 1;\r
+  }\r
+\r
+  // clear input pattern\r
+  clearInputPattern();\r
+\r
+  setOutputPatternComputed(true);\r

 \r
 \r

-    // clear input pattern\r
-    clearInputPattern();\r
-  }  \r

 }\r
 \r
 /*\r
 }\r
 \r
 /*\r