Home | History | Annotate | Line # | Download | only in lint1
op.h revision 1.2
      1  1.2  cgd /*	$NetBSD: op.h,v 1.2 1995/07/03 21:24:27 cgd Exp $	*/
      2  1.2  cgd 
      3  1.1  cgd /*
      4  1.1  cgd  * Copyright (c) 1994, 1995 Jochen Pohl
      5  1.1  cgd  * All Rights Reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1  cgd  * modification, are permitted provided that the following conditions
      9  1.1  cgd  * are met:
     10  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1  cgd  *    must display the following acknowledgement:
     17  1.1  cgd  *      This product includes software developed by Jochen Pohl for
     18  1.1  cgd  *	The NetBSD Project.
     19  1.1  cgd  * 4. The name of the author may not be used to endorse or promote products
     20  1.1  cgd  *    derived from this software without specific prior written permission.
     21  1.1  cgd  *
     22  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     23  1.1  cgd  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     24  1.1  cgd  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     25  1.1  cgd  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     26  1.1  cgd  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     27  1.1  cgd  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     28  1.1  cgd  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     29  1.1  cgd  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     30  1.1  cgd  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     31  1.1  cgd  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd /*
     35  1.1  cgd  * Various information about operators
     36  1.1  cgd  */
     37  1.1  cgd typedef	struct {
     38  1.1  cgd 	u_int	m_binary : 1;	/* binary op. */
     39  1.1  cgd 	u_int	m_logop : 1;	/* logical op., result is int */
     40  1.1  cgd 	u_int	m_rqint : 1;	/* operands must have integer type */
     41  1.1  cgd 	u_int	m_rqsclt : 1;	/* operands must have scalar type */
     42  1.1  cgd 	u_int	m_rqatyp : 1;	/* operands must have arithmetic type */
     43  1.1  cgd 	u_int	m_fold : 1;	/* operands should be folded */
     44  1.1  cgd 	u_int	m_vctx : 1;	/* value context for left operand */
     45  1.1  cgd 	u_int	m_tctx : 1;	/* test context for left operand */
     46  1.1  cgd 	u_int	m_balance : 1;	/* op. requires balancing */
     47  1.1  cgd 	u_int	m_sideeff : 1;	/* op. has side effect */
     48  1.1  cgd 	u_int	m_tlansiu : 1;	/* warning if left op. is unsign. in ANSI C */
     49  1.1  cgd 	u_int	m_transiu : 1;	/* warning if right op. is unsign. in ANSI C */
     50  1.1  cgd 	u_int	m_tpconf : 1;	/* test possible precedence confusion */
     51  1.1  cgd 	u_int	m_comp : 1;	/* op. performs comparision */
     52  1.1  cgd 	u_int	m_enumop : 1;	/* valid operation on enums */
     53  1.1  cgd 	u_int	m_badeop : 1;	/* dubious operation on enums */
     54  1.1  cgd 	u_int	m_eqwarn : 1;	/* warning if on operand stems from == */
     55  1.1  cgd 	const char *m_name;	/* name of op. */
     56  1.1  cgd } mod_t;
     57  1.1  cgd 
     58  1.1  cgd typedef	enum {
     59  1.1  cgd 	NOOP	= 0,
     60  1.1  cgd 	ARROW,
     61  1.1  cgd 	POINT,
     62  1.1  cgd 	NOT,
     63  1.1  cgd 	COMPL,
     64  1.1  cgd 	INC,
     65  1.1  cgd 	DEC,
     66  1.1  cgd 	INCBEF,
     67  1.1  cgd 	DECBEF,
     68  1.1  cgd 	INCAFT,
     69  1.1  cgd 	DECAFT,
     70  1.1  cgd 	UPLUS,
     71  1.1  cgd 	UMINUS,
     72  1.1  cgd 	STAR,
     73  1.1  cgd 	AMPER,
     74  1.1  cgd 	MULT,
     75  1.1  cgd 	DIV,
     76  1.1  cgd 	MOD,
     77  1.1  cgd 	PLUS,
     78  1.1  cgd 	MINUS,
     79  1.1  cgd 	SHL,
     80  1.1  cgd 	SHR,
     81  1.1  cgd 	LT,
     82  1.1  cgd 	LE,
     83  1.1  cgd 	GT,
     84  1.1  cgd 	GE,
     85  1.1  cgd 	EQ,
     86  1.1  cgd 	NE,
     87  1.1  cgd 	AND,
     88  1.1  cgd 	XOR,
     89  1.1  cgd 	OR,
     90  1.1  cgd 	LOGAND,
     91  1.1  cgd 	LOGOR,
     92  1.1  cgd 	QUEST,
     93  1.1  cgd 	COLON,
     94  1.1  cgd 	ASSIGN,
     95  1.1  cgd 	MULASS,
     96  1.1  cgd 	DIVASS,
     97  1.1  cgd 	MODASS,
     98  1.1  cgd 	ADDASS,
     99  1.1  cgd 	SUBASS,
    100  1.1  cgd 	SHLASS,
    101  1.1  cgd 	SHRASS,
    102  1.1  cgd 	ANDASS,
    103  1.1  cgd 	XORASS,
    104  1.1  cgd 	ORASS,
    105  1.1  cgd 	NAME,
    106  1.1  cgd 	CON,
    107  1.1  cgd 	STRING,
    108  1.1  cgd 	FSEL,
    109  1.1  cgd 	CALL,
    110  1.1  cgd 	COMMA,
    111  1.1  cgd 	CVT,
    112  1.1  cgd 	ICALL,
    113  1.1  cgd 	LOAD,
    114  1.1  cgd 	PUSH,
    115  1.1  cgd 	RETURN,
    116  1.1  cgd 	INIT,		/* pseudo op, not used in trees */
    117  1.1  cgd 	CASE,		/* pseudo op, not used in trees */
    118  1.1  cgd 	FARG		/* pseudo op, not used in trees */
    119  1.1  cgd #define NOPS	((int)FARG + 1)
    120  1.1  cgd } op_t;
    121