/* This may look like C code, but it is really -*- C++ -*- */
/* Data and function member declarations for the keyword list class.
Copyright (C) 1989 Free Software Foundation, Inc.
written by Douglas C. Schmidt (schmidt@ics.uci.edu)
This file is part of GNU GPERF.
GNU GPERF 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)
GNU GPERF 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 GPERF; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
/* The key word list is a useful abstraction that keeps track of
various pieces of information that enable that fast generation
of the Gen_Perf.hash function. A Key_List is a singly-linked
class Key_List
: private Std_Err
, private Read_Line
, public Vectors
const int MAX_INT
= ~unsigned (0) >> 1; /* Most positive integer value. */
const int MIN_INT
= ~unsigned (0) ^ MAX_INT
; /* Most negative integer value. */
const int MAX_SIGNED_CHAR
= 127; /* Maximum value a signed char can take. */
const int MAX_UNSIGNED_CHAR
= 255; /* Maximum value an unsigned char can take. */
const int MAX_UNSIGNED_SHORT
= 65535; /* Maximum value an unsigned short can take. */
const int MAX_SIGNED_SHORT
= 32767; /* Maximum value a signed short can take. */
const int MIN_SIGNED_SHORT
= -32768; /* Minimum value a signed short can take. */
const int TABLE_MULTIPLE
= 10; /* Make the hash table 8 times larger than the number of keyword entries. */
char *const default_array_type
= "char *"; /* Default type for generated code. */
char *const default_return_type
= "char *"; /* in_word_set return type, by default. */
char *array_type
; /* Pointer to the type for word list. */
char *return_type
; /* Pointer to return type for lookup function. */
char *struct_tag
; /* Shorthand for user-defined struct tag type. */
char *include_src
; /* C source code to be included verbatim. */
int max_key_len
; /* Maximum length of the longest keyword. */
int min_key_len
; /* Minimum length of the shortest keyword. */
int min_hash_value
; /* Minimum hash value for all keywords. */
int max_hash_value
; /* Maximum hash value for all keywords. */
int occurrence_sort
; /* True if sorting by occurrence. */
int hash_sort
; /* True if sorting by hash value. */
int additional_code
; /* True if any additional C code is included. */
int list_len
; /* Length of head's Key_List, not counting duplicates. */
int total_keys
; /* Total number of keys, counting duplicates. */
static int determined
[ALPHA_SIZE
]; /* Used in function reorder, below. */
static int get_occurrence (List_Node
*ptr
);
static int strcspn (const char *s
, const char *reject
);
static int already_determined (List_Node
*ptr
);
static void set_determined (List_Node
*ptr
);
void output_min_max (void);
void output_switch (void);
void output_keyword_table (void);
void output_keylength_table (void);
void output_hash_function (void);
void output_lookup_function (void);
void output_lookup_array (void);
void set_output_types (void);
char *get_array_type (void);
char *save_include_src (void);
char *get_special_input (char delimiter
);
List_Node
*merge (List_Node
*list1
, List_Node
*list2
);
List_Node
*merge_sort (List_Node
*head
);
List_Node
*head
; /* Points to the head of the linked list. */
int total_duplicates
; /* Total number of duplicate hash values. */
int keyword_list_length (void);
int max_key_length (void);