IdentList*
intersection(IdentList *i1, IdentList *i2)
// make sorted intersection of sorted identlists
{
if (!i1 || !i2)
return NULL;
IdentList *r = new IdentList;
Ident *id1 = i1->begin();
Ident *id2 = i2->begin();
while (id1 != i1->end() && id2 != i2->end()) {
if (*id1 < *id2)
id1++;
else if (*id1 > *id2)
id2++;
else {
r->push_back(*id1);
id1++;
id2++;
}
}
if (r->empty()) {
delete r;
r = NULL;
}
return r;
}
void
MonaUntypedAST::makeGTAGuide()
{
IdentList *univs = symbolTable.allUnivs();
if (numTypes > 0) {
// convert types to guide
if (!univs || univs->empty()) {
cout << "Error: Types declared but no universes (or trees)\n"
<< "Execution aborted\n";
exit(-1);
}
if (univs->size() == 1) {
// boolean and universe state space must be different
Name name = Name("<dummy>", dummyPos);
symbolTable.insertUniv(&name, NULL, true);
delete univs;
univs = symbolTable.allUnivs();
}
guide_declaration = new Guide_Declaration(new GuideFuncList, dummyPos);
typedUnivs2guide(univs->size(), univs, 0, "");
}
if (guide_declaration) { // guide is declared
/*#warning NOT REQUIRING UNIVERSES*/
/*
if (!univs || univs->empty()) {
cout << "Error: Guide declared but no universes\n"
<< "Execution aborted\n";
exit(-1);
}
*/
// fill tables
unsigned numUnivs = univs->size();
char **univPos = (char **) mem_alloc(sizeof(char *)*numUnivs);
char **univName = (char **) mem_alloc(sizeof(char *)*numUnivs);
IdentList::iterator id;
int i;
for (id = univs->begin(), i = 0; id != univs->end(); id++, i++) {
univName[i] = symbolTable.lookupSymbol(*id);
univPos[i] = symbolTable.lookupPos(*id);
}
unsigned numSs = guide_declaration->funcList->size();
SsId *muLeft = (SsId *) mem_alloc(sizeof(SsId)*numSs);
SsId *muRight = (SsId *) mem_alloc(sizeof(SsId)*numSs);
char **ssName = (char **) mem_alloc(sizeof(char *)*numSs);
SsKind *ssKind = 0;
int *ssType = 0;
if (numTypes > 0) {
ssKind = (SsKind *) mem_alloc(sizeof(SsKind)*numSs);
ssType = (int *) mem_alloc(sizeof(int)*numSs);
}
GuideFuncList::iterator g;
for (g = guide_declaration->funcList->begin(), i = 0;
g != guide_declaration->funcList->end(); g++, i++) {
muLeft[i] = symbolTable.lookupNumber((*g)->name2);
muRight[i] = symbolTable.lookupNumber((*g)->name3);
ssName[i] = (*g)->name1->str;
if (numTypes > 0) {
switch((*g)->kind) {
case SS_UNIVHAT:
ssKind[i] = gtaSSUNIVHAT;
break;
case SS_ORHAT:
ssKind[i] = gtaSSORHAT;
break;
case SS_ORLEAF:
ssKind[i] = gtaSSORLEAF;
break;
case SS_AND:
ssKind[i] = gtaSSAND;
break;
case SS_DUMMY:
ssKind[i] = gtaSSDUMMY;
break;
default: ;
}
Ident sstype =
symbolTable.lookupSSType(symbolTable.lookupIdent((*g)->name1));
if (sstype != -1) {
char *sstypename = symbolTable.lookupSymbol(sstype);
int j;
for (j = 0; j < numTypes; j++)
if (treetypes[j].name == sstypename) {
ssType[i] = j;
break;
}
invariant(j < numTypes);
}
else
ssType[i] = -1;
}
}
makeGuide(numSs, muLeft, muRight, ssName, numUnivs,
univPos, univName, ssType, ssKind);
if (!checkDisjoint()) {
cout << "Illegal guide and universe declarations:\n"
<< "Universes must have disjoint state spaces\n"
<< "Execution aborted\n";
exit(-1);
}
if (!checkAllUsed()) {
cout << "Illegal guide and universe declarations:\n"
<< "All state spaces must be reachable\n"
<< "Execution aborted\n";
exit(-1);
}
if (!checkAllCovered()) {
cout << "Illegal guide and universe declarations:\n"
<< "Every infinite path in the guide must belong to a universe\n"
<< "Execution aborted\n";
exit(-1);
}
}
else { // no guide declared, make default
if (!univs || univs->empty()) {
// make one universe
Name name = Name("<univ>", dummyPos);
symbolTable.insertUniv(&name, (char *) NULL);
delete univs;
univs = symbolTable.allUnivs();
}
if (univs->size() == 1) {
// boolean and universe state space must be different
Name name = Name("<dummy>", dummyPos);
symbolTable.insertUniv(&name, NULL, true);
delete univs;
univs = symbolTable.allUnivs();
}
// fill name table
unsigned numUnivs = univs->size();
char **univName = (char **) mem_alloc(sizeof(char *)*numUnivs);
Ident *id;
int u;
for (id = univs->begin(), u = 0; id != univs->end(); id++, u++)
univName[u] = symbolTable.lookupSymbol(*id);
makeDefaultGuide(numUnivs, univName);
}
delete univs;
}
