Home Research Papers Posters Manuals Talks Download People Help Internal

xlat-i/sdag/CParsedFile.C

Go to the documentation of this file.

#include "CParsedFile.h"
#include "xi-Chare.h"
#include <algorithm>

using std::for_each;
using std::list;

namespace xi {

/*void CParsedFile::print(int indent)
{
  for(CEntry *ce=entryList.begin(); !entryList.end(); ce=entryList.next())
  {
    ce->print(indent);
    printf("\n");
  }
  for(SdagConstruct *cn=nodeList.begin(); !nodeList.end(); cn=nodeList.next())
  {
    cn->print(indent);
    printf("\n");
  }
}
*/
XStr* CParsedFile::className = NULL;

template <typename T>
struct SdagConCall {
  void (SdagConstruct::*fn)(T);
  T arg;

  SdagConCall(void (SdagConstruct::*fn_)(T), const T& arg_) : fn(fn_), arg(arg_) {}
  void operator()(Entry* e) {
    if (e->sdagCon) {
      (e->sdagCon->*fn)(arg);
    }
  }
};

template <>
struct SdagConCall<void> {
  void (SdagConstruct::*fn)();
  SdagConCall(void (SdagConstruct::*fn_)()) : fn(fn_) {}
  void operator()(Entry* e) {
    if (e->sdagCon) {
      (e->sdagCon->*fn)();
    }
  }
};

void CParsedFile::doProcess(XStr& classname, XStr& decls, XStr& defs) {
  className = &classname;
  decls << "#define " << classname << "_SDAG_CODE \n";

  for_each(nodeList.begin(), nodeList.end(),
           SdagConCall<void>(&SdagConstruct::numberNodes));
  for_each(nodeList.begin(), nodeList.end(),
           SdagConCall<void>(&SdagConstruct::labelNodes));
  for_each(nodeList.begin(), nodeList.end(),
           SdagConCall<int>(&SdagConstruct::propagateState, 0));
  for_each(nodeList.begin(), nodeList.end(),
           SdagConCall<void>(&SdagConstruct::generateTrace));
  generateEntryList();
  mapCEntry();

  generateCode(decls, defs);
  generateEntries(decls, defs);
  generateInitFunction(decls, defs);
  generatePupFunction(decls, defs);
  generateRegisterEp(decls, defs);
  generateTraceEp(decls, defs);

#ifdef USE_CRITICAL_PATH_HEADER_ARRAY
  generateDependencyMergePoints(decls);  // for Isaac's Critical Path Detection
#endif

  decls.line_append_padding('\\');
  decls << "\n";
}

void CParsedFile::mapCEntry(void) {
  for (list<CEntry*>::iterator en = entryList.begin(); en != entryList.end(); ++en) {
    container->lookforCEntry(*en);
  }
}

void CParsedFile::generateEntryList(void) {
  for (std::list<Entry*>::iterator cn = nodeList.begin(); cn != nodeList.end(); ++cn) {
    (*cn)->sdagCon->generateEntryList(entryList, NULL);
  }
}

void CParsedFile::generateCode(XStr& decls, XStr& defs) {
  for (std::list<Entry*>::iterator cn = nodeList.begin(); cn != nodeList.end(); ++cn) {
    (*cn)->sdagCon->setNext(0, 0);
    (*cn)->sdagCon->generateCode(decls, defs, *cn);
  }
}

void CParsedFile::generateEntries(XStr& decls, XStr& defs) {
  decls << "public:\n";
  for (list<CEntry*>::iterator en = entryList.begin(); en != entryList.end(); ++en) {
    (*en)->generateCode(decls, defs);
  }
}

void CParsedFile::generateInitFunction(XStr& decls, XStr& defs) {
  decls << "public:\n";
  decls << "  SDAG::dep_ptr __dep;\n";

  XStr name = "_sdag_init";
  generateVarSignature(decls, defs, container, false, "void", &name, false, NULL);
  defs << "  __dep.reset(new SDAG::Dependency(" << numEntries << "," << numWhens
       << "));\n";

  for (list<CEntry*>::iterator en = entryList.begin(); en != entryList.end(); ++en)
    (*en)->generateDeps(defs);
  endMethod(defs);

  // Backwards compatibility
  XStr oldname = "__sdag_init";
  generateVarSignature(decls, defs, container, false, "void", &oldname, false, NULL);
  endMethod(defs);
}

void CParsedFile::generateDependencyMergePoints(XStr& decls) {
  decls << " \n";

  // Each when statement will have a set of message dependencies, and
  // also the dependencies from completion of previous task
  for (int i = 0; i < numWhens; i++) {
    decls << "  MergeablePathHistory _when_" << i
          << "_PathMergePoint; /* For Critical Path Detection */ \n";
  }

  // The end of each overlap block will have multiple paths that merge
  // before the subsequent task is executed
  for (int i = 0; i < numOlists; i++) {
    decls << "  MergeablePathHistory olist__co" << i
          << "_PathMergePoint; /* For Critical Path Detection */ \n";
  }
}

void CParsedFile::generatePupFunction(XStr& decls, XStr& defs) {
  decls << "public:\n";
  XStr signature = "_sdag_pup(PUP::er &p)";
  decls << "  void " << signature << ";\n";
  // Backward compatibility version
  decls << "  void _" << signature << " { }\n";

  templateGuardBegin(false, defs);
  defs << container->tspec() << "void " << container->baseName() << "::" << signature
       << " {"
       << "  // Potentially missing " << container->baseName()
       << "_SDAG_CODE in your class definition?\n"
       << "  p|__dep;\n"
       << "}\n";
  templateGuardEnd(defs);
}

void CParsedFile::generateRegisterEp(XStr& decls, XStr& defs) {
  XStr name = "__sdag_register";
  generateVarSignature(decls, defs, container, true, "void", &name, false, NULL);

  for (std::list<Entry*>::iterator cn = nodeList.begin(); cn != nodeList.end(); ++cn) {
    if ((*cn)->sdagCon != 0) {
      (*cn)->sdagCon->generateRegisterEp(defs);
    }
  }

  defs << container->sdagPUPReg;

  endMethod(defs);
}

void CParsedFile::generateTraceEp(XStr& decls, XStr& defs) {
  for (std::list<Entry*>::iterator cn = nodeList.begin(); cn != nodeList.end(); ++cn) {
    if ((*cn)->sdagCon != 0) {
      (*cn)->sdagCon->generateTraceEp(decls, defs, container);
    }
  }
}

}  // namespace xi

---