/* ----------------------------------------------------------------------------- 
 * string.c
 *
 *    This file provides support for string storage in WAD.  Since strings are
 *    used frequently in WAD, this file implements string interning and
 *    some lookup functions that can be used to return a previously stored
 *    string rather than making a new copy.
 * 
 * Author(s) : David Beazley (beazley@cs.uchicago.edu)
 *
 * Copyright (C) 2000.  The University of Chicago. 
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 * 
 * See the file COPYING for a complete copy of the LGPL.
 * ----------------------------------------------------------------------------- */

#include "wad.h"

static char cvs[] = "$Header: /cvsroot/CableSwig/CableSwig/SWIG/Tools/WAD/Wad/string.c,v 1.1.1.1 2003/04/09 17:34:11 hoffman Exp $";

/* Hash table containing stab strings and such */
typedef struct stringtype {
  char             *str;
  struct stringtype *next;
} stringtype;

#define STRING_HASH_SIZE  1013

static stringtype *strings[STRING_HASH_SIZE];
static int         strings_init = 0;

static int shash(char *name) {
  unsigned int h = 0;
  char *c;
  int i;
  c = name;
  for (i = 0; (i < 16) && (*c); i++, c++) {
    h = ((h^~i) << 6) + *c;
  }
  return h % STRING_HASH_SIZE;
}

char *
wad_string_lookup(char *s) {
  int h;
  int i;
  stringtype *st;

  if (!strings_init) {
    for (i = 0; i < STRING_HASH_SIZE; i++) {
      strings[i] = 0;
    }
    strings_init = 1;
  }
  
  h = shash(s);
  st = strings[h];
  while (st) {
    if (strcmp(st->str,s) == 0) return st->str;
    st = st->next;
  }
  
  /* Not found. Add the string to the hash table */
  st = (stringtype *) wad_malloc(sizeof(stringtype));
  st->str = wad_strdup(s);
  st->next = strings[h];
  strings[h] = st;
  return st->str;
}

void wad_string_debug() {
  if (wad_debug_mode & DEBUG_STRING) {
    int maxdepth = 0;
    int total = 0;
    int stringlen = 0;
    int i;

    for (i = 0; i < STRING_HASH_SIZE; i++) {
      stringtype *s;
      int c = 0;
      s = strings[i];
      while (s) {
	c++;
	stringlen += strlen(s->str);
	s = s->next;
      }
      /*      wad_printf("WAD: stringhash[%d] = %d\n", i, c);*/
      if (c > maxdepth) maxdepth = c;
      total += c;
    }
    wad_printf("WAD: nstrings = %d (%d bytes)\n", total, stringlen + total*sizeof(stringtype));
    wad_printf("WAD: maxdepth = %d\n", maxdepth);
    }
}

/* Our own string copy */
char *wad_strcpy(char *t, const char *s) {
  if (s)
    for (; *s; s++, t++) *t = *s;
  *t = 0;
  return t;
}

char *
wad_strcat(char *t, const char *s) {
  while (*t) t++;
  return wad_strcpy(t,s);
}

int
wad_strlen(const char *s) {
  int count = 0;
  while (*(s++)) count++;
  return count;
}



