X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/blast.git/blobdiff_plain/c8c1e24dac94abfacb78fb3b661c9a5dbbb0d86a..df84660fd98b39737692d57b68c8b2c2d34af0f1:/FunctionalBlock.cpp

diff --git a/FunctionalBlock.cpp b/FunctionalBlock.cpp
index 7a4d4ff..7be000a 100644
--- a/FunctionalBlock.cpp
+++ b/FunctionalBlock.cpp
@@ -28,8 +28,12 @@ FunctionalBlock::FunctionalBlock(GroupBlock *_parent, ReferenceBlock *_reference
   lengthOP = -1;
   lengthPP = -1;
   delta = -1;
+  evaluator = NULL;
 }
 
+FunctionalBlock::~FunctionalBlock() {
+  if (evaluator != NULL) delete evaluator;
+}
 
 void FunctionalBlock::parametersValidation(QList<AbstractBlock*>* checkedBlocks, QList<AbstractBlock *> *blocksToConfigure) {
   /*
@@ -115,26 +119,41 @@ QString FunctionalBlock::getReferenceHashMd5() {
     return ((ReferenceBlock *)reference)->getHashMd5();
 }
 
-bool FunctionalBlock::createPatterns() {
+void FunctionalBlock::createPatterns() throw(Exception) {
   static QString fctName = "FunctionalBlock::createPatterns()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
   
   cout << "create patterns for block " << qPrintable(name) << endl;
-  evaluator = new ArithmeticEvaluator();
-  bool ok = true;  
+  if (evaluator == NULL) evaluator = new ArithmeticEvaluator();
   if (! isGeneratorBlock()) {
-    ok = ok & createDelta();
-    if (ok) ok = ok & createConsumptionPattern();    
-    if (ok) ok = ok & createProductionCounter();
+    try {
+      createDelta();
+      createConsumptionPattern();    
+      createProductionCounter();
+    }
+    catch(Exception e) {
+      throw(e); // rethrow e
+    }
+  }
+  try {
+    createProductionPattern();
+  }
+  catch(Exception e) {
+    throw(e);
+  }
+  cout << "PP of " << qPrintable(name) << endl;
+  QMapIterator<AbstractInterface*,QList<char>* > it(productionPattern);
+  while (it.hasNext()) {
+    it.next();
+    QList<char>* pat = it.value();
+    foreach(char c, *pat) cout << (int)c;
+    cout << endl;
   }
-  if (ok) ok = ok & createProductionPattern();
-  delete evaluator;
-  return ok;
 }
 
-bool FunctionalBlock::createDelta() {
+void FunctionalBlock::createDelta() throw(Exception) {
   static QString fctName = "FunctionalBlock::createDelta()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
@@ -144,81 +163,91 @@ bool FunctionalBlock::createDelta() {
   cout << "delta for " << qPrintable(name) << " = " << qPrintable(deltaStr) << endl;
   if (deltaStr.isEmpty()) {
     delta = -1;
-    return true;
+    return;
   }
   
-  // look for parameter names
-  bool ok = true;
-  double result = evaluateExpression(deltaStr, &ok);
-  if (!ok) return false;
-  
+  // look for parameter names  
+  double result = 0;
+  try {
+    result = evaluateExpression(deltaStr);
+  }
+  catch(Exception e) {
+    throw(e);
+  }
   delta = result;
   cout << "delta = " << delta << endl;
-   
-  return true;
 }
 
-bool FunctionalBlock::createConsumptionPattern() {
+void FunctionalBlock::createConsumptionPattern()  throw(Exception) {
   static QString fctName = "FunctionalBlock::createConsumptionPattern()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
   
-  lengthCP = -1;
-  bool ok = true; 
+  lengthCP = -1;  
   QHash<QString,QString> consPattern = implementation->getConsumptionPattern();  
   
   foreach(AbstractInterface* iface, getControlInputs()) {       
     FunctionalInterface* connIface = AI_TO_FUN(iface);
     QString refName = connIface->getReference()->getName();    
     if (! consPattern.contains(refName)) {
+      throw(Exception(NO_IFACE_CP));
       cerr << "no consumption pattern for reference interface " << qPrintable(refName) << endl;
-      return false;
     }
-    QList<char>* pattern = expandPattern(consPattern.value(refName),&ok);        
-    if (!ok) return false;
+    QList<char>* pattern = NULL;
+    try {
+      pattern = expandPattern(consPattern.value(refName));
+    }
+    catch(Exception e) {
+      throw(e);
+    }
     consumptionPattern.insert(connIface,pattern);
     if (lengthCP == -1) {
       lengthCP = pattern->size();
     }
     else {
-      if (pattern->size() != lengthCP) return false;
+      if (pattern->size() != lengthCP) {
+        throw(Exception(INVALID_IFACE_CP_LENGTH));
+      }
     }
-  }        
-  return true;
+  }          
 }
 
-bool FunctionalBlock::createProductionPattern() {  
+void FunctionalBlock::createProductionPattern() throw(Exception){  
   static QString fctName = "FunctionalBlock::createProductionPattern()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
   
-  lengthPP = -1;
-  bool ok = true; 
+  lengthPP = -1;  
   QHash<QString,QString> prodPattern = implementation->getProductionPattern();  
   
   foreach(AbstractInterface* iface, getControlOutputs()) {    
     FunctionalInterface* connIface = AI_TO_FUN(iface);
     QString refName = connIface->getReference()->getName();    
     if (! prodPattern.contains(refName)) {
-      cerr << "no production pattern for reference interface " << qPrintable(refName) << endl;
-      return false;
+      throw(Exception(NO_IFACE_PP));      
+    }
+    QList<char>* pattern = NULL;
+    try {
+      pattern = expandPattern(prodPattern.value(refName));
+    }
+    catch(Exception e) {
+      throw(e);
     }
-    QList<char>* pattern = expandPattern(prodPattern.value(refName),&ok);
-    if (!ok) return false;
     productionPattern.insert(connIface,pattern);
     if (lengthPP == -1) {
       lengthPP = pattern->size();
     }
     else {
-      if (pattern->size() != lengthPP) return false;
+      if (pattern->size() != lengthPP) {
+        throw(Exception(INVALID_IFACE_PP_LENGTH));
+      }
     }
-  }    
-  return true;
+  }      
 }
 
-bool FunctionalBlock::createProductionCounter() {
+void FunctionalBlock::createProductionCounter() throw(Exception) {
   static QString fctName = "FunctionalBlock::createProductionCounter()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
@@ -236,14 +265,20 @@ bool FunctionalBlock::createProductionCounter() {
       s.remove(0,1);
       s.chop(1);
       QStringList gen = s.split(":");
-      if (gen.size() != 3) return false;
+      if (gen.size() != 3) {
+        throw(Exception(INVALID_IFACE_PC));
+      }
       int start = 0;
       int nb = 0;
       int step = 0;
-      for(int i=0;i<3;i++) {
-        bool okVal;
-        double result = evaluateExpression(gen.at(i),&okVal);
-        if (!okVal) return false;
+      for(int i=0;i<3;i++) {        
+        double result = 0.0;
+        try {
+          result = evaluateExpression(gen.at(i));
+        }
+        catch(Exception e) {
+          throw(e);
+        }
         if (i==0) start = result;
         else if (i==1) nb = result;
         else if (i==2) step = result;
@@ -252,11 +287,14 @@ bool FunctionalBlock::createProductionCounter() {
         productionCounter.append(start+j*step);
       }
     }
-    else {
-      bool okVal;
-      double result = evaluateExpression(s,&okVal);
-      
-      if (!okVal) return false;
+    else {      
+      double result = 0.0;
+      try {
+        result = evaluateExpression(s);
+      }
+      catch(Exception e) {
+        throw(e);
+      }
       productionCounter.append(result);      
     }
   }
@@ -264,11 +302,9 @@ bool FunctionalBlock::createProductionCounter() {
     cout << val << ",";
   }
   cout << endl;
-  
-  return true;
 }
 
-QList<char>* FunctionalBlock::expandPattern(const QString& patternIn, bool* ok) {
+QList<char>* FunctionalBlock::expandPattern(const QString& patternIn) throw(Exception) {
   static QString fctName = "FunctionalBlock::expandPattern()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
@@ -277,32 +313,42 @@ QList<char>* FunctionalBlock::expandPattern(const QString& patternIn, bool* ok)
   QList<char> lst;
   QString  p = patternIn;
   p.append(')');
-  int offset = 0;
+  int offset = 0;  
   QList<char>* patternOut = new QList<char>();
-  expandPatternRecur(p,&offset,ok,patternOut);   
+  try {
+    patternOut->append(expandPatternRecur(p,&offset));
+  }
+  catch(Exception e) {
+    throw(e);
+  }
+
   return patternOut;
 }
 
-void FunctionalBlock::expandPatternRecur(const QString& patternIn, int *offset, bool *ok, QList<char>* patternOut) {  
+QList<char> FunctionalBlock::expandPatternRecur(const QString& patternIn, int *offset) throw(Exception) {
   
+  QList<char> patternOut;
+
   while ((*offset < patternIn.size()) && (patternIn.at(*offset) != ')')) {
     
     QChar c = patternIn.at(*offset);
     if (c == '(') {
       *offset += 1;
-      expandPatternRecur(patternIn,offset, ok, patternOut);
-      if (!ok) {
-        return;
+      try {
+        patternOut.append(expandPatternRecur(patternIn,offset));
+      }
+      catch(Exception e) {
+        throw(e);
       }
     }
     else if (c == '0') {
-      patternOut->append(0);
+      patternOut.append(0);
     }
     else if (c == '1') {
-      patternOut->append(1);
+      patternOut.append(1);
     }
     else if (c == 'X') {
-      patternOut->append(-1);
+      patternOut.append(-1);
     }
     else if (c == '{') {
       *offset += 1;
@@ -312,19 +358,21 @@ void FunctionalBlock::expandPatternRecur(const QString& patternIn, int *offset,
         *offset += 1;
       }
       if (*offset == patternIn.size()) {
-        *ok = false;
-        return;
+        throw(Exception(INVALID_IFACE_PATTERN));
+      }
+      double repeat = 0;
+      try {
+        repeat = evaluateExpression(expr);
+      }
+      catch(Exception e) {
+        throw(e);
       }
-      double repeat = evaluateExpression(expr,ok);
-      if (!ok) {
-        return;      
-      }            
       // repeat just the last value in currentGroup
-      char last = patternOut->last();      
+      char last = patternOut.last();
       //cout << "repeat last char " << repeat << " times : " << (int)last << endl;
       
       for(int i=1;i<(int)repeat;i++) {
-        patternOut->append(last);
+        patternOut.append(last);
       }
     }    
     *offset += 1;
@@ -339,34 +387,34 @@ void FunctionalBlock::expandPatternRecur(const QString& patternIn, int *offset,
       *offset += 1;
     }
     if (*offset == patternIn.size()) {
-      *ok = false;
-      return;
+      throw(Exception(INVALID_IFACE_PATTERN));
+    }
+    double repeat = 0;
+    try {
+      repeat = evaluateExpression(expr);
     }
-    double repeat = evaluateExpression(expr,ok);
-    if (!ok) {
-      return;      
+    catch(Exception e) {
+      throw(e);
     }
     /*
     cout << "repeat last group " << repeat << " times : ";
     foreach (char c, currentGroup) cout <<(int)c;
     cout << endl;  
     */
-    QList<char> single = *patternOut;
+    QList<char> single = patternOut;
     for(int i=1;i<(int)repeat;i++) {
-      patternOut->append(single);
+      patternOut.append(single);
     }    
-  }
-  //*offset += 1;
-  return;
+  }  
+  return patternOut;
 }
 
-double FunctionalBlock::evaluateExpression(const QString& expression, bool* ok) {
+double FunctionalBlock::evaluateExpression(const QString& expression) throw(Exception) {
   static QString fctName = "FunctionalBlock::evaluateExpression()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
-  
-  *ok = true;
+    
   QHash<QString,double> vars;
   evaluator->setExpression(expression);
   QList<QString> varNames = evaluator->getVariableNames();
@@ -375,34 +423,29 @@ double FunctionalBlock::evaluateExpression(const QString& expression, bool* ok)
     paramName.remove(0,1);
     BlockParameter* param = reference->getParameterFromName(paramName);    
     if (param == NULL) {
-      cerr << "found an unknown parameter in delta"<< endl;
-      *ok = false;
-      return 0.0;
+      throw(Exception(EVAL_PARAM_UNKNOWN));
     }
     bool okVal;
     int val = param->getDoubleValue(&okVal);
     if (!okVal) {
-      cerr << "cannot obtain double value of paramter " << qPrintable(paramName) << endl;
-      *ok = false;
-      return 0.0;
+      throw(Exception(EVAL_PARAM_NOVALUE));      
     }
     vars.insert(name,(double)val);    
   }
   
   evaluator->setVariablesValue(vars);
-  double result;
+  double result = 0.0;
   try {
     result = evaluator->evaluate();
   }
   catch(int index) {
     cerr << "Error at index " << index << ": " << qPrintable(evaluator->getError()) << endl;
-    *ok = false;
-    return 0.0;
+    throw(Exception(EVAL_INVALID_EXPR));
   }
   return result;
 }
 
-void FunctionalBlock::createInputPattern() {
+void FunctionalBlock::createInputPattern()  throw(Exception) {
   static QString fctName = "FunctionalBlock::createInputPattern())";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
@@ -412,38 +455,36 @@ void FunctionalBlock::createInputPattern() {
   foreach(AbstractInterface* iface, getControlInputs()) {      
     ConnectedInterface* connIface = AI_TO_CON(iface);
     QList<char>* out = connIface->getConnectedFrom()->getOutputPattern();
+    if (out->size() == 0) {
+      clearInputPattern();
+      throw(Exception(NO_IFACE_IP));
+    }
     if (lengthIP == -1) {
       lengthIP = out->size();
     }
     else {
       if (out->size() < lengthIP) lengthIP = out->size();
     }
-    if (out->size() > 0) {
-      QList<char>* in = new QList<char>(*out);
-      foreach(char c, *in) {
-        cout << (int)c;
-      }
-      cout << endl;
-
-      inputPattern.insert(connIface,in);
+    
+    QList<char>* in = new QList<char>(*out);
+    foreach(char c, *in) {
+      cout << (int)c;
     }
-    else {
-      inputPattern.insert(connIface,NULL);
-    }      
+    cout << endl;    
+    inputPattern.insert(connIface,in);    
   }
-  // remove null columns at the end of IP
+  // search the last valid group in IP,
   while(! isValidDataGroup(inputPattern,lengthIP-1)) {
-    removeDataGroup(inputPattern,lengthIP-1);
+    //removeDataGroup(inputPattern,lengthIP-1);
     lengthIP -= 1;
   }
 }
 
-bool FunctionalBlock::createAdmittance(int nbExec) {
+void FunctionalBlock::createAdmittance(int nbExec) throw(Exception) {
   static QString fctName = "FunctionalBlock::createAdmittance()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
-#endif
-  bool ok = true;
+#endif  
   // firstly, copy CP in AP
   QMapIterator<AbstractInterface*,QList<char>* > iterC(consumptionPattern);
   while (iterC.hasNext()) {
@@ -497,8 +538,7 @@ bool FunctionalBlock::createAdmittance(int nbExec) {
         j -= 1;
       }
       else {
-        cout << "AP and CP are not consistent" << endl;
-        return false;
+        throw(INVALID_DELTA_CP);        
       }
     }
   }
@@ -512,32 +552,31 @@ bool FunctionalBlock::createAdmittance(int nbExec) {
       cout << (int)(pattern->at(i));
     }
     cout << endl;
-  }
-  return true;
+  }  
 }
 
-bool FunctionalBlock::checkInputPatternCompatibility() {
+void FunctionalBlock::checkInputPatternCompatibility() throw(Exception) {
   static QString fctName = "FunctionalBlock::checkInputPatternCompatibility()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
-  
-  bool ok = true;
+    
   // firstly, create input pattern
-  createInputPattern();      
-  // if some patterns are not available, end now, returning false
-  if (lengthIP == 0) {
-    clearInputPattern();
-    return false;
+  try {
+    createInputPattern();
+  }
+  catch(Exception e) {
+    throw(e);
   }
-  int nbExec = getNumberOfExecution();
+  int nbExec = createTriggers();
   cout << qPrintable(name) << " will exec. " << nbExec << " times." << endl;
   
-  ok = createAdmittance(nbExec);
-  
-  if (!ok) {
+  try {
+    createAdmittance(nbExec);
+  }
+  catch(Exception e) {
     cout << "cannot create admittance" << endl;
-    return false;
+    throw(e);
   }
   
   int clock = 0; // index in IP  
@@ -549,7 +588,7 @@ bool FunctionalBlock::checkInputPatternCompatibility() {
       while ((clock < lengthIP) && (! isValidDataGroup(inputPattern,clock))) clock++;
       if (clock == lengthIP) {
         cerr << "Abnormal case: end of IP has been reached without finding a valid group" << endl;
-        return false;
+        throw(Exception(IP_END_NULLCOL));        
       }
     }    
     /* at that point 2 cases of compat : IP(clock) and AP(i) are equal valid group, or
@@ -557,19 +596,18 @@ bool FunctionalBlock::checkInputPatternCompatibility() {
     */
     if (! samePatterns(inputPattern,clock,admittance,i)) {
       cout << "AP(" << i << ") and IP(" << clock << ") are not equal" << endl;
-      return false;
+      throw(Exception(IP_AP_NOTCOMPAT)); // IP and AP not compatible
     }
     clock++;
     i++;
   }
   if (clock < lengthIP) {
-    cerr << "Abnormal case: AP is to short" << endl;
-    return false;
-  }
-  return true;
+    throw(Exception(AP_TOO_SHORT));
+    cerr << "Abnormal case: AP is to short" << endl;   
+  }  
 }
 
-bool FunctionalBlock::computeOutputPattern(int nbExec) {
+void FunctionalBlock::computeOutputPattern(int nbExec) throw(Exception) {
   static QString fctName = "FunctionalBlock::computeOutputPattern()";
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
@@ -600,11 +638,11 @@ bool FunctionalBlock::computeOutputPattern(int nbExec) {
     // in case of inputPattern not created, do it
     if (lengthIP <= 0) {
       // collect the input patterns for each input    
-      createInputPattern();    
-      // if some patterns are not available, end now, returning false
-      if (lengthIP == 0) {
-        clearInputPattern();
-        return false;
+      try {
+        createInputPattern();
+      }
+      catch(Exception e) {
+        throw(e);
       }
       cout << "input pattern array initialized with min. len " << lengthIP << endl;
     }
@@ -692,10 +730,135 @@ bool FunctionalBlock::computeOutputPattern(int nbExec) {
 
     // clear input pattern
     clearInputPattern();
-  }
-  return true;
+  }  
 }
 
+/*
+
+void FunctionalBlock::computeOutputPattern(int nbExec) throw(Exception) {
+  static QString fctName = "FunctionalBlock::computeOutputPattern()";
+#ifdef DEBUG_FCTNAME
+  cout << "call to " << qPrintable(fctName) << endl;
+#endif
+
+  // case 1: the block is a generator for which output pattern
+  //   must be computed for a nbExec following executions
+
+  if (nbExec > 0) {
+    cout << "computing output pattern of " << qPrintable(name) << " for " << nbExec << " executions" << endl;
+    foreach(AbstractInterface* iface, getControlOutputs()) {
+      FunctionalInterface* connIface = AI_TO_FUN(iface);
+      // create output pattern
+      QList<char>* pp = productionPattern.value(connIface);
+      QList<char>* pattern = new QList<char>(*pp);
+      for(int i=1;i<nbExec;i++) pattern->append(*pp);
+      // assign pattern to interface
+      connIface->setOutputPattern(pattern);
+      // store it in QMap
+      outputPattern.insert(connIface,pattern);
+    }
+  }
+  else {
+    cout << "computing output pattern of " << qPrintable(name) << endl;
+
+    // in case of inputPattern not created, do it
+    if (lengthIP <= 0) {
+      // collect the input patterns for each input
+      try {
+        createInputPattern();
+      }
+      catch(Exception e) {
+        throw(e);
+      }
+      cout << "input pattern array initialized with min. len " << lengthIP << endl;
+    }
+
+    // initialize the output pattern
+    lengthOP = 0;
+    foreach(AbstractInterface* iface, getControlOutputs()) {
+      FunctionalInterface* connIface = AI_TO_FUN(iface);
+      lengthOP = lengthIP+productionPattern.value(connIface)->size();
+      QList<char>* pattern = new QList<char>();
+      for(int i=0;i<lengthOP;i++) pattern->append(0);
+      connIface->setOutputPattern(pattern);
+      outputPattern.insert(connIface,pattern);
+    }
+    cout << "output pattern array initialized" << endl;
+
+    int clock = 0;
+    nbExec = 0;
+    // search for the beginning of the first execution.
+    while ((clock < lengthIP) && (! isValidDataGroup(inputPattern,clock))) clock++;
+    cout << "found 1st exec clock: " << clock << endl;
+
+    while (clock < lengthIP) {
+      // initialize counters for current execution.
+      int p = 0; // index in production pattern
+      int o = 0; // clock+o will give the clock cycle of each output group
+      int cip = 0; // clock+cip give the clock cycle of an input group
+      int ccp = 0; // ccp give a column in the consumptio pattern
+      int nip = 0; // number of input data groups already consumed during the current execution, used while exploring IP
+      int ncp = 0; // number of input data groups already consumed during the current execution, used while exploring CP
+      bool cannotCompleteExec = false;
+      for(int m=0;m<productionCounter.size();m++) {
+        // search for the first production in PP
+        while (!isValidDataGroup(productionPattern,p)) {
+          p += 1;
+          o += 1;
+        }
+        int gap = 0; // count the number of extra null columns
+        // search for PC(m) valid input group in IP
+        while (nip < productionCounter.at(m)) {
+          if (clock+cip < lengthIP) {
+            if (isValidDataGroup(inputPattern,clock+cip)) nip += 1;
+            cip += 1;
+            gap += 1;
+          }
+          else {
+            cannotCompleteExec = true;
+            break;
+          }
+        }
+
+        if (cannotCompleteExec) break; // no need to go further since the next search of input data group will lead to go outside inputPattern
+
+        // search for PC(m) valid input group in IP
+        while (ncp < productionCounter.at(m)) {
+          if (isValidDataGroup(consumptionPattern,ccp)) ncp += 1;
+          ccp += 1;
+          gap -= 1;
+        }
+        o += gap; // to take into acocunt of extra null columns
+        combinePatterns(productionPattern,p,outputPattern,clock+o);
+        p += 1;
+        o += 1;
+      }
+
+      if (cannotCompleteExec) break; // no need to go further since the next search of input data group will lead to go outside inputPattern
+
+      // current exec. taken into accunt
+      nbExec += 1;
+
+      // search for the next exec.
+      clock += 1;
+      nip = 0;
+      while ((clock < lengthIP) && (nip < delta)) {
+        if (isValidDataGroup(inputPattern,clock)) nip += 1;
+        if (nip < delta) clock += 1;
+      }
+      cout << "found exec " << nbExec << " at clock: " << clock << endl;
+    }
+    // find the last valid output data group
+    while(! isValidDataGroup(outputPattern,lengthOP-1)) {
+      removeDataGroup(outputPattern,lengthOP-1);
+      lengthOP -= 1;
+    }
+
+    // clear input pattern
+    clearInputPattern();
+  }
+}
+*/
 bool FunctionalBlock::samePatterns(const QMap<AbstractInterface*, QList<char>* >& patternSrc, int srcCol, const QMap<AbstractInterface*, QList<char>* >& patternDest, int destCol) {
   
   if (patternSrc.size() != patternDest.size()) return false;
@@ -842,24 +1005,24 @@ void FunctionalBlock::clearInputPattern() {
   lengthIP = -1;
 }
 
-int FunctionalBlock::getNumberOfExecution() {
+int FunctionalBlock::createTriggers() {
+  triggers.clear();
   /* NB: this method returns the number of executions that have been started
      but not necessary completed.
   */
-  if (delta <= 0) return 0;
-  int nbExec = 0;
+  if (delta <= 0) return 0;  
   int offset = 0;
   // search for the first exec.
   while ((offset < lengthIP) && (! isValidDataGroup(inputPattern,offset))) offset++;
   if (offset == lengthIP) return 0;
-  nbExec = 1;
+  triggers.append(offset);  
   int nbGroup = 0;
   for(int i = offset;i<lengthIP;i++) {
     if (isValidDataGroup(inputPattern,i)) nbGroup++;
     if (nbGroup == delta+1) {
-      nbExec += 1;
+      triggers.append(i);
       nbGroup = 1;
     }
   }      
-  return nbExec;  
+  return triggers.size();
 }