+void FunctionalBlock::createPatterns() throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::createPatterns()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+\r
+ if (implementation->hasNoPatterns()) return;\r
+ \r
+ cout << "create patterns for block " << qPrintable(name) << endl;\r
+ if (evaluator == NULL) evaluator = new ArithmeticEvaluator();\r
+ if (! isGeneratorBlock()) {\r
+ try {\r
+ createDelta();\r
+ createConsumptionPattern(); \r
+ createProductionCounter();\r
+ }\r
+ catch(Exception e) {\r
+ throw(e); // rethrow e\r
+ }\r
+ }\r
+ try {\r
+ createProductionPattern();\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ cout << "PP of " << qPrintable(name) << endl;\r
+ QMapIterator<AbstractInterface*,QList<char>* > it(productionPattern);\r
+ while (it.hasNext()) {\r
+ it.next();\r
+ QList<char>* pat = it.value();\r
+ foreach(char c, *pat) cout << (int)c;\r
+ cout << endl;\r
+ }\r
+}\r
+\r
+void FunctionalBlock::createDelta() throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::createDelta()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif \r
+ \r
+ QString deltaStr = implementation->getDelta(); \r
+ cout << "delta for " << qPrintable(name) << " = " << qPrintable(deltaStr) << endl;\r
+ if (deltaStr.isEmpty()) {\r
+ delta = -1;\r
+ return;\r
+ }\r
+ \r
+ // look for parameter names \r
+ double result = 0;\r
+ try {\r
+ result = evaluateExpression(deltaStr);\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ delta = result;\r
+ cout << "delta = " << delta << endl;\r
+}\r
+\r
+void FunctionalBlock::createConsumptionPattern() throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::createConsumptionPattern()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+ \r
+ // first clear if already exists\r
+ clearConsumptionPattern();\r
+\r
+ lengthCP = -1; \r
+ QHash<QString,QString> consPattern = implementation->getConsumptionPattern(); \r
+ \r
+ foreach(AbstractInterface* iface, getControlInputs()) { \r
+ FunctionalInterface* connIface = AI_TO_FUN(iface);\r
+ QString refName = connIface->getReference()->getName(); \r
+ if (! consPattern.contains(refName)) {\r
+ throw(Exception(NO_IFACE_CP,this));\r
+ cerr << "no consumption pattern for reference interface " << qPrintable(refName) << endl;\r
+ }\r
+ QList<char>* pattern = NULL;\r
+ try {\r
+ pattern = expandPattern(consPattern.value(refName));\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ consumptionPattern.insert(connIface,pattern);\r
+ if (lengthCP == -1) {\r
+ lengthCP = pattern->size();\r
+ }\r
+ else {\r
+ if (pattern->size() != lengthCP) {\r
+ throw(Exception(INVALID_IFACE_CP_LENGTH,this));\r
+ }\r
+ }\r
+ } \r
+}\r
+\r
+void FunctionalBlock::createProductionPattern() throw(Exception){ \r
+ static QString fctName = "FunctionalBlock::createProductionPattern()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+\r
+ // first clear if already exists\r
+ clearProductionPattern();\r
+ \r
+ lengthPP = -1; \r
+ QHash<QString,QString> prodPattern = implementation->getProductionPattern(); \r
+ \r
+ foreach(AbstractInterface* iface, getControlOutputs()) { \r
+ FunctionalInterface* connIface = AI_TO_FUN(iface);\r
+ QString refName = connIface->getReference()->getName(); \r
+ if (! prodPattern.contains(refName)) {\r
+ throw(Exception(NO_IFACE_PP,this));\r
+ }\r
+ QList<char>* pattern = NULL;\r
+ try {\r
+ pattern = expandPattern(prodPattern.value(refName));\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ productionPattern.insert(connIface,pattern);\r
+ if (lengthPP == -1) {\r
+ lengthPP = pattern->size();\r
+ }\r
+ else {\r
+ if (pattern->size() != lengthPP) {\r
+ throw(Exception(INVALID_IFACE_PP_LENGTH,this));\r
+ }\r
+ }\r
+ } \r
+}\r
+\r
+void FunctionalBlock::createProductionCounter() throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::createProductionCounter()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+\r
+ // first clear if already exists\r
+ productionCounter.clear();\r
+\r
+ \r
+ QStringList counterParts = implementation->getProductionCounter().split(",");\r
+ foreach(QString s, counterParts) {\r
+ cout << "cont part = " << qPrintable(s) << endl;\r
+ bool ok;\r
+ double val = s.toDouble(&ok);\r
+ if (ok) {\r
+ productionCounter.append(val);\r
+ }\r
+ else if (s.at(0) == '{') {\r
+ s.remove(0,1);\r
+ s.chop(1);\r
+ QStringList gen = s.split(":");\r
+ if (gen.size() != 3) {\r
+ throw(Exception(INVALID_IFACE_PC,this));\r
+ }\r
+ int start = 0;\r
+ int nb = 0;\r
+ int step = 0;\r
+ for(int i=0;i<3;i++) { \r
+ double result = 0.0;\r
+ try {\r
+ result = evaluateExpression(gen.at(i));\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ if (i==0) start = result;\r
+ else if (i==1) nb = result;\r
+ else if (i==2) step = result;\r
+ }\r
+ for(int j=0;j<nb;j++) {\r
+ productionCounter.append(start+j*step);\r
+ }\r
+ }\r
+ else { \r
+ double result = 0.0;\r
+ try {\r
+ result = evaluateExpression(s);\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ productionCounter.append(result); \r
+ }\r
+ }\r
+ foreach(int val, productionCounter) {\r
+ cout << val << ",";\r
+ }\r
+ cout << endl;\r
+}\r
+\r
+QList<char>* FunctionalBlock::expandPattern(const QString& patternIn) throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::expandPattern()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+ /* expanding a pattern is done in two steps :\r
+ - 1 : finding all variables that correspond to an expression\r
+ and copy them in the pattern\r
+ - 2 : parsing the result\r
+\r
+ Note that the result MUST contain only variables that have a\r
+ integer/double value. Otherwise, expanding will fail.\r
+\r
+ */\r
+\r
+ // first step.\r
+\r
+ QString p = replaceExpressions(patternIn);\r
+\r
+ QList<char> lst; \r
+ p.append(')');\r
+ int offset = 0; \r
+ QList<char>* patternOut = new QList<char>();\r
+ try {\r
+ patternOut->append(expandPatternRecur(p,&offset));\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+\r
+ return patternOut;\r
+}\r
+\r
+QString FunctionalBlock::replaceExpressions(const QString& patternIn) throw(Exception) {\r
+\r
+ QString res = patternIn;\r
+ bool stop = false;\r
+ QRegularExpression re("[$][a-zA-Z0-9_]+");\r
+\r
+ while (!stop) {\r
+ stop = true;\r
+ QRegularExpressionMatchIterator matcher = re.globalMatch(res);\r
+ while(matcher.hasNext()) {\r
+ QRegularExpressionMatch m = matcher.next();\r
+ QString param = m.captured(0);\r
+ QString paramName = param;\r
+ paramName.remove(0,1);\r
+ BlockParameter* p = getParameterFromName(paramName);\r
+ if ((p != NULL) && (p->getType() == BlockParameter::Expression)) {\r
+ res.replace(param,p->getStringValue());\r
+ stop = false;\r
+ cout << "found an expr: " << qPrintable(paramName) << ", patern => " << qPrintable(res) << endl;\r
+ }\r
+ }\r
+ }\r
+ return res;\r
+}\r
+\r
+QList<char> FunctionalBlock::expandPatternRecur(const QString& patternIn, int *offset) throw(Exception) {\r
+ \r
+ QList<char> patternOut;\r
+\r
+ while ((*offset < patternIn.size()) && (patternIn.at(*offset) != ')')) {\r
+ \r
+ QChar c = patternIn.at(*offset);\r
+ if (c == '(') {\r
+ *offset += 1;\r
+ try {\r
+ patternOut.append(expandPatternRecur(patternIn,offset));\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ }\r
+ else if (c == '0') {\r
+ patternOut.append(0);\r
+ }\r
+ else if (c == '1') {\r
+ patternOut.append(1);\r
+ }\r
+ else if (c == 'X') {\r
+ patternOut.append(-1);\r
+ }\r
+ else if (c == '{') {\r
+ *offset += 1;\r
+ QString expr = ""; \r
+ while ((*offset < patternIn.size()) && (patternIn.at(*offset) != '}')) {\r
+ expr += patternIn.at(*offset); \r
+ *offset += 1;\r
+ }\r
+ if (*offset == patternIn.size()) {\r
+ throw(Exception(INVALID_IFACE_PATTERN,this));\r
+ }\r
+ double repeat = 0;\r
+ try {\r
+ repeat = evaluateExpression(expr);\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ if (repeat == 0) {\r
+ // remove the last\r
+ patternOut.removeLast();\r
+ }\r
+ else {\r
+ // repeat just the last value in currentGroup\r
+ char last = patternOut.last();\r
+ //cout << "repeat last char " << repeat << " times : " << (int)last << endl;\r
+ for(int i=1;i<(int)repeat;i++) {\r
+ patternOut.append(last);\r
+ }\r
+ }\r
+ } \r
+ *offset += 1;\r
+ }\r
+ \r
+ // must check if after ), there is a {\r
+ if ((*offset < patternIn.size()-1) && (patternIn.at(*offset+1) == '{')) {\r
+ *offset += 2;\r
+ QString expr = ""; \r
+ while ((*offset < patternIn.size()) && (patternIn.at(*offset) != '}')) {\r
+ expr += patternIn.at(*offset); \r
+ *offset += 1;\r
+ }\r
+ if (*offset == patternIn.size()) {\r
+ throw(Exception(INVALID_IFACE_PATTERN,this));\r
+ }\r
+ double repeat = 0;\r
+ try {\r
+ repeat = evaluateExpression(expr);\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ if (repeat == 0) {\r
+ QList<char> voidList;\r
+ return voidList;\r
+ }\r
+ else {\r
+ /*\r
+ cout << "repeat last group " << repeat << " times : ";\r
+ foreach (char c, currentGroup) cout <<(int)c;\r
+ cout << endl;\r
+ */\r
+ QList<char> single = patternOut;\r
+ for(int i=1;i<(int)repeat;i++) {\r
+ patternOut.append(single);\r
+ }\r
+ }\r
+ } \r
+ return patternOut;\r
+}\r
+\r
+double FunctionalBlock::evaluateExpression(const QString& expression) throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::evaluateExpression()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+ \r
+ QHash<QString,double> vars;\r
+ evaluator->setExpression(expression);\r
+ QList<QString> varNames = evaluator->getVariableNames();\r
+ foreach (QString name, varNames) {\r
+ QString paramName = name;\r
+ paramName.remove(0,1);\r
+ BlockParameter* param = getParameterFromName(paramName);\r
+ if (param == NULL) {\r
+ throw(Exception(EVAL_PARAM_UNKNOWN,this));\r
+ }\r
+ bool okVal;\r
+ int val = param->getDoubleValue(&okVal); \r
+ if (!okVal) {\r
+ throw(Exception(EVAL_PARAM_NOVALUE,this));\r
+ }\r
+ vars.insert(name,(double)val); \r
+ }\r
+ \r
+ evaluator->setVariablesValue(vars);\r
+ double result = 0.0;\r
+ try {\r
+ result = evaluator->evaluate();\r
+ }\r
+ catch(int index) {\r
+ cerr << "Error at index " << index << ": " << qPrintable(evaluator->getError()) << endl;\r
+ throw(Exception(EVAL_INVALID_EXPR,this));\r
+ }\r
+ return result;\r
+}\r
+\r
+void FunctionalBlock::computeAdmittanceDelays() throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::computeAdmittanceDelays()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+ QList<int> inClock;\r
+ QList<int> delays;\r
+\r
+ clearAdmittanceDelays();\r
+\r
+ // trying to synchronize the first one in AP\r
+ QMapIterator<AbstractInterface*,QList<char>* > iterAP(admittance);\r
+ QMapIterator<AbstractInterface*,QList<char>* > iterIP(inputPattern);\r
+\r
+ while (iterAP.hasNext()) {\r
+ iterAP.next();\r
+ iterIP.next();\r
+ QList<char>* ap = iterAP.value();\r
+ QList<char>* ip = iterIP.value();\r
+ int first = 0;\r
+ while ((first < lengthIP) && (ip->at(first) == 0)) first++;\r
+ while ((first < lengthAP) && (ap->at(first) == 0)) first--;\r
+ delays.append(first);\r
+ inClock.append(0);\r
+ QList<int>* delays = new QList<int>();\r
+ admittanceDelays.insert(iterAP.key(), delays);\r
+ }\r
+\r
+ QMapIterator<AbstractInterface*,QList<int>* > iterDelays(admittanceDelays);\r
+\r
+ // get the delay to apply\r
+ int maxDelay = 0;\r
+ for(int i=0;i<delays.size();i++) {\r
+ if (delays[i] > maxDelay) maxDelay = delays[i];\r
+ }\r
+ // adding the delays to IP\r
+ iterIP.toFront();\r
+ int i = 0;\r
+ while (iterIP.hasNext()) {\r
+ iterIP.next();\r
+ iterDelays.next();\r
+ QList<char>* ip = iterIP.value();\r
+ QList<int>* d = iterDelays.value();\r
+ d->append(maxDelay-delays[i]);\r
+ cout << "prependind " << qPrintable(iterIP.key()->getName()) << " with " << (maxDelay-delays[i]) << " 0" << endl;\r
+ for(int j=0;j<maxDelay-delays[i];j++) {\r
+ ip->prepend(0);\r
+ }\r
+ for(int j=0;j<delays[i];j++) {\r
+ ip->append(0);\r
+ }\r
+ i++;\r
+ }\r
+ lengthIP += maxDelay;\r
+\r
+ cout << "IP length = " << lengthIP << ", AP length = " << lengthAP << endl;\r
+ bool stop = false;\r
+ int apIndex = 0;\r
+ int ipIndex = 0;\r
+ while (!stop) {\r
+\r
+ // if AP is a valid group, search for the next valid group in IP\r
+ if (isValidDataGroup(admittance,apIndex)) {\r
+\r
+ while ((ipIndex < lengthIP) && (! isValidDataGroup(inputPattern,ipIndex))) ipIndex++;\r
+ if (ipIndex == lengthIP) {\r
+ stop = true;\r
+ continue;\r
+ }\r
+ }\r
+\r
+ iterAP.toFront();\r
+ iterIP.toFront();\r
+ iterDelays.toFront();\r
+\r
+ if (samePatterns(inputPattern,ipIndex,admittance,apIndex)) {\r
+ while (iterAP.hasNext()) {\r
+ iterAP.next();\r
+ iterDelays.next();\r
+ QList<char>* ap = iterAP.value();\r
+ if (ap->at(apIndex) == 1) {\r
+ QList<int>* d = iterDelays.value();\r
+ d->append(0); // the 1 is at its good place, so no delay\r
+ }\r
+ }\r
+ }\r
+ else {\r
+ cout << "diff between IP and AP at " << apIndex << endl;\r
+ // search for the next 1 in IP for every input that has a 1 in AP\r
+\r
+ while (iterAP.hasNext()) {\r
+ iterAP.next();\r
+ iterIP.next();\r
+ iterDelays.next();\r
+ QList<char>* ap = iterAP.value();\r
+ QList<char>* ip = iterIP.value();\r
+ QList<int>* d = iterDelays.value();\r
+ // case 1: 1 in IP is too late\r
+ if ((ap->at(apIndex) == 1) && (ip->at(ipIndex) == 0)) {\r
+ int delay = 1;\r
+ while ( ((ipIndex+delay) < lengthIP) && (ip->at(ipIndex+delay) == 0) ) delay++;\r
+ cout << "found a delay of " << (-delay) << " for iface " << qPrintable(iterAP.key()->getName()) << endl;\r
+ // moving the 1 to its normal pos.\r
+ ip->replace(ipIndex,1);\r
+ ip->replace(ipIndex+delay,0);\r
+ d->append(-delay);\r
+ }\r
+ // case 2: 1 in IP is too soon\r
+ else if ((ap->at(apIndex) == 0) && (ip->at(ipIndex) == 1)) {\r
+ int delay = 1;\r
+ while ( ((apIndex+delay) < lengthAP) && (ap->at(apIndex+delay) == 0) ) delay++;\r
+ cout << "found a delay of " << delay << " for iface " << qPrintable(iterAP.key()->getName()) << endl;\r
+ // search for next 0 in IP to put the 1\r
+ int k = ipIndex+delay;\r
+ while ((k < lengthIP) && (ip->at(k) == 1)) k++;\r
+ ip->replace(ipIndex,0);\r
+ ip->replace(k,1);\r
+ d->append(delay);\r
+ }\r
+ }\r
+ if (! samePatterns(inputPattern,inClock,admittance,apIndex)) {\r
+ cout << "Abnormal case while searching for delays" << endl;\r
+ }\r
+ }\r
+\r
+ apIndex++;\r
+ ipIndex++;\r
+ if ((apIndex >= lengthAP) || (ipIndex >= lengthIP)) stop = true;\r
+ }\r
+ iterDelays.toFront();\r
+ while (iterDelays.hasNext()) {\r
+ iterDelays.next();\r
+ QList<int>* d = iterDelays.value();\r
+ foreach(int v, *d) {\r
+ cout << v << " ";\r
+ }\r
+ cout << endl;\r
+ }\r
+\r
+}\r
+\r
+void FunctionalBlock::createInputPattern() throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::createInputPattern())";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+ \r
+ lengthIP = -1;\r
+ foreach(AbstractInterface* iface, getControlInputs()) {\r
+\r
+ ConnectedInterface* connIface = AI_TO_CON(iface);\r
+ // check if it is connected\r
+ if (connIface->getConnectedFrom() == NULL) {\r
+ throw(Exception(IFACE_NOT_CONNECTED,this));\r
+ }\r
+ // get the precursor output pattern\r
+ QList<char>* out = connIface->getConnectedFrom()->getOutputPattern();\r
+ AbstractInputModifier* modifier = connIface->getInputModifier();\r
+ // check if the input is modified\r
+ if (modifier != NULL) {\r
+\r
+ out = modifier->getModifiedInput(out);\r
+ }\r
+\r
+ if (out->size() == 0) {\r
+ clearInputPattern();\r
+ throw(Exception(NO_IFACE_IP,this));\r
+ }\r
+ if (lengthIP == -1) {\r
+ lengthIP = out->size();\r
+ }\r
+ else {\r
+ if (out->size() < lengthIP) lengthIP = out->size();\r
+ }\r
+ \r
+ QList<char>* in = new QList<char>(*out);\r
+ foreach(char c, *in) {\r
+ cout << (int)c;\r
+ }\r
+ cout << endl; \r
+ inputPattern.insert(connIface,in); \r
+ }\r
+ // search the last valid group in IP,\r
+ while(! isValidDataGroup(inputPattern,lengthIP-1)) {\r
+ //removeDataGroup(inputPattern,lengthIP-1);\r
+ lengthIP -= 1;\r
+ }\r
+}\r
+\r
+void FunctionalBlock::createAdmittance(int nbExec) throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::createAdmittance()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif \r
+ // firstly, copy CP in AP\r
+ QMapIterator<AbstractInterface*,QList<char>* > iterC(consumptionPattern);\r
+ while (iterC.hasNext()) {\r
+ iterC.next();\r
+ QList<char>* pattern = new QList<char>(*(iterC.value()));\r
+ admittance.insert(iterC.key(), pattern); \r
+ }\r
+ lengthAP = lengthCP;\r
+ int clock = 0; \r
+ cout << "trigger 1 at c.c. 0" << endl;\r
+ for(int i=1;i<nbExec;i++) {\r
+ // searching for the clock cycle for which a new exec starts\r
+ int nbGroup = 0;\r
+ while ((clock < lengthAP) && (nbGroup < delta)) {\r
+ if (isValidDataGroup(admittance,clock)) nbGroup+=1;\r
+ clock += 1;\r
+ }\r
+ while ((clock < lengthAP) && (! isValidDataGroup(admittance,clock))) clock+=1;\r
+ cout << "trigger " << (i+1) << " at c.c. " << clock << endl;\r
+ int sc = clock;\r
+ // combine CP with AP at sc\r
+ for(int j=0;j<lengthCP;j++) {\r
+ // first case : column of CP must be placed beyond AP's end.\r
+ if (sc == lengthAP) {\r
+ cout << i << "," << j << " append in AP at " << sc << endl;\r
+ appendToPattern(consumptionPattern,j,admittance,1);\r
+ lengthAP += 1;\r
+ sc += 1; \r
+ }\r
+ // second case : CP and AP can be combined directly (i.e. no X | 1 to do)\r
+ else if (canCombinePatterns(consumptionPattern,j,admittance,sc)) {\r
+ cout << i << "," << j << " combine at " << sc << endl;\r
+ combinePatterns(consumptionPattern,j,admittance,sc);\r
+ sc += 1;\r
+ }\r
+ // third case : CP has an X column\r
+ else if (isOnlyXDataGroup(consumptionPattern,j)) {\r
+ cout << i << "," << j << " shift rigth AP to combine at " << sc << endl;\r
+ shiftRightPattern(admittance,sc);\r
+ lengthAP += 1;\r
+ if (! canCombinePatterns(consumptionPattern,j,admittance,sc)) {\r
+ cerr << "Abnormal case when combining AP and CP" << endl;\r
+ }\r
+ combinePatterns(consumptionPattern,j,admittance,sc); \r
+ sc += 1;\r
+ }\r
+ // fourth case : AP has an X column\r
+ else if (isOnlyXDataGroup(admittance,sc)) {\r
+ cout << i << "," << j << " jump c.c. for CP at " << sc << endl; \r
+ sc += 1;\r
+ j -= 1;\r
+ }\r
+ else {\r
+ throw(INVALID_DELTA_CP); \r
+ }\r
+ }\r
+ }\r
+ // turn all X into 0\r
+ QMapIterator<AbstractInterface*,QList<char>* > iterA(admittance);\r
+ while (iterA.hasNext()) {\r
+ iterA.next();\r
+ QList<char>* pattern = iterA.value();\r
+ for(int i=0;i<pattern->size();i++) {\r
+ if (pattern->at(i) == -1) pattern->replace(i,0);\r
+ cout << (int)(pattern->at(i));\r
+ }\r
+ cout << endl;\r
+ } \r
+}\r
+\r
+void FunctionalBlock::checkInputPatternCompatibility() throw(Exception) {\r
+ static QString fctName = "FunctionalBlock::checkInputPatternCompatibility()";\r
+#ifdef DEBUG_FCTNAME\r
+ cout << "call to " << qPrintable(fctName) << endl;\r
+#endif\r
+ \r
+ // firstly, create input pattern\r
+ try {\r
+ createInputPattern();\r
+ }\r
+ catch(Exception e) {\r
+ throw(e);\r
+ }\r
+ int nbExec = createTriggers();\r
+ cout << qPrintable(name) << " will exec. " << nbExec << " times." << endl;\r
+ \r
+ try {\r
+ createAdmittance(nbExec);\r
+ }\r
+ catch(Exception e) {\r
+ cout << "cannot create admittance" << endl;\r
+ throw(e);\r
+ }\r
