gcc/range-op.h

   1 /* Header file for range operator class.
   2    Copyright (C) 2017-2023 Free Software Foundation, Inc.
   3    Contributed by Andrew MacLeod <amacleod@redhat.com>
   4    and Aldy Hernandez <aldyh@redhat.com>.
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify it under
   9 the terms of the GNU General Public License as published by the Free
  10 Software Foundation; either version 3, or (at your option) any later
  11 version.
  12
  13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  15 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  16  for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 #ifndef GCC_RANGE_OP_H
  23 #define GCC_RANGE_OP_H
  24
  25 // This class is implemented for each kind of operator supported by
  26 // the range generator.  It serves various purposes.
  27 //
  28 // 1 - Generates range information for the specific operation between
  29 //     two ranges.  This provides the ability to fold ranges for an
  30 //     expression.
  31 //
  32 // 2 - Performs range algebra on the expression such that a range can be
  33 //     adjusted in terms of one of the operands:
  34 //
  35 //       def = op1 + op2
  36 //
  37 //     Given a range for def, we can adjust the range so that it is in
  38 //     terms of either operand.
  39 //
  40 //     op1_range (def_range, op2) will adjust the range in place so it
  41 //     is in terms of op1.  Since op1 = def - op2, it will subtract
  42 //     op2 from each element of the range.
  43 //
  44 // 3 - Creates a range for an operand based on whether the result is 0 or
  45 //     non-zero.  This is mostly for logical true false, but can serve other
  46 //     purposes.
  47 //       ie   0 = op1 - op2 implies op2 has the same range as op1.
  48 //
  49 // 4 - All supported range combinations are explicitly specified.
  50 //     Any desired combinations should be implemented for each operator.
  51 //     When new range classes are added, new matching prototypes should be
  52 //     added.
  53
  54 class range_operator
  55 {
  56   friend class range_op_table;
  57 public:
  58   // Perform an operation between 2 ranges and return it.
  59   virtual bool fold_range (irange &r, tree type,
  60                            const irange &lh,
  61                            const irange &rh,
  62                            relation_trio = TRIO_VARYING) const;
  63   virtual bool fold_range (frange &r, tree type,
  64                            const frange &lh,
  65                            const frange &rh,
  66                            relation_trio = TRIO_VARYING) const;
  67   virtual bool fold_range (irange &r, tree type,
  68                            const frange &lh,
  69                            const irange &rh,
  70                            relation_trio = TRIO_VARYING) const;
  71   virtual bool fold_range (irange &r, tree type,
  72                            const frange &lh,
  73                            const frange &rh,
  74                            relation_trio = TRIO_VARYING) const;
  75   virtual bool fold_range (frange &r, tree type,
  76                            const irange &lh,
  77                            const irange &rh,
  78                            relation_trio = TRIO_VARYING) const;
  79
  80   // Return the range for op[12] in the general case.  LHS is the range for
  81   // the LHS of the expression, OP[12]is the range for the other
  82   //
  83   // The operand and the result is returned in R.
  84   //
  85   // TYPE is the expected type of the range.
  86   //
  87   // Return TRUE if the operation is performed and a valid range is available.
  88   //
  89   // i.e.  [LHS] = ??? + OP2
  90   // is re-formed as R = [LHS] - OP2.
  91   virtual bool op1_range (irange &r, tree type,
  92                           const irange &lhs,
  93                           const irange &op2,
  94                           relation_trio = TRIO_VARYING) const;
  95   virtual bool op1_range (frange &r, tree type,
  96                           const frange &lhs,
  97                           const frange &op2,
  98                           relation_trio = TRIO_VARYING) const;
  99   virtual bool op1_range (frange &r, tree type,
 100                           const irange &lhs,
 101                           const frange &op2,
 102                           relation_trio = TRIO_VARYING) const;
 103
 104
 105   virtual bool op2_range (irange &r, tree type,
 106                           const irange &lhs,
 107                           const irange &op1,
 108                           relation_trio = TRIO_VARYING) const;
 109   virtual bool op2_range (frange &r, tree type,
 110                           const frange &lhs,
 111                           const frange &op1,
 112                           relation_trio = TRIO_VARYING) const;
 113   virtual bool op2_range (frange &r, tree type,
 114                           const irange &lhs,
 115                           const frange &op1,
 116                           relation_trio = TRIO_VARYING) const;
 117
 118   // The following routines are used to represent relations between the
 119   // various operations.  If the caller knows where the symbolics are,
 120   // it can query for relationships between them given known ranges.
 121   // the optional relation passed in is the relation between op1 and op2.
 122   virtual relation_kind lhs_op1_relation (const irange &lhs,
 123                                           const irange &op1,
 124                                           const irange &op2,
 125                                           relation_kind = VREL_VARYING) const;
 126   virtual relation_kind lhs_op1_relation (const frange &lhs,
 127                                           const frange &op1,
 128                                           const frange &op2,
 129                                           relation_kind = VREL_VARYING) const;
 130   virtual relation_kind lhs_op1_relation (const irange &lhs,
 131                                           const frange &op1,
 132                                           const frange &op2,
 133                                           relation_kind = VREL_VARYING) const;
 134
 135   virtual relation_kind lhs_op2_relation (const irange &lhs,
 136                                           const irange &op1,
 137                                           const irange &op2,
 138                                           relation_kind = VREL_VARYING) const;
 139   virtual relation_kind lhs_op2_relation (const frange &lhs,
 140                                           const frange &op1,
 141                                           const frange &op2,
 142                                           relation_kind = VREL_VARYING) const;
 143   virtual relation_kind lhs_op2_relation (const irange &lhs,
 144                                           const frange &op1,
 145                                           const frange &op2,
 146                                           relation_kind = VREL_VARYING) const;
 147
 148   virtual relation_kind op1_op2_relation (const irange &lhs) const;
 149   virtual relation_kind op1_op2_relation (const frange &lhs) const;
 150 protected:
 151   // Perform an integral operation between 2 sub-ranges and return it.
 152   virtual void wi_fold (irange &r, tree type,
 153                         const wide_int &lh_lb,
 154                         const wide_int &lh_ub,
 155                         const wide_int &rh_lb,
 156                         const wide_int &rh_ub) const;
 157   // Effect of relation for generic fold_range clients.
 158   virtual bool op1_op2_relation_effect (irange &lhs_range, tree type,
 159                                         const irange &op1_range,
 160                                         const irange &op2_range,
 161                                         relation_kind rel) const;
 162   // Called by fold range to split small subranges into parts.
 163   void wi_fold_in_parts (irange &r, tree type,
 164                          const wide_int &lh_lb,
 165                          const wide_int &lh_ub,
 166                          const wide_int &rh_lb,
 167                          const wide_int &rh_ub) const;
 168
 169   // Called by fold range to split small subranges into parts when op1 == op2
 170   void wi_fold_in_parts_equiv (irange &r, tree type,
 171                                const wide_int &lb,
 172                                const wide_int &ub,
 173                                unsigned limit) const;
 174   // Apply any bitmasks implied by these ranges.
 175   virtual void update_bitmask (irange &, const irange &, const irange &) const;
 176
 177   // Perform an float operation between 2 ranges and return it.
 178   virtual void rv_fold (REAL_VALUE_TYPE &lb, REAL_VALUE_TYPE &ub,
 179                         bool &maybe_nan,
 180                         tree type,
 181                         const REAL_VALUE_TYPE &lh_lb,
 182                         const REAL_VALUE_TYPE &lh_ub,
 183                         const REAL_VALUE_TYPE &rh_lb,
 184                         const REAL_VALUE_TYPE &rh_ub,
 185                         relation_kind) const;
 186 };
 187
 188 class range_op_handler
 189 {
 190 public:
 191   range_op_handler ();
 192   range_op_handler (unsigned);
 193   operator bool () const;
 194   range_operator *range_op () const;
 195
 196   bool fold_range (vrange &r, tree type,
 197                    const vrange &lh,
 198                    const vrange &rh,
 199                    relation_trio = TRIO_VARYING) const;
 200   bool op1_range (vrange &r, tree type,
 201                   const vrange &lhs,
 202                   const vrange &op2,
 203                   relation_trio = TRIO_VARYING) const;
 204   bool op2_range (vrange &r, tree type,
 205                   const vrange &lhs,
 206                   const vrange &op1,
 207                   relation_trio = TRIO_VARYING) const;
 208   relation_kind lhs_op1_relation (const vrange &lhs,
 209                                   const vrange &op1,
 210                                   const vrange &op2,
 211                                   relation_kind = VREL_VARYING) const;
 212   relation_kind lhs_op2_relation (const vrange &lhs,
 213                                   const vrange &op1,
 214                                   const vrange &op2,
 215                                   relation_kind = VREL_VARYING) const;
 216   relation_kind op1_op2_relation (const vrange &lhs) const;
 217 protected:
 218   unsigned dispatch_kind (const vrange &lhs, const vrange &op1,
 219                           const vrange& op2) const;
 220   range_operator *m_operator;
 221 };
 222
 223 // Cast the range in R to TYPE if R supports TYPE.
 224
 225 inline bool
 226 range_cast (vrange &r, tree type)
 227 {
 228   gcc_checking_assert (r.supports_type_p (type));
 229   Value_Range tmp (r);
 230   Value_Range varying (type);
 231   varying.set_varying (type);
 232   // Call op_convert, if it fails, the result is varying.
 233   if (!range_op_handler (CONVERT_EXPR).fold_range (r, type, tmp, varying))
 234     {
 235       r.set_varying (type);
 236       return false;
 237     }
 238   return true;
 239 }
 240
 241 // Range cast which is capable of switching range kinds.
 242 // ie for float to int.
 243
 244 inline bool
 245 range_cast (Value_Range &r, tree type)
 246 {
 247   Value_Range tmp (r);
 248   Value_Range varying (type);
 249   varying.set_varying (type);
 250
 251   // Ensure we are in the correct mode for the call to fold.
 252   r.set_type (type);
 253
 254   // Call op_convert, if it fails, the result is varying.
 255   if (!range_op_handler (CONVERT_EXPR).fold_range (r, type, tmp, varying))
 256     {
 257       r.set_varying (type);
 258       return false;
 259     }
 260   return true;
 261 }
 262
 263
 264 extern void wi_set_zero_nonzero_bits (tree type,
 265                                       const wide_int &, const wide_int &,
 266                                       wide_int &maybe_nonzero,
 267                                       wide_int &mustbe_nonzero);
 268
 269 // These are extra operators that do not fit in the normal scheme of things.
 270 // Add them to the end of the tree-code vector, and provide a name for
 271 // each allowing for easy access when required.
 272
 273 #define OP_WIDEN_MULT_SIGNED    ((unsigned) MAX_TREE_CODES)
 274 #define OP_WIDEN_MULT_UNSIGNED  ((unsigned) MAX_TREE_CODES + 1)
 275 #define OP_WIDEN_PLUS_SIGNED    ((unsigned) MAX_TREE_CODES + 2)
 276 #define OP_WIDEN_PLUS_UNSIGNED  ((unsigned) MAX_TREE_CODES + 3)
 277 #define RANGE_OP_TABLE_SIZE     ((unsigned) MAX_TREE_CODES + 4)
 278
 279 // This implements the range operator tables as local objects.
 280
 281 class range_op_table
 282 {
 283 public:
 284   range_op_table ();
 285   inline range_operator *operator[] (unsigned code)
 286     {
 287       gcc_checking_assert (code < RANGE_OP_TABLE_SIZE);
 288       return m_range_tree[code];
 289     }
 290 protected:
 291   inline void set (unsigned code, range_operator &op)
 292     {
 293       gcc_checking_assert (code < RANGE_OP_TABLE_SIZE);
 294       gcc_checking_assert (m_range_tree[code] == NULL);
 295       m_range_tree[code] = &op;
 296     }
 297   range_operator *m_range_tree[RANGE_OP_TABLE_SIZE];
 298   void initialize_integral_ops ();
 299   void initialize_pointer_ops ();
 300   void initialize_float_ops ();
 301 };
 302 #endif // GCC_RANGE_OP_H