string DocCompiler::generateCacheCode(Tree sig, const string& exp) { // cerr << "!! entering generateCacheCode with sig=\"" << ppsig(sig) << "\"" << endl; string vname, ctype, code, vectorname; int sharing = getSharingCount(sig); Occurences* o = fOccMarkup.retrieve(sig); // check reentrance if(getCompiledExpression(sig, code)) { // cerr << "!! generateCacheCode called a true getCompiledExpression" << endl; return code; } // check for expression occuring in delays if(o->getMaxDelay() > 0) { if(getVectorNameProperty(sig, vectorname)) { return exp; } getTypedNames(getCertifiedSigType(sig), "r", ctype, vname); gDocNoticeFlagMap["recursigs"] = true; // cerr << "- r : generateCacheCode : vame=\"" << vname << "\", for sig=\"" << ppsig(sig) << "\"" << endl; if(sharing > 1) { // cerr << " generateCacheCode calls generateDelayVec(generateVariableStore) on vame=\"" << vname << "\"" << endl; return generateDelayVec(sig, generateVariableStore(sig, exp), ctype, vname, o->getMaxDelay()); } else { // cerr << " generateCacheCode calls generateDelayVec(exp) on vame=\"" << vname << "\"" << endl; return generateDelayVec(sig, exp, ctype, vname, o->getMaxDelay()); } } else if(sharing == 1 || getVectorNameProperty(sig, vectorname) || isVerySimpleFormula(sig)) { // cerr << "! generateCacheCode : sharing == 1 : return \"" << exp << "\"" << endl; return exp; } else if(sharing > 1) { // cerr << "! generateCacheCode : sharing > 1 : return \"" << exp << "\"" << endl; return generateVariableStore(sig, exp); } else { cerr << "Error in sharing count (" << sharing << ") for " << *sig << endl; exit(1); } return "Error in generateCacheCode"; }
string DocCompiler::generateFVar (Tree sig, const string& file, const string& exp) { string ctype, vname; Occurences* o = fOccMarkup.retrieve(sig); if (o->getMaxDelay()>0) { getTypedNames(getCertifiedSigType(sig), "r", ctype, vname); gGlobal->gDocNoticeFlagMap["recursigs"] = true; //cerr << "- r : generateFVar : \"" << vname << "\"" << endl; setVectorNameProperty(sig, vname); generateDelayVec(sig, exp, ctype, vname, o->getMaxDelay()); } return generateCacheCode(sig, exp); }
string DocCompiler::generateNumber (Tree sig, const string& exp) { string ctype, vname; Occurences* o = fOccMarkup.retrieve(sig); // check for number occuring in delays if (o->getMaxDelay()>0) { getTypedNames(getCertifiedSigType(sig), "r", ctype, vname); gGlobal->gDocNoticeFlagMap["recursigs"] = true; //cerr << "- r : generateNumber : \"" << vname << "\"" << endl; generateDelayVec(sig, exp, ctype, vname, o->getMaxDelay()); } return exp; }
string DocCompiler::generateFConst (Tree sig, const string& file, const string& exp) { string ctype, vname; Occurences* o = fOccMarkup.retrieve(sig); if (o->getMaxDelay()>0) { getTypedNames(getCertifiedSigType(sig), "r", ctype, vname); gGlobal->gDocNoticeFlagMap["recursigs"] = true; //cerr << "- r : generateFConst : \"" << vname << "\"" << endl; generateDelayVec(sig, exp, ctype, vname, o->getMaxDelay()); } if (exp == "fSamplingFreq") { //gGlobal->gDocNoticeFlagMap["fsamp"] = true; return "f_S"; } return "\\mathrm{"+exp+"}"; }