Logo Search packages:      
Sourcecode: iverilog version File versions  Download package

vcd_priv.c

/*
 * Copyright (c) 2003-2008 Stephen Williams (steve@icarus.com)
 *
 *    This source code is free software; you can redistribute it
 *    and/or modify it in source code form under the terms of the GNU
 *    General Public License as published by the Free Software
 *    Foundation; either version 2 of the License, 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
 */

#include  "vpi_config.h"
#include  "vcd_priv.h"
#include  <stdio.h>
#include  <stdlib.h>
#include  <string.h>
#include  <assert.h>
#ifdef HAVE_MALLOC_H
# include  <malloc.h>
#endif
#include  <ctype.h>
#include  "stringheap.h"
#include  <sys_priv.h>

int is_escaped_id(const char *name)
{
      int lp;

      assert(name);
        /* The first digit must be alpha or '_' to be a normal id. */
      if (isalpha(name[0]) || name[0] == '_') {
          for (lp=1; name[lp] != '\0'; lp++) {
                /* If this digit is not alpha-numeric or '_' we have
                 * an escaped identifier. */
              if (!(isalnum(name[lp]) || name[lp] == '_')) {
                    return 1;
              }
          }
            /* We looked at all the digits, so this is a normal id. */
          return 0;
      }
      return 1;
}

struct stringheap_s name_heap = {0, 0};

struct vcd_names_s {
      const char *name;
      struct vcd_names_s *next;
};

void vcd_names_add(struct vcd_names_list_s*tab, const char *name)
{
      struct vcd_names_s *nl = (struct vcd_names_s *)
          malloc(sizeof(struct vcd_names_s));
      assert(nl);
      nl->name = strdup_sh(&name_heap, name);
      nl->next = tab->vcd_names_list;
      tab->vcd_names_list = nl;
      tab->listed_names ++;
}

void vcd_names_delete(struct vcd_names_list_s*tab)
{
      struct vcd_names_s *cur, *tmp;
      for (cur = tab->vcd_names_list; cur; cur = tmp) {
          tmp = cur->next;
          free(cur);
      }
      tab->vcd_names_list = 0;
      tab->listed_names = 0;
      free(tab->vcd_names_sorted);
      tab->vcd_names_sorted = 0;
      tab->sorted_names = 0;
      string_heap_delete(&name_heap);
}

static int vcd_names_compare(const void *s1, const void *s2)
{
      const char *v1 = *(const char **) s1;
      const char *v2 = *(const char **) s2;

      return strcmp(v1, v2);
}

const char *vcd_names_search(struct vcd_names_list_s*tab, const char *key)
{
      const char **v;

      if (tab->vcd_names_sorted == 0)
          return 0;

      v = (const char **) bsearch(&key,
                          tab->vcd_names_sorted, tab->sorted_names,
                          sizeof(const char *), vcd_names_compare );

      return(v ? *v : NULL);
}

void vcd_names_sort(struct vcd_names_list_s*tab)
{
      if (tab->listed_names) {
          struct vcd_names_s *r;
          const char **l;

          tab->sorted_names += tab->listed_names;
          tab->vcd_names_sorted = (const char **)
              realloc(tab->vcd_names_sorted,
                    tab->sorted_names*(sizeof(const char *)));
          assert(tab->vcd_names_sorted);

          l = tab->vcd_names_sorted + tab->sorted_names - tab->listed_names;
          tab->listed_names = 0;

          r = tab->vcd_names_list;
          tab->vcd_names_list = 0x0;

          while (r) {
              struct vcd_names_s *rr = r;
              r = rr->next;
              *(l++) = rr->name;
              free(rr);
          }

          qsort(tab->vcd_names_sorted, tab->sorted_names,
              sizeof(const char **), vcd_names_compare);
      }
}


/*
   Nexus Id cache

   In structural models, many signals refer to the same nexus.
   Some structural models also have very many signals.  This cache
   saves nexus_id - vcd_id pairs, and reuses the vcd_id when a signal
   refers to a nexus that is already dumped.

   The new signal will be listed as a $var, but no callback
   will be installed.  This saves considerable CPU time and leads
   to smaller VCD files.

   The _vpiNexusId is a private (int) property of IVL simulators.
*/

struct vcd_id_s
{
      const char *id;
      struct vcd_id_s *next;
      int nex;
};

static __inline__ unsigned ihash(int nex)
{
      unsigned a = nex;
      a ^= a>>16;
      a ^= a>>8;
      return a & 0xff;
}

static struct vcd_id_s **vcd_ids = 0;

const char *find_nexus_ident(int nex)
{
      struct vcd_id_s *bucket;

      if (!vcd_ids) {
          vcd_ids = (struct vcd_id_s **)
              calloc(256, sizeof(struct vcd_id_s*));
          assert(vcd_ids);
      }

      bucket = vcd_ids[ihash(nex)];
      while (bucket) {
          if (nex == bucket->nex)
              return bucket->id;
          bucket = bucket->next;
      }

      return 0;
}

void set_nexus_ident(int nex, const char *id)
{
      struct vcd_id_s *bucket;

      assert(vcd_ids);

      bucket = (struct vcd_id_s *) malloc(sizeof(struct vcd_id_s));
      bucket->next = vcd_ids[ihash(nex)];
      bucket->id = id;
      bucket->nex = nex;
      vcd_ids[ihash(nex)] = bucket;
}

void nexus_ident_delete()
{
      unsigned idx;

      if (vcd_ids == 0) return;

      for (idx = 0 ; idx < 256; idx++) {
          struct vcd_id_s *cur, *tmp;
          for (cur = vcd_ids[idx]; cur; cur = tmp) {
              tmp = cur->next;
              free(cur);
          }
      }
      free(vcd_ids);
      vcd_ids = 0;
}

/*
 * Since the compiletf routines are all the same they are located here,
 * so we only need a single copy. Some are generic enough they can use
 * the ones in sys_priv.c (no arg, one numeric argument, etc.).
 */

/* $dumpvars takes a variety of arguments. */
PLI_INT32 sys_dumpvars_compiletf(PLI_BYTE8 *name)
{
      vpiHandle callh = vpi_handle(vpiSysTfCall, 0);
      vpiHandle argv = vpi_iterate(vpiArgument, callh);
      vpiHandle arg;

      /* No arguments is OK, dump everything. */
      if (argv == 0) return 0;

      /* The first argument is the numeric level. */
      if (! is_numeric_obj(vpi_scan(argv))) {
            vpi_printf("ERROR: %s:%d: ", vpi_get_str(vpiFile, callh),
                       (int)vpi_get(vpiLineNo, callh));
            vpi_printf("%s's argument must be numeric.\n", name);
            vpi_control(vpiFinish, 1);
      }

      /* The rest of the arguments are either a module or a variable. */
      while ((arg=vpi_scan(argv)) != NULL) {
        switch(vpi_get(vpiType, arg)) {
          case vpiMemoryWord:
            if (vpi_get(vpiConstantSelect, arg) == 0) {
              vpi_printf("ERROR: %s:%d: ", vpi_get_str(vpiFile, callh),
                         (int)vpi_get(vpiLineNo, callh));
              vpi_printf("%s cannot dump a non-constant select %s.\n", name,
                         vpi_get_str(vpiType, arg));
              vpi_control(vpiFinish, 1);
            }
          /* The module types. */
          case vpiModule:
          case vpiTask:
          case vpiFunction:
          case vpiNamedBegin:
          case vpiNamedFork:
          /* The variable types. */
          case vpiNet:
          case vpiReg:
          case vpiIntegerVar:
          case vpiTimeVar:
          case vpiRealVar:
            break;
          default:
            vpi_printf("ERROR: %s:%d: ", vpi_get_str(vpiFile, callh),
                       (int)vpi_get(vpiLineNo, callh));
            vpi_printf("%s cannot dump a %s.\n", name,
                       vpi_get_str(vpiType, arg));
            vpi_control(vpiFinish, 1);
        }
      }

      return 0;
}

Generated by  Doxygen 1.6.0   Back to index