From 59947667adccd7191aad383e68a6ff5c86129774 Mon Sep 17 00:00:00 2001
From: bdemsky <bdemsky>
Date: Thu, 6 May 2004 20:56:32 +0000
Subject: [PATCH 1/1] Cleaning up more files

---
 Repair/RepairCompiler/MCC/SimpleHash.cc | 440 ------------------------
 Repair/RepairCompiler/MCC/SimpleHash.h  | 199 -----------
 Repair/RepairCompiler/MCC/test2.cc      |  12 -
 3 files changed, 651 deletions(-)
 delete mode 100755 Repair/RepairCompiler/MCC/SimpleHash.cc
 delete mode 100755 Repair/RepairCompiler/MCC/SimpleHash.h
 delete mode 100755 Repair/RepairCompiler/MCC/test2.cc

diff --git a/Repair/RepairCompiler/MCC/SimpleHash.cc b/Repair/RepairCompiler/MCC/SimpleHash.cc
deleted file mode 100755
index 7206571..0000000
--- a/Repair/RepairCompiler/MCC/SimpleHash.cc
+++ /dev/null
@@ -1,440 +0,0 @@
-#include "SimpleHash.h"
-#include <stdarg.h>
-#include <stdlib.h>
-
-/* LINKED HASH NODE ****************************************************/
-
-LinkedHashNode::LinkedHashNode(int key, int data, LinkedHashNode *next) {
-    this->key = key;
-    this->data = data;
-    this->next = next;
-    this->lnext=0;
-    this->lprev=0;
-}
-
-LinkedHashNode::LinkedHashNode() {
-    this->key = -1;
-    this->data = -1;
-    this->next = 0;
-    this->lnext=0;
-    this->lprev=0;
-}
-
-/* SIMPLE LIST ****************************************************/
-
-SimpleList::SimpleList() {
-    ptr = 0;
-    head.next = 0;
-}
-
-void SimpleList::reset() {
-  // ptr = head.next;
-  ptr = &head;
-}
-
-int SimpleList::hasMoreElements() {
-  //  return (ptr != 0);
-  return (ptr->next != 0);
-}
-
-int SimpleList::nextElement() {
-  ptr = ptr->next;
-  return ptr->data;
-
-  //int data = ptr->data;
-  //ptr = ptr->next;
-  //return data;
-}
-
-void SimpleList::add(int data) {
-    LinkedHashNode *cur = &head;
-    while (cur->next) {
-        cur = cur->next;
-        if (cur->data == data) {
-            return; // no duplicates
-        }
-    }
-    cur->next = new LinkedHashNode(0, data, 0);
-    return;
-}
-
-int SimpleList::contains(int data) {
-    LinkedHashNode *cur = &head;
-    while (cur->next) {
-        cur = cur->next;
-        if (cur->data == data) {
-            return 1; // found!
-        }
-    }
-    return 0;    
-}
-
-/* WORK LIST ****************************************************/
-
-WorkList::WorkList() {
-  head=(struct ListNode *) malloc(sizeof(struct ListNode));
-  tail=head;
-  headoffset=0;
-  tailoffset=0;
-}
-
-int WorkList::hasMoreElements() {
-  //  return (ptr != 0);
-  return ((head!=tail)||(headoffset!=tailoffset));
-}
-
-int WorkList::getid() {
-  return tail->data[tailoffset];
-}
-
-int WorkList::gettype() {
-  return tail->data[tailoffset+1];
-}
-
-int WorkList::getlvalue() {
-  return tail->data[tailoffset+2];
-}
-
-int WorkList::getrvalue() {
-  return tail->data[tailoffset+3];
-}
-
-WorkList::~WorkList() {
-  struct ListNode *ptr=tail;
-  while(ptr) {
-    struct ListNode *oldptr=ptr;
-    ptr=ptr->next;
-    free(oldptr);
-  }
-}
-
-void WorkList::pop() {
-  int newoffset=tailoffset+4;
-  struct ListNode *ptr=tail;
-  if (newoffset>=WLISTSIZE) {
-    newoffset-=WLISTSIZE;
-    struct ListNode *oldptr=ptr;
-    ptr=ptr->next;
-    free(oldptr);
-  }
-  tail=ptr;
-  tailoffset=newoffset;
-}
-
-void WorkList::add(int id,int type, int lvalue, int rvalue) {
-  if (headoffset==WLISTSIZE) {
-    head->next=(struct ListNode *)malloc(sizeof(struct ListNode));
-    headoffset=0;
-    head=head->next;
-  }
-  head->data[headoffset++]=id;
-  head->data[headoffset++]=type;
-  head->data[headoffset++]=lvalue;
-  head->data[headoffset++]=rvalue;
-}
-
-/* SIMPLE HASH ********************************************************/
-SimpleIterator* SimpleHash::iterator() {
-  return new SimpleIterator(listhead,this);
-}
-
-void SimpleHash::iterator(SimpleIterator & it) {
-  it.table=this;
-  it.cur=listhead;
-  it.index=0;
-}
-
-SimpleHash::SimpleHash(int size) {
-    if (size <= 0) {
-        throw SimpleHashException();
-    }
-    this->size = size;
-    this->bucket = (struct SimpleNode **) calloc(sizeof(struct SimpleNode *)*size,1);
-    /* Set allocation blocks*/
-    this->listhead=(struct ArraySimple *) calloc(sizeof(struct ArraySimple),1);
-    this->listtail=this->listhead;
-    this->tailindex=0;
-    /*Set data counts*/
-    this->numparents = 0;
-    this->numchildren = 0;
-    this->numelements = 0;
-}
-
-SimpleHash::~SimpleHash() {
-  free(bucket);
-  struct ArraySimple *ptr=listhead;
-  while(ptr) {
-      struct ArraySimple *next=ptr->nextarray;
-      free(ptr);
-      ptr=next;
-  }
-}
-
-void SimpleHash::addParent(SimpleHash* parent) {
-    parents[numparents++] = parent;
-    parent->addChild(this);
-}
-
-void SimpleHash::addChild(SimpleHash *child) {
-  children[numchildren++]=child;
-}
-
-int SimpleHash::remove(int key, int data) {
-    unsigned int hashkey = (unsigned int)key % size;
-    
-    struct SimpleNode **ptr = &bucket[hashkey];
-
-    for (int i = 0; i < numchildren; i++) {
-      children[i]->remove(key, data);
-    }
-
-    while (*ptr) {
-        if ((*ptr)->key == key && (*ptr)->data == data) {
-	  struct SimpleNode *toremove=*ptr;
-	  *ptr=(*ptr)->next;
-
-	  toremove->inuse=0; /* Marked as unused */
-
-	  numelements--;
-	  return 1;
-        }
-        ptr = &((*ptr)->next);
-    }
-
-    return 0;
-}
-
-
-
-int SimpleHash::add(int key, int data) {
-    unsigned int hashkey = (unsigned int)key % size;
-    
-    struct SimpleNode **ptr = &bucket[hashkey];
-
-    /* check that this key/object pair isn't already here */
-    // TBD can be optimized for set v. relation */
-    while (*ptr) {
-        if ((*ptr)->key == key && (*ptr)->data == data) {
-            return 0;
-        }
-        ptr = &((*ptr)->next);
-    }
-    if (tailindex==ARRAYSIZE) {
-      listtail->nextarray=(struct ArraySimple *) calloc(sizeof(struct ArraySimple),1);
-      tailindex=0;
-      listtail=listtail->nextarray;
-    }
-    
-    *ptr = &listtail->nodes[tailindex++];
-    (*ptr)->key=key;
-    (*ptr)->data=data;
-    (*ptr)->inuse=1;
-
-    numelements++;
-    
-    for (int i = 0; i < numparents; i++) {
-        parents[i]->add(key, data);
-    }
-
-    return 1;
-}
-
-bool SimpleHash::contains(int key) {
-    unsigned int hashkey = (unsigned int)key % size;
-    
-    struct SimpleNode *ptr = bucket[hashkey];
-    while (ptr) {
-        if (ptr->key == key) {
-            // we already have this object 
-            // stored in the hash so just return
-            return true;
-        }
-        ptr = ptr->next;
-    }
-    return false;
-}
-
-bool SimpleHash::contains(int key, int data) {
-    unsigned int hashkey = (unsigned int)key % size;
-    
-    struct SimpleNode *ptr = bucket[hashkey];
-    while (ptr) {
-        if (ptr->key == key && ptr->data == data) {
-            // we already have this object 
-            // stored in the hash so just return
-            return true;
-        }
-        ptr = ptr->next;
-    }
-    return false;
-}
-
-int SimpleHash::count(int key) {
-    unsigned int hashkey = (unsigned int)key % size;
-    int count = 0;
-
-    struct SimpleNode *ptr = bucket[hashkey];
-    while (ptr) {
-        if (ptr->key == key) {
-            count++;
-        }
-        ptr = ptr->next;
-    }
-    return count;
-}
-
-int SimpleHash::get(int key, int&data) {
-    unsigned int hashkey = (unsigned int)key % size;
-    
-    struct SimpleNode *ptr = bucket[hashkey];
-    while (ptr) {
-        if (ptr->key == key) {
-            data = ptr->data;
-            return 1; // success
-        }
-        ptr = ptr->next;
-    }
-        
-    return 0; // failure
-}
-
-int SimpleHash::countdata(int data) {
-    int count = 0;
-    struct ArraySimple *ptr = listhead;
-    while(ptr) {
-      if (ptr->nextarray) {
-	for(int i=0;i<ARRAYSIZE;i++)
-	  if (ptr->nodes[i].data == data
-	      &&ptr->nodes[i].inuse) {
-	    count++;
-	  }
-      } else {
-	for(int i=0;i<tailindex;i++)
-	  if (ptr->nodes[i].data == data
-	      &&ptr->nodes[i].inuse) {
-	    count++;
-	  }
-      }
-      ptr = ptr->nextarray;
-    }
-    return count;
-}
-
-SimpleHashException::SimpleHashException() {}
-// ************************************************************
-
-
-RepairHashNode::RepairHashNode(int setrelation, int rule, int lvalue, int rvalue, int data){
-    this->setrelation = setrelation;
-    this->lvalue=lvalue;
-    this->rvalue=rvalue;
-    this->data = data;
-    this->next = 0;
-    this->lnext=0;
-    this->rule=rule;
-}
-
-// ************************************************************
-
-RepairHash::RepairHash(int size) {
-    if (size <= 0) {
-        throw SimpleHashException();
-    }
-    this->size = size;
-    this->bucket = new RepairHashNode* [size];
-    for (int i=0;i<size;i++)
-      bucket[i]=0;
-    this->nodelist=0;
-    this->numelements = 0;
-}
-
-RepairHash::RepairHash() {
-  RepairHash(100);
-}
-
-RepairHash::~RepairHash() {
-  delete [] this->bucket;
-  RepairHashNode *ptr=nodelist;
-  while(ptr) {
-      RepairHashNode *next=ptr->lnext;
-      delete ptr;
-      ptr=next;
-  }
-}
-
-#define SETFLAG (1<<31)
-
-int RepairHash::addset(int setv, int rule, int value, int data) {
-  return addrelation(setv||SETFLAG, rule, value,0,data);
-}
-
-int RepairHash::addrelation(int relation, int rule, int lvalue, int rvalue, int data) {
-    unsigned int hashkey = ((unsigned int)(relation ^ rule ^ lvalue ^ rvalue)) % size;
-    
-    RepairHashNode **ptr = &bucket[hashkey];
-
-    /* check that this key/object pair isn't already here */
-    // TBD can be optimized for set v. relation */
-    while (*ptr) {
-        if ((*ptr)->setrelation == relation && 
-	    (*ptr)->rule==rule &&
-	    (*ptr)->lvalue==lvalue &&
-	    (*ptr)->rvalue==rvalue &&
-	    (*ptr)->data == data) {
-            return 0;
-        }
-        ptr = &((*ptr)->next);
-    }
-    
-    *ptr = new RepairHashNode(relation,rule,lvalue,rvalue, data);
-    (*ptr)->lnext=nodelist;
-    nodelist=*ptr;
-    numelements++;
-    return 1;
-}
-
-bool RepairHash::containsset(int setv, int rule, int value) {
-  return containsrelation(setv||SETFLAG, rule, value,0);
-}
-
-bool RepairHash::containsrelation(int relation, int rule, int lvalue, int rvalue) {
-    unsigned int hashkey = ((unsigned int)(relation ^ rule ^ lvalue ^ rvalue)) % size;
-    
-    RepairHashNode **ptr = &bucket[hashkey];
-
-    /* check that this key/object pair isn't already here */
-    // TBD can be optimized for set v. relation */
-    while (*ptr) {
-        if ((*ptr)->setrelation == relation && 
-	    (*ptr)->rule==rule &&
-	    (*ptr)->lvalue==lvalue &&
-	    (*ptr)->rvalue==rvalue) {
-            return true;
-        }
-        ptr = &((*ptr)->next);
-    }
-    return false;
-}
-
-int RepairHash::getset(int setv, int rule, int value) {
-  return getrelation(setv||SETFLAG, rule, value,0);
-}
-
-int RepairHash::getrelation(int relation, int rule, int lvalue,int rvalue) {
-    unsigned int hashkey = ((unsigned int)(relation ^ rule ^ lvalue ^ rvalue)) % size;
-    
-    RepairHashNode **ptr = &bucket[hashkey];
-
-    /* check that this key/object pair isn't already here */
-    // TBD can be optimized for set v. relation */
-    while (*ptr) {
-        if ((*ptr)->setrelation == relation && 
-	    (*ptr)->rule==rule &&
-	    (*ptr)->lvalue==lvalue &&
-	    (*ptr)->rvalue==rvalue) {
-	  return (*ptr)->data;
-        }
-        ptr = &((*ptr)->next);
-    }
-    return 0;
-}
diff --git a/Repair/RepairCompiler/MCC/SimpleHash.h b/Repair/RepairCompiler/MCC/SimpleHash.h
deleted file mode 100755
index 50020d8..0000000
--- a/Repair/RepairCompiler/MCC/SimpleHash.h
+++ /dev/null
@@ -1,199 +0,0 @@
-#ifndef SIMPLEHASH_H
-#define SIMPLEHASH_H
-
-/* LinkedHashNode *****************************************************/
-
-class LinkedHashNode {
-    
-public:
-    LinkedHashNode *next;
-    LinkedHashNode *lnext,*lprev;
-    int data;
-    int key;  
-
-
-    LinkedHashNode(int key, int data, LinkedHashNode *next);
-    LinkedHashNode();
-
-};
-
-/* SimpleList *********************************************************/
-
-class SimpleList {
-private:
-    LinkedHashNode head;
-    LinkedHashNode *ptr;
-public:
-    SimpleList();
-    void add(int data);
-    int contains(int data);
-    void reset();
-    int hasMoreElements();
-    int nextElement();
-};
-
-
-/* WorkList *********************************************************/
-#define WLISTSIZE 4*100
-
-class WorkList {
-private:
-  struct ListNode *head;
-  struct ListNode *tail;
-  int headoffset;
-  int tailoffset;
-
-public:
-    WorkList();
-    ~WorkList();
-    void add(int id, int type, int lvalue, int rvalue);
-    int hasMoreElements();
-    int getid();
-    int gettype();
-    int getlvalue();
-    int getrvalue();
-    void pop();
-};
-
-struct ListNode {
-  int data[WLISTSIZE];
-  ListNode *next;
-};
-/* SimpleHash *********************************************************/
-class SimpleIterator;
-
-class SimpleHash {
-private:
-    int numelements;
-    int size;
-    struct SimpleNode **bucket;
-    struct ArraySimple *listhead;
-    struct ArraySimple *listtail;
-
-
-    int numparents;
-    int numchildren;
-    SimpleHash* parents[10];
-    SimpleHash* children[10];
-    void addChild(SimpleHash* child);
-public:
-    int tailindex;
-    SimpleHash(int size=100);
-    ~SimpleHash();
-    int add(int key, int data);
-    int remove(int key, int data);
-    bool contains(int key);
-    bool contains(int key, int data);
-    int get(int key, int& data);
-    int countdata(int data);
-    void addParent(SimpleHash* parent);
-    int firstkey();
-    SimpleIterator* iterator();
-    void iterator(SimpleIterator & it);
-    inline int count() {
-        return numelements;
-    }
-    int count(int key);
-
-};
-
-/* SimpleHashExcepion  *************************************************/
-
-
-/* SimpleIterator *****************************************************/
-#define ARRAYSIZE 100
-
-struct SimpleNode {
-  struct SimpleNode *next;
-  int data;
-  int key;  
-  int inuse;
-};
-
-struct ArraySimple {
-  struct SimpleNode nodes[ARRAYSIZE];
-  struct ArraySimple * nextarray;
-};
-
-
-class SimpleIterator {
- public:
-
-  struct ArraySimple *cur;
-  int index;
-  SimpleHash * table;
-  inline SimpleIterator() {}
-
-  inline SimpleIterator(struct ArraySimple *start, SimpleHash *t) {
-    cur = start;
-    table=t;
-    index=0;
-  }
-
-  inline int hasNext() {
-    while((index==ARRAYSIZE)||!cur->nodes[index].inuse) {
-      if (cur->nextarray==0 &&
-	  index==table->tailindex)
-	return 0;
-      index++;
-      if (index==ARRAYSIZE) {
-	index=0;
-	cur=cur->nextarray;
-      }
-    }
-    if (cur->nodes[index].inuse)
-      return 1;
-    else
-      return 0;
-  }
-
-  inline int next() {
-    return cur->nodes[index++].data;
-  }
-  
-  inline int key() {
-    return cur->nodes[index].key;
-  }
-};
-
-/* SimpleHashExcepion  *************************************************/
-
-class SimpleHashException {
-public:
-    SimpleHashException();
-};
-
-class RepairHashNode {
- public:
-    RepairHashNode *next;
-    RepairHashNode *lnext;
-    int data;
-    int setrelation;  
-    int lvalue;  
-    int rvalue;  
-    int rule;
-    RepairHashNode(int setrelation, int rule, int lvalue, int rvalue, int data);
-};
-
-class RepairHash {
-
-private:
-    int numelements;
-    int size;
-    RepairHashNode **bucket;
-    RepairHashNode *nodelist;
-
-public:
-    RepairHash();
-    RepairHash(int size);
-    ~RepairHash();
-    int addset(int setv, int rule, int value, int data);
-    int addrelation(int relation, int rule, int lvalue, int rvalue, int data);
-    bool containsset(int setv, int rule, int value);
-    bool containsrelation(int relation, int rule, int lvalue, int rvalue);
-    int getset(int setv, int rule, int value);
-    int getrelation(int relation, int rule, int lvalue, int rvalue);
-};
-
-#endif
-
diff --git a/Repair/RepairCompiler/MCC/test2.cc b/Repair/RepairCompiler/MCC/test2.cc
deleted file mode 100755
index 2d939a3..0000000
--- a/Repair/RepairCompiler/MCC/test2.cc
+++ /dev/null
@@ -1,12 +0,0 @@
-
-// Token values
-
-// Used = 100
-// Free = 101
-
-
-foo_state * __repairstate0__=new foo_state();
-__repairstate0__->d=(int)d;
-__repairstate0__->doanalysis();
-*((int*) &d)=__repairstate0__->d;
-delete __repairstate0__;
-- 
2.34.1