Return to c-lex.h CVS log

Up to [Apple XNU] / GNUtools / cc

Annotation of GNUtools/cc/c-lex.h, revision 1.1

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
        !            18: the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */
        !            19: 
        !            20: 
        !            21: 
        !            22: enum rid
        !            23: {
        !            24:   RID_UNUSED,
        !            25:   RID_INT,
        !            26:   RID_CHAR,
        !            27:   RID_FLOAT,
        !            28:   RID_DOUBLE,
        !            29:   RID_VOID,
        !            30:   RID_UNUSED1,
        !            31: 
        !            32:   RID_UNSIGNED,
        !            33:   RID_SHORT,
        !            34:   RID_LONG,
        !            35:   RID_AUTO,
        !            36:   RID_STATIC,
        !            37:   RID_EXTERN,
        !            38:   RID_REGISTER,
        !            39:   RID_TYPEDEF,
        !            40:   RID_SIGNED,
        !            41:   RID_CONST,
        !            42:   RID_VOLATILE,
        !            43:   RID_INLINE,
        !            44:   RID_NOALIAS,
        !            45:   RID_ITERATOR,
        !            46:   RID_COMPLEX,
        !            47: 
        !            48:   RID_IN,
        !            49:   RID_OUT,
        !            50:   RID_INOUT,
        !            51:   RID_BYCOPY,
        !            52:   RID_ONEWAY,
        !            53:   RID_ID,
        !            54: 
        !            55:   RID_MAX
        !            56: };
        !            57: 
        !            58: #define NORID RID_UNUSED
        !            59: 
        !            60: #define RID_FIRST_MODIFIER RID_UNSIGNED
        !            61: 
        !            62: /* The elements of `ridpointers' are identifier nodes
        !            63:    for the reserved type names and storage classes.
        !            64:    It is indexed by a RID_... value.  */
        !            65: extern tree ridpointers[(int) RID_MAX];
        !            66: 
        !            67: /* the declaration found for the last IDENTIFIER token read in.
        !            68:    yylex must look this up to detect typedefs, which get token type TYPENAME,
        !            69:    so it is left around in case the identifier is not a typedef but is
        !            70:    used in a context which makes it a reference to a variable.  */
        !            71: extern tree lastiddecl;
        !            72: 
        !            73: extern char *token_buffer;     /* Pointer to token buffer.  */
        !            74: 
        !            75: extern tree make_pointer_declarator ();
        !            76: extern void reinit_parse_for_function ();
        !            77: extern int yylex ();
        !            78: 
        !            79: extern char *get_directive_line ();

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