-#include <assert.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
+/* jit/sets.c -
+
+ Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003
+ Institut f. Computersprachen, TU Wien
+ R. Grafl, A. Krall, C. Kruegel, C. Oates, R. Obermaisser, M. Probst,
+ S. Ring, E. Steiner, C. Thalinger, D. Thuernbeck, P. Tomsich,
+ J. Wenninger
+
+ This file is part of CACAO.
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2, or (at
+ your option) any later version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
+ 02111-1307, USA.
+ Contact: cacao@complang.tuwien.ac.at
+
+ Authors: Carolyn Oates
+
+ $Id: sets.c 557 2003-11-02 22:51:59Z twisti $
+
+*/
+
+
+#include <stdio.h>
#include "sets.h"
+#include "types.h"
+#include "global.h"
/*
* set.c - functions to manipulate ptr sets.
*/
+
/*------------------------------------------------------------*/
/*-- fieldinfo call set fns */
/*------------------------------------------------------------*/
-fldSetNode *inFldSet (fldSetNode *s, fieldinfo *f)
- {
- fldSetNode* i;
- for (i=s; i != NULL; i = i->nextfldRef) {
- if (i->fldRef == f) {
- return i; /* true = found */
- }
- }
- return NULL;
- }
+fldSetNode *inFldSet(fldSetNode *s, fieldinfo *f)
+{
+ fldSetNode* i;
+ for (i=s; i != NULL; i = i->nextfldRef) {
+ if (i->fldRef == f) {
+ return i; /* true = found */
+ }
+ }
+ return NULL;
+}
+
/*------------------------------------------------------------*/
/* */
-fldSetNode *addFldRef(fldSetNode *s, fieldinfo *f)
- {
- fldSetNode *s1 = s;
- if (!inFldSet(s,f)) {
- s1 = (fldSetNode *)malloc(sizeof(fldSetNode));
- s1->nextfldRef = s;
- s1->fldRef = f;
- s1->writePUT = false;
- s1->readGET = false;
- s1->lastptrPUT = NULL;
- s1->lastptrGET = NULL;
-
- if (s == NULL)
- s1->index = 1;
- else
- s1->index = s->index+1;
- }
- return s1;
- }
+fldSetNode *addFldRef(fldSetNode *s, fieldinfo *f)
+{
+ fldSetNode *s1 = s;
+ if (!inFldSet(s,f)) {
+ s1 = (fldSetNode *)malloc(sizeof(fldSetNode));
+ s1->nextfldRef = s;
+ s1->fldRef = f;
+ s1->writePUT = false;
+ s1->readGET = false;
+ s1->lastptrPUT = NULL;
+ s1->lastptrGET = NULL;
+
+ if (s == NULL)
+ s1->index = 1;
+ else
+ s1->index = s->index+1;
+ }
+ return s1;
+}
+
/*------------------------------------------------------------*/
fldSet *add2FldSet(fldSet *sf, fieldinfo *f, bool wput, bool rget)
- {
- fldSetNode *s1;
- fldSetNode *s;
+{
+ fldSetNode *s1;
+ fldSetNode *s;
- if (sf == NULL) {
- sf = createFldSet();
+ if (sf == NULL) {
+ sf = createFldSet();
}
- s = sf->head;
- s1 = inFldSet(s,f);
- if (s1 == NULL) {
- s1 = (fldSetNode *)malloc(sizeof(fldSetNode));
- if (sf->head == NULL) {
- sf->head = s1;
- sf->pos = s1;
- s1->index = 1;
- }
- else {
- sf->tail->nextfldRef = s1;
- sf->length++;
- s1->index = sf->length;
+ s = sf->head;
+ s1 = inFldSet(s,f);
+ if (s1 == NULL) {
+ s1 = (fldSetNode *)malloc(sizeof(fldSetNode));
+ if (sf->head == NULL) {
+ sf->head = s1;
+ sf->pos = s1;
+ s1->index = 1;
+ }
+ else {
+ sf->tail->nextfldRef = s1;
+ sf->length++;
+ s1->index = sf->length;
}
- s1->nextfldRef = NULL;
- s1->fldRef = f;
- s1->writePUT = wput;
- s1->readGET = rget;
- s1->lastptrPUT = NULL;
- s1->lastptrGET = NULL;
- sf->tail = s1;
- }
- else {
- if ((s1->writePUT == false) && (wput))
- s1->writePUT = wput;
- if ((s1->readGET == false) && (rget))
- s1->readGET = rget;
+ s1->nextfldRef = NULL;
+ s1->fldRef = f;
+ s1->writePUT = wput;
+ s1->readGET = rget;
+ s1->lastptrPUT = NULL;
+ s1->lastptrGET = NULL;
+ sf->tail = s1;
}
- return sf;
- }
+ else {
+ if ((s1->writePUT == false) && (wput))
+ s1->writePUT = wput;
+ if ((s1->readGET == false) && (rget))
+ s1->readGET = rget;
+ }
+ return sf;
+}
+
/*------------------------------------------------------------*/
fldSet *createFldSet( )
- {
- fldSet *s;
- s = (fldSet *)malloc(sizeof(fldSet));
- s->head = NULL;
- s->tail = NULL;
- s->pos = NULL;
- s->length = 0;
- return s;
- }
+{
+ fldSet *s;
+ s = (fldSet *)malloc(sizeof(fldSet));
+ s->head = NULL;
+ s->tail = NULL;
+ s->pos = NULL;
+ s->length = 0;
+ return s;
+}
+
/*------------------------------------------------------------*/
/*-- methodinfo call set fns */
/*------------------------------------------------------------*/
int inMethSet (methSetNode *s, methodinfo *m)
- {
- methSetNode* i;
- for (i=s; i != NULL; i = i->nextmethRef) {
- if (i->methRef == m) {
- return (int)1; /* true = found */
- }
- }
- return (int)0;
- }
+{
+ methSetNode* i;
+ for (i=s; i != NULL; i = i->nextmethRef) {
+ if (i->methRef == m) {
+ return (int)1; /* true = found */
+ }
+ }
+ return (int)0;
+}
+
/*------------------------------------------------------------*/
methSetNode *addMethRef(methSetNode *s, methodinfo *m)
- {
- methSetNode *s1 = s;
- if (!inMethSet(s,m)) {
- s1 = (methSetNode *)malloc(sizeof(methSetNode));
- s1->nextmethRef= s;
- s1->methRef = m;
- s1->lastptrIntoClassSet2 = NULL;
- if (s == NULL)
- s1->index = 1;
- else
- s1->index = s->index+1;
- s1->monoPoly = MONO;
- }
+{
+ methSetNode *s1 = s;
+ if (!inMethSet(s,m)) {
+ s1 = (methSetNode *)malloc(sizeof(methSetNode));
+ s1->nextmethRef= s;
+ s1->methRef = m;
+ s1->lastptrIntoClassSet2 = NULL;
+ if (s == NULL)
+ s1->index = 1;
+ else
+ s1->index = s->index+1;
+ s1->monoPoly = MONO;
+ }
- return s1;
- }
+ return s1;
+}
+
/*------------------------------------------------------------*/
methSet *add2MethSet(methSet *sm, methodinfo *m)
- {
- methSetNode *s1;
- methSetNode *s;
+{
+ methSetNode *s1;
+ methSetNode *s;
- if (sm == NULL) {
- sm = createMethSet();
+ if (sm == NULL) {
+ sm = createMethSet();
}
- s = sm->head;
- if (!inMethSet(s,m)) {
- s1 = (methSetNode *)malloc(sizeof(methSetNode));
- if (sm->head == NULL) {
- sm->head = s1;
- sm->pos = s1;
- s1->index = 1;
- }
- else {
- sm->tail->nextmethRef = s1;
- sm->length++;
- s1->index = sm->length;
+ s = sm->head;
+ if (!inMethSet(s,m)) {
+ s1 = (methSetNode *)malloc(sizeof(methSetNode));
+ if (sm->head == NULL) {
+ sm->head = s1;
+ sm->pos = s1;
+ s1->index = 1;
+ }
+ else {
+ sm->tail->nextmethRef = s1;
+ sm->length++;
+ s1->index = sm->length;
}
- s1->monoPoly = MONO;
- s1->nextmethRef= NULL;
- s1->methRef = m;
- s1->lastptrIntoClassSet2 = NULL;
- sm->tail = s1;
- }
- return sm;
- }
+ s1->monoPoly = MONO;
+ s1->nextmethRef= NULL;
+ s1->methRef = m;
+ s1->lastptrIntoClassSet2 = NULL;
+ sm->tail = s1;
+ }
+ return sm;
+}
+
/*------------------------------------------------------------*/
methSet *createMethSet( )
- {
- methSet *s;
- s = (methSet *)malloc(sizeof(methSet));
- s->head = NULL;
- s->tail = NULL;
- s->pos = NULL;
- s->length = 0;
- return s;
- }
+{
+ methSet *s;
+ s = (methSet *)malloc(sizeof(methSet));
+ s->head = NULL;
+ s->tail = NULL;
+ s->pos = NULL;
+ s->length = 0;
+ return s;
+}
+
/*------------------------------------------------------------*/
/*-- classinfo XTA set fns */
/*------------------------------------------------------------*/
int inSet (classSetNode *s, classinfo *c)
- {
- classSetNode* i;
- for (i=s; i != NULL; i = i->nextClass) {
- if (i->classType == c) {
- return ((i->index)+1); /* true = found */
- }
- }
- return (int)0;
- }
+{
+ classSetNode* i;
+ for (i=s; i != NULL; i = i->nextClass) {
+ if (i->classType == c) {
+ return ((i->index)+1); /* true = found */
+ }
+ }
+ return (int)0;
+}
+
/*------------------------------------------------------------*/
classSetNode *addElement(classSetNode *s, classinfo *c)
- {
- classSetNode *s1 = s;
- if (!inSet(s,c)) {
- s1 = (classSetNode *)malloc(sizeof(classSetNode));
- s1->nextClass= s;
- s1->classType = c;
- if (s == NULL)
- s1->index = 1;
- else
- s1->index = s->index+1;
- }
- return s1;
- }
+{
+ classSetNode *s1 = s;
+ if (!inSet(s,c)) {
+ s1 = (classSetNode *)malloc(sizeof(classSetNode));
+ s1->nextClass= s;
+ s1->classType = c;
+ if (s == NULL)
+ s1->index = 1;
+ else
+ s1->index = s->index+1;
+ }
+ return s1;
+}
+
/*------------------------------------------------------------*/
classSet *add2ClassSet(classSet *sc, classinfo *c)
- {
- classSetNode *s1;
- classSetNode *s;
+{
+ classSetNode *s1;
+ classSetNode *s;
- if (sc == NULL) {
- sc = createClassSet();
+ if (sc == NULL) {
+ sc = createClassSet();
}
- s = sc->head;
+ s = sc->head;
- if (!inSet(s,c)) {
- s1 = (classSetNode *)malloc(sizeof(classSetNode));
- if (sc->head == NULL) {
- sc->head = s1;
- sc->pos = s1;
- s1->index = 1;
- }
- else {
- sc->tail->nextClass = s1;
- sc->length++;
- s1->index = sc->length;
+ if (!inSet(s,c)) {
+ s1 = (classSetNode *)malloc(sizeof(classSetNode));
+ if (sc->head == NULL) {
+ sc->head = s1;
+ sc->pos = s1;
+ s1->index = 1;
+ }
+ else {
+ sc->tail->nextClass = s1;
+ sc->length++;
+ s1->index = sc->length;
}
- s1->classType = c;
- s1->nextClass= NULL;
- sc->tail = s1;
- }
- return sc;
- }
+ s1->classType = c;
+ s1->nextClass= NULL;
+ sc->tail = s1;
+ }
+ return sc;
+}
+
/*------------------------------------------------------------*/
classSet *createClassSet( )
- {
- classSet *s;
- s = (classSet *)malloc(sizeof(classSet));
- s->head = NULL;
- s->tail = NULL;
- s->pos = NULL;
- s->length = 0;
- return s;
- }
+{
+ classSet *s;
+ s = (classSet *)malloc(sizeof(classSet));
+ s->head = NULL;
+ s->tail = NULL;
+ s->pos = NULL;
+ s->length = 0;
+ return s;
+}
+
/*------------------------------------------------------------*/
/* Returns: */
/* 1 c is a superclass of an existing set element */
int inRange (classSetNode *s, classinfo *c)
- {
- classSetNode* i;
- int rc=0;
-
- for (i=s; i != NULL; i = i->nextClass) {
- classinfo *cs = i->classType;
- if (cs->vftbl->baseval <= c->vftbl->baseval) {
- if (c->vftbl->baseval <= (cs->vftbl->baseval+cs->vftbl->diffval)) {
- rc = -1; /* subtype */
+{
+ classSetNode* i;
+ int rc=0;
+
+ for (i=s; i != NULL; i = i->nextClass) {
+ classinfo *cs = i->classType;
+ if (cs->vftbl->baseval <= c->vftbl->baseval) {
+ if (c->vftbl->baseval <= (cs->vftbl->baseval+cs->vftbl->diffval)) {
+ rc = -1; /* subtype */
+ }
}
- }
- else {
- if (cs->vftbl->baseval < (c->vftbl->baseval+c->vftbl->diffval)) {
- i->classType = c; /* replace element with its new super */
- rc = 1; /* super */
+ else {
+ if (cs->vftbl->baseval < (c->vftbl->baseval+c->vftbl->diffval)) {
+ i->classType = c; /* replace element with its new super */
+ rc = 1; /* super */
+ }
}
- }
}
- return rc;
- }
+ return rc;
+}
+
/*------------------------------------------------------------*/
/* adds class if not subtype of an existing set element */
/* then replace the existing element with the "new" class */
classSetNode *addClassCone(classSetNode *s, classinfo *c)
- {
- classSetNode *s1 = s;
+{
+ classSetNode *s1 = s;
-if (inRange(s,c) == 0) {
- /* not in set nor cone of an existing element so add */
- s1 = (classSetNode *)malloc(sizeof(classSetNode));
- s1->nextClass= s;
- s1->classType = c;
- if (s == NULL)
- s1->index = 1;
- else
- s1->index = s->index+1;
+ if (inRange(s,c) == 0) {
+ /* not in set nor cone of an existing element so add */
+ s1 = (classSetNode *)malloc(sizeof(classSetNode));
+ s1->nextClass= s;
+ s1->classType = c;
+ if (s == NULL)
+ s1->index = 1;
+ else
+ s1->index = s->index+1;
}
- return s1;
- }
+ return s1;
+}
+
/*------------------------------------------------------------*/
classSetNode * intersectSubtypesWithSet(classinfo *t, classSetNode *s) {
- classSetNode *s1 = NULL;
- classSetNode *c;
+ classSetNode *s1 = NULL;
+ classSetNode *c;
- /* for each s class */
- for (c=s; c != NULL; c = c->nextClass) {
- vftbl *t_cl_vt = t->vftbl;
- vftbl *c_cl_vt = c->classType->vftbl;
+ /* for each s class */
+ for (c=s; c != NULL; c = c->nextClass) {
+ vftbl *t_cl_vt = t->vftbl;
+ vftbl *c_cl_vt = c->classType->vftbl;
- /* if s class is in the t Class range */
- if ( (t_cl_vt->baseval <= c_cl_vt->baseval)
- && (c_cl_vt->baseval <= (t_cl_vt->baseval+t_cl_vt->diffval)) ) {
+ /* if s class is in the t Class range */
+ if ( (t_cl_vt->baseval <= c_cl_vt->baseval)
+ && (c_cl_vt->baseval <= (t_cl_vt->baseval+t_cl_vt->diffval)) ) {
- /* add s class to return class set */
- s1 = addElement(s1,c->classType);
+ /* add s class to return class set */
+ s1 = addElement(s1,c->classType);
}
}
- return s1;
- }
+ return s1;
+}
+
/*------------------------------------------------------------*/
int sizeOfSet(classSetNode *s) {
-/*** need to update */
- int cnt=0;
- classSetNode * i;
- for (i=s; i != NULL; i = i->nextClass) cnt++;
- return cnt;
- }
+ /*** need to update */
+ int cnt=0;
+ classSetNode * i;
+ for (i=s; i != NULL; i = i->nextClass) cnt++;
+ return cnt;
+}
+
/*------------------------------------------------------------*/
int printSet(classSetNode *s)
- {
- classSetNode* i;
- int cnt=0;
+{
+ classSetNode* i;
+ int cnt=0;
- if (s == NULL) {
- printf("Set of types: <");
- printf("\t\tEmpty Set\n");
+ if (s == NULL) {
+ printf("Set of types: <");
+ printf("\t\tEmpty Set\n");
}
- else {
- printf("<%i>Set of types: ",s->index);
- for (i=s; i != NULL; i = i->nextClass) {
+ else {
+ printf("<%i>Set of types: ",s->index);
+ for (i=s; i != NULL; i = i->nextClass) {
printf("\t#%i: ",cnt);
- if (i->classType == NULL) {
- printf("NULL CLASS");
- fflush(stdout);
+ if (i->classType == NULL) {
+ printf("NULL CLASS");
+ fflush(stdout);
}
- else {
- utf_display(i->classType->name);
- fflush(stdout);
- printf("<b%i/d%i> ",i->classType->vftbl->baseval,i->classType->vftbl->diffval);
- fflush(stdout);
+ else {
+ utf_display(i->classType->name);
+ fflush(stdout);
+ printf("<b%i/d%i> ",i->classType->vftbl->baseval,i->classType->vftbl->diffval);
+ fflush(stdout);
}
- cnt++;
+ cnt++;
}
- printf(">\n");
+ printf(">\n");
}
- return cnt;
- }
+ return cnt;
+}
+
+
/*------------------------------------------------------------*/
int printClassSet(classSet *sc) {
-if (sc == NULL) {
- printf("Class Set not yet created\n");
- return 0;
+ if (sc == NULL) {
+ printf("Class Set not yet created\n");
+ return 0;
}
-else
- return (printSet(sc->head));
+ else
+ return (printSet(sc->head));
}
+
/*------------------------------------------------------------*/
int printMethSet(methSetNode *s)
- {
- methSetNode* i;
- int cnt=0;
+{
+ methSetNode* i;
+ int cnt=0;
- if (s == NULL) {
- printf("Set of Methods: "); fflush(stdout);
+ if (s == NULL) {
+ printf("Set of Methods: "); fflush(stdout);
printf("\t\tEmpty Set\n"); fflush(stdout);
- }
- else {
- printf("<%i>Set of Methods: ",s->index);fflush(stdout);
- for (i=s; i != NULL; i = i->nextmethRef) {
+ }
+ else {
+ printf("<%i>Set of Methods: ",s->index);fflush(stdout);
+ for (i=s; i != NULL; i = i->nextmethRef) {
printf("\t#%i: ",cnt);
- /* class.method */
- utf_display(i->methRef->class->name);
- printf(".");
- method_display(i->methRef);
+ /* class.method */
+ utf_display(i->methRef->class->name);
+ printf(".");
+ method_display(i->methRef);
- /* lastptr <class> */
- printf("\t<");
- if (i->lastptrIntoClassSet2 != NULL)
- utf_display(i->lastptrIntoClassSet2->classType->name);
- printf(">\n");
+ /* lastptr <class> */
+ printf("\t<");
+ if (i->lastptrIntoClassSet2 != NULL)
+ utf_display(i->lastptrIntoClassSet2->classType->name);
+ printf(">\n");
- cnt++;
+ cnt++;
}
- printf("\n");
+ printf("\n");
}
- return cnt;
- }
+ return cnt;
+}
+
+
/*------------------------------------------------------------*/
int printMethodSet(methSet *sm) {
-if (sm == NULL) {
- printf("Method Set not yet created\n");
- return 0;
+ if (sm == NULL) {
+ printf("Method Set not yet created\n");
+ return 0;
}
-else
- return (printMethSet(sm->head));
+ else
+ return (printMethSet(sm->head));
}
+
+
/*------------------------------------------------------------*/
int printFldSet(fldSetNode *s)
- {
- fldSetNode* i;
- int cnt=0;
+{
+ fldSetNode* i;
+ int cnt=0;
- if (s == NULL) {
- printf("Set of Fields: ");
- printf("\tEmpty Set\n");
+ if (s == NULL) {
+ printf("Set of Fields: ");
+ printf("\tEmpty Set\n");
}
- else {
- printf("<%i>Set of Fields: ",s->index);
- for (i=s; i != NULL; i = i->nextfldRef) {
+ else {
+ printf("<%i>Set of Fields: ",s->index);
+ for (i=s; i != NULL; i = i->nextfldRef) {
printf("\t#%i: ",cnt);
- printf("(%ir/%iw)",i->writePUT,i->readGET);
- field_display(i->fldRef);
- cnt++;
+ printf("(%ir/%iw)",i->writePUT,i->readGET);
+ field_display(i->fldRef);
+ cnt++;
}
- printf("\n");
+ printf("\n");
}
- return cnt;
- }
+ return cnt;
+}
+
/*------------------------------------------------------------*/
int printFieldSet(fldSet *sf) {
-if (sf == NULL) {
- printf("Field Set not yet created\n");
- return 0;
+ if (sf == NULL) {
+ printf("Field Set not yet created\n");
+ return 0;
}
-else
- return (printFldSet(sf->head));
+ else
+ return (printFldSet(sf->head));
}
/*------------------------------------------------------------*/
/*void destroy_set */
+
+/*
+ * These are local overrides for various environment variables in Emacs.
+ * Please do not remove this and leave it at the end of the file, where
+ * Emacs will automagically detect them.
+ * ---------------------------------------------------------------------
+ * Local variables:
+ * mode: c
+ * indent-tabs-mode: t
+ * c-basic-offset: 4
+ * tab-width: 4
+ * End:
+ */
projects / cacao.git / blobdiff