Line data Source code
1 : /* Gimple ranger SSA cache implementation.
2 : Copyright (C) 2017-2026 Free Software Foundation, Inc.
3 : Contributed by Andrew MacLeod <amacleod@redhat.com>.
4 :
5 : This file is part of GCC.
6 :
7 : GCC is free software; you can redistribute it and/or modify
8 : it under the terms of the GNU General Public License as published by
9 : the Free Software Foundation; either version 3, or (at your option)
10 : any later version.
11 :
12 : GCC is distributed in the hope that it will be useful,
13 : but WITHOUT ANY WARRANTY; without even the implied warranty of
14 : MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 : GNU General Public License for more details.
16 :
17 : You should have received a copy of the GNU General Public License
18 : along with GCC; see the file COPYING3. If not see
19 : <http://www.gnu.org/licenses/>. */
20 :
21 : #include "config.h"
22 : #include "system.h"
23 : #include "coretypes.h"
24 : #include "backend.h"
25 : #include "insn-codes.h"
26 : #include "tree.h"
27 : #include "gimple.h"
28 : #include "ssa.h"
29 : #include "gimple-pretty-print.h"
30 : #include "gimple-range.h"
31 : #include "value-range-storage.h"
32 : #include "tree-cfg.h"
33 : #include "target.h"
34 : #include "attribs.h"
35 : #include "gimple-iterator.h"
36 : #include "gimple-walk.h"
37 : #include "cfganal.h"
38 :
39 : #define DEBUG_RANGE_CACHE (dump_file \
40 : && (param_ranger_debug & RANGER_DEBUG_CACHE))
41 :
42 : // This class represents the API into a cache of ranges for an SSA_NAME.
43 : // Routines must be implemented to set, get, and query if a value is set.
44 :
45 : class ssa_block_ranges
46 : {
47 : public:
48 27516934 : ssa_block_ranges (tree t) : m_type (t) { }
49 : virtual bool set_bb_range (const_basic_block bb, const vrange &r) = 0;
50 : virtual bool get_bb_range (vrange &r, const_basic_block bb) = 0;
51 : virtual bool bb_range_p (const_basic_block bb) = 0;
52 :
53 : void dump(FILE *f);
54 : private:
55 : tree m_type;
56 : };
57 :
58 : // Print the list of known ranges for file F in a nice format.
59 :
60 : void
61 0 : ssa_block_ranges::dump (FILE *f)
62 : {
63 0 : basic_block bb;
64 0 : value_range r (m_type);
65 :
66 0 : FOR_EACH_BB_FN (bb, cfun)
67 0 : if (get_bb_range (r, bb))
68 : {
69 0 : fprintf (f, "BB%d -> ", bb->index);
70 0 : r.dump (f);
71 0 : fprintf (f, "\n");
72 : }
73 0 : }
74 :
75 : // This class implements the range cache as a linear vector, indexed by BB.
76 : // It caches a varying and undefined range which are used instead of
77 : // allocating new ones each time.
78 :
79 : class sbr_vector : public ssa_block_ranges
80 : {
81 : public:
82 : sbr_vector (tree t, vrange_allocator *allocator, bool zero_p = true);
83 :
84 : virtual bool set_bb_range (const_basic_block bb, const vrange &r) override;
85 : virtual bool get_bb_range (vrange &r, const_basic_block bb) override;
86 : virtual bool bb_range_p (const_basic_block bb) override;
87 : protected:
88 : vrange_storage **m_tab; // Non growing vector.
89 : int m_tab_size;
90 : vrange_storage *m_varying;
91 : vrange_storage *m_undefined;
92 : tree m_type;
93 : vrange_allocator *m_range_allocator;
94 : bool m_zero_p;
95 : void grow ();
96 : };
97 :
98 :
99 : // Initialize a block cache for an ssa_name of type T.
100 :
101 27432383 : sbr_vector::sbr_vector (tree t, vrange_allocator *allocator, bool zero_p)
102 27432383 : : ssa_block_ranges (t)
103 : {
104 27432383 : gcc_checking_assert (TYPE_P (t));
105 27432383 : m_type = t;
106 27432383 : m_zero_p = zero_p;
107 27432383 : m_range_allocator = allocator;
108 27432383 : m_tab_size = last_basic_block_for_fn (cfun) + 1;
109 54864766 : m_tab = static_cast <vrange_storage **>
110 27432383 : (allocator->alloc (m_tab_size * sizeof (vrange_storage *)));
111 27432383 : if (zero_p)
112 24046891 : memset (m_tab, 0, m_tab_size * sizeof (vrange *));
113 :
114 : // Create the cached type range.
115 27432383 : m_varying = m_range_allocator->clone_varying (t);
116 27432383 : m_undefined = m_range_allocator->clone_undefined (t);
117 27432383 : }
118 :
119 : // Grow the vector when the CFG has increased in size.
120 :
121 : void
122 10143 : sbr_vector::grow ()
123 : {
124 10143 : int curr_bb_size = last_basic_block_for_fn (cfun);
125 10143 : gcc_checking_assert (curr_bb_size > m_tab_size);
126 :
127 : // Increase the max of a)128, b)needed increase * 2, c)10% of current_size.
128 10143 : int inc = MAX ((curr_bb_size - m_tab_size) * 2, 128);
129 10143 : inc = MAX (inc, curr_bb_size / 10);
130 10143 : int new_size = inc + curr_bb_size;
131 :
132 : // Allocate new memory, copy the old vector and clear the new space.
133 10143 : vrange_storage **t = static_cast <vrange_storage **>
134 10143 : (m_range_allocator->alloc (new_size * sizeof (vrange_storage *)));
135 10143 : memcpy (t, m_tab, m_tab_size * sizeof (vrange_storage *));
136 10143 : if (m_zero_p)
137 7892 : memset (t + m_tab_size, 0, (new_size - m_tab_size) * sizeof (vrange_storage *));
138 :
139 10143 : m_tab = t;
140 10143 : m_tab_size = new_size;
141 10143 : }
142 :
143 : // Set the range for block BB to be R.
144 :
145 : bool
146 72019252 : sbr_vector::set_bb_range (const_basic_block bb, const vrange &r)
147 : {
148 72019252 : vrange_storage *m;
149 72019252 : if (bb->index >= m_tab_size)
150 10143 : grow ();
151 72019252 : if (r.varying_p ())
152 22300517 : m = m_varying;
153 49718735 : else if (r.undefined_p ())
154 5353529 : m = m_undefined;
155 : else
156 44365206 : m = m_range_allocator->clone (r);
157 72019252 : m_tab[bb->index] = m;
158 72019252 : return true;
159 : }
160 :
161 : // Return the range associated with block BB in R. Return false if
162 : // there is no range.
163 :
164 : bool
165 310819343 : sbr_vector::get_bb_range (vrange &r, const_basic_block bb)
166 : {
167 310819343 : if (bb->index >= m_tab_size)
168 : return false;
169 310811590 : vrange_storage *m = m_tab[bb->index];
170 310811590 : if (m)
171 : {
172 235426021 : m->get_vrange (r, m_type);
173 235426021 : return true;
174 : }
175 : return false;
176 : }
177 :
178 : // Return true if a range is present.
179 :
180 : bool
181 229892966 : sbr_vector::bb_range_p (const_basic_block bb)
182 : {
183 229892966 : if (bb->index < m_tab_size)
184 229881875 : return m_tab[bb->index] != NULL;
185 : return false;
186 : }
187 :
188 : // Like an sbr_vector, except it uses a bitmap to manage whetehr vale is set
189 : // or not rather than cleared memory.
190 :
191 : class sbr_lazy_vector : public sbr_vector
192 : {
193 : public:
194 : sbr_lazy_vector (tree t, vrange_allocator *allocator, bitmap_obstack *bm);
195 :
196 : virtual bool set_bb_range (const_basic_block bb, const vrange &r) override;
197 : virtual bool get_bb_range (vrange &r, const_basic_block bb) override;
198 : virtual bool bb_range_p (const_basic_block bb) override;
199 : protected:
200 : bitmap m_has_value;
201 : };
202 :
203 3385492 : sbr_lazy_vector::sbr_lazy_vector (tree t, vrange_allocator *allocator,
204 3385492 : bitmap_obstack *bm)
205 3385492 : : sbr_vector (t, allocator, false)
206 : {
207 3385492 : m_has_value = BITMAP_ALLOC (bm);
208 3385492 : }
209 :
210 : bool
211 11758039 : sbr_lazy_vector::set_bb_range (const_basic_block bb, const vrange &r)
212 : {
213 11758039 : sbr_vector::set_bb_range (bb, r);
214 11758039 : bitmap_set_bit (m_has_value, bb->index);
215 11758039 : return true;
216 : }
217 :
218 : bool
219 241648334 : sbr_lazy_vector::get_bb_range (vrange &r, const_basic_block bb)
220 : {
221 241648334 : if (bitmap_bit_p (m_has_value, bb->index))
222 40055016 : return sbr_vector::get_bb_range (r, bb);
223 : return false;
224 : }
225 :
226 : bool
227 43462421 : sbr_lazy_vector::bb_range_p (const_basic_block bb)
228 : {
229 43462421 : return bitmap_bit_p (m_has_value, bb->index);
230 : }
231 :
232 : // This class implements the on entry cache via a sparse bitmap.
233 : // It uses the quad bit routines to access 4 bits at a time.
234 : // A value of 0 (the default) means there is no entry, and a value of
235 : // 1 thru SBR_NUM represents an element in the m_range vector.
236 : // Varying is given the first value (1) and pre-cached.
237 : // SBR_NUM + 1 represents the value of UNDEFINED, and is never stored.
238 : // SBR_NUM is the number of values that can be cached.
239 : // Indexes are 1..SBR_NUM and are stored locally at m_range[0..SBR_NUM-1]
240 :
241 : #define SBR_NUM 14
242 : #define SBR_UNDEF SBR_NUM + 1
243 : #define SBR_VARYING 1
244 :
245 : class sbr_sparse_bitmap : public ssa_block_ranges
246 : {
247 : public:
248 : sbr_sparse_bitmap (tree t, vrange_allocator *allocator, bitmap_obstack *bm);
249 : virtual bool set_bb_range (const_basic_block bb, const vrange &r) override;
250 : virtual bool get_bb_range (vrange &r, const_basic_block bb) override;
251 : virtual bool bb_range_p (const_basic_block bb) override;
252 : private:
253 : void bitmap_set_quad (bitmap head, int quad, int quad_value);
254 : int bitmap_get_quad (const_bitmap head, int quad);
255 : vrange_allocator *m_range_allocator;
256 : vrange_storage *m_range[SBR_NUM];
257 : bitmap_head bitvec;
258 : tree m_type;
259 : };
260 :
261 : // Initialize a block cache for an ssa_name of type T.
262 :
263 84551 : sbr_sparse_bitmap::sbr_sparse_bitmap (tree t, vrange_allocator *allocator,
264 84551 : bitmap_obstack *bm)
265 84551 : : ssa_block_ranges (t)
266 : {
267 84551 : gcc_checking_assert (TYPE_P (t));
268 84551 : m_type = t;
269 84551 : bitmap_initialize (&bitvec, bm);
270 84551 : bitmap_tree_view (&bitvec);
271 84551 : m_range_allocator = allocator;
272 : // Pre-cache varying.
273 84551 : m_range[0] = m_range_allocator->clone_varying (t);
274 : // Pre-cache zero and non-zero values for pointers.
275 84551 : if (POINTER_TYPE_P (t))
276 : {
277 1188 : prange nonzero;
278 1188 : nonzero.set_nonzero (t);
279 1188 : m_range[1] = m_range_allocator->clone (nonzero);
280 1188 : prange zero;
281 1188 : zero.set_zero (t);
282 1188 : m_range[2] = m_range_allocator->clone (zero);
283 1188 : }
284 : else
285 83363 : m_range[1] = m_range[2] = NULL;
286 : // Clear SBR_NUM entries.
287 1014612 : for (int x = 3; x < SBR_NUM; x++)
288 930061 : m_range[x] = 0;
289 84551 : }
290 :
291 : // Set 4 bit values in a sparse bitmap. This allows a bitmap to
292 : // function as a sparse array of 4 bit values.
293 : // QUAD is the index, QUAD_VALUE is the 4 bit value to set.
294 :
295 : inline void
296 443510 : sbr_sparse_bitmap::bitmap_set_quad (bitmap head, int quad, int quad_value)
297 : {
298 443510 : bitmap_set_aligned_chunk (head, quad, 4, (BITMAP_WORD) quad_value);
299 : }
300 :
301 : // Get a 4 bit value from a sparse bitmap. This allows a bitmap to
302 : // function as a sparse array of 4 bit values.
303 : // QUAD is the index.
304 : inline int
305 14228097 : sbr_sparse_bitmap::bitmap_get_quad (const_bitmap head, int quad)
306 : {
307 28456194 : return (int) bitmap_get_aligned_chunk (head, quad, 4);
308 : }
309 :
310 : // Set the range on entry to basic block BB to R.
311 :
312 : bool
313 443510 : sbr_sparse_bitmap::set_bb_range (const_basic_block bb, const vrange &r)
314 : {
315 443510 : if (r.undefined_p ())
316 : {
317 18275 : bitmap_set_quad (&bitvec, bb->index, SBR_UNDEF);
318 18275 : return true;
319 : }
320 :
321 : // Loop thru the values to see if R is already present.
322 781516 : for (int x = 0; x < SBR_NUM; x++)
323 770501 : if (!m_range[x] || m_range[x]->equal_p (r))
324 : {
325 414220 : if (!m_range[x])
326 98574 : m_range[x] = m_range_allocator->clone (r);
327 414220 : bitmap_set_quad (&bitvec, bb->index, x + 1);
328 414220 : return true;
329 : }
330 : // All values are taken, default to VARYING.
331 11015 : bitmap_set_quad (&bitvec, bb->index, SBR_VARYING);
332 11015 : return false;
333 : }
334 :
335 : // Return the range associated with block BB in R. Return false if
336 : // there is no range.
337 :
338 : bool
339 11859523 : sbr_sparse_bitmap::get_bb_range (vrange &r, const_basic_block bb)
340 : {
341 11859523 : int value = bitmap_get_quad (&bitvec, bb->index);
342 :
343 11859523 : if (!value)
344 : return false;
345 :
346 1823377 : gcc_checking_assert (value <= SBR_UNDEF);
347 1823377 : if (value == SBR_UNDEF)
348 36338 : r.set_undefined ();
349 : else
350 1787039 : m_range[value - 1]->get_vrange (r, m_type);
351 : return true;
352 : }
353 :
354 : // Return true if a range is present.
355 :
356 : bool
357 2368574 : sbr_sparse_bitmap::bb_range_p (const_basic_block bb)
358 : {
359 2368574 : return (bitmap_get_quad (&bitvec, bb->index) != 0);
360 : }
361 :
362 : // -------------------------------------------------------------------------
363 :
364 : // Initialize the block cache.
365 :
366 27858982 : block_range_cache::block_range_cache ()
367 : {
368 27858982 : bitmap_obstack_initialize (&m_bitmaps);
369 27858982 : m_ssa_ranges.create (0);
370 55717964 : m_ssa_ranges.safe_grow_cleared (num_ssa_names);
371 27858982 : m_range_allocator = new vrange_allocator;
372 27858982 : }
373 :
374 : // Remove any m_block_caches which have been created.
375 :
376 27858981 : block_range_cache::~block_range_cache ()
377 : {
378 27858981 : delete m_range_allocator;
379 : // Release the vector itself.
380 27858981 : m_ssa_ranges.release ();
381 27858981 : bitmap_obstack_release (&m_bitmaps);
382 27858981 : }
383 :
384 : // Set the range for NAME on entry to block BB to R.
385 : // If it has not been accessed yet, allocate it first.
386 :
387 : bool
388 72462762 : block_range_cache::set_bb_range (tree name, const_basic_block bb,
389 : const vrange &r)
390 : {
391 72462762 : unsigned v = SSA_NAME_VERSION (name);
392 72462762 : if (v >= m_ssa_ranges.length ())
393 2 : m_ssa_ranges.safe_grow_cleared (num_ssa_names);
394 :
395 72462762 : if (!m_ssa_ranges[v])
396 : {
397 : // Use sparse bitmap representation if there are too many basic blocks.
398 27516934 : if (last_basic_block_for_fn (cfun) > param_vrp_sparse_threshold)
399 : {
400 84551 : void *r = m_range_allocator->alloc (sizeof (sbr_sparse_bitmap));
401 84551 : m_ssa_ranges[v] = new (r) sbr_sparse_bitmap (TREE_TYPE (name),
402 : m_range_allocator,
403 84551 : &m_bitmaps);
404 : }
405 27432383 : else if (last_basic_block_for_fn (cfun) < param_vrp_vector_threshold)
406 : {
407 : // For small CFGs use the basic vector implemntation.
408 24046891 : void *r = m_range_allocator->alloc (sizeof (sbr_vector));
409 24046891 : m_ssa_ranges[v] = new (r) sbr_vector (TREE_TYPE (name),
410 24046891 : m_range_allocator);
411 : }
412 : else
413 : {
414 : // Otherwise use the sparse vector implementation.
415 3385492 : void *r = m_range_allocator->alloc (sizeof (sbr_lazy_vector));
416 3385492 : m_ssa_ranges[v] = new (r) sbr_lazy_vector (TREE_TYPE (name),
417 : m_range_allocator,
418 3385492 : &m_bitmaps);
419 : }
420 : }
421 72462762 : return m_ssa_ranges[v]->set_bb_range (bb, r);
422 : }
423 :
424 :
425 : // Return a pointer to the ssa_block_cache for NAME. If it has not been
426 : // accessed yet, return NULL.
427 :
428 : inline ssa_block_ranges *
429 1082160048 : block_range_cache::query_block_ranges (tree name)
430 : {
431 1082160048 : unsigned v = SSA_NAME_VERSION (name);
432 1082160048 : if (v >= m_ssa_ranges.length () || !m_ssa_ranges[v])
433 : return NULL;
434 : return m_ssa_ranges[v];
435 : }
436 :
437 :
438 :
439 : // Return the range for NAME on entry to BB in R. Return true if there
440 : // is one.
441 :
442 : bool
443 714171710 : block_range_cache::get_bb_range (vrange &r, tree name, const_basic_block bb)
444 : {
445 714171710 : ssa_block_ranges *ptr = query_block_ranges (name);
446 714171710 : if (ptr)
447 524270929 : return ptr->get_bb_range (r, bb);
448 : return false;
449 : }
450 :
451 : // Return true if NAME has a range set in block BB.
452 :
453 : bool
454 367988338 : block_range_cache::bb_range_p (tree name, const_basic_block bb)
455 : {
456 367988338 : ssa_block_ranges *ptr = query_block_ranges (name);
457 367988338 : if (ptr)
458 275723961 : return ptr->bb_range_p (bb);
459 : return false;
460 : }
461 :
462 : // Print all known block caches to file F.
463 :
464 : void
465 0 : block_range_cache::dump (FILE *f)
466 : {
467 0 : unsigned x;
468 0 : for (x = 1; x < m_ssa_ranges.length (); ++x)
469 : {
470 0 : if (m_ssa_ranges[x])
471 : {
472 0 : fprintf (f, " Ranges for ");
473 0 : print_generic_expr (f, ssa_name (x), TDF_NONE);
474 0 : fprintf (f, ":\n");
475 0 : m_ssa_ranges[x]->dump (f);
476 0 : fprintf (f, "\n");
477 : }
478 : }
479 0 : }
480 :
481 : // Print all known ranges on entry to block BB to file F.
482 :
483 : void
484 248 : block_range_cache::dump (FILE *f, basic_block bb, bool print_varying)
485 : {
486 248 : unsigned x;
487 248 : bool summarize_varying = false;
488 12593 : for (x = 1; x < m_ssa_ranges.length (); ++x)
489 : {
490 12345 : if (!m_ssa_ranges[x])
491 22180 : continue;
492 :
493 1255 : if (!gimple_range_ssa_p (ssa_name (x)))
494 0 : continue;
495 :
496 1255 : value_range r (TREE_TYPE (ssa_name (x)));
497 1255 : if (m_ssa_ranges[x]->get_bb_range (r, bb))
498 : {
499 220 : if (!print_varying && r.varying_p ())
500 : {
501 0 : summarize_varying = true;
502 0 : continue;
503 : }
504 220 : print_generic_expr (f, ssa_name (x), TDF_NONE);
505 220 : fprintf (f, "\t");
506 220 : r.dump(f);
507 220 : fprintf (f, "\n");
508 : }
509 1255 : }
510 : // If there were any varying entries, lump them all together.
511 248 : if (summarize_varying)
512 : {
513 0 : fprintf (f, "VARYING_P on entry : ");
514 0 : for (x = 1; x < m_ssa_ranges.length (); ++x)
515 : {
516 0 : if (!m_ssa_ranges[x])
517 0 : continue;
518 :
519 0 : if (!gimple_range_ssa_p (ssa_name (x)))
520 0 : continue;
521 :
522 0 : value_range r (TREE_TYPE (ssa_name (x)));
523 0 : if (m_ssa_ranges[x]->get_bb_range (r, bb))
524 : {
525 0 : if (r.varying_p ())
526 : {
527 0 : print_generic_expr (f, ssa_name (x), TDF_NONE);
528 0 : fprintf (f, " ");
529 : }
530 : }
531 0 : }
532 0 : fprintf (f, "\n");
533 : }
534 248 : }
535 :
536 : // -------------------------------------------------------------------------
537 :
538 : // Initialize an ssa cache.
539 :
540 55318668 : ssa_cache::ssa_cache ()
541 : {
542 55318668 : m_tab.create (0);
543 55318668 : m_range_allocator = new vrange_allocator;
544 55318668 : }
545 :
546 : // Deconstruct an ssa cache.
547 :
548 55318658 : ssa_cache::~ssa_cache ()
549 : {
550 55318658 : m_tab.release ();
551 55318658 : delete m_range_allocator;
552 55318658 : }
553 :
554 : // Enable a query to evaluate staements/ramnges based on picking up ranges
555 : // from just an ssa-cache.
556 :
557 : bool
558 532 : ssa_cache::range_of_expr (vrange &r, tree expr, gimple *stmt)
559 : {
560 532 : if (!gimple_range_ssa_p (expr))
561 0 : return get_tree_range (r, expr, stmt);
562 :
563 532 : if (!get_range (r, expr))
564 20 : gimple_range_global (r, expr, cfun);
565 : return true;
566 : }
567 :
568 : // Return TRUE if the global range of NAME has a cache entry.
569 :
570 : bool
571 4117821 : ssa_cache::has_range (tree name) const
572 : {
573 4117821 : unsigned v = SSA_NAME_VERSION (name);
574 4117821 : if (v >= m_tab.length ())
575 : return false;
576 3685316 : return m_tab[v] != NULL;
577 : }
578 :
579 : // Retrieve the global range of NAME from cache memory if it exists.
580 : // Return the value in R.
581 :
582 : bool
583 1136368912 : ssa_cache::get_range (vrange &r, tree name) const
584 : {
585 1136368912 : unsigned v = SSA_NAME_VERSION (name);
586 1136368912 : if (v >= m_tab.length ())
587 : return false;
588 :
589 1124554277 : vrange_storage *stow = m_tab[v];
590 1124554277 : if (!stow)
591 : return false;
592 916333384 : stow->get_vrange (r, TREE_TYPE (name));
593 916333384 : return true;
594 : }
595 :
596 : // Set the range for NAME to R in the ssa cache.
597 : // Return TRUE if there was already a range set, otherwise false.
598 :
599 : bool
600 149100811 : ssa_cache::set_range (tree name, const vrange &r)
601 : {
602 149100811 : unsigned v = SSA_NAME_VERSION (name);
603 149100811 : if (v >= m_tab.length ())
604 15584012 : m_tab.safe_grow_cleared (num_ssa_names + 1);
605 :
606 149100811 : vrange_storage *m = m_tab[v];
607 149100811 : if (m && m->fits_p (r))
608 21022383 : m->set_vrange (r);
609 : else
610 128078428 : m_tab[v] = m_range_allocator->clone (r);
611 149100811 : return m != NULL;
612 : }
613 :
614 : // If NAME has a range, intersect it with R, otherwise set it to R.
615 : // Return TRUE if the range is new or changes.
616 :
617 : bool
618 122 : ssa_cache::merge_range (tree name, const vrange &r)
619 : {
620 122 : unsigned v = SSA_NAME_VERSION (name);
621 122 : if (v >= m_tab.length ())
622 12 : m_tab.safe_grow_cleared (num_ssa_names + 1);
623 :
624 122 : vrange_storage *m = m_tab[v];
625 : // Check if this is a new value.
626 122 : if (!m)
627 121 : m_tab[v] = m_range_allocator->clone (r);
628 : else
629 : {
630 1 : value_range curr (TREE_TYPE (name));
631 1 : m->get_vrange (curr, TREE_TYPE (name));
632 : // If there is no change, return false.
633 1 : if (!curr.intersect (r))
634 1 : return false;
635 :
636 0 : if (m->fits_p (curr))
637 0 : m->set_vrange (curr);
638 : else
639 0 : m_tab[v] = m_range_allocator->clone (curr);
640 1 : }
641 : return true;
642 : }
643 :
644 : // Set the range for NAME to R in the ssa cache.
645 :
646 : void
647 0 : ssa_cache::clear_range (tree name)
648 : {
649 0 : unsigned v = SSA_NAME_VERSION (name);
650 0 : if (v >= m_tab.length ())
651 : return;
652 0 : m_tab[v] = NULL;
653 : }
654 :
655 : // Clear the ssa cache.
656 :
657 : void
658 0 : ssa_cache::clear ()
659 : {
660 0 : if (m_tab.address ())
661 0 : memset (m_tab.address(), 0, m_tab.length () * sizeof (vrange *));
662 0 : }
663 :
664 : // Dump the contents of the ssa cache to F.
665 :
666 : void
667 61 : ssa_cache::dump (FILE *f)
668 : {
669 3138 : for (unsigned x = 1; x < num_ssa_names; x++)
670 : {
671 3077 : if (!gimple_range_ssa_p (ssa_name (x)))
672 1262 : continue;
673 1815 : value_range r (TREE_TYPE (ssa_name (x)));
674 : // Dump all non-varying ranges.
675 1815 : if (get_range (r, ssa_name (x)) && !r.varying_p ())
676 : {
677 298 : print_generic_expr (f, ssa_name (x), TDF_NONE);
678 298 : fprintf (f, " : ");
679 298 : r.dump (f);
680 298 : fprintf (f, "\n");
681 : }
682 1815 : }
683 :
684 61 : }
685 :
686 : // Construct an ssa_lazy_cache. If OB is specified, us it, otherwise use
687 : // a local bitmap obstack.
688 :
689 27459680 : ssa_lazy_cache::ssa_lazy_cache (bitmap_obstack *ob)
690 : {
691 27459680 : if (!ob)
692 : {
693 27459671 : bitmap_obstack_initialize (&m_bitmaps);
694 27459671 : m_ob = &m_bitmaps;
695 : }
696 : else
697 9 : m_ob = ob;
698 27459680 : active_p = BITMAP_ALLOC (m_ob);
699 27459680 : }
700 :
701 : // Destruct an sa_lazy_cache. Free the bitmap if it came from a different
702 : // obstack, or release the obstack if it was a local one.
703 :
704 27459671 : ssa_lazy_cache::~ssa_lazy_cache ()
705 : {
706 27459671 : if (m_ob == &m_bitmaps)
707 27459671 : bitmap_obstack_release (&m_bitmaps);
708 : else
709 0 : BITMAP_FREE (active_p);
710 27459671 : }
711 :
712 : // Return true if NAME has an active range in the cache.
713 :
714 : bool
715 259 : ssa_lazy_cache::has_range (tree name) const
716 : {
717 259 : return bitmap_bit_p (active_p, SSA_NAME_VERSION (name));
718 : }
719 :
720 : // Set range of NAME to R in a lazy cache. Return FALSE if it did not already
721 : // have a range.
722 :
723 : bool
724 99395414 : ssa_lazy_cache::set_range (tree name, const vrange &r)
725 : {
726 99395414 : unsigned v = SSA_NAME_VERSION (name);
727 99395414 : if (!bitmap_set_bit (active_p, v))
728 : {
729 : // There is already an entry, simply set it.
730 12401451 : gcc_checking_assert (v < m_tab.length ());
731 12401451 : return ssa_cache::set_range (name, r);
732 : }
733 86993963 : if (v >= m_tab.length ())
734 46356892 : m_tab.safe_grow (num_ssa_names + 1);
735 86993963 : m_tab[v] = m_range_allocator->clone (r);
736 86993963 : return false;
737 : }
738 :
739 : // If NAME has a range, intersect it with R, otherwise set it to R.
740 : // Return TRUE if the range is new or changes.
741 :
742 : bool
743 210 : ssa_lazy_cache::merge_range (tree name, const vrange &r)
744 : {
745 210 : unsigned v = SSA_NAME_VERSION (name);
746 210 : if (!bitmap_set_bit (active_p, v))
747 : {
748 : // There is already an entry, simply merge it.
749 1 : gcc_checking_assert (v < m_tab.length ());
750 1 : return ssa_cache::merge_range (name, r);
751 : }
752 209 : if (v >= m_tab.length ())
753 156 : m_tab.safe_grow (num_ssa_names + 1);
754 209 : m_tab[v] = m_range_allocator->clone (r);
755 209 : return true;
756 : }
757 :
758 : // Merge all elements of CACHE with this cache.
759 : // Any names in CACHE that are not in this one are added.
760 : // Any names in both are merged via merge_range..
761 :
762 : void
763 7 : ssa_lazy_cache::merge (const ssa_lazy_cache &cache)
764 : {
765 7 : unsigned x;
766 7 : bitmap_iterator bi;
767 57 : EXECUTE_IF_SET_IN_BITMAP (cache.active_p, 0, x, bi)
768 : {
769 50 : tree name = ssa_name (x);
770 50 : value_range r(TREE_TYPE (name));
771 50 : cache.get_range (r, name);
772 50 : merge_range (ssa_name (x), r);
773 50 : }
774 7 : }
775 :
776 : // Return TRUE if NAME has a range, and return it in R.
777 :
778 : bool
779 258687489 : ssa_lazy_cache::get_range (vrange &r, tree name) const
780 : {
781 258687489 : if (!bitmap_bit_p (active_p, SSA_NAME_VERSION (name)))
782 : return false;
783 108320323 : return ssa_cache::get_range (r, name);
784 : }
785 :
786 : // Remove NAME from the active range list.
787 :
788 : void
789 49592603 : ssa_lazy_cache::clear_range (tree name)
790 : {
791 49592603 : bitmap_clear_bit (active_p, SSA_NAME_VERSION (name));
792 49592603 : }
793 :
794 : // Remove all ranges from the active range list.
795 :
796 : void
797 33806203 : ssa_lazy_cache::clear ()
798 : {
799 33806203 : bitmap_clear (active_p);
800 33806203 : }
801 :
802 : // --------------------------------------------------------------------------
803 :
804 :
805 : // This class will manage the timestamps for each ssa_name.
806 : // When a value is calculated, the timestamp is set to the current time.
807 : // Current time is then incremented. Any dependencies will already have
808 : // been calculated, and will thus have older timestamps.
809 : // If one of those values is ever calculated again, it will get a newer
810 : // timestamp, and the "current_p" check will fail.
811 :
812 : class temporal_cache
813 : {
814 : public:
815 : temporal_cache ();
816 : ~temporal_cache ();
817 : bool current_p (tree name, tree dep1, tree dep2) const;
818 : void set_timestamp (tree name);
819 : void set_always_current (tree name, bool value);
820 : bool always_current_p (tree name) const;
821 : private:
822 : int temporal_value (unsigned ssa) const;
823 : int m_current_time;
824 : vec <int> m_timestamp;
825 : };
826 :
827 : inline
828 27858982 : temporal_cache::temporal_cache ()
829 : {
830 27858982 : m_current_time = 1;
831 27858982 : m_timestamp.create (0);
832 55717964 : m_timestamp.safe_grow_cleared (num_ssa_names);
833 27858982 : }
834 :
835 : inline
836 27858981 : temporal_cache::~temporal_cache ()
837 : {
838 27858981 : m_timestamp.release ();
839 27858981 : }
840 :
841 : // Return the timestamp value for SSA, or 0 if there isn't one.
842 :
843 : inline int
844 558957505 : temporal_cache::temporal_value (unsigned ssa) const
845 : {
846 558957505 : if (ssa >= m_timestamp.length ())
847 : return 0;
848 558957505 : return abs (m_timestamp[ssa]);
849 : }
850 :
851 : // Return TRUE if the timestamp for NAME is newer than any of its dependents.
852 : // Up to 2 dependencies can be checked.
853 :
854 : bool
855 336322545 : temporal_cache::current_p (tree name, tree dep1, tree dep2) const
856 : {
857 336322545 : if (always_current_p (name))
858 : return true;
859 :
860 : // Any non-registered dependencies will have a value of 0 and thus be older.
861 : // Return true if time is newer than either dependent.
862 330046301 : int ts = temporal_value (SSA_NAME_VERSION (name));
863 507936457 : if (dep1 && ts < temporal_value (SSA_NAME_VERSION (dep1)))
864 : return false;
865 330280411 : if (dep2 && ts < temporal_value (SSA_NAME_VERSION (dep2)))
866 6322551 : return false;
867 :
868 : return true;
869 : }
870 :
871 : // This increments the global timer and sets the timestamp for NAME.
872 :
873 : inline void
874 118724800 : temporal_cache::set_timestamp (tree name)
875 : {
876 118724800 : unsigned v = SSA_NAME_VERSION (name);
877 118724800 : if (v >= m_timestamp.length ())
878 0 : m_timestamp.safe_grow_cleared (num_ssa_names + 20);
879 118724800 : m_timestamp[v] = ++m_current_time;
880 118724800 : }
881 :
882 : // Set the timestamp to 0, marking it as "always up to date".
883 :
884 : inline void
885 272161716 : temporal_cache::set_always_current (tree name, bool value)
886 : {
887 272161716 : unsigned v = SSA_NAME_VERSION (name);
888 272161716 : if (v >= m_timestamp.length ())
889 1934 : m_timestamp.safe_grow_cleared (num_ssa_names + 20);
890 :
891 272161716 : int ts = abs (m_timestamp[v]);
892 : // If this does not have a timestamp, create one.
893 272161716 : if (ts == 0)
894 124264468 : ts = ++m_current_time;
895 272161716 : m_timestamp[v] = value ? -ts : ts;
896 272161716 : }
897 :
898 : // Return true if NAME is always current.
899 :
900 : inline bool
901 336322545 : temporal_cache::always_current_p (tree name) const
902 : {
903 336322545 : unsigned v = SSA_NAME_VERSION (name);
904 336322545 : if (v >= m_timestamp.length ())
905 : return false;
906 336322545 : return m_timestamp[v] <= 0;
907 : }
908 :
909 : // --------------------------------------------------------------------------
910 :
911 : // This class provides an abstraction of a list of blocks to be updated
912 : // by the cache. It is currently a stack but could be changed. It also
913 : // maintains a list of blocks which have failed propagation, and does not
914 : // enter any of those blocks into the list.
915 :
916 : // A vector over the BBs is maintained, and an entry of 0 means it is not in
917 : // a list. Otherwise, the entry is the next block in the list. -1 terminates
918 : // the list. m_head points to the top of the list, -1 if the list is empty.
919 :
920 : class update_list
921 : {
922 : public:
923 : update_list ();
924 : ~update_list ();
925 : void add (basic_block bb);
926 : basic_block pop ();
927 153669415 : inline bool empty_p () { return m_update_head == -1; }
928 5798192 : inline void clear_failures () { bitmap_clear (m_propfail); }
929 6 : inline void propagation_failed (basic_block bb)
930 6 : { bitmap_set_bit (m_propfail, bb->index); }
931 : private:
932 : vec<int> m_update_list;
933 : int m_update_head;
934 : bitmap m_propfail;
935 : bitmap_obstack m_bitmaps;
936 : };
937 :
938 : // Create an update list.
939 :
940 27858982 : update_list::update_list ()
941 : {
942 27858982 : m_update_list.create (0);
943 27858982 : m_update_list.safe_grow_cleared (last_basic_block_for_fn (cfun) + 64);
944 27858982 : m_update_head = -1;
945 27858982 : bitmap_obstack_initialize (&m_bitmaps);
946 27858982 : m_propfail = BITMAP_ALLOC (&m_bitmaps);
947 27858982 : }
948 :
949 : // Destroy an update list.
950 :
951 27858981 : update_list::~update_list ()
952 : {
953 27858981 : m_update_list.release ();
954 27858981 : bitmap_obstack_release (&m_bitmaps);
955 27858981 : }
956 :
957 : // Add BB to the list of blocks to update, unless it's already in the list.
958 :
959 : void
960 13418156 : update_list::add (basic_block bb)
961 : {
962 13418156 : int i = bb->index;
963 : // If propagation has failed for BB, or its already in the list, don't
964 : // add it again.
965 13418156 : if ((unsigned)i >= m_update_list.length ())
966 74 : m_update_list.safe_grow_cleared (i + 64);
967 13418156 : if (!m_update_list[i] && !bitmap_bit_p (m_propfail, i))
968 : {
969 12715863 : if (empty_p ())
970 : {
971 7187259 : m_update_head = i;
972 7187259 : m_update_list[i] = -1;
973 : }
974 : else
975 : {
976 5528604 : gcc_checking_assert (m_update_head > 0);
977 5528604 : m_update_list[i] = m_update_head;
978 5528604 : m_update_head = i;
979 : }
980 : }
981 13418156 : }
982 :
983 : // Remove a block from the list.
984 :
985 : basic_block
986 12715863 : update_list::pop ()
987 : {
988 12715863 : gcc_checking_assert (!empty_p ());
989 12715863 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, m_update_head);
990 12715863 : int pop = m_update_head;
991 12715863 : m_update_head = m_update_list[pop];
992 12715863 : m_update_list[pop] = 0;
993 12715863 : return bb;
994 : }
995 :
996 : // --------------------------------------------------------------------------
997 :
998 27858982 : ranger_cache::ranger_cache (int not_executable_flag, bool use_imm_uses)
999 : {
1000 27858982 : m_workback = vNULL;
1001 27858982 : m_temporal = new temporal_cache;
1002 :
1003 : // If DOM info is available, spawn an oracle as well.
1004 27858982 : create_relation_oracle ();
1005 : // Create an infer oracle using this cache as the range query. The cache
1006 : // version acts as a read-only query, and will spawn no additional lookups.
1007 : // It just ues what is already known.
1008 27858982 : create_infer_oracle (this, use_imm_uses);
1009 27858982 : create_gori (not_executable_flag, param_vrp_switch_limit);
1010 :
1011 27858982 : unsigned x, lim = last_basic_block_for_fn (cfun);
1012 : // Calculate outgoing range info upfront. This will fully populate the
1013 : // m_maybe_variant bitmap which will help eliminate processing of names
1014 : // which never have their ranges adjusted.
1015 355961743 : for (x = 0; x < lim ; x++)
1016 : {
1017 328102761 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, x);
1018 328102761 : if (bb)
1019 309169870 : gori_ssa ()->exports (bb);
1020 : }
1021 27858982 : m_update = new update_list ();
1022 27858982 : m_stale = BITMAP_ALLOC (NULL);
1023 27858982 : }
1024 :
1025 27858981 : ranger_cache::~ranger_cache ()
1026 : {
1027 27858981 : BITMAP_FREE (m_stale);
1028 27858981 : delete m_update;
1029 27858981 : destroy_infer_oracle ();
1030 27858981 : destroy_relation_oracle ();
1031 55717962 : delete m_temporal;
1032 27858981 : m_workback.release ();
1033 27858981 : }
1034 :
1035 : // Dump the global caches to file F. if GORI_DUMP is true, dump the
1036 : // gori map as well.
1037 :
1038 : void
1039 45 : ranger_cache::dump (FILE *f)
1040 : {
1041 45 : fprintf (f, "Non-varying global ranges:\n");
1042 45 : fprintf (f, "=========================:\n");
1043 45 : m_globals.dump (f);
1044 45 : fprintf (f, "\n");
1045 45 : }
1046 :
1047 : // Dump the caches for basic block BB to file F.
1048 :
1049 : void
1050 248 : ranger_cache::dump_bb (FILE *f, basic_block bb)
1051 : {
1052 248 : gori_ssa ()->dump (f, bb, false);
1053 248 : m_on_entry.dump (f, bb);
1054 248 : m_relation->dump (f, bb);
1055 248 : }
1056 :
1057 : // Get the global range for NAME, and return in R. Return false if the
1058 : // global range is not set, and return the legacy global value in R.
1059 :
1060 : bool
1061 817464147 : ranger_cache::get_global_range (vrange &r, tree name) const
1062 : {
1063 817464147 : if (m_globals.get_range (r, name))
1064 : return true;
1065 190860371 : gimple_range_global (r, name);
1066 190860371 : return false;
1067 : }
1068 :
1069 : // Mark NAME as stale. The next query of NAME forces a recalculation.
1070 :
1071 : void
1072 4117585 : ranger_cache::mark_stale (tree name)
1073 : {
1074 : // Only mark it as stale if it has been processed. If it has no range
1075 : // it will be calculated at the next request anyway.
1076 4117585 : if (m_globals.has_range (name))
1077 1582486 : bitmap_set_bit (m_stale, SSA_NAME_VERSION (name));
1078 4117585 : }
1079 :
1080 : // Get the global range for NAME, and return in R. Return false if the
1081 : // global range is not set, and R will contain the legacy global value.
1082 : // CURRENT_P is set to true if the value was in cache and not stale.
1083 : // Otherwise, set CURRENT_P to false and mark as it always current.
1084 : // If the global cache did not have a value, initialize it as well.
1085 : // After this call, the global cache will have a value.
1086 :
1087 : bool
1088 337048175 : ranger_cache::get_global_range (vrange &r, tree name, bool ¤t_p)
1089 : {
1090 337048175 : bool had_global = get_global_range (r, name);
1091 :
1092 : // If there was a global value, set current flag, otherwise set a value.
1093 337048175 : current_p = false;
1094 337048175 : if (had_global)
1095 425677548 : current_p = r.singleton_p ()
1096 425455553 : || m_temporal->current_p (name, gori_ssa ()->depend1 (name),
1097 212616779 : gori_ssa ()->depend2 (name));
1098 : else
1099 : {
1100 : // If no global value has been set and value is VARYING, fold the stmt
1101 : // using just global ranges to get a better initial value.
1102 : // After inlining we tend to decide some things are constant, so
1103 : // so not do this evaluation after inlining.
1104 124209401 : if (r.varying_p () && !cfun->after_inlining)
1105 : {
1106 20300848 : gimple *s = SSA_NAME_DEF_STMT (name);
1107 : // Do not process PHIs as SCEV may be in use and it can
1108 : // spawn cyclic lookups.
1109 20300848 : if (gimple_get_lhs (s) == name && !is_a<gphi *> (s))
1110 : {
1111 15890895 : if (!fold_range (r, s, get_global_range_query ()))
1112 0 : gimple_range_global (r, name);
1113 : }
1114 : }
1115 124209401 : m_globals.set_range (name, r);
1116 : }
1117 :
1118 : // If NAME is out of date, clear the bit and mark as not current.
1119 337048175 : if (bitmap_bit_p (m_stale, SSA_NAME_VERSION (name)))
1120 : {
1121 417399 : bitmap_clear_bit (m_stale, SSA_NAME_VERSION (name));
1122 417399 : current_p = false;
1123 : }
1124 :
1125 : // If the existing value was not current, mark it as always current.
1126 337048175 : if (!current_p)
1127 135965991 : m_temporal->set_always_current (name, true);
1128 337048175 : return had_global;
1129 : }
1130 :
1131 : // Consumers of NAME that have already calculated values should recalculate.
1132 : // Accomplished by updating the timestamp.
1133 :
1134 : void
1135 60499472 : ranger_cache::update_consumers (tree name)
1136 : {
1137 60499472 : m_temporal->set_timestamp (name);
1138 60499472 : }
1139 :
1140 : // Set the global range of NAME to R and give it a timestamp.
1141 :
1142 : void
1143 136195725 : ranger_cache::set_global_range (tree name, const vrange &r, bool changed)
1144 : {
1145 : // Setting a range always clears the always_current flag.
1146 136195725 : m_temporal->set_always_current (name, false);
1147 136195725 : if (!changed)
1148 : {
1149 : // If there are dependencies, make sure this is not out of date.
1150 123705766 : if (!m_temporal->current_p (name, gori_ssa ()->depend1 (name),
1151 123705766 : gori_ssa ()->depend2 (name)))
1152 45735369 : m_temporal->set_timestamp (name);
1153 123705766 : return;
1154 : }
1155 12489959 : if (m_globals.set_range (name, r))
1156 : {
1157 : // If there was already a range set, propagate the new value.
1158 12434891 : basic_block bb = gimple_bb (SSA_NAME_DEF_STMT (name));
1159 12434891 : if (!bb)
1160 1213 : bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
1161 :
1162 12434891 : if (DEBUG_RANGE_CACHE)
1163 0 : fprintf (dump_file, " GLOBAL :");
1164 :
1165 12434891 : propagate_updated_value (name, bb);
1166 : }
1167 : // Constants no longer need to tracked. Any further refinement has to be
1168 : // undefined. Propagation works better with constants. PR 100512.
1169 : // Pointers which resolve to non-zero also do not need
1170 : // tracking in the cache as they will never change. See PR 98866.
1171 : // Timestamp must always be updated, or dependent calculations may
1172 : // not include this latest value. PR 100774.
1173 :
1174 12489959 : if (r.singleton_p ()
1175 12489959 : || (POINTER_TYPE_P (TREE_TYPE (name)) && r.nonzero_p ()))
1176 2246231 : gori_ssa ()->set_range_invariant (name);
1177 12489959 : m_temporal->set_timestamp (name);
1178 : }
1179 :
1180 : // Provide lookup for the gori-computes class to access the best known range
1181 : // of an ssa_name in any given basic block. Note, this does no additional
1182 : // lookups, just accesses the data that is already known.
1183 :
1184 : // Get the range of NAME when the def occurs in block BB. If BB is NULL
1185 : // get the best global value available.
1186 :
1187 : void
1188 210583453 : ranger_cache::range_of_def (vrange &r, tree name, basic_block bb)
1189 : {
1190 210583453 : gcc_checking_assert (gimple_range_ssa_p (name));
1191 353401570 : gcc_checking_assert (!bb || bb == gimple_bb (SSA_NAME_DEF_STMT (name)));
1192 :
1193 : // Pick up the best global range available.
1194 210583453 : if (!m_globals.get_range (r, name))
1195 : {
1196 : // If that fails, try to calculate the range using just global values.
1197 29175136 : gimple *s = SSA_NAME_DEF_STMT (name);
1198 29175136 : if (gimple_get_lhs (s) == name)
1199 25978409 : fold_range (r, s, get_global_range_query ());
1200 : else
1201 3196727 : gimple_range_global (r, name);
1202 : }
1203 210583453 : }
1204 :
1205 : // Get the range of NAME as it occurs on entry to block BB. Use MODE for
1206 : // lookups.
1207 :
1208 : void
1209 149261866 : ranger_cache::entry_range (vrange &r, tree name, basic_block bb,
1210 : enum rfd_mode mode)
1211 : {
1212 149261866 : if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun))
1213 : {
1214 0 : gimple_range_global (r, name);
1215 0 : return;
1216 : }
1217 :
1218 : // If NAME is invariant, simply return the defining range.
1219 149261866 : if (!gori ().has_edge_range_p (name))
1220 : {
1221 32727809 : range_of_def (r, name);
1222 32727809 : return;
1223 : }
1224 :
1225 : // Look for the on-entry value of name in BB from the cache.
1226 : // Otherwise pick up the best available global value.
1227 116534057 : if (!m_on_entry.get_bb_range (r, name, bb))
1228 41401477 : if (!range_from_dom (r, name, bb, mode))
1229 35037527 : range_of_def (r, name);
1230 : }
1231 :
1232 : // Get the range of NAME as it occurs on exit from block BB. Use MODE for
1233 : // lookups.
1234 :
1235 : void
1236 108641044 : ranger_cache::exit_range (vrange &r, tree name, basic_block bb,
1237 : enum rfd_mode mode)
1238 : {
1239 108641044 : if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun))
1240 : {
1241 60658 : gimple_range_global (r, name);
1242 60658 : return;
1243 : }
1244 :
1245 108580386 : gimple *s = SSA_NAME_DEF_STMT (name);
1246 108580386 : basic_block def_bb = gimple_bb (s);
1247 108580386 : if (def_bb == bb)
1248 45390011 : range_of_def (r, name, bb);
1249 : else
1250 63190375 : entry_range (r, name, bb, mode);
1251 : }
1252 :
1253 : // Get the range of NAME on edge E using MODE, return the result in R.
1254 : // Always returns a range and true.
1255 :
1256 : bool
1257 98486639 : ranger_cache::edge_range (vrange &r, edge e, tree name, enum rfd_mode mode)
1258 : {
1259 98486639 : exit_range (r, name, e->src, mode);
1260 : // If this is not an abnormal edge, check for inferred ranges on exit.
1261 98486639 : if ((e->flags & (EDGE_EH | EDGE_ABNORMAL)) == 0)
1262 98182821 : infer_oracle ().maybe_adjust_range (r, name, e->src);
1263 98486639 : value_range er (TREE_TYPE (name));
1264 98486639 : if (gori ().edge_range_p (er, e, name, *this))
1265 22228822 : r.intersect (er);
1266 196973278 : return true;
1267 98486639 : }
1268 :
1269 :
1270 :
1271 : // Implement range_of_expr.
1272 :
1273 : bool
1274 223061017 : ranger_cache::range_of_expr (vrange &r, tree name, gimple *stmt)
1275 : {
1276 223061017 : if (!gimple_range_ssa_p (name))
1277 39561420 : get_tree_range (r, name, stmt);
1278 : /* If no context is provided, pick up the global value. */
1279 183499597 : else if (!stmt)
1280 0 : get_global_range (r, name);
1281 : else
1282 : {
1283 183499597 : basic_block bb = gimple_bb (stmt);
1284 183499597 : gimple *def_stmt = SSA_NAME_DEF_STMT (name);
1285 183499597 : basic_block def_bb = gimple_bb (def_stmt);
1286 :
1287 183499597 : if (bb == def_bb)
1288 97428106 : range_of_def (r, name, bb);
1289 : else
1290 86071491 : entry_range (r, name, bb, RFD_NONE);
1291 : }
1292 223061017 : return true;
1293 : }
1294 :
1295 :
1296 : // Implement range_on_edge. Always return the best available range using
1297 : // the current cache values.
1298 :
1299 : bool
1300 73319285 : ranger_cache::range_on_edge (vrange &r, edge e, tree expr)
1301 : {
1302 73319285 : if (gimple_range_ssa_p (expr))
1303 70515296 : return edge_range (r, e, expr, RFD_NONE);
1304 2803989 : return get_tree_range (r, expr, NULL);
1305 : }
1306 :
1307 : // Return a static range for NAME on entry to basic block BB in R. If
1308 : // calc is true, fill any cache entries required between BB and the
1309 : // def block for NAME. Otherwise, return false if the cache is empty.
1310 :
1311 : bool
1312 376432602 : ranger_cache::block_range (vrange &r, basic_block bb, tree name, bool calc)
1313 : {
1314 376432602 : gcc_checking_assert (gimple_range_ssa_p (name));
1315 :
1316 : // If there are no range calculations anywhere in the IL, global range
1317 : // applies everywhere, so don't bother caching it.
1318 376432602 : if (!gori ().has_edge_range_p (name))
1319 : return false;
1320 :
1321 236399898 : if (calc)
1322 : {
1323 116227951 : gimple *def_stmt = SSA_NAME_DEF_STMT (name);
1324 116227951 : basic_block def_bb = NULL;
1325 116227951 : if (def_stmt)
1326 116227951 : def_bb = gimple_bb (def_stmt);
1327 116227951 : if (!def_bb)
1328 : {
1329 : // If we get to the entry block, this better be a default def
1330 : // or range_on_entry was called for a block not dominated by
1331 : // the def. But it could be also SSA_NAME defined by a statement
1332 : // not yet in the IL (such as queued edge insertion), in that case
1333 : // just punt.
1334 16636286 : if (!SSA_NAME_IS_DEFAULT_DEF (name))
1335 : return false;
1336 16636285 : def_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
1337 : }
1338 :
1339 : // There is no range on entry for the definition block.
1340 116227950 : if (def_bb == bb)
1341 : return false;
1342 :
1343 : // Otherwise, go figure out what is known in predecessor blocks.
1344 115874846 : fill_block_cache (name, bb, def_bb);
1345 115874846 : gcc_checking_assert (m_on_entry.bb_range_p (name, bb));
1346 : }
1347 236046793 : return m_on_entry.get_bb_range (r, name, bb);
1348 : }
1349 :
1350 : // If there is anything in the propagation update_list, continue
1351 : // processing NAME until the list of blocks is empty.
1352 :
1353 : void
1354 5798192 : ranger_cache::propagate_cache (tree name)
1355 : {
1356 5798192 : basic_block bb;
1357 5798192 : edge_iterator ei;
1358 5798192 : edge e;
1359 5798192 : tree type = TREE_TYPE (name);
1360 5798192 : value_range new_range (type);
1361 5798192 : value_range current_range (type);
1362 5798192 : value_range e_range (type);
1363 :
1364 : // Process each block by seeing if its calculated range on entry is
1365 : // the same as its cached value. If there is a difference, update
1366 : // the cache to reflect the new value, and check to see if any
1367 : // successors have cache entries which may need to be checked for
1368 : // updates.
1369 :
1370 24312247 : while (!m_update->empty_p ())
1371 : {
1372 12715863 : bb = m_update->pop ();
1373 12715863 : gcc_checking_assert (m_on_entry.bb_range_p (name, bb));
1374 12715863 : m_on_entry.get_bb_range (current_range, name, bb);
1375 :
1376 12715863 : if (DEBUG_RANGE_CACHE)
1377 : {
1378 0 : fprintf (dump_file, "FWD visiting block %d for ", bb->index);
1379 0 : print_generic_expr (dump_file, name, TDF_SLIM);
1380 0 : fprintf (dump_file, " starting range : ");
1381 0 : current_range.dump (dump_file);
1382 0 : fprintf (dump_file, "\n");
1383 : }
1384 :
1385 : // Calculate the "new" range on entry by unioning the pred edges.
1386 12715863 : new_range.set_undefined ();
1387 27133922 : FOR_EACH_EDGE (e, ei, bb->preds)
1388 : {
1389 17882931 : edge_range (e_range, e, name, RFD_READ_ONLY);
1390 17882931 : if (DEBUG_RANGE_CACHE)
1391 : {
1392 0 : fprintf (dump_file, " edge %d->%d :", e->src->index, bb->index);
1393 0 : e_range.dump (dump_file);
1394 0 : fprintf (dump_file, "\n");
1395 : }
1396 17882931 : new_range.union_ (e_range);
1397 17882931 : if (new_range.varying_p ())
1398 : break;
1399 : }
1400 :
1401 : // If the range on entry has changed, update it.
1402 12715863 : if (new_range != current_range)
1403 : {
1404 7316523 : bool ok_p = m_on_entry.set_bb_range (name, bb, new_range);
1405 : // If the cache couldn't set the value, mark it as failed.
1406 7316523 : if (!ok_p)
1407 6 : m_update->propagation_failed (bb);
1408 7316523 : if (DEBUG_RANGE_CACHE)
1409 : {
1410 0 : if (!ok_p)
1411 : {
1412 0 : fprintf (dump_file, " Cache failure to store value:");
1413 0 : print_generic_expr (dump_file, name, TDF_SLIM);
1414 0 : fprintf (dump_file, " ");
1415 : }
1416 : else
1417 : {
1418 0 : fprintf (dump_file, " Updating range to ");
1419 0 : new_range.dump (dump_file);
1420 : }
1421 0 : fprintf (dump_file, "\n Updating blocks :");
1422 : }
1423 : // Mark each successor that has a range to re-check its range
1424 18767747 : FOR_EACH_EDGE (e, ei, bb->succs)
1425 11451224 : if (m_on_entry.bb_range_p (name, e->dest))
1426 : {
1427 7012523 : if (DEBUG_RANGE_CACHE)
1428 0 : fprintf (dump_file, " bb%d",e->dest->index);
1429 7012523 : m_update->add (e->dest);
1430 : }
1431 7316523 : if (DEBUG_RANGE_CACHE)
1432 0 : fprintf (dump_file, "\n");
1433 : }
1434 : }
1435 5798192 : if (DEBUG_RANGE_CACHE)
1436 : {
1437 0 : fprintf (dump_file, "DONE visiting blocks for ");
1438 0 : print_generic_expr (dump_file, name, TDF_SLIM);
1439 0 : fprintf (dump_file, "\n");
1440 : }
1441 5798192 : m_update->clear_failures ();
1442 5798192 : }
1443 :
1444 : // Check to see if an update to the value for NAME in BB has any effect
1445 : // on values already in the on-entry cache for successor blocks.
1446 : // If it does, update them. Don't visit any blocks which don't have a cache
1447 : // entry.
1448 :
1449 : void
1450 54398915 : ranger_cache::propagate_updated_value (tree name, basic_block bb)
1451 : {
1452 54398915 : edge e;
1453 54398915 : edge_iterator ei;
1454 :
1455 : // The update work list should be empty at this point.
1456 54398915 : gcc_checking_assert (m_update->empty_p ());
1457 54398915 : gcc_checking_assert (bb);
1458 :
1459 54398915 : if (DEBUG_RANGE_CACHE)
1460 : {
1461 0 : fprintf (dump_file, " UPDATE cache for ");
1462 0 : print_generic_expr (dump_file, name, TDF_SLIM);
1463 0 : fprintf (dump_file, " in BB %d : successors : ", bb->index);
1464 : }
1465 157823844 : FOR_EACH_EDGE (e, ei, bb->succs)
1466 : {
1467 : // Only update active cache entries.
1468 103424929 : if (m_on_entry.bb_range_p (name, e->dest))
1469 : {
1470 4938607 : m_update->add (e->dest);
1471 4938607 : if (DEBUG_RANGE_CACHE)
1472 0 : fprintf (dump_file, " UPDATE: bb%d", e->dest->index);
1473 : }
1474 : }
1475 54398915 : if (!m_update->empty_p ())
1476 : {
1477 4872388 : if (DEBUG_RANGE_CACHE)
1478 0 : fprintf (dump_file, "\n");
1479 4872388 : propagate_cache (name);
1480 : }
1481 : else
1482 : {
1483 49526527 : if (DEBUG_RANGE_CACHE)
1484 0 : fprintf (dump_file, " : No updates!\n");
1485 : }
1486 54398915 : }
1487 :
1488 : // Make sure that the range-on-entry cache for NAME is set for block BB.
1489 : // Work back through the CFG to DEF_BB ensuring the range is calculated
1490 : // on the block/edges leading back to that point.
1491 :
1492 : void
1493 115874846 : ranger_cache::fill_block_cache (tree name, basic_block bb, basic_block def_bb)
1494 : {
1495 115874846 : edge_iterator ei;
1496 115874846 : edge e;
1497 115874846 : tree type = TREE_TYPE (name);
1498 115874846 : value_range block_result (type);
1499 115874846 : value_range undefined (type);
1500 :
1501 : // At this point we shouldn't be looking at the def, entry block.
1502 115874846 : gcc_checking_assert (bb != def_bb && bb != ENTRY_BLOCK_PTR_FOR_FN (cfun));
1503 115874846 : unsigned start_length = m_workback.length ();
1504 :
1505 : // If the block cache is set, then we've already visited this block.
1506 115874846 : if (m_on_entry.bb_range_p (name, bb))
1507 : return;
1508 :
1509 50601876 : if (DEBUG_RANGE_CACHE)
1510 : {
1511 0 : fprintf (dump_file, "\n");
1512 0 : print_generic_expr (dump_file, name, TDF_SLIM);
1513 0 : fprintf (dump_file, " : ");
1514 : }
1515 :
1516 : // Check if a dominators can supply the range.
1517 50601876 : if (range_from_dom (block_result, name, bb, RFD_FILL))
1518 : {
1519 49676072 : if (DEBUG_RANGE_CACHE)
1520 : {
1521 0 : fprintf (dump_file, "Filled from dominator! : ");
1522 0 : block_result.dump (dump_file);
1523 0 : fprintf (dump_file, "\n");
1524 : }
1525 : // See if any equivalences can refine it.
1526 : // PR 109462, like 108139 below, a one way equivalence introduced
1527 : // by a PHI node can also be through the definition side. Disallow it.
1528 49676072 : tree equiv_name;
1529 49676072 : relation_kind rel;
1530 49676072 : int prec = TYPE_PRECISION (type);
1531 : // If there are too many basic blocks, do not attempt to process
1532 : // equivalencies.
1533 49676072 : if (last_basic_block_for_fn (cfun) > param_vrp_sparse_threshold)
1534 : {
1535 385279 : m_on_entry.set_bb_range (name, bb, block_result);
1536 770528 : gcc_checking_assert (m_workback.length () == start_length);
1537 : return;
1538 : }
1539 58518782 : FOR_EACH_PARTIAL_AND_FULL_EQUIV (m_relation, bb, name, equiv_name, rel)
1540 : {
1541 9227989 : basic_block equiv_bb = gimple_bb (SSA_NAME_DEF_STMT (equiv_name));
1542 :
1543 : // Ignore partial equivs that are smaller than this object.
1544 16484695 : if (rel != VREL_EQ && prec > pe_to_bits (rel))
1545 3527861 : continue;
1546 :
1547 : // Check if the equiv has any ranges calculated.
1548 8231599 : if (!gori ().has_edge_range_p (equiv_name))
1549 351341 : continue;
1550 :
1551 : // Check if the equiv definition dominates this block
1552 7880258 : if (equiv_bb == bb ||
1553 7668451 : (equiv_bb && !dominated_by_p (CDI_DOMINATORS, bb, equiv_bb)))
1554 2180130 : continue;
1555 :
1556 5700128 : if (DEBUG_RANGE_CACHE)
1557 : {
1558 0 : if (rel == VREL_EQ)
1559 0 : fprintf (dump_file, "Checking Equivalence (");
1560 : else
1561 0 : fprintf (dump_file, "Checking Partial equiv (");
1562 0 : print_relation (dump_file, rel);
1563 0 : fprintf (dump_file, ") ");
1564 0 : print_generic_expr (dump_file, equiv_name, TDF_SLIM);
1565 0 : fprintf (dump_file, "\n");
1566 : }
1567 5700128 : value_range equiv_range (TREE_TYPE (equiv_name));
1568 5700128 : if (range_from_dom (equiv_range, equiv_name, bb, RFD_READ_ONLY))
1569 : {
1570 5700128 : if (rel != VREL_EQ)
1571 3976680 : range_cast (equiv_range, type);
1572 : else
1573 1723448 : adjust_equivalence_range (equiv_range);
1574 :
1575 5700128 : if (block_result.intersect (equiv_range))
1576 : {
1577 324931 : if (DEBUG_RANGE_CACHE)
1578 : {
1579 0 : if (rel == VREL_EQ)
1580 0 : fprintf (dump_file, "Equivalence update! : ");
1581 : else
1582 0 : fprintf (dump_file, "Partial equiv update! : ");
1583 0 : print_generic_expr (dump_file, equiv_name, TDF_SLIM);
1584 0 : fprintf (dump_file, " has range : ");
1585 0 : equiv_range.dump (dump_file);
1586 0 : fprintf (dump_file, " refining range to :");
1587 0 : block_result.dump (dump_file);
1588 0 : fprintf (dump_file, "\n");
1589 : }
1590 : }
1591 : }
1592 5700128 : }
1593 :
1594 49290793 : m_on_entry.set_bb_range (name, bb, block_result);
1595 96027068 : gcc_checking_assert (m_workback.length () == start_length);
1596 : return;
1597 : }
1598 :
1599 : // Visit each block back to the DEF. Initialize each one to UNDEFINED.
1600 : // m_visited at the end will contain all the blocks that we needed to set
1601 : // the range_on_entry cache for.
1602 925804 : m_workback.safe_push (bb);
1603 925804 : undefined.set_undefined ();
1604 925804 : m_on_entry.set_bb_range (name, bb, undefined);
1605 925804 : gcc_checking_assert (m_update->empty_p ());
1606 :
1607 6231691 : while (m_workback.length () > start_length)
1608 : {
1609 5305887 : basic_block node = m_workback.pop ();
1610 5305887 : if (DEBUG_RANGE_CACHE)
1611 : {
1612 0 : fprintf (dump_file, "BACK visiting block %d for ", node->index);
1613 0 : print_generic_expr (dump_file, name, TDF_SLIM);
1614 0 : fprintf (dump_file, "\n");
1615 : }
1616 :
1617 12705601 : FOR_EACH_EDGE (e, ei, node->preds)
1618 : {
1619 7399714 : basic_block pred = e->src;
1620 7399714 : value_range r (TREE_TYPE (name));
1621 :
1622 7399714 : if (DEBUG_RANGE_CACHE)
1623 0 : fprintf (dump_file, " %d->%d ",e->src->index, e->dest->index);
1624 :
1625 : // If the pred block is the def block add this BB to update list.
1626 7399714 : if (pred == def_bb)
1627 : {
1628 876187 : m_update->add (node);
1629 876187 : continue;
1630 : }
1631 :
1632 : // If the pred is entry but NOT def, then it is used before
1633 : // defined, it'll get set to [] and no need to update it.
1634 6523527 : if (pred == ENTRY_BLOCK_PTR_FOR_FN (cfun))
1635 : {
1636 0 : if (DEBUG_RANGE_CACHE)
1637 0 : fprintf (dump_file, "entry: bail.");
1638 0 : continue;
1639 : }
1640 :
1641 : // Regardless of whether we have visited pred or not, if the
1642 : // pred has inferred ranges, revisit this block.
1643 : // Don't search the DOM tree.
1644 6523527 : if (infer_oracle ().has_range_p (pred, name))
1645 : {
1646 12031 : if (DEBUG_RANGE_CACHE)
1647 0 : fprintf (dump_file, "Inferred range: update ");
1648 12031 : m_update->add (node);
1649 : }
1650 :
1651 : // If the pred block already has a range, or if it can contribute
1652 : // something new. Ie, the edge generates a range of some sort.
1653 6523527 : if (m_on_entry.get_bb_range (r, name, pred))
1654 : {
1655 2143444 : if (DEBUG_RANGE_CACHE)
1656 : {
1657 0 : fprintf (dump_file, "has cache, ");
1658 0 : r.dump (dump_file);
1659 0 : fprintf (dump_file, ", ");
1660 : }
1661 2143444 : if (!r.undefined_p () || gori ().has_edge_range_p (name, e))
1662 : {
1663 578808 : m_update->add (node);
1664 578808 : if (DEBUG_RANGE_CACHE)
1665 0 : fprintf (dump_file, "update. ");
1666 : }
1667 2143444 : continue;
1668 : }
1669 :
1670 4380083 : if (DEBUG_RANGE_CACHE)
1671 0 : fprintf (dump_file, "pushing undefined pred block.\n");
1672 : // If the pred hasn't been visited (has no range), add it to
1673 : // the list.
1674 4380083 : gcc_checking_assert (!m_on_entry.bb_range_p (name, pred));
1675 4380083 : m_on_entry.set_bb_range (name, pred, undefined);
1676 4380083 : m_workback.safe_push (pred);
1677 7399714 : }
1678 : }
1679 :
1680 925804 : if (DEBUG_RANGE_CACHE)
1681 0 : fprintf (dump_file, "\n");
1682 :
1683 : // Now fill in the marked blocks with values.
1684 925804 : propagate_cache (name);
1685 925804 : if (DEBUG_RANGE_CACHE)
1686 0 : fprintf (dump_file, " Propagation update done.\n");
1687 115874846 : }
1688 :
1689 : // Resolve the range of BB if the dominators range is R by calculating incoming
1690 : // edges to this block. All lead back to the dominator so should be cheap.
1691 : // The range for BB is set and returned in R.
1692 :
1693 : void
1694 4266547 : ranger_cache::resolve_dom (vrange &r, tree name, basic_block bb)
1695 : {
1696 4266547 : basic_block def_bb = gimple_bb (SSA_NAME_DEF_STMT (name));
1697 4266547 : basic_block dom_bb = get_immediate_dominator (CDI_DOMINATORS, bb);
1698 :
1699 : // if it doesn't already have a value, store the incoming range.
1700 4266547 : if (!m_on_entry.bb_range_p (name, dom_bb) && def_bb != dom_bb)
1701 : {
1702 : // If the range can't be store, don't try to accumulate
1703 : // the range in PREV_BB due to excessive recalculations.
1704 1105727 : if (!m_on_entry.set_bb_range (name, dom_bb, r))
1705 0 : return;
1706 : }
1707 : // With the dominator set, we should be able to cheaply query
1708 : // each incoming edge now and accumulate the results.
1709 4266547 : r.set_undefined ();
1710 4266547 : edge e;
1711 4266547 : edge_iterator ei;
1712 4266547 : value_range er (TREE_TYPE (name));
1713 14377675 : FOR_EACH_EDGE (e, ei, bb->preds)
1714 : {
1715 : // If the predecessor is dominated by this block, then there is a back
1716 : // edge, and won't provide anything useful. We'll actually end up with
1717 : // VARYING as we will not resolve this node.
1718 10111128 : if (dominated_by_p (CDI_DOMINATORS, e->src, bb))
1719 22716 : continue;
1720 10088412 : edge_range (er, e, name, RFD_READ_ONLY);
1721 10088412 : r.union_ (er);
1722 : }
1723 : // Set the cache in PREV_BB so it is not calculated again.
1724 4266547 : m_on_entry.set_bb_range (name, bb, r);
1725 4266547 : }
1726 :
1727 : // Get the range of NAME from dominators of BB and return it in R. Search the
1728 : // dominator tree based on MODE.
1729 :
1730 : bool
1731 97703481 : ranger_cache::range_from_dom (vrange &r, tree name, basic_block start_bb,
1732 : enum rfd_mode mode)
1733 : {
1734 97703481 : if (mode == RFD_NONE || !dom_info_available_p (CDI_DOMINATORS))
1735 35963331 : return false;
1736 :
1737 : // Search back to the definition block or entry block.
1738 61740150 : basic_block def_bb = gimple_bb (SSA_NAME_DEF_STMT (name));
1739 61740150 : if (def_bb == NULL)
1740 7852897 : def_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
1741 :
1742 61740150 : basic_block bb;
1743 61740150 : basic_block prev_bb = start_bb;
1744 :
1745 : // Track any inferred ranges seen.
1746 61740150 : value_range infer (TREE_TYPE (name));
1747 61740150 : infer.set_varying (TREE_TYPE (name));
1748 :
1749 : // Range on entry to the DEF block should not be queried.
1750 61740150 : gcc_checking_assert (start_bb != def_bb);
1751 61740150 : unsigned start_limit = m_workback.length ();
1752 :
1753 : // Default value is global range.
1754 61740150 : get_global_range (r, name);
1755 :
1756 : // The dominator of EXIT_BLOCK doesn't seem to be set, so at least handle
1757 : // the common single exit cases.
1758 61869001 : if (start_bb == EXIT_BLOCK_PTR_FOR_FN (cfun) && single_pred_p (start_bb))
1759 128625 : bb = single_pred_edge (start_bb)->src;
1760 : else
1761 61611525 : bb = get_immediate_dominator (CDI_DOMINATORS, start_bb);
1762 :
1763 : // Search until a value is found, pushing blocks which may need calculating.
1764 365052570 : for ( ; bb; prev_bb = bb, bb = get_immediate_dominator (CDI_DOMINATORS, bb))
1765 : {
1766 : // Accumulate any block exit inferred ranges.
1767 364371386 : infer_oracle ().maybe_adjust_range (infer, name, bb);
1768 :
1769 : // This block has an outgoing range.
1770 364371386 : if (gori ().has_edge_range_p (name, bb))
1771 43540009 : m_workback.safe_push (prev_bb);
1772 : else
1773 : {
1774 : // Normally join blocks don't carry any new range information on
1775 : // incoming edges. If the first incoming edge to this block does
1776 : // generate a range, calculate the ranges if all incoming edges
1777 : // are also dominated by the dominator. (Avoids backedges which
1778 : // will break the rule of moving only upward in the dominator tree).
1779 : // If the first pred does not generate a range, then we will be
1780 : // using the dominator range anyway, so that's all the check needed.
1781 320831377 : if (EDGE_COUNT (prev_bb->preds) > 1
1782 320831377 : && gori ().has_edge_range_p (name, EDGE_PRED (prev_bb, 0)->src))
1783 : {
1784 737057 : edge e;
1785 737057 : edge_iterator ei;
1786 737057 : bool all_dom = true;
1787 2511657 : FOR_EACH_EDGE (e, ei, prev_bb->preds)
1788 1774600 : if (e->src != bb
1789 1774600 : && !dominated_by_p (CDI_DOMINATORS, e->src, bb))
1790 : {
1791 : all_dom = false;
1792 : break;
1793 : }
1794 737057 : if (all_dom)
1795 737057 : m_workback.safe_push (prev_bb);
1796 : }
1797 : }
1798 :
1799 364371386 : if (def_bb == bb)
1800 : break;
1801 :
1802 326134069 : if (m_on_entry.get_bb_range (r, name, bb))
1803 : break;
1804 : }
1805 :
1806 61740150 : if (DEBUG_RANGE_CACHE)
1807 : {
1808 0 : fprintf (dump_file, "CACHE: BB %d DOM query for ", start_bb->index);
1809 0 : print_generic_expr (dump_file, name, TDF_SLIM);
1810 0 : fprintf (dump_file, ", found ");
1811 0 : r.dump (dump_file);
1812 0 : if (bb)
1813 0 : fprintf (dump_file, " at BB%d\n", bb->index);
1814 : else
1815 0 : fprintf (dump_file, " at function top\n");
1816 : }
1817 :
1818 : // Now process any blocks wit incoming edges that nay have adjustments.
1819 106017216 : while (m_workback.length () > start_limit)
1820 : {
1821 44277066 : value_range er (TREE_TYPE (name));
1822 44277066 : prev_bb = m_workback.pop ();
1823 44277066 : if (!single_pred_p (prev_bb))
1824 : {
1825 : // Non single pred means we need to cache a value in the dominator
1826 : // so we can cheaply calculate incoming edges to this block, and
1827 : // then store the resulting value. If processing mode is not
1828 : // RFD_FILL, then the cache cant be stored to, so don't try.
1829 : // Otherwise this becomes a quadratic timed calculation.
1830 6415308 : if (mode == RFD_FILL)
1831 4266547 : resolve_dom (r, name, prev_bb);
1832 6415308 : continue;
1833 : }
1834 :
1835 37861758 : edge e = single_pred_edge (prev_bb);
1836 37861758 : bb = e->src;
1837 37861758 : if (gori ().edge_range_p (er, e, name, *this))
1838 : {
1839 34278650 : r.intersect (er);
1840 : // If this is a normal edge, apply any inferred ranges.
1841 34278650 : if ((e->flags & (EDGE_EH | EDGE_ABNORMAL)) == 0)
1842 34278650 : infer_oracle ().maybe_adjust_range (r, name, bb);
1843 :
1844 34278650 : if (DEBUG_RANGE_CACHE)
1845 : {
1846 0 : fprintf (dump_file, "CACHE: Adjusted edge range for %d->%d : ",
1847 : bb->index, prev_bb->index);
1848 0 : r.dump (dump_file);
1849 0 : fprintf (dump_file, "\n");
1850 : }
1851 : }
1852 44277066 : }
1853 :
1854 : // Apply non-null if appropriate.
1855 61740150 : if (!has_abnormal_call_or_eh_pred_edge_p (start_bb))
1856 61564980 : r.intersect (infer);
1857 :
1858 61740150 : if (DEBUG_RANGE_CACHE)
1859 : {
1860 0 : fprintf (dump_file, "CACHE: Range for DOM returns : ");
1861 0 : r.dump (dump_file);
1862 0 : fprintf (dump_file, "\n");
1863 : }
1864 61740150 : return true;
1865 61740150 : }
1866 :
1867 : // This routine will register an inferred value in block BB, and possibly
1868 : // update the on-entry cache if appropriate.
1869 :
1870 : void
1871 16217401 : ranger_cache::register_inferred_value (const vrange &ir, tree name,
1872 : basic_block bb)
1873 : {
1874 16217401 : value_range r (TREE_TYPE (name));
1875 16217401 : if (!m_on_entry.get_bb_range (r, name, bb))
1876 10154405 : exit_range (r, name, bb, RFD_READ_ONLY);
1877 16217401 : if (r.intersect (ir))
1878 : {
1879 4792006 : m_on_entry.set_bb_range (name, bb, r);
1880 : // If this range was invariant before, remove invariant.
1881 4792006 : if (!gori ().has_edge_range_p (name))
1882 4012001 : gori_ssa ()->set_range_invariant (name, false);
1883 : }
1884 16217401 : }
1885 :
1886 : // This routine is used during a block walk to adjust any inferred ranges
1887 : // of operands on stmt S.
1888 :
1889 : void
1890 251374974 : ranger_cache::apply_inferred_ranges (gimple *s)
1891 : {
1892 251374974 : bool update = true;
1893 :
1894 251374974 : basic_block bb = gimple_bb (s);
1895 251374974 : gimple_infer_range infer(s, this);
1896 251374974 : if (infer.num () == 0)
1897 : return;
1898 :
1899 : // Do not update the on-entry cache for block ending stmts.
1900 15916927 : if (stmt_ends_bb_p (s))
1901 : {
1902 1130128 : edge_iterator ei;
1903 1130128 : edge e;
1904 2054550 : FOR_EACH_EDGE (e, ei, gimple_bb (s)->succs)
1905 2049088 : if (!(e->flags & (EDGE_ABNORMAL|EDGE_EH)))
1906 : break;
1907 1130128 : if (e == NULL)
1908 5462 : update = false;
1909 : }
1910 :
1911 15916927 : infer_oracle ().add_ranges (s, infer);
1912 15916927 : if (update)
1913 32109086 : for (unsigned x = 0; x < infer.num (); x++)
1914 16197621 : register_inferred_value (infer.range (x), infer.name (x), bb);
1915 : }
|
