source: kBuild/trunk/src/kmk/strcache.c@ 1878

/* Constant string caching for GNU Make.
Copyright (C) 2006 Free Software Foundation, Inc.
This file is part of GNU Make.

GNU Make 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.

GNU Make 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
GNU Make; see the file COPYING.  If not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.  */

#include "make.h"
#ifndef CONFIG_WITH_STRCACHE2

#include <assert.h>

#include "hash.h"


/* The size (in bytes) of each cache buffer.
   Try to pick something that will map well into the heap.  */
#define CACHE_BUFFER_SIZE   (8192 - 16)


/* A string cached here will never be freed, so we don't need to worry about
   reference counting.  We just store the string, and then remember it in a
   hash so it can be looked up again. */

struct strcache {
  struct strcache *next;    /* The next block of strings.  */
  char *end;                /* Pointer to the beginning of the free space.  */
  int count;                /* # of strings in this buffer (for stats).  */
  int bytesfree;            /* The amount of the buffer that is free.  */
  char buffer[1];           /* The buffer comes after this.  */
};

static int bufsize = CACHE_BUFFER_SIZE;
static struct strcache *strcache = NULL;

/* Add a new buffer to the cache.  Add it at the front to reduce search time.
   This can also increase the overhead, since it's less likely that older
   buffers will be filled in.  However, GNU make has so many smaller strings
   that this doesn't seem to be much of an issue in practice.
 */
static struct strcache *
new_cache()
{
  struct strcache *new;
  new = xmalloc (sizeof (*new) + bufsize);
  new->end = new->buffer;
  new->count = 0;
  new->bytesfree = bufsize;

  new->next = strcache;
  strcache = new;

  return new;
}

#ifndef CONFIG_WITH_VALUE_LENGTH
static const char *
add_string(const char *str, int len)
{
  struct strcache *best = NULL;
  struct strcache *sp;
  const char *res;

  /* If the string we want is too large to fit into a single buffer, then
     we're screwed; nothing will ever fit!  Change the maximum size of the
     cache to be big enough.  */
  if (len > bufsize)
    bufsize = len * 2;

  /* First, find a cache with enough free space.  We always look through all
     the blocks and choose the one with the best fit (the one that leaves the
     least amount of space free).  */
  for (sp = strcache; sp != NULL; sp = sp->next)
    if (sp->bytesfree > len && (!best || best->bytesfree > sp->bytesfree))
      best = sp;

  /* If nothing is big enough, make a new cache.  */
  if (!best)
    best = new_cache();

  assert (best->bytesfree > len);

  /* Add the string to the best cache.  */
  res = best->end;
  memcpy (best->end, str, len);
  best->end += len;
  *(best->end++) = '\0';
  best->bytesfree -= len + 1;
  ++best->count;
  return res;
}

#else  /* CONFIG_WITH_VALUE_LENGTH */

static const char *
add_string(const char *str, struct strcache_pref *prefix)
{
  struct strcache *best = NULL;
  struct strcache *sp;
  struct strcache_pref *real_prefix;
  int len;
  const char *res;
  char *dst;

  /* Calc the entry length; the prefix data + the string + alignment. */
  len = sizeof(struct strcache_pref) + prefix->len + 1;
  len = (len + sizeof(void *) - 1) & ~(sizeof(void *) - 1);

  /* If the string we want is too large to fit into a single buffer, then
     we're screwed; nothing will ever fit!  Change the maximum size of the
     cache to be big enough.  */
  if (len > bufsize)
    bufsize = len * 2;

  /* First, find a cache with enough free space.  We always look through all
     the blocks and choose the one with the best fit (the one that leaves the
     least amount of space free).  */
  for (sp = strcache; sp != NULL; sp = sp->next)
    if (sp->bytesfree >= len && (!best || best->bytesfree > sp->bytesfree))
      best = sp;

  /* If nothing is big enough, make a new cache.  */
  if (!best)
    best = new_cache();

  assert (best->bytesfree >= len);

  /* Add the string to the best cache.  */
  real_prefix = (struct strcache_pref *)best->end;
  *real_prefix = *prefix;

  res = dst = (char *)(real_prefix + 1);
  assert(!((size_t)res & (sizeof(void *) - 1)));
  memcpy (dst, str, prefix->len);
  dst += prefix->len;
  *(dst++) = '\0';

  best->end += len;
  best->bytesfree -= len;
  ++best->count;

  return res;
}

/* Hackish globals for passing data to the hash functions.
   There isn't really any other way without running the
   risk of breaking rehashing. */
static const char *lookup_string;
static struct strcache_pref *lookup_prefix;

#endif /* CONFIG_WITH_VALUE_LENGTH */


/* Hash table of strings in the cache.  */

static unsigned long
str_hash_1 (const void *key)
{
#if 0
#ifdef CONFIG_WITH_VALUE_LENGTH
  if (MY_PREDICT_TRUE ((const char *) key == lookup_string))
    return lookup_prefix->hash1;
#endif
#endif
  return_ISTRING_HASH_1 ((const char *) key);
}

static unsigned long
str_hash_2 (const void *key)
{
#ifdef CONFIG_WITH_VALUE_LENGTH
  if (MY_PREDICT_TRUE ((const char *) key == lookup_string))
    {
      if (lookup_prefix->hash2)
        {
          unsigned long hash2 = 0;
          ISTRING_HASH_2 ((const char *)key, hash2);
          lookup_prefix->hash2 = hash2;
        }
      return lookup_prefix->hash2;
    }
#endif
  return_ISTRING_HASH_2 ((const char *) key);
}

static int
str_hash_cmp (const void *x, const void *y)
{
#ifdef CONFIG_WITH_VALUE_LENGTH
  /* Use the string length to avoid some unncessary comparing.
     X is either the add_hash input (during hash_find_slot)
     or a cache entry (during rare hash_insert_at calls).
     This catches 520253 out of 1341947 calls in the typical
     kBuild scenario.  */

  if (MY_PREDICT_TRUE ((const char *) x == lookup_string))
    {
      assert (lookup_prefix->len == strlen ((const char *)x));
      if (strcache_get_len ((const char *)y) != lookup_prefix->len)
        return -1;
    }
#endif
  return_ISTRING_COMPARE ((const char *) x, (const char *) y);
}

static struct hash_table strings;
static unsigned long total_adds = 0;

#ifndef CONFIG_WITH_VALUE_LENGTH
static const char *
add_hash (const char *str, int len)
{
  /* Look up the string in the hash.  If it's there, return it.  */
  char *const *slot = (char *const *) hash_find_slot (&strings, str);
  const char *key = *slot;

  /* Count the total number of adds we performed.  */
  ++total_adds;

  if (!HASH_VACANT (key))
    return key;

  /* Not there yet so add it to a buffer, then into the hash table.  */
  key = add_string (str, len);
  hash_insert_at (&strings, key, slot);
  return key;
}

#else  /* CONFIG_WITH_VALUE_LENGTH */

static const char *
add_hash (const char *str, int len, unsigned long hash1, unsigned long hash2)
{
  void const **slot;
  const char *key;
  struct strcache_pref prefix;

  /* Look up the string in the hash.  If it's there, return it.  */
  prefix.len = len;
  prefix.hash2 = hash2;
  if (!hash1 && !hash2)
    ISTRING_HASH_1 (str, hash1);
  prefix.hash1 = hash1;

  lookup_string = str;
  lookup_prefix = &prefix;

  slot = hash_find_slot_prehashed (&strings, str, prefix.hash1, prefix.hash2);
  key = *(const char **)slot;

  /* Count the total number of adds we performed.  */
  ++total_adds;

  if (!HASH_VACANT (key))
    return key;

  /* Not there yet so add it to a buffer, then into the hash table.  */
  key = add_string (str,  &prefix);
  hash_insert_at (&strings, key, slot);
  return key;
}

/* Verifies that a string cache entry didn't change and that the
   prefix is still valid. */
int
strcache_check_sanity (const char *str)
{
  struct strcache_pref const *prefix = (struct strcache_pref const *)str - 1;
  unsigned long hash;

  if (strlen (str) != prefix->len)
    {
      MY_ASSERT_MSG (0, ("len: %u != %u - '%s'\n", (unsigned int)strlen (str),
                         prefix->len, str));
      return -1;
    }

  hash = 0;
  ISTRING_HASH_1 (str, hash);
  if (hash != prefix->hash1)
    {
      MY_ASSERT_MSG (0, ("hash1: %lx != %lx - '%s'\n", hash, prefix->hash1, str));
      return -1;
    }

  if (prefix->hash2)
    {
      hash = 0;
      ISTRING_HASH_2 (str, hash);
      if (hash != prefix->hash2)
        {
          MY_ASSERT_MSG (0, ("hash2: %lx != %lx - '%s'\n", hash, prefix->hash2, str));
          return -1;
        }
    }

  return 0;
}

/* Fallback for when the hash2 value isn't present. */
unsigned long
strcache_get_hash2_fallback (const char *str)
{
  struct strcache_pref *prefix = (struct strcache_pref *)str - 1;
  unsigned long hash2 = 0;

  ISTRING_HASH_2 (str, hash2);
  prefix->hash2 = hash2;

  return hash2;
}

#endif /* CONFIG_WITH_VALUE_LENGTH */

/* Returns true if the string is in the cache; false if not.  */
int
strcache_iscached (const char *str)
{
  struct strcache *sp;

  for (sp = strcache; sp != 0; sp = sp->next)
    if (str >= sp->buffer && str < sp->end)
      return 1;

  return 0;
}

/* If the string is already in the cache, return a pointer to the cached
   version.  If not, add it then return a pointer to the cached version.
   Note we do NOT take control of the string passed in.  */
const char *
strcache_add (const char *str)
{
#ifndef CONFIG_WITH_VALUE_LENGTH
  return add_hash (str, strlen (str));
#else
  /* XXX: calc the hash1 while determining the string length. */
  return add_hash (str, strlen (str), 0, 0);
#endif
}

const char *
strcache_add_len (const char *str, int len)
{
  /* If we're not given a nul-terminated string we have to create one, because
     the hashing functions expect it.  */
  if (str[len] != '\0')
    {
      char *key = alloca (len + 1);
      memcpy (key, str, len);
      key[len] = '\0';
      str = key;
    }

#ifndef CONFIG_WITH_VALUE_LENGTH
  return add_hash (str, len);
#else
  /* XXX: eliminate the alloca mess using the prefixing? */
  return add_hash (str, len, 0, 0);
#endif
}

#ifdef CONFIG_WITH_INCLUDEDEP

/* A special variant used by the includedep worker threads, it off loads
   the main thread when it adds the strings to the cache later. */
const char *
strcache_add_prehashed (const char *str, int len, unsigned long hash1,
                        unsigned long hash2)
{
  return add_hash (str, len, hash1, hash2);
}

/* Performs the prehashing for use with strcache_add_prehashed(). */
void
strcache_prehash_str (const char *str, unsigned int len, unsigned long *hash1p,
                      unsigned long *hash2p)
{
  (void)len;
  *hash1p = str_hash_1 (str);
  *hash2p = str_hash_2 (str);
}

#endif /* CONFIG_WITH_INCLUDEDEP */

int
strcache_setbufsize(int size)
{
  if (size > bufsize)
    bufsize = size;
  return bufsize;
}

void
strcache_init (void)
{
#ifdef KMK
  hash_init (&strings, 65535, str_hash_1, str_hash_2, str_hash_cmp);
#else
  hash_init (&strings, 8000, str_hash_1, str_hash_2, str_hash_cmp);
#endif
}


/* Generate some stats output.  */

void
strcache_print_stats (const char *prefix)
{
  int numbuffs = 0, numstrs = 0;
  int totsize = 0, avgsize, maxsize = 0, minsize = bufsize;
  int totfree = 0, avgfree, maxfree = 0, minfree = bufsize;
  int lastused = 0, lastfree = 0;

  if (strcache)
    {
      const struct strcache *sp;

      /* Count the first buffer separately since it's not full.  */
      lastused = strcache->end - strcache->buffer;
      lastfree = strcache->bytesfree;

      for (sp = strcache->next; sp != NULL; sp = sp->next)
        {
          int bf = sp->bytesfree;
          int sz = sp->end - sp->buffer;

          ++numbuffs;
          numstrs += sp->count;

          totsize += sz;
          maxsize = (sz > maxsize ? sz : maxsize);
          minsize = (sz < minsize ? sz : minsize);

          totfree += bf;
          maxfree = (bf > maxfree ? bf : maxfree);
          minfree = (bf < minfree ? bf : minfree);
        }
    }

  avgsize = numbuffs ? (int)(totsize / numbuffs) : 0;
  avgfree = numbuffs ? (int)(totfree / numbuffs) : 0;

  printf (_("\n%s # of strings in strcache: %d / lookups = %lu / hits = %lu\n"),
          prefix, numstrs, total_adds, (total_adds - numstrs));
  printf (_("%s # of strcache buffers: %d (* %d B/buffer = %d B)\n"),
          prefix, (numbuffs + 1), bufsize, ((numbuffs + 1) * bufsize));
  printf (_("%s strcache used: total = %d (%d) / max = %d / min = %d / avg = %d\n"),
          prefix, totsize, lastused, maxsize, minsize, avgsize);
  printf (_("%s strcache free: total = %d (%d) / max = %d / min = %d / avg = %d\n"),
          prefix, totfree, lastfree, maxfree, minfree, avgfree);

  fputs (_("\n# strcache hash-table stats:\n# "), stdout);
  hash_print_stats (&strings, stdout);
}

#else /* CONFIG_WITH_STRCACHE2 */

#include "strcache2.h"

/* The file string cache. */
struct strcache2 file_strcache;

void strcache_init (void)
{
  strcache2_init(&file_strcache,
                 "file",        /* name */
                 65536,         /* hash size */
                 0,             /* default segment size*/
#ifdef HAVE_CASE_INSENSITIVE_FS
                 1,             /* case insensitive */
#else
                 0,             /* case insensitive */
#endif
                 0);            /* thread safe */
}

void
strcache_print_stats (const char *prefix)
{
  strcache2_print_stats (&file_strcache, prefix);
}


#endif /* CONFIG_WITH_STRCACHE2 */