gcc/gimple-range.cc

   1 /* Code for GIMPLE range related routines.
   2    Copyright (C) 2019-2021 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
   9 it under the terms of the GNU General Public License as published by
  10 the Free Software Foundation; either version 3, or (at your option)
  11 any later version.
  12
  13 GCC is distributed in the hope that it will be useful,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public License 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 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "backend.h"
  26 #include "tree.h"
  27 #include "gimple.h"
  28 #include "ssa.h"
  29 #include "gimple-pretty-print.h"
  30 #include "gimple-iterator.h"
  31 #include "tree-cfg.h"
  32 #include "fold-const.h"
  33 #include "tree-cfg.h"
  34 #include "cfgloop.h"
  35 #include "tree-scalar-evolution.h"
  36 #include "gimple-range.h"
  37
  38 gimple_ranger::gimple_ranger () :
  39         non_executable_edge_flag (cfun),
  40         m_cache (non_executable_edge_flag),
  41         tracer ("")
  42 {
  43   // If the cache has a relation oracle, use it.
  44   m_oracle = m_cache.oracle ();
  45   if (dump_file && (param_evrp_mode & EVRP_MODE_TRACE))
  46     tracer.enable_trace ();
  47
  48   // Ensure the not_executable flag is clear everywhere.
  49   if (flag_checking)
  50     {
  51       basic_block bb;
  52       FOR_ALL_BB_FN (bb, cfun)
  53         {
  54           edge_iterator ei;
  55           edge e;
  56           FOR_EACH_EDGE (e, ei, bb->succs)
  57             gcc_checking_assert ((e->flags & non_executable_edge_flag) == 0);
  58         }
  59     }
  60 }
  61
  62 bool
  63 gimple_ranger::range_of_expr (irange &r, tree expr, gimple *stmt)
  64 {
  65   unsigned idx;
  66   if (!gimple_range_ssa_p (expr))
  67     return get_tree_range (r, expr, stmt);
  68
  69   if ((idx = tracer.header ("range_of_expr(")))
  70     {
  71       print_generic_expr (dump_file, expr, TDF_SLIM);
  72       fputs (")", dump_file);
  73       if (stmt)
  74         {
  75           fputs (" at stmt ", dump_file);
  76           print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
  77         }
  78       else
  79         fputs ("\n", dump_file);
  80     }
  81
  82   // If there is no statement, just get the global value.
  83   if (!stmt)
  84     {
  85       if (!m_cache.get_global_range (r, expr))
  86         r = gimple_range_global (expr);
  87     }
  88   // For a debug stmt, pick the best value currently available, do not
  89   // trigger new value calculations.  PR 100781.
  90   else if (is_gimple_debug (stmt))
  91     m_cache.range_of_expr (r, expr, stmt);
  92   else
  93     {
  94       basic_block bb = gimple_bb (stmt);
  95       gimple *def_stmt = SSA_NAME_DEF_STMT (expr);
  96
  97       // If name is defined in this block, try to get an range from S.
  98       if (def_stmt && gimple_bb (def_stmt) == bb)
  99         {
 100           range_of_stmt (r, def_stmt, expr);
 101           m_cache.m_non_null.adjust_range (r, expr, bb, true);
 102         }
 103       // Otherwise OP comes from outside this block, use range on entry.
 104       else
 105         range_on_entry (r, bb, expr);
 106     }
 107   if (idx)
 108     tracer.trailer (idx, "range_of_expr", true, expr, r);
 109   return true;
 110 }
 111
 112 // Return the range of NAME on entry to block BB in R.
 113
 114 void
 115 gimple_ranger::range_on_entry (irange &r, basic_block bb, tree name)
 116 {
 117   int_range_max entry_range;
 118   gcc_checking_assert (gimple_range_ssa_p (name));
 119
 120   unsigned idx;
 121   if ((idx = tracer.header ("range_on_entry (")))
 122     {
 123       print_generic_expr (dump_file, name, TDF_SLIM);
 124       fprintf (dump_file, ") to BB %d\n", bb->index);
 125     }
 126
 127   // Start with any known range
 128   range_of_stmt (r, SSA_NAME_DEF_STMT (name), name);
 129
 130   // Now see if there is any on_entry value which may refine it.
 131   if (m_cache.block_range (entry_range, bb, name))
 132     r.intersect (entry_range);
 133
 134   m_cache.m_non_null.adjust_range (r, name, bb, true);
 135
 136   if (idx)
 137     tracer.trailer (idx, "range_on_entry", true, name, r);
 138 }
 139
 140 // Calculate the range for NAME at the end of block BB and return it in R.
 141 // Return false if no range can be calculated.
 142
 143 void
 144 gimple_ranger::range_on_exit (irange &r, basic_block bb, tree name)
 145 {
 146   // on-exit from the exit block?
 147   gcc_checking_assert (bb != EXIT_BLOCK_PTR_FOR_FN (cfun));
 148   gcc_checking_assert (gimple_range_ssa_p (name));
 149
 150   unsigned idx;
 151   if ((idx = tracer.header ("range_on_exit (")))
 152     {
 153       print_generic_expr (dump_file, name, TDF_SLIM);
 154       fprintf (dump_file, ") from BB %d\n", bb->index);
 155     }
 156
 157   gimple *s = SSA_NAME_DEF_STMT (name);
 158   basic_block def_bb = gimple_bb (s);
 159   // If this is not the definition block, get the range on the last stmt in
 160   // the block... if there is one.
 161   if (def_bb != bb)
 162     s = last_stmt (bb);
 163   // If there is no statement provided, get the range_on_entry for this block.
 164   if (s)
 165     range_of_expr (r, name, s);
 166   else
 167     range_on_entry (r, bb, name);
 168   gcc_checking_assert (r.undefined_p ()
 169                        || range_compatible_p (r.type (), TREE_TYPE (name)));
 170
 171   if (idx)
 172     tracer.trailer (idx, "range_on_exit", true, name, r);
 173 }
 174
 175 // Calculate a range for NAME on edge E and return it in R.
 176
 177 bool
 178 gimple_ranger::range_on_edge (irange &r, edge e, tree name)
 179 {
 180   int_range_max edge_range;
 181   gcc_checking_assert (irange::supports_type_p (TREE_TYPE (name)));
 182
 183   unsigned idx;
 184   if ((idx = tracer.header ("range_on_edge (")))
 185     {
 186       print_generic_expr (dump_file, name, TDF_SLIM);
 187       fprintf (dump_file, ") on edge %d->%d\n", e->src->index, e->dest->index);
 188     }
 189
 190   // Check to see if the edge is executable.
 191   if ((e->flags & non_executable_edge_flag))
 192     {
 193       r.set_undefined ();
 194       if (idx)
 195         tracer.trailer (idx, "range_on_edge [Unexecutable] ", true,
 196                         name, r);
 197       return true;
 198     }
 199
 200   bool res = true;
 201   if (!gimple_range_ssa_p (name))
 202     res = range_of_expr (r, name);
 203   else
 204     {
 205       range_on_exit (r, e->src, name);
 206       gcc_checking_assert  (r.undefined_p ()
 207                             || range_compatible_p (r.type(), TREE_TYPE (name)));
 208
 209       // Check to see if NAME is defined on edge e.
 210       if (m_cache.range_on_edge (edge_range, e, name))
 211         r.intersect (edge_range);
 212     }
 213
 214   if (idx)
 215     tracer.trailer (idx, "range_on_edge", res, name, r);
 216   return true;
 217 }
 218
 219 // fold_range wrapper for range_of_stmt to use as an internal client.
 220
 221 bool
 222 gimple_ranger::fold_range_internal (irange &r, gimple *s, tree name)
 223 {
 224   fold_using_range f;
 225   fur_depend src (s, &(gori ()), this);
 226   return f.fold_stmt (r, s, src, name);
 227 }
 228
 229 // Calculate a range for statement S and return it in R.  If NAME is
 230 // provided it represents the SSA_NAME on the LHS of the statement.
 231 // It is only required if there is more than one lhs/output.  Check
 232 // the global cache for NAME first to see if the evaluation can be
 233 // avoided.  If a range cannot be calculated, return false and UNDEFINED.
 234
 235 bool
 236 gimple_ranger::range_of_stmt (irange &r, gimple *s, tree name)
 237 {
 238   bool res;
 239   r.set_undefined ();
 240
 241   unsigned idx;
 242   if ((idx = tracer.header ("range_of_stmt (")))
 243     {
 244       if (name)
 245         print_generic_expr (dump_file, name, TDF_SLIM);
 246       fputs (") at stmt ", dump_file);
 247       print_gimple_stmt (dump_file, s, 0, TDF_SLIM);
 248     }
 249
 250   if (!name)
 251     name = gimple_get_lhs (s);
 252
 253   // If no name, simply call the base routine.
 254   if (!name)
 255     res = fold_range_internal (r, s, NULL_TREE);
 256   else if (!gimple_range_ssa_p (name))
 257     res = false;
 258   // Check if the stmt has already been processed, and is not stale.
 259   else if (m_cache.get_non_stale_global_range (r, name))
 260     {
 261       if (idx)
 262         tracer.trailer (idx, " cached", true, name, r);
 263       return true;
 264     }
 265   else
 266     {
 267       // Otherwise calculate a new value.
 268       int_range_max tmp;
 269       fold_range_internal (tmp, s, name);
 270
 271       // Combine the new value with the old value.  This is required because
 272       // the way value propagation works, when the IL changes on the fly we
 273       // can sometimes get different results.  See PR 97741.
 274       r.intersect (tmp);
 275       m_cache.set_global_range (name, r);
 276       res = true;
 277     }
 278
 279   if (idx)
 280     tracer.trailer (idx, "range_of_stmt", res, name, r);
 281   return res;
 282 }
 283
 284 // This routine will export whatever global ranges are known to GCC
 285 // SSA_RANGE_NAME_INFO and SSA_NAME_PTR_INFO fields.
 286
 287 void
 288 gimple_ranger::export_global_ranges ()
 289 {
 290   /* Cleared after the table header has been printed.  */
 291   bool print_header = true;
 292   for (unsigned x = 1; x < num_ssa_names; x++)
 293     {
 294       int_range_max r;
 295       tree name = ssa_name (x);
 296       if (name && !SSA_NAME_IN_FREE_LIST (name)
 297           && gimple_range_ssa_p (name)
 298           && m_cache.get_global_range (r, name)
 299           && !r.varying_p())
 300         {
 301           bool updated = update_global_range (r, name);
 302           if (!updated || !dump_file || !(dump_flags & TDF_DETAILS))
 303             continue;
 304
 305           if (print_header)
 306             {
 307               /* Print the header only when there's something else
 308                  to print below.  */
 309               fprintf (dump_file, "Exported global range table:\n");
 310               fprintf (dump_file, "============================\n");
 311               print_header = false;
 312             }
 313
 314           value_range vr = r;
 315           print_generic_expr (dump_file, name , TDF_SLIM);
 316           fprintf (dump_file, "  : ");
 317           vr.dump (dump_file);
 318           fprintf (dump_file, "\n");
 319           int_range_max same = vr;
 320           if (same != r)
 321             {
 322               fprintf (dump_file, "         irange : ");
 323               r.dump (dump_file);
 324               fprintf (dump_file, "\n");
 325             }
 326         }
 327     }
 328 }
 329
 330 // Print the known table values to file F.
 331
 332 void
 333 gimple_ranger::dump_bb (FILE *f, basic_block bb)
 334 {
 335   unsigned x;
 336   edge_iterator ei;
 337   edge e;
 338   int_range_max range, tmp_range;
 339   fprintf (f, "\n=========== BB %d ============\n", bb->index);
 340   m_cache.dump_bb (f, bb);
 341
 342   ::dump_bb (f, bb, 4, TDF_NONE);
 343
 344   // Now find any globals defined in this block.
 345   for (x = 1; x < num_ssa_names; x++)
 346     {
 347       tree name = ssa_name (x);
 348       if (gimple_range_ssa_p (name) && SSA_NAME_DEF_STMT (name) &&
 349           gimple_bb (SSA_NAME_DEF_STMT (name)) == bb &&
 350           m_cache.get_global_range (range, name))
 351         {
 352           if (!range.varying_p ())
 353             {
 354               print_generic_expr (f, name, TDF_SLIM);
 355               fprintf (f, " : ");
 356               range.dump (f);
 357               fprintf (f, "\n");
 358             }
 359
 360         }
 361     }
 362
 363   // And now outgoing edges, if they define anything.
 364   FOR_EACH_EDGE (e, ei, bb->succs)
 365     {
 366       for (x = 1; x < num_ssa_names; x++)
 367         {
 368           tree name = gimple_range_ssa_p (ssa_name (x));
 369           if (name && gori ().has_edge_range_p (name, e)
 370               && m_cache.range_on_edge (range, e, name))
 371             {
 372               gimple *s = SSA_NAME_DEF_STMT (name);
 373               // Only print the range if this is the def block, or
 374               // the on entry cache for either end of the edge is
 375               // set.
 376               if ((s && bb == gimple_bb (s)) ||
 377                   m_cache.block_range (tmp_range, bb, name, false) ||
 378                   m_cache.block_range (tmp_range, e->dest, name, false))
 379                 {
 380                   if (!range.varying_p ())
 381                     {
 382                       fprintf (f, "%d->%d ", e->src->index,
 383                                e->dest->index);
 384                       char c = ' ';
 385                       if (e->flags & EDGE_TRUE_VALUE)
 386                         fprintf (f, " (T)%c", c);
 387                       else if (e->flags & EDGE_FALSE_VALUE)
 388                         fprintf (f, " (F)%c", c);
 389                       else
 390                         fprintf (f, "     ");
 391                       print_generic_expr (f, name, TDF_SLIM);
 392                       fprintf(f, " : \t");
 393                       range.dump(f);
 394                       fprintf (f, "\n");
 395                     }
 396                 }
 397             }
 398         }
 399     }
 400 }
 401
 402 // Print the known table values to file F.
 403
 404 void
 405 gimple_ranger::dump (FILE *f)
 406 {
 407   basic_block bb;
 408
 409   FOR_EACH_BB_FN (bb, cfun)
 410     dump_bb (f, bb);
 411
 412   m_cache.dump (f);
 413 }
 414
 415 void
 416 gimple_ranger::debug ()
 417 {
 418   dump (stderr);
 419 }
 420
 421 /* Create a new ranger instance and associate it with function FUN.
 422    Each call must be paired with a call to disable_ranger to release
 423    resources.  */
 424
 425 gimple_ranger *
 426 enable_ranger (struct function *fun)
 427 {
 428   gimple_ranger *r;
 429
 430   r = new gimple_ranger;
 431   fun->x_range_query = r;
 432
 433   return r;
 434 }
 435
 436 /* Destroy and release the ranger instance associated with function FUN
 437    and replace it the global ranger.  */
 438
 439 void
 440 disable_ranger (struct function *fun)
 441 {
 442   delete fun->x_range_query;
 443
 444   fun->x_range_query = &global_ranges;
 445 }