Rev 2 | Blame | Compare with Previous | Last modification | View Log | RSS feed
/*
* Copyright (c) 2002-2006 The TenDRA Project <http://www.tendra.org/>.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of The TenDRA Project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific, prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
* IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* $Id$
*/
/*
Crown Copyright (c) 1997
This TenDRA(r) Computer Program is subject to Copyright
owned by the United Kingdom Secretary of State for Defence
acting through the Defence Evaluation and Research Agency
(DERA). It is made available to Recipients with a
royalty-free licence for its use, reproduction, transfer
to other parties and amendment for any purpose not excluding
product development provided that any such use et cetera
shall be deemed to be acceptance of the following conditions:-
(1) Its Recipients shall ensure that this Notice is
reproduced upon any copies or amended versions of it;
(2) Any amended version of it shall be clearly marked to
show both the nature of and the organisation responsible
for the relevant amendment or amendments;
(3) Its onward transfer from a recipient to another
party shall be deemed to be that party's acceptance of
these conditions;
(4) DERA gives no warranty or assurance as to its
quality or suitability for any purpose and DERA accepts
no liability whatsoever in relation to any use to which
it may be put.
*/
#include "config.h"
#include "c_types.h"
#include "exp_ops.h"
#include "str_ops.h"
#include "error.h"
#include "extra.h"
#include "catalog.h"
#include "option.h"
#include "hash.h"
#include "lex.h"
#include "literal.h"
#include "syntax.h"
#include "ustring.h"
#include "xalloc.h"
/*
ERROR CATALOGUE
The error catalogue definition is automatically generated. It consists
of an array of ERR_DATA structures, ERR_CATALOG.
*/
#include "errors3.h"
/*
NUMBER OF ERRORS
This value gives the number of errors in the error catalogue.
*/
#define CATALOG_SIZE array_size(ERR_CATALOG)
unsigned catalog_size = (unsigned)CATALOG_SIZE;
/*
ERROR NAME HASH TABLE
This hash table is used to hold the names of the various errors in
the error catalogue.
*/
typedef struct err_hash_tag {
int number;
ERR_DATA *entry;
struct err_hash_tag *next;
} ERR_HASH;
#define HASH_ERROR 128
static ERR_HASH *error_hash[HASH_ERROR + 1];
static ERR_HASH *all_error_hash = NULL;
/*
INITIALISE THE ERROR NAME HASH TABLE
This routine initialises the error hash table.
*/
static void
init_err_hash(void)
{
int i;
ERR_DATA *cat = ERR_CATALOG;
ERR_HASH *err = xmalloc_nof(ERR_HASH, CATALOG_SIZE);
all_error_hash = err;
for (i = 0; i <= HASH_ERROR; i++) {
error_hash[i] = NULL;
}
for (i = 0; i < CATALOG_SIZE; i++) {
unsigned long h;
CONST char *s = cat->name;
if (s) {
h = hash(ustrlit(s));
h %= HASH_ERROR;
} else {
h = HASH_ERROR;
}
err->number = i;
err->entry = cat;
err->next = error_hash[h];
error_hash[h] = err;
cat++;
err++;
}
return;
}
/*
FIND AN ERROR NUMBER
This routine finds the error number corresponding to the string literal
expression s. n gives a likely value to try first. It returns -1 if
s is not the name of a known error.
*/
int
find_error_no(STRING s, int n)
{
unsigned kind = DEREF_unsigned(str_simple_kind(s));
if (kind == STRING_NONE) {
ERR_HASH *err;
unsigned long h;
string text = DEREF_string(str_simple_text(s));
ulong len = DEREF_ulong(str_simple_len(s));
if (n >= 0 && n < CATALOG_SIZE) {
string nm = ustrlit(ERR_CATALOG[n].name);
if (nm && ustreq(text, nm)) {
if (len == (ulong)ustrlen(nm)) {
return (n);
}
}
}
if (all_error_hash == NULL) {
init_err_hash();
}
h = hash(text);
h %= HASH_ERROR;
for (err = error_hash[h]; err != NULL; err = err->next) {
string nm = ustrlit(err->entry->name);
if (nm && ustreq(text, nm)) {
if (len == (ulong)ustrlen(nm)) {
return (err->number);
}
}
}
}
return (-1);
}
/*
SET AN ERROR SEVERITY LEVEL
This routine sets the severity level of error number n to the error
severity corresponding to the option number opt.
*/
void
set_error_sev(int n, int opt)
{
if (n >= 0 && n < CATALOG_SIZE) {
ERR_CATALOG[n].usage = opt;
}
return;
}
/*
LOOK UP A LANGUAGE DEPENDENT TERM
Certain technical terms vary slightly between C and C++. This routine
looks up the term corresponding to the lexical token number t in the
current language. The default is the normal lexical token name.
*/
string
find_vocab(int t)
{
CONST char *s = token_names[t];
#if LANGUAGE_C
switch (t) {
case lex_class:
s = "struct/union"; break;
}
#endif
return (ustrlit(s));
}
/*
INITIALISE THE ERROR CATALOGUE
This routine initialises the error catalogue.
*/
void
init_catalog(void)
{
ASSERT(OPT_error == 0);
return;
}
/*
TERMINATE THE ERROR CATALOGUE
This routine terminates the error catalogue.
*/
void
term_catalog(void)
{
xfree_nof(all_error_hash);
all_error_hash = NULL;
return;
}