gb_table_temp.h

Gambas is a graphical development environment based on a Basic interpreter, like Visual Basic. It us

/***************************************************************************

  table.c

  Symbol tables management

  (c) 2000-2004 Beno顃 Minisini <[e-mail]>

  This program 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 1, 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., 675 Mass Ave, Cambridge, MA 02139, USA.

***************************************************************************/

#define __TABLE_C

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>

#include "gb_common.h"
#include "gb_error.h"
#include "gb_alloc.h"
#include "gb_limit.h"

#include "gb_table.h"


#define SYM(table, ind) (TABLE_get_symbol(table, ind))


PRIVATE char _buffer[MAX_SYMBOL_LEN + 1];


PRIVATE int compare(const char *s1, long len1, const char *s2, long len2)
{
  long i;
  long len = (len1 < len2) ? len1 : len2;

  for (i = 0; i < len; i++)
  {
    if (*s1 > *s2) return 1;
    if (*s1 < *s2) return -1;
    s1++; s2++;
  }

  if (len1 < len2)
    return -1;
  else if (len1 > len2)
    return 1;
  else
    return 0;
}


PUBLIC int compare_ignore_case(const char *s1, long len1, const char *s2, long len2)
{
  long i;
  long len = (len1 < len2) ? len1 : len2;
  char c1;
  char c2;

  for (i = 0; i < len; i++)
  {
    c1 = toupper(*s1);
    c2 = toupper(*s2);

    if (c1 > c2) return 1;
    if (c1 < c2) return -1;
    s1++; s2++;
  }

  if (len1 < len2)
    return -1;
  else if (len1 > len2)
    return 1;
  else
    return 0;
}


PUBLIC boolean SYMBOL_find(void *symbol, int n_symbol, size_t s_symbol, int flag,
                           const char *name, int len, const char *prefix, long *result)
{
  long pos, deb, fin;
  int cmp;
  int (*cmp_func)(const char *, long, const char *, long);
  SYMBOL *sym;
  long index;
  int len_prefix;

  cmp_func = ((flag == TF_IGNORE_CASE) ? compare_ignore_case : compare);

  pos = 0;
  deb = 0;
  fin = n_symbol;

  if (prefix)
  {
    len_prefix = strlen(prefix);

    if ((len + len_prefix) > MAX_SYMBOL_LEN)
      ERROR_panic("SYMBOL_find: prefixed symbol too long");

    strcpy(_buffer, prefix);
    strcpy(&_buffer[len_prefix], name);
    len += len_prefix;
    name = _buffer;
  }

  for(;;)
  {
    if (deb >= fin)
    {
      *result = NO_SYMBOL;
      return FALSE;
    }

    /*new_pos = deb + (fin - deb) / 2;*/
    pos = (deb + fin) >> 1;

    index = ((SYMBOL *)((char *)symbol + s_symbol * pos))->sort;
    sym = (SYMBOL *)((char *)symbol + s_symbol * index);

    /*
    if (prefix)
    {
      cmp = (*cmp_func)(prefix, len_prefix, sym->name, sym->len);

      if (s

      if (prefix < *sym->name)
        cmp = -1;
      else if (prefix > *sym->name)
        cmp = 1;
      else
        cmp = (*cmp_func)(name, len, sym->name + 1, sym->len - 1);
    }
    else
    */

    cmp = (*cmp_func)(name, len, sym->name, sym->len);

    if (cmp == 0)
    {
      *result = index;
      return TRUE;
    }

    if (cmp < 0)
      fin = pos;
    else
      deb = pos + 1;
  }
}

/* ATTENTION: ici index ne correspond pas