Home | History | Annotate | Line # | Download | only in lint1
op.h revision 1.23 
      1 /*	$NetBSD: op.h,v 1.23 2023/09/14 21:08:12 rillig Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1994, 1995 Jochen Pohl
      5  * All Rights Reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by Jochen Pohl for
     18  *	The NetBSD Project.
     19  * 4. The name of the author may not be used to endorse or promote products
     20  *    derived from this software without specific prior written permission.
     21  *
     22  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     23  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     24  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     25  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     26  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     27  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     28  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     29  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     30  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     31  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     32  */
     33 
     34 #include <stdbool.h>
     35 
     36 /*
     37  * Various information about operators.
     38  */
     39 typedef	struct {
     40 	bool	m_binary: 1;
     41 	bool	m_returns_bool: 1;
     42 	bool	m_takes_bool: 1;
     43 	bool	m_compares_with_zero: 1;
     44 	bool	m_requires_integer: 1;
     45 	bool	m_requires_integer_or_complex: 1;
     46 	bool	m_requires_arith: 1;
     47 	bool	m_requires_scalar: 1;
     48 	bool	m_fold_constant_operands: 1;
     49 	bool	m_value_context: 1;
     50 	bool	m_balance_operands: 1;
     51 	bool	m_has_side_effect: 1;
     52 	bool	m_warn_if_left_unsigned_in_c90: 1;
     53 	bool	m_warn_if_right_unsigned_in_c90: 1;
     54 	bool	m_possible_precedence_confusion: 1;
     55 	bool	m_comparison: 1;
     56 	bool	m_valid_on_enum: 1;
     57 	bool	m_bad_on_enum: 1;
     58 	bool	m_warn_if_operand_eq: 1;
     59 	bool	m_has_operands: 1;
     60 	const char *m_name;
     61 } mod_t;
     62 
     63 typedef enum {
     64 	NOOP,
     65 	ARROW,
     66 	POINT,
     67 	NOT,
     68 	COMPL,
     69 	INC,			/* does not appear in the tree */
     70 	DEC,			/* does not appear in the tree */
     71 	INCBEF,
     72 	DECBEF,
     73 	INCAFT,
     74 	DECAFT,
     75 	UPLUS,
     76 	UMINUS,
     77 	INDIR,
     78 	ADDR,
     79 
     80 	MULT,
     81 	DIV,
     82 	MOD,
     83 	PLUS,
     84 	MINUS,
     85 	SHL,
     86 	SHR,
     87 
     88 	LT,
     89 	LE,
     90 	GT,
     91 	GE,
     92 	EQ,
     93 	NE,
     94 
     95 	BITAND,
     96 	BITXOR,
     97 	BITOR,
     98 	LOGAND,
     99 	LOGOR,
    100 	QUEST,
    101 	COLON,
    102 
    103 	ASSIGN,
    104 	MULASS,
    105 	DIVASS,
    106 	MODASS,
    107 	ADDASS,
    108 	SUBASS,
    109 	SHLASS,
    110 	SHRASS,
    111 	ANDASS,
    112 	XORASS,
    113 	ORASS,
    114 
    115 	NAME,
    116 	CON,
    117 	STRING,
    118 	FSEL,
    119 	CALL,
    120 	COMMA,
    121 	CVT,
    122 	ICALL,
    123 	LOAD,
    124 	/*
    125 	 * PUSH is a virtual node that is used to concatenate arguments in a
    126 	 * function call expression.  The PUSH nodes are ordered from right to
    127 	 * left.  For example, the function call f(17, 23) is represented as
    128 	 * CALL(f, PUSH(23, PUSH(17, NULL))).
    129 	 */
    130 	PUSH,
    131 	RETURN,
    132 	REAL,
    133 	IMAG,
    134 
    135 	INIT,			/* does not appear in the tree */
    136 	CASE,			/* does not appear in the tree */
    137 	/*
    138 	 * FARG is only used temporarily in check_prototype_argument to check
    139 	 * type compatibility and conversion for function arguments.
    140 	 */
    141 	FARG,			/* does not appear in the tree */
    142 } op_t;
    143 
    144 #define NOPS ((int)FARG + 1)
    145 
    146 extern const mod_t modtab[NOPS];
    147