CheckNews.C

Go to the documentation of this file.

// CheckNews.C

#include <stdio.h>
#include <string.h>
//#include <lego.H>

class pstatus
{
public:
  long p;  // pointer value
  char n[30];  // name of object
  char a;  // allocated or not
  class pstatus *next;  // next in chain

  pstatus (long np, char *nn, char na = (char) 1)
  {
    p = np;
    strcpy(n,nn);
    a = na;
    next = NULL;
  }
  ~pstatus () {if (next != NULL) delete next;}
};

class phash
{
public:
  pstatus **table;  // hashtable
  int size;  // size of table

  phash (int sz)
  {
    size = sz;
    if (size != 0)
      {
        table = new (pstatus *) [size];
        for (int i = 0; i < size; i++)
          table[i] = NULL;
      }
    else
      table = NULL;
  }
  ~phash()
  {
    for (int i = 0; i < size; i++)
      delete table[i]; 
    delete[] table;
  }

  int hashfunc (long p) {return (((p ^ (p << 3)) % size));}

  int Allocate (long p, char *n)
  {
    int index;
    pstatus *check, *cprev;

    index = hashfunc (p);
    if (table[index] != NULL)
      {
        for (cprev = check = table[index];
             check != NULL;
             cprev = check, check = check->next)
          {
            if (check->p == p)
              {
                if (check->a == (char) 1)
                  printf ("Duplicate allocation for %x.\n", p);
                else
                  check->a = (char) 1;
                strcpy (check->n, n);
                //              printf ("m");
                break;
              }
          }
        if (check == NULL)
          {
            check = new pstatus (p, n);
            cprev->next = check;
            //      printf ("n");
          }
      }
    else
      {
        table[index] = new pstatus (p, n);
        //      printf ("n");
      }
    //    printf ("A");
    return 1;
  }

  int Free (long p, char *n)
  {
    int index;
    pstatus *check, *cprev;

    index = hashfunc (p);
    if (table[index] != NULL)
      {
        for (cprev = check = table[index];
             check != NULL;
             cprev = check, check = check->next)
          {
            if (check->p == p)
              {
                if (check->a == (char) 1 && strcmp (check->n, n) != 0)
                  {
                    printf ("Object confusion for %x.\n", p);
                    strcpy (check->n, n);
                  }
                if (check->a == (char) 0)
                  printf ("Duplicate deallocation for %x.\n", p);
                else
                  check->a = (char) 0;
                //              printf ("m");
                break;
              }
          }
        if (check == NULL)
          {
            printf ("Deletion of never-allocated %x.\n", p);
            //      printf ("n");
          }
      }
    else
      {
        printf ("Deletion of never-allocated %x.\n", p);
        //      printf ("n");
      }
    //    printf ("D");
    return 1;
  }

};

int main()
{
  FILE *sflog;
  char line[60], obj[30];
  phash *h;
  long p;

  h = new phash (256);
  sflog = fopen ("sf.log", "rt");
  if (sflog == NULL)
    {
      printf ("sf.log not found\n");
      return 1;
    }
  while (fgets (line, 50, sflog) != NULL)
    {
      if (strncmp (line, "Creating", 8) != 0 &&
          strncmp (line, "Deleting", 8) != 0 &&
          strncmp (line, "Assigning", 9) != 0)
        continue;
      sscanf (line, "%*s %s %lx", obj, &p);
      if (strcmp (obj, "LEGOPSET") == 0 ||
          strcmp (obj, "LEGOREGION") == 0 ||
          strcmp (obj, "LEGOPARR") == 0)
        continue;

      if (line[0] == 'C' || line[0] == 'A')
        h->Allocate (p, obj);
      else
        h->Free (p, obj);
    }
  fclose (sflog);
  delete h;
  return 0;
}

---