Return to c-lex.h CVS log

Up to [GCC 2.x] / gcc

Annotation of gcc/c-lex.h, revision 1.1.1.3

1.1       root        1: /* Define constants for communication with c-parse.y.
                      2:    Copyright (C) 1987, 1992 Free Software Foundation, Inc.
                      3: 
                      4: This file is part of GNU CC.
                      5: 
                      6: GNU CC is free software; you can redistribute it and/or modify
                      7: it under the terms of the GNU General Public License as published by
                      8: the Free Software Foundation; either version 2, or (at your option)
                      9: any later version.
                     10: 
                     11: GNU CC is distributed in the hope that it will be useful,
                     12: but WITHOUT ANY WARRANTY; without even the implied warranty of
                     13: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
                     14: GNU General Public License for more details.
                     15: 
                     16: You should have received a copy of the GNU General Public License
                     17: along with GNU CC; see the file COPYING.  If not, write to
1.1.1.3 ! root       18: the Free Software Foundation, 59 Temple Place - Suite 330,
        !            19: Boston, MA 02111-1307, USA.  */
1.1       root       20: 
                     21: 
                     22: 
                     23: enum rid
                     24: {
                     25:   RID_UNUSED,
                     26:   RID_INT,
                     27:   RID_CHAR,
                     28:   RID_FLOAT,
                     29:   RID_DOUBLE,
                     30:   RID_VOID,
                     31:   RID_UNUSED1,
                     32: 
                     33:   RID_UNSIGNED,
                     34:   RID_SHORT,
                     35:   RID_LONG,
                     36:   RID_AUTO,
                     37:   RID_STATIC,
                     38:   RID_EXTERN,
                     39:   RID_REGISTER,
                     40:   RID_TYPEDEF,
                     41:   RID_SIGNED,
                     42:   RID_CONST,
                     43:   RID_VOLATILE,
                     44:   RID_INLINE,
                     45:   RID_NOALIAS,
1.1.1.2   root       46:   RID_ITERATOR,
                     47:   RID_COMPLEX,
                     48: 
                     49:   RID_IN,
                     50:   RID_OUT,
                     51:   RID_INOUT,
                     52:   RID_BYCOPY,
                     53:   RID_ONEWAY,
                     54:   RID_ID,
1.1       root       55: 
                     56:   RID_MAX
                     57: };
                     58: 
                     59: #define NORID RID_UNUSED
                     60: 
                     61: #define RID_FIRST_MODIFIER RID_UNSIGNED
                     62: 
                     63: /* The elements of `ridpointers' are identifier nodes
                     64:    for the reserved type names and storage classes.
                     65:    It is indexed by a RID_... value.  */
                     66: extern tree ridpointers[(int) RID_MAX];
                     67: 
                     68: /* the declaration found for the last IDENTIFIER token read in.
                     69:    yylex must look this up to detect typedefs, which get token type TYPENAME,
                     70:    so it is left around in case the identifier is not a typedef but is
                     71:    used in a context which makes it a reference to a variable.  */
                     72: extern tree lastiddecl;
                     73: 
                     74: extern char *token_buffer;     /* Pointer to token buffer.  */
                     75: 
                     76: extern tree make_pointer_declarator ();
                     77: extern void reinit_parse_for_function ();
                     78: extern int yylex ();
1.1.1.2   root       79: 
                     80: extern char *get_directive_line ();

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.