Line data Source code
1 : /* Code for GIMPLE range related routines.
2 : Copyright (C) 2019-2026 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 "insn-codes.h"
27 : #include "tree.h"
28 : #include "gimple.h"
29 : #include "ssa.h"
30 : #include "gimple-pretty-print.h"
31 : #include "optabs-tree.h"
32 : #include "gimple-iterator.h"
33 : #include "gimple-fold.h"
34 : #include "wide-int.h"
35 : #include "fold-const.h"
36 : #include "case-cfn-macros.h"
37 : #include "omp-general.h"
38 : #include "cfgloop.h"
39 : #include "tree-ssa-loop.h"
40 : #include "tree-scalar-evolution.h"
41 : #include "langhooks.h"
42 : #include "vr-values.h"
43 : #include "range.h"
44 : #include "value-query.h"
45 : #include "gimple-range-op.h"
46 : #include "gimple-range.h"
47 : #include "cgraph.h"
48 : #include "alloc-pool.h"
49 : #include "symbol-summary.h"
50 : #include "ipa-utils.h"
51 : #include "sreal.h"
52 : #include "ipa-cp.h"
53 : #include "ipa-prop.h"
54 : #include "rtl.h"
55 : // Construct a fur_source, and set the m_query field.
56 :
57 494804551 : fur_source::fur_source (range_query *q)
58 : {
59 494804551 : if (q)
60 494803599 : m_query = q;
61 : else
62 1904 : m_query = get_range_query (cfun);
63 494804551 : m_depend_p = false;
64 494804551 : }
65 :
66 : // Invoke range_of_expr on EXPR.
67 :
68 : bool
69 0 : fur_source::get_operand (vrange &r, tree expr)
70 : {
71 0 : return m_query->range_of_expr (r, expr);
72 : }
73 :
74 : // Evaluate EXPR for this stmt as a PHI argument on edge E. Use the current
75 : // range_query to get the range on the edge.
76 :
77 : bool
78 0 : fur_source::get_phi_operand (vrange &r, tree expr, edge e)
79 : {
80 0 : return m_query->range_on_edge (r, e, expr);
81 : }
82 :
83 : // Default is no relation.
84 :
85 : relation_kind
86 6339987 : fur_source::query_relation (tree op1 ATTRIBUTE_UNUSED,
87 : tree op2 ATTRIBUTE_UNUSED)
88 : {
89 6339987 : return VREL_VARYING;
90 : }
91 :
92 : // Default registers nothing and returns false meaning nothing changed.
93 :
94 : bool
95 27630803 : fur_source::register_relation (gimple *s ATTRIBUTE_UNUSED,
96 : relation_kind k ATTRIBUTE_UNUSED,
97 : tree op1 ATTRIBUTE_UNUSED,
98 : tree op2 ATTRIBUTE_UNUSED)
99 : {
100 27630803 : return false;
101 : }
102 :
103 : // Default registers nothing and returns false meaning nothing changed.
104 :
105 : bool
106 7594638 : fur_source::register_relation (edge e ATTRIBUTE_UNUSED,
107 : relation_kind k ATTRIBUTE_UNUSED,
108 : tree op1 ATTRIBUTE_UNUSED,
109 : tree op2 ATTRIBUTE_UNUSED)
110 : {
111 7594638 : return false;
112 : }
113 :
114 : // Get the value of EXPR on edge m_edge.
115 :
116 : bool
117 65130574 : fur_edge::get_operand (vrange &r, tree expr)
118 : {
119 65130574 : return m_query->range_on_edge (r, m_edge, expr);
120 : }
121 :
122 : // Evaluate EXPR for this stmt as a PHI argument on edge E. Use the current
123 : // range_query to get the range on the edge.
124 :
125 : bool
126 0 : fur_edge::get_phi_operand (vrange &r, tree expr, edge e)
127 : {
128 : // Edge to edge recalculations not supported yet, until we sort it out.
129 0 : gcc_checking_assert (e == m_edge);
130 0 : return m_query->range_on_edge (r, e, expr);
131 : }
132 :
133 : // Instantiate a stmt based fur_source.
134 :
135 434208050 : fur_stmt::fur_stmt (gimple *s, range_query *q) : fur_source (q)
136 : {
137 434208050 : m_stmt = s;
138 434208050 : }
139 :
140 : // Retrieve range of EXPR as it occurs as a use on stmt M_STMT.
141 :
142 : bool
143 572669978 : fur_stmt::get_operand (vrange &r, tree expr)
144 : {
145 572669978 : return m_query->range_of_expr (r, expr, m_stmt);
146 : }
147 :
148 : // Evaluate EXPR for this stmt as a PHI argument on edge E. Use the current
149 : // range_query to get the range on the edge.
150 :
151 : bool
152 51208073 : fur_stmt::get_phi_operand (vrange &r, tree expr, edge e)
153 : {
154 : // Pick up the range of expr from edge E.
155 51208073 : fur_edge e_src (e, m_query);
156 51208073 : return e_src.get_operand (r, expr);
157 : }
158 :
159 : // Return relation based from m_stmt.
160 :
161 : relation_kind
162 109483973 : fur_stmt::query_relation (tree op1, tree op2)
163 : {
164 109483973 : return m_query->relation ().query (m_stmt, op1, op2);
165 : }
166 :
167 : // Instantiate a stmt based fur_source with a GORI object and a ranger cache.
168 :
169 239241099 : fur_depend::fur_depend (gimple *s, range_query *q, ranger_cache *c)
170 239241099 : : fur_stmt (s, q), m_cache (c)
171 : {
172 239241099 : m_depend_p = true;
173 239241099 : }
174 :
175 : // Register a relation on a stmt if there is an oracle. Return false if
176 : // no new relation is registered.
177 :
178 : bool
179 31049509 : fur_depend::register_relation (gimple *s, relation_kind k, tree op1, tree op2)
180 : {
181 31049509 : if (!m_query->relation ().record (s, k, op1, op2))
182 : return false;
183 :
184 : // This new relation could cause different calculations, so mark the operands
185 : // with a new timestamp, forcing recalculations.
186 24877722 : if (m_cache)
187 : {
188 24877551 : m_cache->update_consumers (op1);
189 24877551 : m_cache->update_consumers (op2);
190 : }
191 : return true;
192 : }
193 :
194 : // Register a relation on an edge if there is an oracle. Return false if
195 : // no new relation is registered.
196 :
197 : bool
198 6683461 : fur_depend::register_relation (edge e, relation_kind k, tree op1, tree op2)
199 : {
200 6683461 : if (!m_query->relation ().record (e, k, op1, op2))
201 : return false;
202 :
203 : // This new relation could cause different calculations, so mark the operands
204 : // with a new timestamp, forcing recalculations.
205 6665014 : if (m_cache)
206 : {
207 6665012 : m_cache->update_consumers (op1);
208 6665012 : m_cache->update_consumers (op2);
209 : }
210 : return true;
211 : }
212 :
213 : // This version of fur_source will pick a range up from a list of ranges
214 : // supplied by the caller.
215 :
216 : class fur_list : public fur_source
217 : {
218 : public:
219 : fur_list (vrange &r1, range_query *q = NULL);
220 : fur_list (vrange &r1, vrange &r2, range_query *q = NULL);
221 : fur_list (unsigned num, vrange **list, range_query *q = NULL);
222 : virtual bool get_operand (vrange &r, tree expr) override;
223 : virtual bool get_phi_operand (vrange &r, tree expr, edge e) override;
224 : private:
225 : vrange *m_local[2];
226 : vrange **m_list;
227 : unsigned m_index;
228 : unsigned m_limit;
229 : };
230 :
231 : // One range supplied for unary operations.
232 :
233 906850 : fur_list::fur_list (vrange &r1, range_query *q) : fur_source (q)
234 : {
235 906850 : m_list = m_local;
236 906850 : m_index = 0;
237 906850 : m_limit = 1;
238 906850 : m_local[0] = &r1;
239 906850 : }
240 :
241 : // Two ranges supplied for binary operations.
242 :
243 0 : fur_list::fur_list (vrange &r1, vrange &r2, range_query *q) : fur_source (q)
244 : {
245 0 : m_list = m_local;
246 0 : m_index = 0;
247 0 : m_limit = 2;
248 0 : m_local[0] = &r1;
249 0 : m_local[1] = &r2;
250 0 : }
251 :
252 : // Arbitrary number of ranges in a vector.
253 :
254 0 : fur_list::fur_list (unsigned num, vrange **list, range_query *q)
255 0 : : fur_source (q)
256 : {
257 0 : m_list = list;
258 0 : m_index = 0;
259 0 : m_limit = num;
260 0 : }
261 :
262 : // Get the next operand from the vector, ensure types are compatible.
263 :
264 : bool
265 1805920 : fur_list::get_operand (vrange &r, tree expr)
266 : {
267 : // Do not use the vector for non-ssa-names, or if it has been emptied.
268 1805920 : if (TREE_CODE (expr) != SSA_NAME || m_index >= m_limit)
269 899070 : return m_query->range_of_expr (r, expr);
270 906850 : r = *m_list[m_index++];
271 906850 : gcc_checking_assert (range_compatible_p (TREE_TYPE (expr), r.type ()));
272 : return true;
273 : }
274 :
275 : // This will simply pick the next operand from the vector.
276 : bool
277 0 : fur_list::get_phi_operand (vrange &r, tree expr, edge e ATTRIBUTE_UNUSED)
278 : {
279 0 : return get_operand (r, expr);
280 : }
281 :
282 : // Fold stmt S into range R using R1 as the first operand.
283 :
284 : bool
285 906850 : fold_range (vrange &r, gimple *s, vrange &r1, range_query *q)
286 : {
287 906850 : fold_using_range f;
288 906850 : fur_list src (r1, q);
289 906850 : return f.fold_stmt (r, s, src);
290 : }
291 :
292 : // Fold stmt S into range R using R1 and R2 as the first two operands.
293 :
294 : bool
295 0 : fold_range (vrange &r, gimple *s, vrange &r1, vrange &r2, range_query *q)
296 : {
297 0 : fold_using_range f;
298 0 : fur_list src (r1, r2, q);
299 0 : return f.fold_stmt (r, s, src);
300 : }
301 :
302 : // Fold stmt S into range R using NUM_ELEMENTS from VECTOR as the initial
303 : // operands encountered.
304 :
305 : bool
306 0 : fold_range (vrange &r, gimple *s, unsigned num_elements, vrange **vector,
307 : range_query *q)
308 : {
309 0 : fold_using_range f;
310 0 : fur_list src (num_elements, vector, q);
311 0 : return f.fold_stmt (r, s, src);
312 : }
313 :
314 : // Fold stmt S into range R using range query Q.
315 :
316 : bool
317 82705015 : fold_range (vrange &r, gimple *s, range_query *q)
318 : {
319 82705015 : fold_using_range f;
320 82705015 : fur_stmt src (s, q);
321 82705015 : return f.fold_stmt (r, s, src);
322 : }
323 :
324 : // Recalculate stmt S into R using range query Q as if it were on edge ON_EDGE.
325 :
326 : bool
327 8481572 : fold_range (vrange &r, gimple *s, edge on_edge, range_query *q)
328 : {
329 8481572 : fold_using_range f;
330 8481572 : fur_edge src (on_edge, q);
331 8481572 : return f.fold_stmt (r, s, src);
332 : }
333 :
334 : // Calculate op1 on statetemt S with LHS into range R using range query Q
335 : // to resolve any other operands.
336 :
337 : bool
338 0 : op1_range (vrange &r, gimple *s, const vrange &lhs, range_query *q)
339 : {
340 0 : gimple_range_op_handler handler (s);
341 0 : if (!handler)
342 : return false;
343 :
344 0 : fur_stmt src (s, q);
345 :
346 0 : tree op2_expr = handler.operand2 ();
347 0 : if (!op2_expr)
348 0 : return handler.calc_op1 (r, lhs);
349 :
350 0 : value_range op2 (TREE_TYPE (op2_expr));
351 0 : if (!src.get_operand (op2, op2_expr))
352 : return false;
353 :
354 0 : return handler.calc_op1 (r, lhs, op2);
355 0 : }
356 :
357 : // Calculate op1 on statetemt S into range R using range query Q.
358 : // LHS is set to VARYING in this case.
359 :
360 : bool
361 0 : op1_range (vrange &r, gimple *s, range_query *q)
362 : {
363 0 : tree lhs_type = gimple_range_type (s);
364 0 : if (!lhs_type)
365 : return false;
366 0 : value_range lhs_range;
367 0 : lhs_range.set_varying (lhs_type);
368 0 : return op1_range (r, s, lhs_range, q);
369 0 : }
370 :
371 : // Calculate op2 on statetemt S with LHS into range R using range query Q
372 : // to resolve any other operands.
373 :
374 : bool
375 0 : op2_range (vrange &r, gimple *s, const vrange &lhs, range_query *q)
376 : {
377 :
378 0 : gimple_range_op_handler handler (s);
379 0 : if (!handler)
380 : return false;
381 :
382 0 : fur_stmt src (s, q);
383 :
384 0 : value_range op1 (TREE_TYPE (handler.operand1 ()));
385 0 : if (!src.get_operand (op1, handler.operand1 ()))
386 : return false;
387 :
388 0 : return handler.calc_op2 (r, lhs, op1);
389 0 : }
390 :
391 : // Calculate op2 on statetemt S into range R using range query Q.
392 : // LHS is set to VARYING in this case.
393 :
394 : bool
395 0 : op2_range (vrange &r, gimple *s, range_query *q)
396 : {
397 0 : tree lhs_type = gimple_range_type (s);
398 0 : if (!lhs_type)
399 : return false;
400 0 : value_range lhs_range;
401 0 : lhs_range.set_varying (lhs_type);
402 0 : return op2_range (r, s, lhs_range, q);
403 0 : }
404 :
405 : // Provide a fur_source which can be used to determine any relations on
406 : // a statement. It manages the callback from fold_using_ranges to determine
407 : // a relation_trio for a statement.
408 :
409 : class fur_relation : public fur_stmt
410 : {
411 : public:
412 : fur_relation (gimple *s, range_query *q = NULL);
413 : virtual bool register_relation (gimple *stmt, relation_kind k, tree op1,
414 : tree op2);
415 : virtual bool register_relation (edge e, relation_kind k, tree op1,
416 : tree op2);
417 : relation_trio trio() const;
418 : private:
419 : relation_kind def_op1, def_op2, op1_op2;
420 : };
421 :
422 1096335 : fur_relation::fur_relation (gimple *s, range_query *q) : fur_stmt (s, q)
423 : {
424 1096335 : def_op1 = def_op2 = op1_op2 = VREL_VARYING;
425 1096335 : }
426 :
427 : // Construct a trio from what is known.
428 :
429 : relation_trio
430 1096335 : fur_relation::trio () const
431 : {
432 1096335 : return relation_trio (def_op1, def_op2, op1_op2);
433 : }
434 :
435 : // Don't support edges, but avoid a compiler warning by providing the routine.
436 : // Return false indicating nothing has changed.
437 :
438 : bool
439 0 : fur_relation::register_relation (edge, relation_kind, tree, tree)
440 : {
441 0 : return false;
442 : }
443 :
444 : // Register relation K between OP1 and OP2 on STMT. Return false if there
445 : // is no relation.
446 :
447 : bool
448 1077520 : fur_relation::register_relation (gimple *stmt, relation_kind k, tree op1,
449 : tree op2)
450 : {
451 1077520 : tree lhs = gimple_get_lhs (stmt);
452 1077520 : tree a1 = NULL_TREE;
453 1077520 : tree a2 = NULL_TREE;
454 1077520 : switch (gimple_code (stmt))
455 : {
456 0 : case GIMPLE_COND:
457 0 : a1 = gimple_cond_lhs (stmt);
458 0 : a2 = gimple_cond_rhs (stmt);
459 0 : break;
460 1077520 : case GIMPLE_ASSIGN:
461 1077520 : a1 = gimple_assign_rhs1 (stmt);
462 1077520 : if (gimple_num_ops (stmt) >= 3)
463 1077520 : a2 = gimple_assign_rhs2 (stmt);
464 : break;
465 : default:
466 : break;
467 : }
468 : // STMT is of the form LHS = A1 op A2, now map the relation to these
469 : // operands, if possible.
470 1077520 : if (op1 == lhs)
471 : {
472 1077520 : if (op2 == a1)
473 1077520 : def_op1 = k;
474 0 : else if (op2 == a2)
475 0 : def_op2 = k;
476 : }
477 0 : else if (op2 == lhs)
478 : {
479 0 : if (op1 == a1)
480 0 : def_op1 = relation_swap (k);
481 0 : else if (op1 == a2)
482 0 : def_op2 = relation_swap (k);
483 : }
484 : else
485 : {
486 0 : if (op1 == a1 && op2 == a2)
487 0 : op1_op2 = k;
488 0 : else if (op2 == a1 && op1 == a2)
489 0 : op1_op2 = relation_swap (k);
490 : }
491 0 : return def_op1 == VREL_VARYING && def_op2 == VREL_VARYING
492 1077520 : && op1_op2 == VREL_VARYING;
493 : }
494 :
495 : // Return the relation trio for stmt S using query Q.
496 :
497 : relation_trio
498 1096335 : fold_relations (gimple *s, range_query *q)
499 : {
500 1096335 : fold_using_range f;
501 1096335 : fur_relation src (s, q);
502 1096335 : tree lhs = gimple_range_ssa_p (gimple_get_lhs (s));
503 1096335 : if (lhs)
504 : {
505 1096335 : value_range vr(TREE_TYPE (lhs));
506 1096335 : if (f.fold_stmt (vr, s, src))
507 1096335 : return src.trio ();
508 1096335 : }
509 0 : return TRIO_VARYING;
510 : }
511 :
512 : // -------------------------------------------------------------------------
513 :
514 : // Adjust the range for a pointer difference where the operands came
515 : // from a memchr.
516 : //
517 : // This notices the following sequence:
518 : //
519 : // def = __builtin_memchr (arg, 0, sz)
520 : // n = def - arg
521 : //
522 : // The range for N can be narrowed to [0, PTRDIFF_MAX - 1].
523 :
524 : static void
525 2904826 : adjust_pointer_diff_expr (irange &res, const gimple *diff_stmt)
526 : {
527 2904826 : tree op0 = gimple_assign_rhs1 (diff_stmt);
528 2904826 : tree op1 = gimple_assign_rhs2 (diff_stmt);
529 2904826 : tree op0_ptype = TREE_TYPE (TREE_TYPE (op0));
530 2904826 : tree op1_ptype = TREE_TYPE (TREE_TYPE (op1));
531 2904826 : gimple *call;
532 :
533 2904826 : if (TREE_CODE (op0) == SSA_NAME
534 2873087 : && TREE_CODE (op1) == SSA_NAME
535 2827237 : && (call = SSA_NAME_DEF_STMT (op0))
536 2827237 : && is_gimple_call (call)
537 82348 : && gimple_call_builtin_p (call, BUILT_IN_MEMCHR)
538 63396 : && TYPE_MODE (op0_ptype) == TYPE_MODE (char_type_node)
539 63152 : && TYPE_PRECISION (op0_ptype) == TYPE_PRECISION (char_type_node)
540 63152 : && TYPE_MODE (op1_ptype) == TYPE_MODE (char_type_node)
541 62610 : && TYPE_PRECISION (op1_ptype) == TYPE_PRECISION (char_type_node)
542 62610 : && gimple_call_builtin_p (call, BUILT_IN_MEMCHR)
543 62610 : && vrp_operand_equal_p (op1, gimple_call_arg (call, 0))
544 2944175 : && integer_zerop (gimple_call_arg (call, 1)))
545 : {
546 26 : wide_int maxm1 = irange_val_max (ptrdiff_type_node) - 1;
547 26 : res.intersect (int_range<2> (ptrdiff_type_node,
548 52 : wi::zero (TYPE_PRECISION (ptrdiff_type_node)),
549 26 : maxm1));
550 26 : }
551 2904826 : }
552 :
553 : // Adjust the range for an IMAGPART_EXPR.
554 :
555 : static void
556 963557 : adjust_imagpart_expr (vrange &res, const gimple *stmt)
557 : {
558 963557 : tree name = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0);
559 :
560 963557 : if (TREE_CODE (name) != SSA_NAME || !SSA_NAME_DEF_STMT (name))
561 : return;
562 :
563 835006 : gimple *def_stmt = SSA_NAME_DEF_STMT (name);
564 835006 : if (is_gimple_call (def_stmt) && gimple_call_internal_p (def_stmt))
565 : {
566 402420 : switch (gimple_call_internal_fn (def_stmt))
567 : {
568 384942 : case IFN_ADD_OVERFLOW:
569 384942 : case IFN_SUB_OVERFLOW:
570 384942 : case IFN_MUL_OVERFLOW:
571 384942 : case IFN_UADDC:
572 384942 : case IFN_USUBC:
573 384942 : case IFN_ATOMIC_COMPARE_EXCHANGE:
574 384942 : {
575 384942 : int_range<2> r;
576 384942 : r.set_varying (boolean_type_node);
577 384942 : tree type = TREE_TYPE (gimple_assign_lhs (stmt));
578 384942 : range_cast (r, type);
579 384942 : res.intersect (r);
580 384942 : }
581 : default:
582 : break;
583 : }
584 : return;
585 : }
586 432586 : if (is_gimple_assign (def_stmt)
587 432586 : && gimple_assign_rhs_code (def_stmt) == COMPLEX_CST)
588 : {
589 15 : tree cst = gimple_assign_rhs1 (def_stmt);
590 15 : if (TREE_CODE (cst) == COMPLEX_CST
591 15 : && TREE_CODE (TREE_TYPE (TREE_TYPE (cst))) == INTEGER_TYPE)
592 : {
593 4 : wide_int w = wi::to_wide (TREE_IMAGPART (cst));
594 4 : int_range<1> imag (TREE_TYPE (TREE_IMAGPART (cst)), w, w);
595 4 : res.intersect (imag);
596 4 : }
597 : }
598 : }
599 :
600 : // Adjust the range for a REALPART_EXPR.
601 :
602 : static void
603 923444 : adjust_realpart_expr (vrange &res, const gimple *stmt)
604 : {
605 923444 : tree name = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0);
606 :
607 923444 : if (TREE_CODE (name) != SSA_NAME)
608 : return;
609 :
610 787100 : gimple *def_stmt = SSA_NAME_DEF_STMT (name);
611 787100 : if (!SSA_NAME_DEF_STMT (name))
612 : return;
613 :
614 787100 : if (is_gimple_assign (def_stmt)
615 787100 : && gimple_assign_rhs_code (def_stmt) == COMPLEX_CST)
616 : {
617 10 : tree cst = gimple_assign_rhs1 (def_stmt);
618 10 : if (TREE_CODE (cst) == COMPLEX_CST
619 10 : && TREE_CODE (TREE_TYPE (TREE_TYPE (cst))) == INTEGER_TYPE)
620 : {
621 0 : wide_int imag = wi::to_wide (TREE_REALPART (cst));
622 0 : int_range<2> tmp (TREE_TYPE (TREE_REALPART (cst)), imag, imag);
623 0 : res.intersect (tmp);
624 0 : }
625 : }
626 : }
627 :
628 : // This function looks for situations when walking the use/def chains
629 : // may provide additional contextual range information not exposed on
630 : // this statement.
631 :
632 : static void
633 194422728 : gimple_range_adjustment (vrange &res, const gimple *stmt)
634 : {
635 194422728 : switch (gimple_expr_code (stmt))
636 : {
637 2904826 : case POINTER_DIFF_EXPR:
638 2904826 : adjust_pointer_diff_expr (as_a <irange> (res), stmt);
639 2904826 : return;
640 :
641 963557 : case IMAGPART_EXPR:
642 963557 : adjust_imagpart_expr (res, stmt);
643 963557 : return;
644 :
645 923444 : case REALPART_EXPR:
646 923444 : adjust_realpart_expr (res, stmt);
647 923444 : return;
648 :
649 : default:
650 : break;
651 : }
652 : }
653 :
654 : // Provide context to the gimple fold callback.
655 :
656 : static struct
657 : {
658 : gimple *m_stmt;
659 : range_query *m_query;
660 : } x_fold_context;
661 :
662 : // Gimple fold callback.
663 :
664 : static tree
665 92083396 : pta_valueize (tree name)
666 : {
667 92083396 : tree ret
668 92083396 : = x_fold_context.m_query->value_of_expr (name, x_fold_context.m_stmt);
669 :
670 92083396 : return ret ? ret : name;
671 : }
672 :
673 : // Calculate a range for statement S and return it in R. If NAME is provided it
674 : // represents the SSA_NAME on the LHS of the statement. It is only required
675 : // if there is more than one lhs/output. If a range cannot
676 : // be calculated, return false.
677 :
678 : bool
679 308183801 : fold_using_range::fold_stmt (vrange &r, gimple *s, fur_source &src, tree name)
680 : {
681 308183801 : bool res = false;
682 : // If name and S are specified, make sure it is an LHS of S.
683 308183801 : gcc_checking_assert (!name || !gimple_get_lhs (s) ||
684 : name == gimple_get_lhs (s));
685 :
686 : if (!name)
687 171422521 : name = gimple_get_lhs (s);
688 :
689 : // Process addresses and loads from static constructors.
690 308183801 : if (gimple_code (s) == GIMPLE_ASSIGN && range_from_readonly_var (r, s))
691 : return true;
692 :
693 : // Save the current range query and restore it before returning.
694 : // If the specified query is different, make it the current one.
695 : // PR 125854 - The fold machinery may make a query call.
696 : // PR 126814 - tree_expr_nonnegative_p may make a call.
697 : // PR 126942 - path_ranger queries should never be the current query.
698 : // set_range_query will revert to a global query for this.
699 308068622 : range_query *saved_query = set_range_query (cfun, src.query ());
700 :
701 308068622 : gimple_range_op_handler handler (s);
702 308068622 : if (gimple_code (s) == GIMPLE_ASSIGN
703 308068622 : && gimple_assign_rhs_code (s) == ADDR_EXPR)
704 4334314 : res = range_of_address (as_a <prange> (r), s, src);
705 303734308 : else if (handler)
706 194446042 : res = range_of_range_op (r, handler, src);
707 109288266 : else if (is_a<gphi *>(s))
708 24855708 : res = range_of_phi (r, as_a<gphi *> (s), src);
709 84432558 : else if (is_a<gcall *>(s))
710 13429239 : res = range_of_call (r, as_a<gcall *> (s), src);
711 71003319 : else if (is_a<gassign *> (s) && gimple_assign_rhs_code (s) == COND_EXPR)
712 173072 : res = range_of_cond_expr (r, as_a<gassign *> (s), src);
713 :
714 : // If the result is varying, use the type's min/max if either is not
715 : // the same as the full precision min/max. This helps with strict enum
716 : // e.g. `g++.dg/warn/pr33738.C`.
717 237238375 : if (res && r.varying_p () && INTEGRAL_TYPE_P (r.type ()))
718 : {
719 120710573 : irange &ir = as_a <irange> (r);
720 120710573 : tree type = r.type ();
721 120710573 : auto typemax = wi::to_wide (TYPE_MAX_VALUE (type));
722 120710573 : auto typemin = wi::to_wide (TYPE_MIN_VALUE (type));
723 120710573 : auto precisionmax = wi::max_value (TYPE_PRECISION (type),
724 241421146 : TYPE_SIGN (type));
725 120710573 : auto precisionmin = wi::min_value (TYPE_PRECISION (type),
726 241421146 : TYPE_SIGN (type));
727 241351021 : if (typemax != precisionmax || typemin != precisionmin)
728 70125 : ir.set (type, typemin, typemax);
729 120711443 : }
730 :
731 308068622 : if (!res)
732 : {
733 : // Restore the original query.
734 70830247 : if (saved_query)
735 17183691 : set_range_query (cfun, saved_query);
736 : // If no name specified or range is unsupported, bail.
737 70830247 : if (!name || !gimple_range_ssa_p (name))
738 : return false;
739 : // We don't understand the stmt, so return the global range.
740 70779917 : gimple_range_global (r, name);
741 70779917 : return true;
742 : }
743 :
744 237238375 : if (r.undefined_p ())
745 : {
746 : // Restore the original query.
747 52175 : if (saved_query)
748 1466 : set_range_query (cfun, saved_query);
749 : return true;
750 : }
751 :
752 : // We sometimes get compatible types copied from operands, make sure
753 : // the correct type is being returned.
754 237186200 : if (name && TREE_TYPE (name) != r.type ())
755 : {
756 3882740 : gcc_checking_assert (range_compatible_p (r.type (), TREE_TYPE (name)));
757 3882740 : range_cast (r, TREE_TYPE (name));
758 : }
759 :
760 237186200 : if (is_a <prange> (r))
761 : {
762 28132782 : prange &p = as_a <prange> (r);
763 : // Check to see if points_to should be set.
764 28132782 : if (p.pt_unknown_p () && name && gimple_code (s) == GIMPLE_ASSIGN)
765 : {
766 16646181 : tree rhs = gimple_assign_rhs1 (s);
767 16646181 : tree_code code = gimple_assign_rhs_code (s);
768 : // If code is SSA_NAME, any points to would already be copied.
769 16646181 : if (code != SSA_NAME
770 15233739 : && get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS
771 21161378 : && TREE_CODE (rhs) == ADDR_EXPR)
772 4332197 : p.set_pt (rhs, true);
773 : else
774 : {
775 : // If we couldn't find anything, try fold.
776 12313984 : x_fold_context = { s, get_range_query (cfun) };
777 12313984 : rhs = gimple_fold_stmt_to_constant_1 (s, pta_valueize,
778 : pta_valueize);
779 12313984 : if (rhs && TREE_CODE (rhs) == ADDR_EXPR)
780 16481 : p.set_pt (rhs, true);
781 : }
782 : }
783 : }
784 : // Restore the original query.
785 237186200 : if (saved_query)
786 60394978 : set_range_query (cfun, saved_query);
787 : return true;
788 : }
789 :
790 : // Calculate a range for range_op statement S and return it in R. If any
791 : // If a range cannot be calculated, return false.
792 :
793 : bool
794 194446042 : fold_using_range::range_of_range_op (vrange &r,
795 : gimple_range_op_handler &handler,
796 : fur_source &src)
797 : {
798 194446042 : gcc_checking_assert (handler);
799 194446042 : gimple *s = handler.stmt ();
800 194446042 : tree type = gimple_range_type (s);
801 194446042 : if (!type)
802 : return false;
803 :
804 194446042 : tree lhs = handler.lhs ();
805 194446042 : tree op1 = handler.operand1 ();
806 194446042 : tree op2 = handler.operand2 ();
807 :
808 : // Certain types of builtin functions may have no arguments.
809 194446042 : if (!op1)
810 : {
811 23314 : value_range r1 (type);
812 23314 : if (!handler.fold_range (r, type, r1, r1))
813 0 : r.set_varying (type);
814 23314 : return true;
815 23314 : }
816 :
817 194422728 : value_range range1 (TREE_TYPE (op1));
818 194422728 : value_range range2 (op2 ? TREE_TYPE (op2) : TREE_TYPE (op1));
819 :
820 194422728 : if (src.get_operand (range1, op1))
821 : {
822 194422728 : if (!op2)
823 : {
824 : // Fold range, and register any dependency if available.
825 39601449 : value_range r2 (type);
826 39601449 : r2.set_varying (type);
827 39601449 : if (!handler.fold_range (r, type, range1, r2))
828 329836 : r.set_varying (type);
829 39601449 : if (lhs && gimple_range_ssa_p (op1))
830 : {
831 57156872 : if (src.gori_ssa ())
832 20997048 : src.gori_ssa ()->register_dependency (lhs, op1);
833 36159791 : relation_kind rel;
834 36159791 : rel = handler.lhs_op1_relation (r, range1, range1);
835 36159791 : if (rel != VREL_VARYING)
836 26658920 : src.register_relation (s, rel, lhs, op1);
837 : }
838 39601449 : }
839 154821279 : else if (src.get_operand (range2, op2))
840 : {
841 154821279 : relation_kind rel = src.query_relation (op1, op2);
842 154821279 : if (dump_file && (dump_flags & TDF_DETAILS) && rel != VREL_VARYING)
843 : {
844 150 : fprintf (dump_file, " folding with relation ");
845 150 : print_generic_expr (dump_file, op1, TDF_SLIM);
846 150 : print_relation (dump_file, rel);
847 150 : print_generic_expr (dump_file, op2, TDF_SLIM);
848 150 : fputc ('\n', dump_file);
849 : }
850 : // Fold range, and register any dependency if available.
851 154821279 : if (!handler.fold_range (r, type, range1, range2,
852 : relation_trio::op1_op2 (rel)))
853 0 : r.set_varying (type);
854 154821279 : if (irange::supports_p (type))
855 141421259 : relation_fold_and_or (as_a <irange> (r), s, src, range1, range2);
856 154821279 : if (lhs)
857 : {
858 153336029 : if (src.gori_ssa ())
859 : {
860 58170847 : src.gori_ssa ()->register_dependency (lhs, op1);
861 116341694 : src.gori_ssa ()->register_dependency (lhs, op2);
862 : }
863 95164849 : if (gimple_range_ssa_p (op1))
864 : {
865 92510218 : relation_kind rel2 = handler.lhs_op1_relation (r, range1,
866 92510218 : range2, rel);
867 92510218 : if (rel2 != VREL_VARYING)
868 39570647 : src.register_relation (s, rel2, lhs, op1);
869 : }
870 95164849 : if (gimple_range_ssa_p (op2))
871 : {
872 37815516 : relation_kind rel2 = handler.lhs_op2_relation (r, range1,
873 37815516 : range2, rel);
874 37815516 : if (rel2 != VREL_VARYING)
875 2353515 : src.register_relation (s, rel2, lhs, op2);
876 : }
877 : }
878 : // Check for an existing BB, as we maybe asked to fold an
879 : // artificial statement not in the CFG.
880 59656430 : else if (is_a<gcond *> (s) && gimple_bb (s))
881 : {
882 50911202 : basic_block bb = gimple_bb (s);
883 50911202 : edge e0 = EDGE_SUCC (bb, 0);
884 : /* During RTL expansion one of the edges can be removed
885 : if expansion proves the jump is unconditional. */
886 50911202 : edge e1 = single_succ_p (bb) ? NULL : EDGE_SUCC (bb, 1);
887 :
888 50911202 : gcc_checking_assert (e1 || currently_expanding_to_rtl);
889 50911202 : if (!single_pred_p (e0->dest))
890 12473639 : e0 = NULL;
891 50911202 : if (e1 && !single_pred_p (e1->dest))
892 : e1 = NULL;
893 50911202 : src.register_outgoing_edges (as_a<gcond *> (s),
894 : as_a <irange> (r), e0, e1);
895 : }
896 : }
897 : else
898 0 : r.set_varying (type);
899 : }
900 : else
901 0 : r.set_varying (type);
902 : // Make certain range-op adjustments that aren't handled any other way.
903 194422728 : gimple_range_adjustment (r, s);
904 194422728 : return true;
905 194422728 : }
906 :
907 : // Calculate the range of an assignment containing an ADDR_EXPR.
908 : // Return the range in R.
909 : // If a range cannot be calculated, set it to VARYING and return true.
910 :
911 : bool
912 4334314 : fold_using_range::range_of_address (prange &r, gimple *stmt, fur_source &src)
913 : {
914 4334314 : gcc_checking_assert (gimple_code (stmt) == GIMPLE_ASSIGN);
915 4334314 : gcc_checking_assert (gimple_assign_rhs_code (stmt) == ADDR_EXPR);
916 :
917 4334314 : tree expr = gimple_assign_rhs1 (stmt);
918 4334314 : poly_int64 bitsize, bitpos;
919 4334314 : tree offset;
920 4334314 : machine_mode mode;
921 4334314 : int unsignedp, reversep, volatilep;
922 4334314 : tree base = get_inner_reference (TREE_OPERAND (expr, 0), &bitsize,
923 : &bitpos, &offset, &mode, &unsignedp,
924 : &reversep, &volatilep);
925 :
926 :
927 4334314 : if (base != NULL_TREE
928 4334314 : && TREE_CODE (base) == MEM_REF
929 8516533 : && TREE_CODE (TREE_OPERAND (base, 0)) == SSA_NAME)
930 : {
931 4182158 : tree ssa = TREE_OPERAND (base, 0);
932 4182158 : tree lhs = gimple_get_lhs (stmt);
933 6756753 : if (lhs && gimple_range_ssa_p (ssa) && src.gori_ssa ())
934 2574595 : src.gori_ssa ()->register_dependency (lhs, ssa);
935 4182158 : src.get_operand (r, ssa);
936 4182158 : range_cast (r, TREE_TYPE (gimple_assign_rhs1 (stmt)));
937 :
938 4182158 : poly_offset_int off = 0;
939 4182158 : bool off_cst = false;
940 4182158 : if (offset == NULL_TREE || TREE_CODE (offset) == INTEGER_CST)
941 : {
942 4095822 : off = mem_ref_offset (base);
943 4095822 : if (offset)
944 48 : off += poly_offset_int::from (wi::to_poly_wide (offset),
945 48 : SIGNED);
946 4095822 : off <<= LOG2_BITS_PER_UNIT;
947 4095822 : off += bitpos;
948 : off_cst = true;
949 : }
950 : /* If &X->a is equal to X, the range of X is the result. */
951 4095822 : if (off_cst && known_eq (off, 0))
952 1471505 : return true;
953 2710653 : else if (flag_delete_null_pointer_checks
954 2710653 : && !TYPE_OVERFLOW_WRAPS (TREE_TYPE (expr)))
955 : {
956 : /* For -fdelete-null-pointer-checks -fno-wrapv-pointer we don't
957 : allow going from non-NULL pointer to NULL. */
958 2709170 : if (r.undefined_p ()
959 5418340 : || !r.contains_p (wi::zero (TYPE_PRECISION (TREE_TYPE (expr)))))
960 : {
961 : /* We could here instead adjust r by off >> LOG2_BITS_PER_UNIT
962 : using POINTER_PLUS_EXPR if off_cst and just fall back to
963 : this. */
964 1990379 : r.set_nonzero (TREE_TYPE (gimple_assign_rhs1 (stmt)));
965 1990379 : return true;
966 : }
967 : }
968 : /* If MEM_REF has a "positive" offset, consider it non-NULL
969 : always, for -fdelete-null-pointer-checks also "negative"
970 : ones. Punt for unknown offsets (e.g. variable ones). */
971 720274 : if (!TYPE_OVERFLOW_WRAPS (TREE_TYPE (expr))
972 720058 : && off_cst
973 656681 : && known_ne (off, 0)
974 1376955 : && (flag_delete_null_pointer_checks || known_gt (off, 0)))
975 : {
976 656681 : r.set_nonzero (TREE_TYPE (gimple_assign_rhs1 (stmt)));
977 656681 : return true;
978 : }
979 63593 : r.set_varying (TREE_TYPE (gimple_assign_rhs1 (stmt)));
980 63593 : return true;
981 : }
982 :
983 : // Handle "= &a".
984 152156 : if (tree_single_nonzero_p (expr))
985 : {
986 151089 : r.set_nonzero (TREE_TYPE (gimple_assign_rhs1 (stmt)));
987 151089 : return true;
988 : }
989 :
990 : // Otherwise return varying.
991 1067 : r.set_varying (TREE_TYPE (gimple_assign_rhs1 (stmt)));
992 1067 : return true;
993 : }
994 :
995 : /* If TYPE is a pointer, return false. Otherwise, add zero of TYPE (which must
996 : be an integer or a float) to R and return true. */
997 :
998 : static bool
999 1353 : range_from_missing_constructor_part (vrange &r, tree type)
1000 : {
1001 1353 : if (POINTER_TYPE_P (type))
1002 : return false;
1003 1208 : gcc_checking_assert (irange::supports_p (type)
1004 : || frange::supports_p (type));
1005 1208 : value_range zero (type);
1006 1208 : zero.set_zero (type);
1007 1208 : r.union_ (zero);
1008 1208 : return true;
1009 1208 : }
1010 :
1011 : // One step of fold_using_range::range_from_readonly_var. Process expressions
1012 : // in COMPS which together load a value of TYPE, from index I to 0 according to
1013 : // the corresponding static initializer in CST which should be either a scalar
1014 : // invariant or a constructor. Currently TYPE must be a pointer, an integer
1015 : // or a float. If TYPE is a pointer, return true if all potentially loaded
1016 : // values are known not to be zero and false if any of them can be zero.
1017 : // Otherwise return true if it is possible to add all constants which can be
1018 : // loaded from CST (which must be storable to TYPE) to R and do so.
1019 :
1020 : static bool
1021 904805 : range_from_readonly_load (vrange &r, tree type, tree cst,
1022 : const vec <tree> &comps, unsigned i)
1023 : {
1024 918791 : if (i == 0)
1025 : {
1026 784358 : if (!useless_type_conversion_p (type, TREE_TYPE (cst)))
1027 : return false;
1028 :
1029 784358 : if (POINTER_TYPE_P (type))
1030 : {
1031 151779 : return tree_single_nonzero_p (cst);
1032 : }
1033 :
1034 632579 : if (TREE_CODE (cst) == REAL_CST)
1035 : {
1036 84657 : const REAL_VALUE_TYPE *rv = TREE_REAL_CST_PTR (cst);
1037 84657 : frange elt;
1038 84657 : if (real_isnan (rv))
1039 599 : elt.set_nan (type, real_isneg (rv));
1040 : else
1041 84058 : elt.set (type, *rv, *rv, nan_state (false));
1042 84657 : r.union_ (elt);
1043 84657 : return true;
1044 84657 : }
1045 :
1046 547922 : if (TREE_CODE (cst) != INTEGER_CST)
1047 : return false;
1048 :
1049 547851 : wide_int wi_cst = wi::to_wide (cst);
1050 547851 : r.union_ (int_range<1> (type, wi_cst, wi_cst));
1051 547851 : return true;
1052 547851 : }
1053 : /* TODO: Perhaps handle RAW_DATA_CST too. */
1054 134433 : if (TREE_CODE (cst) != CONSTRUCTOR)
1055 : return false;
1056 :
1057 133686 : i--;
1058 133686 : tree expr = comps[i];
1059 133686 : unsigned ix;
1060 133686 : tree index, val;
1061 :
1062 133686 : if (TREE_CODE (expr) == COMPONENT_REF)
1063 : {
1064 14035 : tree ref_fld = TREE_OPERAND (expr, 1);
1065 22291 : FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (cst), ix, index, val)
1066 : {
1067 22242 : if (index != ref_fld)
1068 8256 : continue;
1069 : return range_from_readonly_load (r, type, val, comps, i);
1070 : }
1071 49 : if (TREE_CODE (TREE_TYPE (cst)) == RECORD_TYPE)
1072 7 : return range_from_missing_constructor_part (r, type);
1073 : else
1074 : /* Missing constructor of a union field just isn't like other missing
1075 : constructor parts. */
1076 : return false;
1077 : }
1078 :
1079 119651 : gcc_assert (TREE_CODE (expr) == ARRAY_REF);
1080 119651 : tree op1 = TREE_OPERAND (expr, 1);
1081 :
1082 119651 : if (TREE_CODE (op1) == INTEGER_CST)
1083 : {
1084 3759 : unsigned ctor_idx;
1085 3759 : val = get_array_ctor_element_at_index (cst, wi::to_offset (op1),
1086 : &ctor_idx);
1087 3759 : if (!val)
1088 : {
1089 96 : if (ctor_idx < CONSTRUCTOR_NELTS (cst))
1090 : return false;
1091 96 : return range_from_missing_constructor_part (r, type);
1092 : }
1093 3663 : return range_from_readonly_load (r, type, val, comps, i);
1094 : }
1095 :
1096 115892 : tree arr_type = TREE_TYPE (cst);
1097 115892 : tree domain = TYPE_DOMAIN (arr_type);
1098 115892 : if (!TYPE_MIN_VALUE (domain)
1099 115892 : || !TYPE_MAX_VALUE (domain)
1100 115892 : || !tree_fits_uhwi_p (TYPE_MIN_VALUE (domain))
1101 231784 : || !tree_fits_uhwi_p (TYPE_MAX_VALUE (domain)))
1102 : return false;
1103 115790 : unsigned HOST_WIDE_INT needed_count
1104 115790 : = (tree_to_uhwi (TYPE_MAX_VALUE (domain))
1105 115790 : - tree_to_uhwi (TYPE_MIN_VALUE (domain)) + 1);
1106 231520 : if (CONSTRUCTOR_NELTS (cst) < needed_count)
1107 : {
1108 1250 : if (!range_from_missing_constructor_part (r, type))
1109 : return false;
1110 : }
1111 :
1112 899526 : FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (cst), ix, index, val)
1113 : {
1114 : /* TODO: If the array index in the expr is an SSA_NAME with a known
1115 : range, we could use just values loaded from the corresponding array
1116 : elements. */
1117 784758 : if (!range_from_readonly_load (r, type, val, comps, i))
1118 : return false;
1119 : }
1120 :
1121 : return true;
1122 : }
1123 :
1124 : // Attempt to calculate the range of value loaded by STMT (which must be an
1125 : // assignment) if it is a load from a read-only aggregate variable. If
1126 : // successful, return true and set the discovered range in R. Otherwise return
1127 : // false and leave R untouched.
1128 :
1129 : bool
1130 198384775 : fold_using_range::range_from_readonly_var (vrange &r, gimple *stmt)
1131 : {
1132 198384775 : gcc_checking_assert (gimple_code (stmt) == GIMPLE_ASSIGN);
1133 198384775 : tree type = TREE_TYPE (gimple_assign_lhs (stmt));
1134 198384775 : if (!irange::supports_p (type)
1135 51344731 : && !prange::supports_p (type)
1136 208469976 : && !frange::supports_p (type))
1137 : return false;
1138 :
1139 198384775 : unsigned HOST_WIDE_INT limit = param_vrp_cstload_limit;
1140 198384775 : if (!limit)
1141 : return false;
1142 :
1143 198365974 : tree t = gimple_assign_rhs1 (stmt);
1144 198365974 : if (!tree_fits_uhwi_p (TYPE_SIZE_UNIT (TREE_TYPE (t))))
1145 : return false;
1146 198365974 : limit *= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (t)));
1147 :
1148 198365974 : unsigned count = 0;
1149 198365974 : while (TREE_CODE (t) == ARRAY_REF
1150 251659392 : || TREE_CODE (t) == COMPONENT_REF)
1151 : {
1152 53293418 : count++;
1153 53293418 : t = TREE_OPERAND (t, 0);
1154 : }
1155 198365974 : if (!count
1156 34330509 : || (TREE_CODE (t) != VAR_DECL
1157 34330509 : && TREE_CODE (t) != CONST_DECL))
1158 : return false;
1159 :
1160 9777734 : if (!tree_fits_uhwi_p (DECL_SIZE_UNIT (t))
1161 9777734 : || tree_to_uhwi (DECL_SIZE_UNIT (t)) > limit)
1162 : return false;
1163 :
1164 : /* TODO: We perhaps should try to handle at least some cases when the
1165 : declaration is wrapped in a MEM_REF, but we need to be careful to look at
1166 : the right part of the constructor then. */
1167 8607981 : tree ctor = ctor_for_folding (t);
1168 8607981 : if (!ctor
1169 8607974 : || TREE_CODE (ctor) != CONSTRUCTOR)
1170 : return false;
1171 :
1172 116384 : t = gimple_assign_rhs1 (stmt);
1173 116384 : auto_vec <tree, 4> comps;
1174 116384 : comps.safe_grow (count, true);
1175 116384 : int i = 0;
1176 116384 : while (TREE_CODE (t) == ARRAY_REF
1177 238056 : || TREE_CODE (t) == COMPONENT_REF)
1178 : {
1179 121672 : comps[i] = t;
1180 121672 : t = TREE_OPERAND (t, 0);
1181 121672 : i++;
1182 : }
1183 :
1184 116384 : value_range tmp (type);
1185 116384 : bool res = range_from_readonly_load (tmp, type, ctor, comps, count);
1186 116384 : if (res)
1187 : {
1188 115179 : if (POINTER_TYPE_P (type))
1189 25217 : r.set_nonzero (type);
1190 : else
1191 89962 : r = tmp;
1192 : }
1193 116384 : return res;
1194 116384 : }
1195 :
1196 : // Calculate a range for phi statement S and return it in R.
1197 : // If a range cannot be calculated, return false.
1198 :
1199 : bool
1200 24855708 : fold_using_range::range_of_phi (vrange &r, gphi *phi, fur_source &src)
1201 : {
1202 24855708 : tree phi_def = gimple_phi_result (phi);
1203 24855708 : tree type = gimple_range_type (phi);
1204 24855708 : value_range arg_range (type);
1205 24855708 : value_range equiv_range (type);
1206 24855708 : unsigned x;
1207 :
1208 24855708 : if (!type)
1209 : return false;
1210 :
1211 : // Track if all executable arguments are the same.
1212 24855708 : tree single_arg = NULL_TREE;
1213 24855708 : bool seen_arg = false;
1214 :
1215 24855708 : relation_oracle *oracle = &(src.query()->relation ());
1216 : // Start with an empty range, unioning in each argument's range.
1217 24855708 : r.set_undefined ();
1218 88919682 : for (x = 0; x < gimple_phi_num_args (phi); x++)
1219 : {
1220 51229327 : tree arg = gimple_phi_arg_def (phi, x);
1221 : // An argument that is the same as the def provides no new range.
1222 51229327 : if (arg == phi_def)
1223 21254 : continue;
1224 :
1225 51208073 : edge e = gimple_phi_arg_edge (phi, x);
1226 :
1227 : // Get the range of the argument on its edge.
1228 51208073 : src.get_phi_operand (arg_range, arg, e);
1229 :
1230 51208073 : if (!arg_range.undefined_p ())
1231 : {
1232 : // Register potential dependencies for stale value tracking.
1233 : // Likewise, if the incoming PHI argument is equivalent to this
1234 : // PHI definition, it provides no new info. Accumulate these ranges
1235 : // in case all arguments are equivalences.
1236 50963032 : if (oracle->query (e, arg, phi_def) == VREL_EQ)
1237 244418 : equiv_range.union_(arg_range);
1238 : else
1239 50718614 : r.union_ (arg_range);
1240 :
1241 83257465 : if (gimple_range_ssa_p (arg) && src.gori_ssa ())
1242 32294421 : src.gori_ssa ()->register_dependency (phi_def, arg);
1243 : }
1244 :
1245 : // Track if all arguments are the same.
1246 51208073 : if (!seen_arg)
1247 : {
1248 : seen_arg = true;
1249 : single_arg = arg;
1250 : }
1251 26352365 : else if (!vrp_operand_equal_p (single_arg, arg))
1252 25126537 : single_arg = NULL_TREE;
1253 :
1254 : // Once the value reaches varying, stop looking.
1255 51208073 : if (r.varying_p () && single_arg == NULL_TREE)
1256 : break;
1257 : }
1258 :
1259 : // If all arguments were equivalences, use the equivalence ranges as no
1260 : // arguments were processed.
1261 24855708 : if (r.undefined_p () && !equiv_range.undefined_p ())
1262 97580 : r = equiv_range;
1263 :
1264 : // If the PHI boils down to a single effective argument, look at it.
1265 24855708 : if (single_arg)
1266 : {
1267 : // Symbolic arguments can be equivalences.
1268 2431675 : if (gimple_range_ssa_p (single_arg))
1269 : {
1270 : // Only allow the equivalence if the PHI definition does not
1271 : // dominate any incoming edge for SINGLE_ARG.
1272 : // See PR 108139 and 109462.
1273 1920467 : basic_block bb = gimple_bb (phi);
1274 1920467 : if (!dom_info_available_p (CDI_DOMINATORS))
1275 : single_arg = NULL;
1276 : else
1277 4091839 : for (x = 0; x < gimple_phi_num_args (phi); x++)
1278 2176379 : if (gimple_phi_arg_def (phi, x) == single_arg
1279 4342250 : && dominated_by_p (CDI_DOMINATORS,
1280 2165871 : gimple_phi_arg_edge (phi, x)->src,
1281 : bb))
1282 : {
1283 : single_arg = NULL;
1284 : break;
1285 : }
1286 1919474 : if (single_arg)
1287 1915460 : src.register_relation (phi, VREL_EQ, phi_def, single_arg);
1288 : }
1289 511208 : else if (src.get_operand (arg_range, single_arg))
1290 : {
1291 : // Check if the single argument points to a specific object.
1292 511208 : if (is_a <prange> (arg_range))
1293 : {
1294 46521 : prange &ptr = as_a <prange> (arg_range);
1295 : // If it doesn't already point at something, set points to.
1296 46521 : if (ptr.pt_unknown_p () && TREE_CODE (single_arg) == ADDR_EXPR)
1297 0 : ptr.set_pt (single_arg, true);
1298 46521 : r = ptr;
1299 46521 : return true;
1300 : }
1301 : // Numerical arguments that are a constant can be returned as
1302 : // the constant. This can help fold later cases where even this
1303 : // constant might have been UNDEFINED via an unreachable edge.
1304 464687 : if (arg_range.singleton_p ())
1305 : {
1306 463356 : r = arg_range;
1307 463356 : return true;
1308 : }
1309 : }
1310 : }
1311 :
1312 : // Incorporate any global value. If a PHI analysis phase was run, there may
1313 : // be a restricted global range already. Query the range with no context
1314 : // to get a global range.
1315 :
1316 : // If SCEV is available, query if this PHI has any known values.
1317 24345831 : if (scev_initialized_p ()
1318 24345831 : && !POINTER_TYPE_P (TREE_TYPE (phi_def)))
1319 : {
1320 9444567 : class loop *l = loop_containing_stmt (phi);
1321 9444567 : if (l && loop_outer (l))
1322 : {
1323 6929102 : value_range loop_range (type);
1324 6929102 : range_of_ssa_name_with_loop_info (loop_range, phi_def, l, phi, src);
1325 6929102 : if (!loop_range.varying_p ())
1326 : {
1327 2346109 : if (dump_file && (dump_flags & TDF_DETAILS))
1328 : {
1329 14356 : fprintf (dump_file, "Loops range found for ");
1330 14356 : print_generic_expr (dump_file, phi_def, TDF_SLIM);
1331 14356 : fprintf (dump_file, ": ");
1332 14356 : loop_range.dump (dump_file);
1333 14356 : fprintf (dump_file, " and calculated range :");
1334 14356 : r.dump (dump_file);
1335 14356 : fprintf (dump_file, "\n");
1336 : }
1337 2346109 : r.intersect (loop_range);
1338 : }
1339 6929102 : }
1340 : }
1341 :
1342 : return true;
1343 24855708 : }
1344 :
1345 : // Calculate a range for call statement S and return it in R.
1346 : // If a range cannot be calculated, return false.
1347 :
1348 : bool
1349 13429239 : fold_using_range::range_of_call (vrange &r, gcall *call, fur_source &)
1350 : {
1351 13429239 : tree type = gimple_range_type (call);
1352 13429239 : if (!type)
1353 : return false;
1354 :
1355 13429239 : tree lhs = gimple_call_lhs (call);
1356 :
1357 13429239 : if (gimple_stmt_nonnegative_p (call))
1358 16706 : r.set_nonnegative (type);
1359 13412533 : else if (gimple_call_nonnull_result_p (call)
1360 13412533 : || gimple_call_nonnull_arg (call))
1361 676814 : r.set_nonzero (type);
1362 : else
1363 12735719 : r.set_varying (type);
1364 :
1365 13429239 : tree callee = gimple_call_fndecl (call);
1366 13429239 : if (callee
1367 13429239 : && useless_type_conversion_p (TREE_TYPE (TREE_TYPE (callee)), type))
1368 : {
1369 12250908 : value_range val;
1370 12250908 : if (ipa_return_value_range (val, callee))
1371 : {
1372 612479 : r.intersect (val);
1373 612479 : if (dump_file && (dump_flags & TDF_DETAILS))
1374 : {
1375 28 : fprintf (dump_file, "Using return value range of ");
1376 28 : print_generic_expr (dump_file, callee, TDF_SLIM);
1377 28 : fprintf (dump_file, ": ");
1378 28 : val.dump (dump_file);
1379 28 : fprintf (dump_file, "\n");
1380 : }
1381 : }
1382 12250908 : }
1383 :
1384 : // If there is an LHS, intersect that with what is known.
1385 13429239 : if (gimple_range_ssa_p (lhs))
1386 : {
1387 13429239 : value_range def (TREE_TYPE (lhs));
1388 13429239 : gimple_range_global (def, lhs);
1389 13429239 : r.intersect (def);
1390 13429239 : }
1391 : return true;
1392 : }
1393 :
1394 : // Given COND ? OP1 : OP2 with ranges R1 for OP1 and R2 for OP2, Use gori
1395 : // to further resolve R1 and R2 if there are any dependencies between
1396 : // OP1 and COND or OP2 and COND. All values can are to be calculated using SRC
1397 : // as the origination source location for operands..
1398 : // Effectively, use COND an the edge condition and solve for OP1 on the true
1399 : // edge and OP2 on the false edge.
1400 :
1401 : bool
1402 173072 : fold_using_range::condexpr_adjust (vrange &r1, vrange &r2, gimple *, tree cond,
1403 : tree op1, tree op2, fur_source &src)
1404 : {
1405 173072 : if (!src.gori () || !src.gori_ssa ())
1406 : return false;
1407 :
1408 123134 : tree ssa1 = gimple_range_ssa_p (op1);
1409 123134 : tree ssa2 = gimple_range_ssa_p (op2);
1410 123134 : if (!ssa1 && !ssa2)
1411 : return false;
1412 111787 : if (TREE_CODE (cond) != SSA_NAME)
1413 : return false;
1414 111787 : gassign *cond_def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (cond));
1415 111660 : if (!cond_def
1416 111660 : || TREE_CODE_CLASS (gimple_assign_rhs_code (cond_def)) != tcc_comparison)
1417 : return false;
1418 106952 : tree type = TREE_TYPE (gimple_assign_rhs1 (cond_def));
1419 106952 : if (!value_range::supports_type_p (type)
1420 213900 : || !range_compatible_p (type, TREE_TYPE (gimple_assign_rhs2 (cond_def))))
1421 : return false;
1422 106948 : range_op_handler hand (gimple_assign_rhs_code (cond_def));
1423 106948 : if (!hand)
1424 : return false;
1425 :
1426 106948 : tree c1 = gimple_range_ssa_p (gimple_assign_rhs1 (cond_def));
1427 213896 : tree c2 = gimple_range_ssa_p (gimple_assign_rhs2 (cond_def));
1428 :
1429 : // Only solve if there is one SSA name in the condition.
1430 106948 : if ((!c1 && !c2) || (c1 && c2))
1431 : return false;
1432 :
1433 : // Pick up the current values of each part of the condition.
1434 28526 : tree rhs1 = gimple_assign_rhs1 (cond_def);
1435 28526 : tree rhs2 = gimple_assign_rhs2 (cond_def);
1436 28526 : value_range cl (TREE_TYPE (rhs1));
1437 28526 : value_range cr (TREE_TYPE (rhs2));
1438 28526 : src.get_operand (cl, rhs1);
1439 28526 : src.get_operand (cr, rhs2);
1440 :
1441 28526 : tree cond_name = c1 ? c1 : c2;
1442 28526 : gimple *def_stmt = SSA_NAME_DEF_STMT (cond_name);
1443 :
1444 : // Evaluate the value of COND_NAME on the true and false edges, using either
1445 : // the op1 or op2 routines based on its location.
1446 28526 : value_range cond_true (type), cond_false (type);
1447 28526 : if (c1)
1448 : {
1449 28526 : if (!hand.op1_range (cond_false, type, range_false (), cr))
1450 : return false;
1451 28526 : if (!hand.op1_range (cond_true, type, range_true (), cr))
1452 : return false;
1453 28526 : cond_false.intersect (cl);
1454 28526 : cond_true.intersect (cl);
1455 : }
1456 : else
1457 : {
1458 0 : if (!hand.op2_range (cond_false, type, range_false (), cl))
1459 : return false;
1460 0 : if (!hand.op2_range (cond_true, type, range_true (), cl))
1461 : return false;
1462 0 : cond_false.intersect (cr);
1463 0 : cond_true.intersect (cr);
1464 : }
1465 :
1466 : // Now solve for SSA1 or SSA2 if they are in the dependency chain.
1467 52575 : if (ssa1 && src.gori_ssa()->in_chain_p (ssa1, cond_name))
1468 : {
1469 1749 : value_range tmp1 (TREE_TYPE (ssa1));
1470 3498 : if (src.gori ()->compute_operand_range (tmp1, def_stmt, cond_true,
1471 : ssa1, src))
1472 1263 : r1.intersect (tmp1);
1473 1749 : }
1474 47323 : if (ssa2 && src.gori_ssa ()->in_chain_p (ssa2, cond_name))
1475 : {
1476 254 : value_range tmp2 (TREE_TYPE (ssa2));
1477 508 : if (src.gori ()->compute_operand_range (tmp2, def_stmt, cond_false,
1478 : ssa2, src))
1479 208 : r2.intersect (tmp2);
1480 254 : }
1481 : // If the same name is specified in the condition and COND_EXPR,
1482 : // combine the calculated condition range and the other one provided. ie:
1483 : // c_1 = b_2 < 10
1484 : // f_3 = c_1 ? 0 : b_2
1485 : // With b_2 providing the false value, the value of f_3 will be
1486 : // either 0 UNION (0 = b_2 < 10), which is [-INF, 9].
1487 : // COND_EXPR is
1488 28526 : if (ssa1 && cond_name == ssa1)
1489 2323 : r1 = cond_true;
1490 26203 : else if (ssa2 && cond_name == ssa2)
1491 3080 : r2 = cond_false;
1492 : return true;
1493 28526 : }
1494 :
1495 : // Calculate a range for COND_EXPR statement S and return it in R.
1496 : // If a range cannot be calculated, return false.
1497 :
1498 : bool
1499 173072 : fold_using_range::range_of_cond_expr (vrange &r, gassign *s, fur_source &src)
1500 : {
1501 173072 : tree cond = gimple_assign_rhs1 (s);
1502 173072 : tree op1 = gimple_assign_rhs2 (s);
1503 173072 : tree op2 = gimple_assign_rhs3 (s);
1504 :
1505 173072 : tree type = gimple_range_type (s);
1506 173072 : if (!type)
1507 : return false;
1508 :
1509 173072 : value_range range1 (TREE_TYPE (op1));
1510 173072 : value_range range2 (TREE_TYPE (op2));
1511 173072 : value_range cond_range (TREE_TYPE (cond));
1512 173072 : gcc_checking_assert (gimple_assign_rhs_code (s) == COND_EXPR);
1513 173072 : gcc_checking_assert (range_compatible_p (TREE_TYPE (op1), TREE_TYPE (op2)));
1514 173072 : src.get_operand (cond_range, cond);
1515 173072 : src.get_operand (range1, op1);
1516 173072 : src.get_operand (range2, op2);
1517 :
1518 : // Try to see if there is a dependence between the COND and either operand
1519 173072 : if (condexpr_adjust (range1, range2, s, cond, op1, op2, src))
1520 28526 : if (dump_file && (dump_flags & TDF_DETAILS))
1521 : {
1522 581 : fprintf (dump_file, "Possible COND_EXPR adjustment. Range op1 : ");
1523 581 : range1.dump(dump_file);
1524 581 : fprintf (dump_file, " and Range op2: ");
1525 581 : range2.dump(dump_file);
1526 581 : fprintf (dump_file, "\n");
1527 : }
1528 :
1529 : // If the condition is known, choose the appropriate expression.
1530 173072 : if (cond_range.singleton_p ())
1531 : {
1532 : // False, pick second operand.
1533 2510 : if (cond_range.zero_p ())
1534 1265 : r = range2;
1535 : else
1536 1245 : r = range1;
1537 : }
1538 : else
1539 : {
1540 170562 : r = range1;
1541 170562 : r.union_ (range2);
1542 : }
1543 173072 : gcc_checking_assert (r.undefined_p ()
1544 : || range_compatible_p (r.type (), type));
1545 173072 : return true;
1546 173072 : }
1547 :
1548 : // If SCEV has any information about phi node NAME, return it as a range in R.
1549 :
1550 : void
1551 6929102 : fold_using_range::range_of_ssa_name_with_loop_info (vrange &r, tree name,
1552 : class loop *l, gphi *phi,
1553 : fur_source &src)
1554 : {
1555 6929102 : static bool in_scev_call = false;
1556 6929102 : gcc_checking_assert (TREE_CODE (name) == SSA_NAME);
1557 : // Avoid SCEV callbacks causing infinite recursion.
1558 6929102 : if (in_scev_call)
1559 411081 : r.set_varying (TREE_TYPE (name));
1560 : // SCEV currently invokes get_range_query () for values. If the query
1561 : // being passed in is not the same SCEV will use, do not invoke SCEV.
1562 : // This can be remove if/when SCEV uses a passed in range-query.
1563 13036042 : else if (src.query () != get_range_query (cfun))
1564 : {
1565 744790 : r.set_varying (TREE_TYPE (name));
1566 : // Report the msmatch if SRC is not the global query. The cache
1567 : // uses a global query and would provide numerous false positives.
1568 44 : if (dump_file && (dump_flags & TDF_DETAILS)
1569 744810 : && src.query () != get_global_range_query ())
1570 20 : fprintf (dump_file,
1571 : "fold_using-range:: SCEV not invoked due to mismatched queries\n");
1572 : }
1573 : else
1574 : {
1575 5773231 : in_scev_call = true;
1576 5773231 : if (!range_of_var_in_loop (r, name, l, phi, src.query ()))
1577 293 : r.set_varying (TREE_TYPE (name));
1578 5773231 : in_scev_call = false;
1579 : }
1580 6929102 : }
1581 :
1582 : // -----------------------------------------------------------------------
1583 :
1584 : // Check if an && or || expression can be folded based on relations. ie
1585 : // c_2 = a_6 > b_7
1586 : // c_3 = a_6 < b_7
1587 : // c_4 = c_2 && c_3
1588 : // c_2 and c_3 can never be true at the same time,
1589 : // Therefore c_4 can always resolve to false based purely on the relations.
1590 :
1591 : void
1592 141421259 : fold_using_range::relation_fold_and_or (irange& lhs_range, gimple *s,
1593 : fur_source &src, vrange &op1,
1594 : vrange &op2)
1595 : {
1596 : // No queries or already folded.
1597 141421259 : if (!src.gori () || lhs_range.singleton_p ())
1598 : return;
1599 :
1600 : // Only care about AND and OR expressions.
1601 89949408 : enum tree_code code = gimple_expr_code (s);
1602 89949408 : bool is_and = false;
1603 89949408 : if (code == BIT_AND_EXPR || code == TRUTH_AND_EXPR)
1604 : is_and = true;
1605 86257542 : else if (code != BIT_IOR_EXPR && code != TRUTH_OR_EXPR)
1606 : return;
1607 :
1608 5234770 : gimple_range_op_handler handler (s);
1609 5234770 : tree lhs = handler.lhs ();
1610 5234770 : tree ssa1 = gimple_range_ssa_p (handler.operand1 ());
1611 5234770 : tree ssa2 = gimple_range_ssa_p (handler.operand2 ());
1612 :
1613 : // Deal with || and && only when there is a full set of symbolics.
1614 5234757 : if (!lhs || !ssa1 || !ssa2
1615 2862694 : || (TREE_CODE (TREE_TYPE (lhs)) != BOOLEAN_TYPE)
1616 2003721 : || (TREE_CODE (TREE_TYPE (ssa1)) != BOOLEAN_TYPE)
1617 7237257 : || (TREE_CODE (TREE_TYPE (ssa2)) != BOOLEAN_TYPE))
1618 : return;
1619 :
1620 : // Now we know its a boolean AND or OR expression with boolean operands.
1621 : // Ideally we search dependencies for common names, and see what pops out.
1622 : // until then, simply try to resolve direct dependencies.
1623 :
1624 1999814 : gimple *ssa1_stmt = SSA_NAME_DEF_STMT (ssa1);
1625 1999814 : gimple *ssa2_stmt = SSA_NAME_DEF_STMT (ssa2);
1626 :
1627 1999814 : gimple_range_op_handler handler1 (ssa1_stmt);
1628 1999814 : gimple_range_op_handler handler2 (ssa2_stmt);
1629 :
1630 : // If either handler is not present, no relation can be found.
1631 1999814 : if (!handler1 || !handler2)
1632 : return;
1633 :
1634 : // Both stmts will need to have 2 ssa names in the stmt.
1635 1872872 : tree ssa1_dep1 = gimple_range_ssa_p (handler1.operand1 ());
1636 1872872 : tree ssa1_dep2 = gimple_range_ssa_p (handler1.operand2 ());
1637 1872872 : tree ssa2_dep1 = gimple_range_ssa_p (handler2.operand1 ());
1638 1872872 : tree ssa2_dep2 = gimple_range_ssa_p (handler2.operand2 ());
1639 :
1640 1872872 : if (!ssa1_dep1 || !ssa1_dep2 || !ssa2_dep1 || !ssa2_dep2)
1641 : return;
1642 :
1643 232519 : if (HONOR_NANS (TREE_TYPE (ssa1_dep1)))
1644 : return;
1645 :
1646 : // Make sure they are the same dependencies, and detect the order of the
1647 : // relationship.
1648 217538 : bool reverse_op2 = true;
1649 217538 : if (ssa1_dep1 == ssa2_dep1 && ssa1_dep2 == ssa2_dep2)
1650 : reverse_op2 = false;
1651 217477 : else if (ssa1_dep1 != ssa2_dep2 || ssa1_dep2 != ssa2_dep1)
1652 : return;
1653 :
1654 66 : int_range<2> bool_one = range_true ();
1655 66 : relation_kind relation1 = handler1.op1_op2_relation (bool_one, op1, op2);
1656 66 : relation_kind relation2 = handler2.op1_op2_relation (bool_one, op1, op2);
1657 66 : if (relation1 == VREL_VARYING || relation2 == VREL_VARYING)
1658 : return;
1659 :
1660 30 : if (reverse_op2)
1661 5 : relation2 = relation_swap (relation2);
1662 :
1663 : // x && y is false if the relation intersection of the true cases is NULL.
1664 30 : if (is_and && relation_intersect (relation1, relation2) == VREL_UNDEFINED)
1665 0 : lhs_range = range_false (boolean_type_node);
1666 : // x || y is true if the union of the true cases is NO-RELATION..
1667 : // ie, one or the other being true covers the full range of possibilities.
1668 30 : else if (!is_and && relation_union (relation1, relation2) == VREL_VARYING)
1669 0 : lhs_range = bool_one;
1670 : else
1671 : return;
1672 :
1673 0 : range_cast (lhs_range, TREE_TYPE (lhs));
1674 0 : if (dump_file && (dump_flags & TDF_DETAILS))
1675 : {
1676 0 : fprintf (dump_file, " Relation adjustment: ");
1677 0 : print_generic_expr (dump_file, ssa1, TDF_SLIM);
1678 0 : fprintf (dump_file, " and ");
1679 0 : print_generic_expr (dump_file, ssa2, TDF_SLIM);
1680 0 : fprintf (dump_file, " combine to produce ");
1681 0 : lhs_range.dump (dump_file);
1682 0 : fputc ('\n', dump_file);
1683 : }
1684 :
1685 : return;
1686 66 : }
1687 :
1688 : // Register any outgoing edge relations from a conditional branch.
1689 :
1690 : void
1691 75158193 : fur_source::register_outgoing_edges (gcond *s, irange &lhs_range,
1692 : edge e0, edge e1)
1693 : {
1694 75158193 : int_range<2> e0_range, e1_range;
1695 75158193 : tree name;
1696 75158193 : basic_block bb = gimple_bb (s);
1697 :
1698 75158193 : gimple_range_op_handler handler (s);
1699 75158193 : if (!handler)
1700 : return;
1701 :
1702 75147223 : if (e0)
1703 : {
1704 : // If this edge is never taken, ignore it.
1705 62673584 : gcond_edge_range (e0_range, e0);
1706 62673584 : e0_range.intersect (lhs_range);
1707 62673584 : if (e0_range.undefined_p ())
1708 27388821 : e0 = NULL;
1709 : }
1710 :
1711 75147223 : if (e1)
1712 : {
1713 : // If this edge is never taken, ignore it.
1714 54954340 : gcond_edge_range (e1_range, e1);
1715 54954340 : e1_range.intersect (lhs_range);
1716 54954340 : if (e1_range.undefined_p ())
1717 31906774 : e1 = NULL;
1718 : }
1719 :
1720 75147223 : if (!e0 && !e1)
1721 : return;
1722 :
1723 : // First, register the gcond itself. This will catch statements like
1724 : // if (a_2 < b_5)
1725 71702943 : tree ssa1 = gimple_range_ssa_p (handler.operand1 ());
1726 71702943 : tree ssa2 = gimple_range_ssa_p (handler.operand2 ());
1727 71702943 : value_range r1,r2;
1728 71702943 : if (ssa1 && ssa2)
1729 : {
1730 22444738 : r1.set_varying (TREE_TYPE (ssa1));
1731 22444738 : r2.set_varying (TREE_TYPE (ssa2));
1732 22444738 : if (e0)
1733 : {
1734 15401470 : relation_kind relation = handler.op1_op2_relation (e0_range, r1, r2);
1735 15401470 : if (relation != VREL_VARYING)
1736 15330751 : register_relation (e0, relation, ssa1, ssa2);
1737 : }
1738 22444738 : if (e1)
1739 : {
1740 13174993 : relation_kind relation = handler.op1_op2_relation (e1_range, r1, r2);
1741 13174993 : if (relation != VREL_VARYING)
1742 13117239 : register_relation (e1, relation, ssa1, ssa2);
1743 : }
1744 : }
1745 :
1746 : // Outgoing relations of GORI exports require a gori engine.
1747 128893286 : if (!gori_ssa ())
1748 14512618 : return;
1749 :
1750 : // Now look for other relations in the exports. This will find stmts
1751 : // leading to the condition such as:
1752 : // c_2 = a_4 < b_7
1753 : // if (c_2)
1754 182489284 : FOR_EACH_GORI_EXPORT_NAME (gori_ssa (), bb, name)
1755 : {
1756 125298959 : if (TREE_CODE (TREE_TYPE (name)) != BOOLEAN_TYPE)
1757 119393219 : continue;
1758 9268707 : gimple *stmt = SSA_NAME_DEF_STMT (name);
1759 9268707 : gimple_range_op_handler handler (stmt);
1760 9268707 : if (!handler)
1761 3362967 : continue;
1762 5905740 : tree ssa1 = gimple_range_ssa_p (handler.operand1 ());
1763 5905740 : tree ssa2 = gimple_range_ssa_p (handler.operand2 ());
1764 5905740 : value_range r (TREE_TYPE (name));
1765 5905740 : if (ssa1 && ssa2)
1766 : {
1767 2529183 : r1.set_varying (TREE_TYPE (ssa1));
1768 2529183 : r2.set_varying (TREE_TYPE (ssa2));
1769 1526819 : if (e0 && gori ()->edge_range_p (r, e0, name, *m_query)
1770 4013611 : && r.singleton_p ())
1771 : {
1772 1350259 : relation_kind relation = handler.op1_op2_relation (r, r1, r2);
1773 1350259 : if (relation != VREL_VARYING)
1774 444629 : register_relation (e0, relation, ssa1, ssa2);
1775 : }
1776 1607416 : if (e1 && gori ()->edge_range_p (r, e1, name, *m_query)
1777 4087217 : && r.singleton_p ())
1778 : {
1779 1174173 : relation_kind relation = handler.op1_op2_relation (r, r1, r2);
1780 1174173 : if (relation != VREL_VARYING)
1781 186088 : register_relation (e1, relation, ssa1, ssa2);
1782 : }
1783 : }
1784 5905740 : }
1785 75158193 : }
|
