X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/blast.git/blobdiff_plain/56f7c4239666506c59af42885f0bf0141d21a614..4cf57e6db08da791233d75237f62e74bc88dd427:/FunctionalBlock.cpp

diff --git a/FunctionalBlock.cpp b/FunctionalBlock.cpp
index 7be000a..91f4e03 100644
--- a/FunctionalBlock.cpp
+++ b/FunctionalBlock.cpp
@@ -184,6 +184,9 @@ void FunctionalBlock::createConsumptionPattern()  throw(Exception) {
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
   
+  // first clear if already exists
+  clearConsumptionPattern();
+
   lengthCP = -1;  
   QHash<QString,QString> consPattern = implementation->getConsumptionPattern();  
   
@@ -191,7 +194,7 @@ void FunctionalBlock::createConsumptionPattern()  throw(Exception) {
     FunctionalInterface* connIface = AI_TO_FUN(iface);
     QString refName = connIface->getReference()->getName();    
     if (! consPattern.contains(refName)) {
-      throw(Exception(NO_IFACE_CP));
+      throw(Exception(NO_IFACE_CP,this));
       cerr << "no consumption pattern for reference interface " << qPrintable(refName) << endl;
     }
     QList<char>* pattern = NULL;
@@ -207,7 +210,7 @@ void FunctionalBlock::createConsumptionPattern()  throw(Exception) {
     }
     else {
       if (pattern->size() != lengthCP) {
-        throw(Exception(INVALID_IFACE_CP_LENGTH));
+        throw(Exception(INVALID_IFACE_CP_LENGTH,this));
       }
     }
   }          
@@ -218,6 +221,9 @@ void FunctionalBlock::createProductionPattern() throw(Exception){
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
+
+  // first clear if already exists
+  clearProductionPattern();
   
   lengthPP = -1;  
   QHash<QString,QString> prodPattern = implementation->getProductionPattern();  
@@ -226,7 +232,7 @@ void FunctionalBlock::createProductionPattern() throw(Exception){
     FunctionalInterface* connIface = AI_TO_FUN(iface);
     QString refName = connIface->getReference()->getName();    
     if (! prodPattern.contains(refName)) {
-      throw(Exception(NO_IFACE_PP));      
+      throw(Exception(NO_IFACE_PP,this));
     }
     QList<char>* pattern = NULL;
     try {
@@ -241,7 +247,7 @@ void FunctionalBlock::createProductionPattern() throw(Exception){
     }
     else {
       if (pattern->size() != lengthPP) {
-        throw(Exception(INVALID_IFACE_PP_LENGTH));
+        throw(Exception(INVALID_IFACE_PP_LENGTH,this));
       }
     }
   }      
@@ -252,6 +258,10 @@ void FunctionalBlock::createProductionCounter() throw(Exception) {
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
+
+  // first clear if already exists
+  productionCounter.clear();
+
   
   QStringList counterParts = implementation->getProductionCounter().split(",");
   foreach(QString s, counterParts) {
@@ -266,7 +276,7 @@ void FunctionalBlock::createProductionCounter() throw(Exception) {
       s.chop(1);
       QStringList gen = s.split(":");
       if (gen.size() != 3) {
-        throw(Exception(INVALID_IFACE_PC));
+        throw(Exception(INVALID_IFACE_PC,this));
       }
       int start = 0;
       int nb = 0;
@@ -309,9 +319,21 @@ QList<char>* FunctionalBlock::expandPattern(const QString& patternIn) throw(Exce
 #ifdef DEBUG_FCTNAME
   cout << "call to " << qPrintable(fctName) << endl;
 #endif
-  
-  QList<char> lst;
-  QString  p = patternIn;
+  /* expanding a pattern is done in two steps :
+      - 1 : finding all variables that correspond to an expression
+            and copy them in the pattern
+      - 2 : parsing the result
+
+      Note that the result MUST contain only variables that have a
+      integer/double value. Otherwise, expanding will fail.
+
+   */
+
+  // first step.
+
+  QString p = replaceExpressions(patternIn);
+
+  QList<char> lst;  
   p.append(')');
   int offset = 0;  
   QList<char>* patternOut = new QList<char>();
@@ -325,6 +347,31 @@ QList<char>* FunctionalBlock::expandPattern(const QString& patternIn) throw(Exce
   return patternOut;
 }
 
+QString FunctionalBlock::replaceExpressions(const QString& patternIn) throw(Exception) {
+
+  QString res = patternIn;
+  bool stop = false;
+  QRegularExpression re("[$][a-zA-Z0-9_]+");
+
+  while (!stop) {
+    stop = true;
+    QRegularExpressionMatchIterator matcher = re.globalMatch(res);
+    while(matcher.hasNext()) {
+      QRegularExpressionMatch m = matcher.next();
+      QString param = m.captured(0);
+      QString paramName = param;
+      paramName.remove(0,1);
+      BlockParameter* p = getParameterFromName(paramName);
+      if ((p != NULL) && (p->getType() == BlockParameter::Expression)) {
+        res.replace(param,p->getStringValue());
+        stop = false;
+        cout << "found an expr: " << qPrintable(paramName) << ", patern => " << qPrintable(res) << endl;
+      }
+    }
+  }
+  return res;
+}
+
 QList<char> FunctionalBlock::expandPatternRecur(const QString& patternIn, int *offset) throw(Exception) {
   
   QList<char> patternOut;
@@ -358,7 +405,7 @@ QList<char> FunctionalBlock::expandPatternRecur(const QString& patternIn, int *o
         *offset += 1;
       }
       if (*offset == patternIn.size()) {
-        throw(Exception(INVALID_IFACE_PATTERN));
+        throw(Exception(INVALID_IFACE_PATTERN,this));
       }
       double repeat = 0;
       try {
@@ -387,7 +434,7 @@ QList<char> FunctionalBlock::expandPatternRecur(const QString& patternIn, int *o
       *offset += 1;
     }
     if (*offset == patternIn.size()) {
-      throw(Exception(INVALID_IFACE_PATTERN));
+      throw(Exception(INVALID_IFACE_PATTERN,this));
     }
     double repeat = 0;
     try {
@@ -421,14 +468,14 @@ double FunctionalBlock::evaluateExpression(const QString& expression) throw(Exce
   foreach (QString name, varNames) {
     QString paramName = name;
     paramName.remove(0,1);
-    BlockParameter* param = reference->getParameterFromName(paramName);    
+    BlockParameter* param = getParameterFromName(paramName);
     if (param == NULL) {
-      throw(Exception(EVAL_PARAM_UNKNOWN));
+      throw(Exception(EVAL_PARAM_UNKNOWN,this));
     }
     bool okVal;
-    int val = param->getDoubleValue(&okVal);
+    int val = param->getDoubleValue(&okVal);    
     if (!okVal) {
-      throw(Exception(EVAL_PARAM_NOVALUE));      
+      throw(Exception(EVAL_PARAM_NOVALUE,this));
     }
     vars.insert(name,(double)val);    
   }
@@ -440,11 +487,152 @@ double FunctionalBlock::evaluateExpression(const QString& expression) throw(Exce
   }
   catch(int index) {
     cerr << "Error at index " << index << ": " << qPrintable(evaluator->getError()) << endl;
-    throw(Exception(EVAL_INVALID_EXPR));
+    throw(Exception(EVAL_INVALID_EXPR,this));
   }
   return result;
 }
 
+void FunctionalBlock::computeAdmittanceDelays() throw(Exception) {
+  static QString fctName = "FunctionalBlock::computeAdmittanceDelays()";
+#ifdef DEBUG_FCTNAME
+  cout << "call to " << qPrintable(fctName) << endl;
+#endif
+  QList<int> inClock;
+  QList<int> delays;
+
+  clearAdmittanceDelays();
+
+  // trying to synchronize the first one in AP
+  QMapIterator<AbstractInterface*,QList<char>* > iterAP(admittance);
+  QMapIterator<AbstractInterface*,QList<char>* > iterIP(inputPattern);
+
+  while (iterAP.hasNext()) {
+    iterAP.next();
+    iterIP.next();
+    QList<char>* ap = iterAP.value();
+    QList<char>* ip = iterIP.value();
+    int first = 0;
+    while ((first < lengthIP) && (ip->at(first) == 0)) first++;
+    while ((first < lengthAP) && (ap->at(first) == 0)) first--;
+    delays.append(first);
+    inClock.append(0);
+    QList<int>* delays = new QList<int>();
+    admittanceDelays.insert(iterAP.key(), delays);
+  }
+
+  QMapIterator<AbstractInterface*,QList<int>* > iterDelays(admittanceDelays);
+
+  // get the delay to apply
+  int maxDelay = 0;
+  for(int i=0;i<delays.size();i++) {
+    if (delays[i] > maxDelay) maxDelay = delays[i];
+  }
+  // adding the delays to IP
+  iterIP.toFront();
+  int i = 0;
+  while (iterIP.hasNext()) {
+    iterIP.next();
+    iterDelays.next();
+    QList<char>* ip = iterIP.value();
+    QList<int>* d = iterDelays.value();
+    d->append(maxDelay-delays[i]);
+    cout << "prependind " << qPrintable(iterIP.key()->getName()) << " with " << (maxDelay-delays[i]) << " 0" << endl;
+    for(int j=0;j<maxDelay-delays[i];j++) {
+      ip->prepend(0);
+    }
+    for(int j=0;j<delays[i];j++) {
+      ip->append(0);
+    }
+    i++;
+  }
+  lengthIP += maxDelay;
+
+  cout << "IP length = " << lengthIP << ", AP length = " << lengthAP << endl;
+  bool stop = false;
+  int apIndex = 0;
+  int ipIndex = 0;
+  while (!stop) {
+
+    // if AP is a valid group, search for the next valid group in IP
+    if (isValidDataGroup(admittance,apIndex)) {
+
+      while ((ipIndex < lengthIP) && (! isValidDataGroup(inputPattern,ipIndex))) ipIndex++;
+      if (ipIndex == lengthIP) {
+        stop = true;
+        continue;
+      }
+    }
+
+    iterAP.toFront();
+    iterIP.toFront();
+    iterDelays.toFront();
+
+    if (samePatterns(inputPattern,ipIndex,admittance,apIndex)) {
+      while (iterAP.hasNext()) {
+        iterAP.next();
+        iterDelays.next();
+        QList<char>* ap = iterAP.value();
+        if (ap->at(apIndex) == 1) {
+          QList<int>* d = iterDelays.value();
+          d->append(0); // the 1 is at its good place, so no delay
+        }
+      }
+    }
+    else {
+      cout << "diff between IP and AP at " << apIndex << endl;
+      // search for the next 1 in IP for every input that has a 1 in AP
+
+      while (iterAP.hasNext()) {
+        iterAP.next();
+        iterIP.next();
+        iterDelays.next();
+        QList<char>* ap = iterAP.value();
+        QList<char>* ip = iterIP.value();
+        QList<int>* d = iterDelays.value();
+        // case 1: 1 in IP is too late
+        if ((ap->at(apIndex) == 1) && (ip->at(ipIndex) == 0)) {
+          int delay = 1;
+          while ( ((ipIndex+delay) < lengthIP) && (ip->at(ipIndex+delay) == 0) ) delay++;
+          cout << "found a delay of " << (-delay) << " for iface " << qPrintable(iterAP.key()->getName()) << endl;
+          // moving the 1 to its normal pos.
+          ip->replace(ipIndex,1);
+          ip->replace(ipIndex+delay,0);
+          d->append(-delay);
+        }
+        // case 2: 1 in IP is too soon
+        else if ((ap->at(apIndex) == 0) && (ip->at(ipIndex) == 1)) {
+          int delay = 1;
+          while ( ((apIndex+delay) < lengthAP) && (ap->at(apIndex+delay) == 0) ) delay++;
+          cout << "found a delay of " << delay << " for iface " << qPrintable(iterAP.key()->getName()) << endl;
+          // search for next 0 in IP to put the 1
+          int k = ipIndex+delay;
+          while ((k < lengthIP) && (ip->at(k) == 1)) k++;
+          ip->replace(ipIndex,0);
+          ip->replace(k,1);
+          d->append(delay);
+        }
+      }
+      if (! samePatterns(inputPattern,inClock,admittance,apIndex)) {
+         cout << "Abnormal case while searching for delays" << endl;
+      }
+    }
+
+    apIndex++;
+    ipIndex++;
+    if ((apIndex >= lengthAP) || (ipIndex >= lengthIP)) stop = true;
+  }
+  iterDelays.toFront();
+  while (iterDelays.hasNext()) {
+    iterDelays.next();
+    QList<int>* d = iterDelays.value();
+    foreach(int v, *d) {
+      cout << v << " ";
+    }
+    cout << endl;
+  }
+
+}
+
 void FunctionalBlock::createInputPattern()  throw(Exception) {
   static QString fctName = "FunctionalBlock::createInputPattern())";
 #ifdef DEBUG_FCTNAME
@@ -452,12 +640,27 @@ void FunctionalBlock::createInputPattern()  throw(Exception) {
 #endif
   
   lengthIP = -1;
-  foreach(AbstractInterface* iface, getControlInputs()) {      
+  foreach(AbstractInterface* iface, getControlInputs()) {
+
     ConnectedInterface* connIface = AI_TO_CON(iface);
+    // check if it is connected
+    if (connIface->getConnectedFrom() == NULL) {
+      throw(Exception(IFACE_NOT_CONNECTED,this));
+    }
+    // get the precursor output pattern
     QList<char>* out = connIface->getConnectedFrom()->getOutputPattern();
+
+    ConnectedInterface* assoIface = AI_TO_CON(connIface->getAssociatedIface());
+    AbstractInputModifier* modifier = assoIface->getInputModifier();
+    // check if the input is modified
+    if (modifier != NULL) {
+
+      out = modifier->getModifiedInput(out);
+    }
+
     if (out->size() == 0) {
       clearInputPattern();
-      throw(Exception(NO_IFACE_IP));
+      throw(Exception(NO_IFACE_IP,this));
     }
     if (lengthIP == -1) {
       lengthIP = out->size();
@@ -588,7 +791,7 @@ void FunctionalBlock::checkInputPatternCompatibility() throw(Exception) {
       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;
-        throw(Exception(IP_END_NULLCOL));        
+        throw(Exception(IP_END_NULLCOL,this));
       }
     }    
     /* at that point 2 cases of compat : IP(clock) and AP(i) are equal valid group, or
@@ -596,13 +799,13 @@ void FunctionalBlock::checkInputPatternCompatibility() throw(Exception) {
     */
     if (! samePatterns(inputPattern,clock,admittance,i)) {
       cout << "AP(" << i << ") and IP(" << clock << ") are not equal" << endl;
-      throw(Exception(IP_AP_NOTCOMPAT)); // IP and AP not compatible
+      throw(Exception(IP_AP_NOTCOMPAT,this)); // IP and AP not compatible
     }
     clock++;
     i++;
   }
   if (clock < lengthIP) {
-    throw(Exception(AP_TOO_SHORT));
+    throw(Exception(AP_TOO_SHORT,this));
     cerr << "Abnormal case: AP is to short" << endl;   
   }  
 }
@@ -637,6 +840,8 @@ void FunctionalBlock::computeOutputPattern(int nbExec) throw(Exception) {
     
     // in case of inputPattern not created, do it
     if (lengthIP <= 0) {
+
+      cout << "Strange case: input pattern is not created while it is time to compute output pattern !" << endl;
       // collect the input patterns for each input    
       try {
         createInputPattern();
@@ -876,6 +1081,26 @@ bool FunctionalBlock::samePatterns(const QMap<AbstractInterface*, QList<char>* >
   return true;
 }
 
+bool FunctionalBlock::samePatterns(const QMap<AbstractInterface*, QList<char>* >& patternSrc, const QList<int> &srcCols, const QMap<AbstractInterface*, QList<char>* >& patternDest, int destCol) {
+  if (patternSrc.size() != srcCols.size()) return false;
+  if (patternSrc.size() != patternDest.size()) return false;
+
+  QMapIterator<AbstractInterface*, QList<char>* > iterSrc(patternSrc);
+  QListIterator<int> iterSrcCol(srcCols);
+  QMapIterator<AbstractInterface*, QList<char>* > iterDest(patternDest);
+  while (iterSrc.hasNext()) {
+    iterSrc.next();
+    int srcCol = iterSrcCol.next();
+    iterDest.next();
+    QList<char>* srcPat = iterSrc.value();
+    QList<char>* destPat = iterDest.value();
+    if (srcCol >= srcPat->size()) return false;
+    if (destCol >= destPat->size()) return false;
+    if (srcPat->at(srcCol) != destPat->at(destCol)) return false;
+  }
+  return true;
+}
+
 bool FunctionalBlock::canCombinePatterns(const QMap<AbstractInterface*, QList<char>* >& patternSrc, int srcCol, QMap<AbstractInterface*, QList<char>* > patternDest, int destCol) {
   if (patternSrc.size() != patternDest.size()) return false;
   QMapIterator<AbstractInterface*, QList<char>* > iterSrc(patternSrc);
@@ -960,6 +1185,19 @@ bool FunctionalBlock::isValidDataGroup(const QMap<AbstractInterface *, QList<cha
   return false;
 }
 
+bool FunctionalBlock::isValidDataGroup(const QMap<AbstractInterface*, QList<char>* >& pattern, const QList<int> offsets) {
+  QMapIterator<AbstractInterface*, QList<char>* > iterSrc(pattern);
+  QListIterator<int> iterOffsets(offsets);
+  while (iterSrc.hasNext()) {
+    iterSrc.next();
+    int offset = iterOffsets.next();
+    QList<char>* srcPat = iterSrc.value();
+    if (offset >= srcPat->size()) return false;
+    if (srcPat->at(offset) == 1) return true;
+  }
+  return false;
+}
+
 bool FunctionalBlock::isOnlyXDataGroup(const QMap<AbstractInterface *, QList<char> *> &pattern, int offset) {
   QMapIterator<AbstractInterface*, QList<char>* > iterSrc(pattern);  
   while (iterSrc.hasNext()) {
@@ -1005,6 +1243,16 @@ void FunctionalBlock::clearInputPattern() {
   lengthIP = -1;
 }
 
+void FunctionalBlock::clearAdmittanceDelays() {
+  QMapIterator<AbstractInterface*, QList<int>* > iterA(admittanceDelays);
+  while (iterA.hasNext()) {
+    iterA.next();
+    QList<int>* d = iterA.value();
+    if (d != NULL) delete d;
+  }
+  admittanceDelays.clear();
+}
+
 int FunctionalBlock::createTriggers() {
   triggers.clear();
   /* NB: this method returns the number of executions that have been started