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 494812425 : fur_source::fur_source (range_query *q)
58 : {
59 494812425 : if (q)
60 494811489 : m_query = q;
61 : else
62 1872 : m_query = get_range_query (cfun);
63 494812425 : m_depend_p = false;
64 494812425 : }
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 5824654 : fur_source::query_relation (tree op1 ATTRIBUTE_UNUSED,
87 : tree op2 ATTRIBUTE_UNUSED)
88 : {
89 5824654 : return VREL_VARYING;
90 : }
91 :
92 : // Default registers nothing and returns false meaning nothing changed.
93 :
94 : bool
95 27340476 : 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 27340476 : return false;
101 : }
102 :
103 : // Default registers nothing and returns false meaning nothing changed.
104 :
105 : bool
106 7608626 : 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 7608626 : return false;
112 : }
113 :
114 : // Get the value of EXPR on edge m_edge.
115 :
116 : bool
117 64007196 : fur_edge::get_operand (vrange &r, tree expr)
118 : {
119 64007196 : 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 434877592 : fur_stmt::fur_stmt (gimple *s, range_query *q) : fur_source (q)
136 : {
137 434877592 : m_stmt = s;
138 434877592 : }
139 :
140 : // Retrieve range of EXPR as it occurs as a use on stmt M_STMT.
141 :
142 : bool
143 574790498 : fur_stmt::get_operand (vrange &r, tree expr)
144 : {
145 574790498 : 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 51226374 : fur_stmt::get_phi_operand (vrange &r, tree expr, edge e)
153 : {
154 : // Pick up the range of expr from edge E.
155 51226374 : fur_edge e_src (e, m_query);
156 51226374 : return e_src.get_operand (r, expr);
157 : }
158 :
159 : // Return relation based from m_stmt.
160 :
161 : relation_kind
162 109872307 : fur_stmt::query_relation (tree op1, tree op2)
163 : {
164 109872307 : 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 240103482 : fur_depend::fur_depend (gimple *s, range_query *q, ranger_cache *c)
170 240103482 : : fur_stmt (s, q), m_cache (c)
171 : {
172 240103482 : m_depend_p = true;
173 240103482 : }
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 31168891 : fur_depend::register_relation (gimple *s, relation_kind k, tree op1, tree op2)
180 : {
181 31168891 : 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 24947348 : if (m_cache)
187 : {
188 24947177 : m_cache->update_consumers (op1);
189 24947177 : 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 6669744 : fur_depend::register_relation (edge e, relation_kind k, tree op1, tree op2)
199 : {
200 6669744 : 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 6651239 : if (m_cache)
206 : {
207 6651237 : m_cache->update_consumers (op1);
208 6651237 : 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 880029 : fur_list::fur_list (vrange &r1, range_query *q) : fur_source (q)
234 : {
235 880029 : m_list = m_local;
236 880029 : m_index = 0;
237 880029 : m_limit = 1;
238 880029 : m_local[0] = &r1;
239 880029 : }
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 1752297 : 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 1752297 : if (TREE_CODE (expr) != SSA_NAME || m_index >= m_limit)
269 872268 : return m_query->range_of_expr (r, expr);
270 880029 : r = *m_list[m_index++];
271 880029 : 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 880029 : fold_range (vrange &r, gimple *s, vrange &r1, range_query *q)
286 : {
287 880029 : fold_using_range f;
288 880029 : fur_list src (r1, q);
289 880029 : 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 83106543 : fold_range (vrange &r, gimple *s, range_query *q)
318 : {
319 83106543 : fold_using_range f;
320 83106543 : fur_stmt src (s, q);
321 83106543 : 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 7828424 : fold_range (vrange &r, gimple *s, edge on_edge, range_query *q)
328 : {
329 7828424 : fold_using_range f;
330 7828424 : fur_edge src (on_edge, q);
331 7828424 : 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 1086816 : fur_relation::fur_relation (gimple *s, range_query *q) : fur_stmt (s, q)
423 : {
424 1086816 : def_op1 = def_op2 = op1_op2 = VREL_VARYING;
425 1086816 : }
426 :
427 : // Construct a trio from what is known.
428 :
429 : relation_trio
430 1086816 : fur_relation::trio () const
431 : {
432 1086816 : 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 1068939 : fur_relation::register_relation (gimple *stmt, relation_kind k, tree op1,
449 : tree op2)
450 : {
451 1068939 : tree lhs = gimple_get_lhs (stmt);
452 1068939 : tree a1 = NULL_TREE;
453 1068939 : tree a2 = NULL_TREE;
454 1068939 : 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 1068939 : case GIMPLE_ASSIGN:
461 1068939 : a1 = gimple_assign_rhs1 (stmt);
462 1068939 : if (gimple_num_ops (stmt) >= 3)
463 1068939 : 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 1068939 : if (op1 == lhs)
471 : {
472 1068939 : if (op2 == a1)
473 1068939 : 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 1068939 : && op1_op2 == VREL_VARYING;
493 : }
494 :
495 : // Return the relation trio for stmt S using query Q.
496 :
497 : relation_trio
498 1086816 : fold_relations (gimple *s, range_query *q)
499 : {
500 1086816 : fold_using_range f;
501 1086816 : fur_relation src (s, q);
502 1086816 : tree lhs = gimple_range_ssa_p (gimple_get_lhs (s));
503 1086816 : if (lhs)
504 : {
505 1086816 : value_range vr(TREE_TYPE (lhs));
506 1086816 : if (f.fold_stmt (vr, s, src))
507 1086816 : return src.trio ();
508 1086816 : }
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 2891087 : adjust_pointer_diff_expr (irange &res, const gimple *diff_stmt)
526 : {
527 2891087 : tree op0 = gimple_assign_rhs1 (diff_stmt);
528 2891087 : tree op1 = gimple_assign_rhs2 (diff_stmt);
529 2891087 : tree op0_ptype = TREE_TYPE (TREE_TYPE (op0));
530 2891087 : tree op1_ptype = TREE_TYPE (TREE_TYPE (op1));
531 2891087 : gimple *call;
532 :
533 2891087 : if (TREE_CODE (op0) == SSA_NAME
534 2859335 : && TREE_CODE (op1) == SSA_NAME
535 2813082 : && (call = SSA_NAME_DEF_STMT (op0))
536 2813082 : && is_gimple_call (call)
537 83332 : && gimple_call_builtin_p (call, BUILT_IN_MEMCHR)
538 64390 : && TYPE_MODE (op0_ptype) == TYPE_MODE (char_type_node)
539 64146 : && TYPE_PRECISION (op0_ptype) == TYPE_PRECISION (char_type_node)
540 64146 : && TYPE_MODE (op1_ptype) == TYPE_MODE (char_type_node)
541 63604 : && TYPE_PRECISION (op1_ptype) == TYPE_PRECISION (char_type_node)
542 63604 : && gimple_call_builtin_p (call, BUILT_IN_MEMCHR)
543 63604 : && vrp_operand_equal_p (op1, gimple_call_arg (call, 0))
544 2931044 : && 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 2891087 : }
552 :
553 : // Adjust the range for an IMAGPART_EXPR.
554 :
555 : static void
556 963775 : adjust_imagpart_expr (vrange &res, const gimple *stmt)
557 : {
558 963775 : tree name = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0);
559 :
560 963775 : if (TREE_CODE (name) != SSA_NAME || !SSA_NAME_DEF_STMT (name))
561 : return;
562 :
563 834487 : gimple *def_stmt = SSA_NAME_DEF_STMT (name);
564 834487 : if (is_gimple_call (def_stmt) && gimple_call_internal_p (def_stmt))
565 : {
566 401855 : switch (gimple_call_internal_fn (def_stmt))
567 : {
568 384373 : case IFN_ADD_OVERFLOW:
569 384373 : case IFN_SUB_OVERFLOW:
570 384373 : case IFN_MUL_OVERFLOW:
571 384373 : case IFN_UADDC:
572 384373 : case IFN_USUBC:
573 384373 : case IFN_ATOMIC_COMPARE_EXCHANGE:
574 384373 : {
575 384373 : int_range<2> r;
576 384373 : r.set_varying (boolean_type_node);
577 384373 : tree type = TREE_TYPE (gimple_assign_lhs (stmt));
578 384373 : range_cast (r, type);
579 384373 : res.intersect (r);
580 384373 : }
581 : default:
582 : break;
583 : }
584 : return;
585 : }
586 432632 : if (is_gimple_assign (def_stmt)
587 432632 : && 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 924028 : adjust_realpart_expr (vrange &res, const gimple *stmt)
604 : {
605 924028 : tree name = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0);
606 :
607 924028 : if (TREE_CODE (name) != SSA_NAME)
608 : return;
609 :
610 786901 : gimple *def_stmt = SSA_NAME_DEF_STMT (name);
611 786901 : if (!SSA_NAME_DEF_STMT (name))
612 : return;
613 :
614 786901 : if (is_gimple_assign (def_stmt)
615 786901 : && 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 194779077 : gimple_range_adjustment (vrange &res, const gimple *stmt)
634 : {
635 194779077 : switch (gimple_expr_code (stmt))
636 : {
637 2891087 : case POINTER_DIFF_EXPR:
638 2891087 : adjust_pointer_diff_expr (as_a <irange> (res), stmt);
639 2891087 : return;
640 :
641 963775 : case IMAGPART_EXPR:
642 963775 : adjust_imagpart_expr (res, stmt);
643 963775 : return;
644 :
645 924028 : case REALPART_EXPR:
646 924028 : adjust_realpart_expr (res, stmt);
647 924028 : 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 90330072 : pta_valueize (tree name)
666 : {
667 90330072 : tree ret
668 90330072 : = x_fold_context.m_query->value_of_expr (name, x_fold_context.m_stmt);
669 :
670 90330072 : 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 308658972 : fold_using_range::fold_stmt (vrange &r, gimple *s, fur_source &src, tree name)
680 : {
681 308658972 : bool res = false;
682 : // If name and S are specified, make sure it is an LHS of S.
683 308658972 : gcc_checking_assert (!name || !gimple_get_lhs (s) ||
684 : name == gimple_get_lhs (s));
685 :
686 : if (!name)
687 171779674 : name = gimple_get_lhs (s);
688 :
689 : // Process addresses and loads from static constructors.
690 308658972 : 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 308554626 : range_query *save = cfun->x_range_query;
698 379558997 : if (src.query () != get_range_query (cfun))
699 144221931 : cfun->x_range_query = src.query ();
700 :
701 308554626 : gimple_range_op_handler handler (s);
702 308554626 : if (gimple_code (s) == GIMPLE_ASSIGN
703 308554626 : && gimple_assign_rhs_code (s) == ADDR_EXPR)
704 4337619 : res = range_of_address (as_a <prange> (r), s, src);
705 304217007 : else if (handler)
706 194780225 : res = range_of_range_op (r, handler, src);
707 109436782 : else if (is_a<gphi *>(s))
708 24881620 : res = range_of_phi (r, as_a<gphi *> (s), src);
709 84555162 : else if (is_a<gcall *>(s))
710 13463248 : res = range_of_call (r, as_a<gcall *> (s), src);
711 71091914 : else if (is_a<gassign *> (s) && gimple_assign_rhs_code (s) == COND_EXPR)
712 166403 : 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 237629115 : if (res && r.varying_p () && INTEGRAL_TYPE_P (r.type ()))
718 : {
719 121257968 : irange &ir = as_a <irange> (r);
720 121257968 : tree type = r.type ();
721 121257968 : auto typemax = wi::to_wide (TYPE_MAX_VALUE (type));
722 121257968 : auto typemin = wi::to_wide (TYPE_MIN_VALUE (type));
723 121257968 : auto precisionmax = wi::max_value (TYPE_PRECISION (type),
724 242515936 : TYPE_SIGN (type));
725 121257968 : auto precisionmin = wi::min_value (TYPE_PRECISION (type),
726 242515936 : TYPE_SIGN (type));
727 242445982 : if (typemax != precisionmax || typemin != precisionmin)
728 69954 : ir.set (type, typemin, typemax);
729 121258838 : }
730 :
731 308554626 : if (!res)
732 : {
733 : // Restore the original query.
734 70925511 : cfun->x_range_query = save;
735 : // If no name specified or range is unsupported, bail.
736 70925511 : if (!name || !gimple_range_ssa_p (name))
737 : return false;
738 : // We don't understand the stmt, so return the global range.
739 70875296 : gimple_range_global (r, name);
740 70875296 : return true;
741 : }
742 :
743 237629115 : if (r.undefined_p ())
744 : {
745 : // Restore the original query.
746 52073 : cfun->x_range_query = save;
747 52073 : return true;
748 : }
749 :
750 : // We sometimes get compatible types copied from operands, make sure
751 : // the correct type is being returned.
752 237577042 : if (name && TREE_TYPE (name) != r.type ())
753 : {
754 3880603 : gcc_checking_assert (range_compatible_p (r.type (), TREE_TYPE (name)));
755 3880603 : range_cast (r, TREE_TYPE (name));
756 : }
757 :
758 237577042 : if (is_a <prange> (r))
759 : {
760 28241913 : prange &p = as_a <prange> (r);
761 : // Check to see if points_to should be set.
762 28241913 : if (p.pt_unknown_p () && name && gimple_code (s) == GIMPLE_ASSIGN)
763 : {
764 16721089 : tree rhs = gimple_assign_rhs1 (s);
765 16721089 : tree_code code = gimple_assign_rhs_code (s);
766 : // If code is SSA_NAME, any points to would already be copied.
767 16721089 : if (code != SSA_NAME
768 15308026 : && get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS
769 21239798 : && TREE_CODE (rhs) == ADDR_EXPR)
770 4335498 : p.set_pt (rhs, true);
771 : else
772 : {
773 : // If we couldn't find anything, try fold.
774 12385591 : x_fold_context = { s, src.query () };
775 12385591 : rhs = gimple_fold_stmt_to_constant_1 (s, pta_valueize,
776 : pta_valueize);
777 12385591 : if (rhs && TREE_CODE (rhs) == ADDR_EXPR)
778 17383 : p.set_pt (rhs, true);
779 : }
780 : }
781 : }
782 : // Restore the original query.
783 237577042 : cfun->x_range_query = save;
784 237577042 : return true;
785 : }
786 :
787 : // Calculate a range for range_op statement S and return it in R. If any
788 : // If a range cannot be calculated, return false.
789 :
790 : bool
791 194780225 : fold_using_range::range_of_range_op (vrange &r,
792 : gimple_range_op_handler &handler,
793 : fur_source &src)
794 : {
795 194780225 : gcc_checking_assert (handler);
796 194780225 : gimple *s = handler.stmt ();
797 194780225 : tree type = gimple_range_type (s);
798 194780225 : if (!type)
799 : return false;
800 :
801 194780225 : tree lhs = handler.lhs ();
802 194780225 : tree op1 = handler.operand1 ();
803 194780225 : tree op2 = handler.operand2 ();
804 :
805 : // Certain types of builtin functions may have no arguments.
806 194780225 : if (!op1)
807 : {
808 1148 : value_range r1 (type);
809 1148 : if (!handler.fold_range (r, type, r1, r1))
810 0 : r.set_varying (type);
811 1148 : return true;
812 1148 : }
813 :
814 194779077 : value_range range1 (TREE_TYPE (op1));
815 194779077 : value_range range2 (op2 ? TREE_TYPE (op2) : TREE_TYPE (op1));
816 :
817 194779077 : if (src.get_operand (range1, op1))
818 : {
819 194779077 : if (!op2)
820 : {
821 : // Fold range, and register any dependency if available.
822 39568417 : value_range r2 (type);
823 39568417 : r2.set_varying (type);
824 39568417 : if (!handler.fold_range (r, type, range1, r2))
825 305342 : r.set_varying (type);
826 39568417 : if (lhs && gimple_range_ssa_p (op1))
827 : {
828 57186248 : if (src.gori_ssa ())
829 21047739 : src.gori_ssa ()->register_dependency (lhs, op1);
830 36138476 : relation_kind rel;
831 36138476 : rel = handler.lhs_op1_relation (r, range1, range1);
832 36138476 : if (rel != VREL_VARYING)
833 26685649 : src.register_relation (s, rel, lhs, op1);
834 : }
835 39568417 : }
836 155210660 : else if (src.get_operand (range2, op2))
837 : {
838 155210660 : relation_kind rel = src.query_relation (op1, op2);
839 155210660 : if (dump_file && (dump_flags & TDF_DETAILS) && rel != VREL_VARYING)
840 : {
841 150 : fprintf (dump_file, " folding with relation ");
842 150 : print_generic_expr (dump_file, op1, TDF_SLIM);
843 150 : print_relation (dump_file, rel);
844 150 : print_generic_expr (dump_file, op2, TDF_SLIM);
845 150 : fputc ('\n', dump_file);
846 : }
847 : // Fold range, and register any dependency if available.
848 155210660 : if (!handler.fold_range (r, type, range1, range2,
849 : relation_trio::op1_op2 (rel)))
850 0 : r.set_varying (type);
851 155210660 : if (irange::supports_p (type))
852 141815448 : relation_fold_and_or (as_a <irange> (r), s, src, range1, range2);
853 155210660 : if (lhs)
854 : {
855 153898784 : if (src.gori_ssa ())
856 : {
857 58622705 : src.gori_ssa ()->register_dependency (lhs, op1);
858 117245410 : src.gori_ssa ()->register_dependency (lhs, op2);
859 : }
860 95275746 : if (gimple_range_ssa_p (op1))
861 : {
862 92465805 : relation_kind rel2 = handler.lhs_op1_relation (r, range1,
863 92465805 : range2, rel);
864 92465805 : if (rel2 != VREL_VARYING)
865 39417826 : src.register_relation (s, rel2, lhs, op1);
866 : }
867 95275746 : if (gimple_range_ssa_p (op2))
868 : {
869 38370325 : relation_kind rel2 = handler.lhs_op2_relation (r, range1,
870 38370325 : range2, rel);
871 38370325 : if (rel2 != VREL_VARYING)
872 2474980 : src.register_relation (s, rel2, lhs, op2);
873 : }
874 : }
875 : // Check for an existing BB, as we maybe asked to fold an
876 : // artificial statement not in the CFG.
877 59934914 : else if (is_a<gcond *> (s) && gimple_bb (s))
878 : {
879 51183343 : basic_block bb = gimple_bb (s);
880 51183343 : edge e0 = EDGE_SUCC (bb, 0);
881 : /* During RTL expansion one of the edges can be removed
882 : if expansion proves the jump is unconditional. */
883 51183343 : edge e1 = single_succ_p (bb) ? NULL : EDGE_SUCC (bb, 1);
884 :
885 51183343 : gcc_checking_assert (e1 || currently_expanding_to_rtl);
886 51183343 : if (!single_pred_p (e0->dest))
887 12409822 : e0 = NULL;
888 51183343 : if (e1 && !single_pred_p (e1->dest))
889 : e1 = NULL;
890 51183343 : src.register_outgoing_edges (as_a<gcond *> (s),
891 : as_a <irange> (r), e0, e1);
892 : }
893 : }
894 : else
895 0 : r.set_varying (type);
896 : }
897 : else
898 0 : r.set_varying (type);
899 : // Make certain range-op adjustments that aren't handled any other way.
900 194779077 : gimple_range_adjustment (r, s);
901 194779077 : return true;
902 194779077 : }
903 :
904 : // Calculate the range of an assignment containing an ADDR_EXPR.
905 : // Return the range in R.
906 : // If a range cannot be calculated, set it to VARYING and return true.
907 :
908 : bool
909 4337619 : fold_using_range::range_of_address (prange &r, gimple *stmt, fur_source &src)
910 : {
911 4337619 : gcc_checking_assert (gimple_code (stmt) == GIMPLE_ASSIGN);
912 4337619 : gcc_checking_assert (gimple_assign_rhs_code (stmt) == ADDR_EXPR);
913 :
914 4337619 : tree expr = gimple_assign_rhs1 (stmt);
915 4337619 : poly_int64 bitsize, bitpos;
916 4337619 : tree offset;
917 4337619 : machine_mode mode;
918 4337619 : int unsignedp, reversep, volatilep;
919 4337619 : tree base = get_inner_reference (TREE_OPERAND (expr, 0), &bitsize,
920 : &bitpos, &offset, &mode, &unsignedp,
921 : &reversep, &volatilep);
922 :
923 :
924 4337619 : if (base != NULL_TREE
925 4337619 : && TREE_CODE (base) == MEM_REF
926 8523301 : && TREE_CODE (TREE_OPERAND (base, 0)) == SSA_NAME)
927 : {
928 4185621 : tree ssa = TREE_OPERAND (base, 0);
929 4185621 : tree lhs = gimple_get_lhs (stmt);
930 6760023 : if (lhs && gimple_range_ssa_p (ssa) && src.gori_ssa ())
931 2574402 : src.gori_ssa ()->register_dependency (lhs, ssa);
932 4185621 : src.get_operand (r, ssa);
933 4185621 : range_cast (r, TREE_TYPE (gimple_assign_rhs1 (stmt)));
934 :
935 4185621 : poly_offset_int off = 0;
936 4185621 : bool off_cst = false;
937 4185621 : if (offset == NULL_TREE || TREE_CODE (offset) == INTEGER_CST)
938 : {
939 4103338 : off = mem_ref_offset (base);
940 4103338 : if (offset)
941 48 : off += poly_offset_int::from (wi::to_poly_wide (offset),
942 48 : SIGNED);
943 4103338 : off <<= LOG2_BITS_PER_UNIT;
944 4103338 : off += bitpos;
945 : off_cst = true;
946 : }
947 : /* If &X->a is equal to X, the range of X is the result. */
948 4103338 : if (off_cst && known_eq (off, 0))
949 1473296 : return true;
950 2712325 : else if (flag_delete_null_pointer_checks
951 2712325 : && !TYPE_OVERFLOW_WRAPS (TREE_TYPE (expr)))
952 : {
953 : /* For -fdelete-null-pointer-checks -fno-wrapv-pointer we don't
954 : allow going from non-NULL pointer to NULL. */
955 2710842 : if (r.undefined_p ()
956 5421684 : || !r.contains_p (wi::zero (TYPE_PRECISION (TREE_TYPE (expr)))))
957 : {
958 : /* We could here instead adjust r by off >> LOG2_BITS_PER_UNIT
959 : using POINTER_PLUS_EXPR if off_cst and just fall back to
960 : this. */
961 1993598 : r.set_nonzero (TREE_TYPE (gimple_assign_rhs1 (stmt)));
962 1993598 : return true;
963 : }
964 : }
965 : /* If MEM_REF has a "positive" offset, consider it non-NULL
966 : always, for -fdelete-null-pointer-checks also "negative"
967 : ones. Punt for unknown offsets (e.g. variable ones). */
968 718727 : if (!TYPE_OVERFLOW_WRAPS (TREE_TYPE (expr))
969 718511 : && off_cst
970 659185 : && known_ne (off, 0)
971 1377912 : && (flag_delete_null_pointer_checks || known_gt (off, 0)))
972 : {
973 659185 : r.set_nonzero (TREE_TYPE (gimple_assign_rhs1 (stmt)));
974 659185 : return true;
975 : }
976 59542 : r.set_varying (TREE_TYPE (gimple_assign_rhs1 (stmt)));
977 59542 : return true;
978 : }
979 :
980 : // Handle "= &a".
981 151998 : if (tree_single_nonzero_p (expr))
982 : {
983 150944 : r.set_nonzero (TREE_TYPE (gimple_assign_rhs1 (stmt)));
984 150944 : return true;
985 : }
986 :
987 : // Otherwise return varying.
988 1054 : r.set_varying (TREE_TYPE (gimple_assign_rhs1 (stmt)));
989 1054 : return true;
990 : }
991 :
992 : /* If TYPE is a pointer, return false. Otherwise, add zero of TYPE (which must
993 : be an integer) to R and return true. */
994 :
995 : static bool
996 1183 : range_from_missing_constructor_part (vrange &r, tree type)
997 : {
998 1183 : if (POINTER_TYPE_P (type))
999 : return false;
1000 1038 : gcc_checking_assert (irange::supports_p (type));
1001 1038 : wide_int zero = wi::zero (TYPE_PRECISION (type));
1002 1038 : r.union_ (int_range<1> (type, zero, zero));
1003 1038 : return true;
1004 1038 : }
1005 :
1006 : // One step of fold_using_range::range_from_readonly_var. Process expressions
1007 : // in COMPS which together load a value of TYPE, from index I to 0 according to
1008 : // the corresponding static initializer in CST which should be either a scalar
1009 : // invariant or a constructor. Currently TYPE must be either a pointer or an
1010 : // integer. If TYPE is a pointer, return true if all potentially loaded values
1011 : // are known not to be zero and false if any of them can be zero. Otherwise
1012 : // return true if it is possible to add all constants which can be loaded from
1013 : // CST (which must be storable to TYPE) to R and do so.
1014 : // TODO: Add support for franges.
1015 :
1016 : static bool
1017 800054 : range_from_readonly_load (vrange &r, tree type, tree cst,
1018 : const vec <tree> &comps, unsigned i)
1019 : {
1020 811056 : if (i == 0)
1021 : {
1022 691001 : if (!useless_type_conversion_p (type, TREE_TYPE (cst)))
1023 : return false;
1024 :
1025 691001 : if (POINTER_TYPE_P (type))
1026 : {
1027 151728 : return tree_single_nonzero_p (cst);
1028 : }
1029 :
1030 539273 : if (TREE_CODE (cst) != INTEGER_CST)
1031 : return false;
1032 :
1033 539202 : wide_int wi_cst = wi::to_wide (cst);
1034 539202 : r.union_ (int_range<1> (type, wi_cst, wi_cst));
1035 539202 : return true;
1036 539202 : }
1037 : /* TODO: Perhaps handle RAW_DATA_CST too. */
1038 120055 : if (TREE_CODE (cst) != CONSTRUCTOR)
1039 : return false;
1040 :
1041 119308 : i--;
1042 119308 : tree expr = comps[i];
1043 119308 : unsigned ix;
1044 119308 : tree index, val;
1045 :
1046 119308 : if (TREE_CODE (expr) == COMPONENT_REF)
1047 : {
1048 11049 : tree ref_fld = TREE_OPERAND (expr, 1);
1049 17620 : FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (cst), ix, index, val)
1050 : {
1051 17573 : if (index != ref_fld)
1052 6571 : continue;
1053 : return range_from_readonly_load (r, type, val, comps, i);
1054 : }
1055 47 : if (TREE_CODE (TREE_TYPE (cst)) == RECORD_TYPE)
1056 7 : return range_from_missing_constructor_part (r, type);
1057 : else
1058 : /* Missing constructor of a union field just isn't like other missing
1059 : constructor parts. */
1060 : return false;
1061 : }
1062 :
1063 108259 : gcc_assert (TREE_CODE (expr) == ARRAY_REF);
1064 108259 : tree op1 = TREE_OPERAND (expr, 1);
1065 :
1066 108259 : if (TREE_CODE (op1) == INTEGER_CST)
1067 : {
1068 3315 : unsigned ctor_idx;
1069 3315 : val = get_array_ctor_element_at_index (cst, wi::to_offset (op1),
1070 : &ctor_idx);
1071 3315 : if (!val)
1072 : {
1073 96 : if (ctor_idx < CONSTRUCTOR_NELTS (cst))
1074 : return false;
1075 96 : return range_from_missing_constructor_part (r, type);
1076 : }
1077 3219 : return range_from_readonly_load (r, type, val, comps, i);
1078 : }
1079 :
1080 104944 : tree arr_type = TREE_TYPE (cst);
1081 104944 : tree domain = TYPE_DOMAIN (arr_type);
1082 104944 : if (!TYPE_MIN_VALUE (domain)
1083 104944 : || !TYPE_MAX_VALUE (domain)
1084 104944 : || !tree_fits_uhwi_p (TYPE_MIN_VALUE (domain))
1085 209888 : || !tree_fits_uhwi_p (TYPE_MAX_VALUE (domain)))
1086 : return false;
1087 104869 : unsigned HOST_WIDE_INT needed_count
1088 104869 : = (tree_to_uhwi (TYPE_MAX_VALUE (domain))
1089 104869 : - tree_to_uhwi (TYPE_MIN_VALUE (domain)) + 1);
1090 209678 : if (CONSTRUCTOR_NELTS (cst) < needed_count)
1091 : {
1092 1080 : if (!range_from_missing_constructor_part (r, type))
1093 : return false;
1094 : }
1095 :
1096 795160 : FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (cst), ix, index, val)
1097 : {
1098 : /* TODO: If the array index in the expr is an SSA_NAME with a known
1099 : range, we could use just values loaded from the corresponding array
1100 : elements. */
1101 691313 : if (!range_from_readonly_load (r, type, val, comps, i))
1102 : return false;
1103 : }
1104 :
1105 : return true;
1106 : }
1107 :
1108 : // Attempt to calculate the range of value loaded by STMT (which must be an
1109 : // assignment) if it is a load from a read-only aggregate variable. If
1110 : // successful, return true and set the discovered range in R. Otherwise return
1111 : // false and leave R untouched.
1112 :
1113 : bool
1114 198604214 : fold_using_range::range_from_readonly_var (vrange &r, gimple *stmt)
1115 : {
1116 198604214 : gcc_checking_assert (gimple_code (stmt) == GIMPLE_ASSIGN);
1117 198604214 : tree type = TREE_TYPE (gimple_assign_lhs (stmt));
1118 : /* TODO: Add support for frange. */
1119 198604214 : if (!irange::supports_p (type)
1120 198604214 : && !prange::supports_p (type))
1121 : return false;
1122 :
1123 188549454 : unsigned HOST_WIDE_INT limit = param_vrp_cstload_limit;
1124 188549454 : if (!limit)
1125 : return false;
1126 :
1127 188530710 : tree t = gimple_assign_rhs1 (stmt);
1128 188530710 : if (!tree_fits_uhwi_p (TYPE_SIZE_UNIT (TREE_TYPE (t))))
1129 : return false;
1130 188530710 : limit *= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (t)));
1131 :
1132 188530710 : unsigned count = 0;
1133 188530710 : while (TREE_CODE (t) == ARRAY_REF
1134 240810339 : || TREE_CODE (t) == COMPONENT_REF)
1135 : {
1136 52279629 : count++;
1137 52279629 : t = TREE_OPERAND (t, 0);
1138 : }
1139 188530710 : if (!count
1140 33632102 : || (TREE_CODE (t) != VAR_DECL
1141 33632102 : && TREE_CODE (t) != CONST_DECL))
1142 : return false;
1143 :
1144 9388453 : if (!tree_fits_uhwi_p (DECL_SIZE_UNIT (t))
1145 9388453 : || tree_to_uhwi (DECL_SIZE_UNIT (t)) > limit)
1146 : return false;
1147 :
1148 : /* TODO: We perhaps should try to handle at least some cases when the
1149 : declaration is wrapped in a MEM_REF, but we need to be careful to look at
1150 : the right part of the constructor then. */
1151 8365171 : tree ctor = ctor_for_folding (t);
1152 8365171 : if (!ctor
1153 8365164 : || TREE_CODE (ctor) != CONSTRUCTOR)
1154 : return false;
1155 :
1156 105522 : t = gimple_assign_rhs1 (stmt);
1157 105522 : auto_vec <tree, 4> comps;
1158 105522 : comps.safe_grow (count, true);
1159 105522 : int i = 0;
1160 105522 : while (TREE_CODE (t) == ARRAY_REF
1161 215703 : || TREE_CODE (t) == COMPONENT_REF)
1162 : {
1163 110181 : comps[i] = t;
1164 110181 : t = TREE_OPERAND (t, 0);
1165 110181 : i++;
1166 : }
1167 :
1168 105522 : value_range tmp (type);
1169 105522 : bool res = range_from_readonly_load (tmp, type, ctor, comps, count);
1170 105522 : if (res)
1171 : {
1172 104346 : if (POINTER_TYPE_P (type))
1173 25167 : r.set_nonzero (type);
1174 : else
1175 79179 : r = tmp;
1176 : }
1177 105522 : return res;
1178 105522 : }
1179 :
1180 : // Calculate a range for phi statement S and return it in R.
1181 : // If a range cannot be calculated, return false.
1182 :
1183 : bool
1184 24881620 : fold_using_range::range_of_phi (vrange &r, gphi *phi, fur_source &src)
1185 : {
1186 24881620 : tree phi_def = gimple_phi_result (phi);
1187 24881620 : tree type = gimple_range_type (phi);
1188 24881620 : value_range arg_range (type);
1189 24881620 : value_range equiv_range (type);
1190 24881620 : unsigned x;
1191 :
1192 24881620 : if (!type)
1193 : return false;
1194 :
1195 : // Track if all executable arguments are the same.
1196 24881620 : tree single_arg = NULL_TREE;
1197 24881620 : bool seen_arg = false;
1198 :
1199 24881620 : relation_oracle *oracle = &(src.query()->relation ());
1200 : // Start with an empty range, unioning in each argument's range.
1201 24881620 : r.set_undefined ();
1202 88977154 : for (x = 0; x < gimple_phi_num_args (phi); x++)
1203 : {
1204 51247612 : tree arg = gimple_phi_arg_def (phi, x);
1205 : // An argument that is the same as the def provides no new range.
1206 51247612 : if (arg == phi_def)
1207 21238 : continue;
1208 :
1209 51226374 : edge e = gimple_phi_arg_edge (phi, x);
1210 :
1211 : // Get the range of the argument on its edge.
1212 51226374 : src.get_phi_operand (arg_range, arg, e);
1213 :
1214 51226374 : if (!arg_range.undefined_p ())
1215 : {
1216 : // Register potential dependencies for stale value tracking.
1217 : // Likewise, if the incoming PHI argument is equivalent to this
1218 : // PHI definition, it provides no new info. Accumulate these ranges
1219 : // in case all arguments are equivalences.
1220 50981802 : if (oracle->query (e, arg, phi_def) == VREL_EQ)
1221 243837 : equiv_range.union_(arg_range);
1222 : else
1223 50737965 : r.union_ (arg_range);
1224 :
1225 83304965 : if (gimple_range_ssa_p (arg) && src.gori_ssa ())
1226 32323151 : src.gori_ssa ()->register_dependency (phi_def, arg);
1227 : }
1228 :
1229 : // Track if all arguments are the same.
1230 51226374 : if (!seen_arg)
1231 : {
1232 : seen_arg = true;
1233 : single_arg = arg;
1234 : }
1235 26344754 : else if (!vrp_operand_equal_p (single_arg, arg))
1236 25125943 : single_arg = NULL_TREE;
1237 :
1238 : // Once the value reaches varying, stop looking.
1239 51226374 : if (r.varying_p () && single_arg == NULL_TREE)
1240 : break;
1241 : }
1242 :
1243 : // If all arguments were equivalences, use the equivalence ranges as no
1244 : // arguments were processed.
1245 24881620 : if (r.undefined_p () && !equiv_range.undefined_p ())
1246 97389 : r = equiv_range;
1247 :
1248 : // If the PHI boils down to a single effective argument, look at it.
1249 24881620 : if (single_arg)
1250 : {
1251 : // Symbolic arguments can be equivalences.
1252 2448161 : if (gimple_range_ssa_p (single_arg))
1253 : {
1254 : // Only allow the equivalence if the PHI definition does not
1255 : // dominate any incoming edge for SINGLE_ARG.
1256 : // See PR 108139 and 109462.
1257 1922628 : basic_block bb = gimple_bb (phi);
1258 1922628 : if (!dom_info_available_p (CDI_DOMINATORS))
1259 : single_arg = NULL;
1260 : else
1261 4084945 : for (x = 0; x < gimple_phi_num_args (phi); x++)
1262 2167836 : if (gimple_phi_arg_def (phi, x) == single_arg
1263 4325180 : && dominated_by_p (CDI_DOMINATORS,
1264 2157344 : gimple_phi_arg_edge (phi, x)->src,
1265 : bb))
1266 : {
1267 : single_arg = NULL;
1268 : break;
1269 : }
1270 1921606 : if (single_arg)
1271 1917109 : src.register_relation (phi, VREL_EQ, phi_def, single_arg);
1272 : }
1273 525533 : else if (src.get_operand (arg_range, single_arg))
1274 : {
1275 : // Check if the single argument points to a specific object.
1276 525533 : if (is_a <prange> (arg_range))
1277 : {
1278 46556 : prange &ptr = as_a <prange> (arg_range);
1279 : // If it doesn't already point at something, set points to.
1280 46556 : if (ptr.pt_unknown_p () && TREE_CODE (single_arg) == ADDR_EXPR)
1281 0 : ptr.set_pt (single_arg, true);
1282 46556 : r = ptr;
1283 46556 : return true;
1284 : }
1285 : // Numerical arguments that are a constant can be returned as
1286 : // the constant. This can help fold later cases where even this
1287 : // constant might have been UNDEFINED via an unreachable edge.
1288 478977 : if (arg_range.singleton_p ())
1289 : {
1290 477382 : r = arg_range;
1291 477382 : return true;
1292 : }
1293 : }
1294 : }
1295 :
1296 : // Incorporate any global value. If a PHI analysis phase was run, there may
1297 : // be a restricted global range already. Query the range with no context
1298 : // to get a global range.
1299 :
1300 : // If SCEV is available, query if this PHI has any known values.
1301 24357682 : if (scev_initialized_p ()
1302 24357682 : && !POINTER_TYPE_P (TREE_TYPE (phi_def)))
1303 : {
1304 9419172 : class loop *l = loop_containing_stmt (phi);
1305 9419172 : if (l && loop_outer (l))
1306 : {
1307 6901172 : value_range loop_range (type);
1308 6901172 : range_of_ssa_name_with_loop_info (loop_range, phi_def, l, phi, src);
1309 6901172 : if (!loop_range.varying_p ())
1310 : {
1311 2786105 : if (dump_file && (dump_flags & TDF_DETAILS))
1312 : {
1313 14291 : fprintf (dump_file, "Loops range found for ");
1314 14291 : print_generic_expr (dump_file, phi_def, TDF_SLIM);
1315 14291 : fprintf (dump_file, ": ");
1316 14291 : loop_range.dump (dump_file);
1317 14291 : fprintf (dump_file, " and calculated range :");
1318 14291 : r.dump (dump_file);
1319 14291 : fprintf (dump_file, "\n");
1320 : }
1321 2786105 : r.intersect (loop_range);
1322 : }
1323 6901172 : }
1324 : }
1325 :
1326 : return true;
1327 24881620 : }
1328 :
1329 : // Calculate a range for call statement S and return it in R.
1330 : // If a range cannot be calculated, return false.
1331 :
1332 : bool
1333 13463248 : fold_using_range::range_of_call (vrange &r, gcall *call, fur_source &)
1334 : {
1335 13463248 : tree type = gimple_range_type (call);
1336 13463248 : if (!type)
1337 : return false;
1338 :
1339 13463248 : tree lhs = gimple_call_lhs (call);
1340 :
1341 13463248 : if (gimple_stmt_nonnegative_p (call))
1342 46183 : r.set_nonnegative (type);
1343 13417065 : else if (gimple_call_nonnull_result_p (call)
1344 13417065 : || gimple_call_nonnull_arg (call))
1345 676682 : r.set_nonzero (type);
1346 : else
1347 12740383 : r.set_varying (type);
1348 :
1349 13463248 : tree callee = gimple_call_fndecl (call);
1350 13463248 : if (callee
1351 13463248 : && useless_type_conversion_p (TREE_TYPE (TREE_TYPE (callee)), type))
1352 : {
1353 12287700 : value_range val;
1354 12287700 : if (ipa_return_value_range (val, callee))
1355 : {
1356 613719 : r.intersect (val);
1357 613719 : if (dump_file && (dump_flags & TDF_DETAILS))
1358 : {
1359 28 : fprintf (dump_file, "Using return value range of ");
1360 28 : print_generic_expr (dump_file, callee, TDF_SLIM);
1361 28 : fprintf (dump_file, ": ");
1362 28 : val.dump (dump_file);
1363 28 : fprintf (dump_file, "\n");
1364 : }
1365 : }
1366 12287700 : }
1367 :
1368 : // If there is an LHS, intersect that with what is known.
1369 13463248 : if (gimple_range_ssa_p (lhs))
1370 : {
1371 13463248 : value_range def (TREE_TYPE (lhs));
1372 13463248 : gimple_range_global (def, lhs);
1373 13463248 : r.intersect (def);
1374 13463248 : }
1375 : return true;
1376 : }
1377 :
1378 : // Given COND ? OP1 : OP2 with ranges R1 for OP1 and R2 for OP2, Use gori
1379 : // to further resolve R1 and R2 if there are any dependencies between
1380 : // OP1 and COND or OP2 and COND. All values can are to be calculated using SRC
1381 : // as the origination source location for operands..
1382 : // Effectively, use COND an the edge condition and solve for OP1 on the true
1383 : // edge and OP2 on the false edge.
1384 :
1385 : bool
1386 166403 : fold_using_range::condexpr_adjust (vrange &r1, vrange &r2, gimple *, tree cond,
1387 : tree op1, tree op2, fur_source &src)
1388 : {
1389 166403 : if (!src.gori () || !src.gori_ssa ())
1390 : return false;
1391 :
1392 121534 : tree ssa1 = gimple_range_ssa_p (op1);
1393 121534 : tree ssa2 = gimple_range_ssa_p (op2);
1394 121534 : if (!ssa1 && !ssa2)
1395 : return false;
1396 110044 : if (TREE_CODE (cond) != SSA_NAME)
1397 : return false;
1398 110044 : gassign *cond_def = dyn_cast <gassign *> (SSA_NAME_DEF_STMT (cond));
1399 109923 : if (!cond_def
1400 109923 : || TREE_CODE_CLASS (gimple_assign_rhs_code (cond_def)) != tcc_comparison)
1401 : return false;
1402 105195 : tree type = TREE_TYPE (gimple_assign_rhs1 (cond_def));
1403 105195 : if (!value_range::supports_type_p (type)
1404 210386 : || !range_compatible_p (type, TREE_TYPE (gimple_assign_rhs2 (cond_def))))
1405 : return false;
1406 105191 : range_op_handler hand (gimple_assign_rhs_code (cond_def));
1407 105191 : if (!hand)
1408 : return false;
1409 :
1410 105191 : tree c1 = gimple_range_ssa_p (gimple_assign_rhs1 (cond_def));
1411 210382 : tree c2 = gimple_range_ssa_p (gimple_assign_rhs2 (cond_def));
1412 :
1413 : // Only solve if there is one SSA name in the condition.
1414 105191 : if ((!c1 && !c2) || (c1 && c2))
1415 : return false;
1416 :
1417 : // Pick up the current values of each part of the condition.
1418 27131 : tree rhs1 = gimple_assign_rhs1 (cond_def);
1419 27131 : tree rhs2 = gimple_assign_rhs2 (cond_def);
1420 27131 : value_range cl (TREE_TYPE (rhs1));
1421 27131 : value_range cr (TREE_TYPE (rhs2));
1422 27131 : src.get_operand (cl, rhs1);
1423 27131 : src.get_operand (cr, rhs2);
1424 :
1425 27131 : tree cond_name = c1 ? c1 : c2;
1426 27131 : gimple *def_stmt = SSA_NAME_DEF_STMT (cond_name);
1427 :
1428 : // Evaluate the value of COND_NAME on the true and false edges, using either
1429 : // the op1 or op2 routines based on its location.
1430 27131 : value_range cond_true (type), cond_false (type);
1431 27131 : if (c1)
1432 : {
1433 27131 : if (!hand.op1_range (cond_false, type, range_false (), cr))
1434 : return false;
1435 27131 : if (!hand.op1_range (cond_true, type, range_true (), cr))
1436 : return false;
1437 27131 : cond_false.intersect (cl);
1438 27131 : cond_true.intersect (cl);
1439 : }
1440 : else
1441 : {
1442 0 : if (!hand.op2_range (cond_false, type, range_false (), cl))
1443 : return false;
1444 0 : if (!hand.op2_range (cond_true, type, range_true (), cl))
1445 : return false;
1446 0 : cond_false.intersect (cr);
1447 0 : cond_true.intersect (cr);
1448 : }
1449 :
1450 : // Now solve for SSA1 or SSA2 if they are in the dependency chain.
1451 49760 : if (ssa1 && src.gori_ssa()->in_chain_p (ssa1, cond_name))
1452 : {
1453 922 : value_range tmp1 (TREE_TYPE (ssa1));
1454 1844 : if (src.gori ()->compute_operand_range (tmp1, def_stmt, cond_true,
1455 : ssa1, src))
1456 580 : r1.intersect (tmp1);
1457 922 : }
1458 44762 : if (ssa2 && src.gori_ssa ()->in_chain_p (ssa2, cond_name))
1459 : {
1460 260 : value_range tmp2 (TREE_TYPE (ssa2));
1461 520 : if (src.gori ()->compute_operand_range (tmp2, def_stmt, cond_false,
1462 : ssa2, src))
1463 206 : r2.intersect (tmp2);
1464 260 : }
1465 : // If the same name is specified in the condition and COND_EXPR,
1466 : // combine the calculated condition range and the other one provided. ie:
1467 : // c_1 = b_2 < 10
1468 : // f_3 = c_1 ? 0 : b_2
1469 : // With b_2 providing the false value, the value of f_3 will be
1470 : // either 0 UNION (0 = b_2 < 10), which is [-INF, 9].
1471 : // COND_EXPR is
1472 27131 : if (ssa1 && cond_name == ssa1)
1473 2160 : r1 = cond_true;
1474 24971 : else if (ssa2 && cond_name == ssa2)
1475 3042 : r2 = cond_false;
1476 : return true;
1477 27131 : }
1478 :
1479 : // Calculate a range for COND_EXPR statement S and return it in R.
1480 : // If a range cannot be calculated, return false.
1481 :
1482 : bool
1483 166403 : fold_using_range::range_of_cond_expr (vrange &r, gassign *s, fur_source &src)
1484 : {
1485 166403 : tree cond = gimple_assign_rhs1 (s);
1486 166403 : tree op1 = gimple_assign_rhs2 (s);
1487 166403 : tree op2 = gimple_assign_rhs3 (s);
1488 :
1489 166403 : tree type = gimple_range_type (s);
1490 166403 : if (!type)
1491 : return false;
1492 :
1493 166403 : value_range range1 (TREE_TYPE (op1));
1494 166403 : value_range range2 (TREE_TYPE (op2));
1495 166403 : value_range cond_range (TREE_TYPE (cond));
1496 166403 : gcc_checking_assert (gimple_assign_rhs_code (s) == COND_EXPR);
1497 166403 : gcc_checking_assert (range_compatible_p (TREE_TYPE (op1), TREE_TYPE (op2)));
1498 166403 : src.get_operand (cond_range, cond);
1499 166403 : src.get_operand (range1, op1);
1500 166403 : src.get_operand (range2, op2);
1501 :
1502 : // Try to see if there is a dependence between the COND and either operand
1503 166403 : if (condexpr_adjust (range1, range2, s, cond, op1, op2, src))
1504 27131 : if (dump_file && (dump_flags & TDF_DETAILS))
1505 : {
1506 565 : fprintf (dump_file, "Possible COND_EXPR adjustment. Range op1 : ");
1507 565 : range1.dump(dump_file);
1508 565 : fprintf (dump_file, " and Range op2: ");
1509 565 : range2.dump(dump_file);
1510 565 : fprintf (dump_file, "\n");
1511 : }
1512 :
1513 : // If the condition is known, choose the appropriate expression.
1514 166403 : if (cond_range.singleton_p ())
1515 : {
1516 : // False, pick second operand.
1517 2495 : if (cond_range.zero_p ())
1518 1247 : r = range2;
1519 : else
1520 1248 : r = range1;
1521 : }
1522 : else
1523 : {
1524 163908 : r = range1;
1525 163908 : r.union_ (range2);
1526 : }
1527 166403 : gcc_checking_assert (r.undefined_p ()
1528 : || range_compatible_p (r.type (), type));
1529 166403 : return true;
1530 166403 : }
1531 :
1532 : // If SCEV has any information about phi node NAME, return it as a range in R.
1533 :
1534 : void
1535 6901172 : fold_using_range::range_of_ssa_name_with_loop_info (vrange &r, tree name,
1536 : class loop *l, gphi *phi,
1537 : fur_source &src)
1538 : {
1539 6901172 : static bool in_scev_call = false;
1540 6901172 : gcc_checking_assert (TREE_CODE (name) == SSA_NAME);
1541 : // Avoid SCEV callbacks causing infinite recursion.
1542 6901172 : if (in_scev_call)
1543 408205 : r.set_varying (TREE_TYPE (name));
1544 : // SCEV currently invokes get_range_query () for values. If the query
1545 : // being passed in is not the same SCEV will use, do not invoke SCEV.
1546 : // This can be remove if/when SCEV uses a passed in range-query.
1547 12985934 : else if (src.query () != get_range_query (cfun))
1548 : {
1549 0 : r.set_varying (TREE_TYPE (name));
1550 : // Report the msmatch if SRC is not the global query. The cache
1551 : // uses a global query and would provide numerous false positives.
1552 0 : if (dump_file && (dump_flags & TDF_DETAILS)
1553 0 : && src.query () != get_global_range_query ())
1554 0 : fprintf (dump_file,
1555 : "fold_using-range:: SCEV not invoked due to mismatched queries\n");
1556 : }
1557 : else
1558 : {
1559 6492967 : in_scev_call = true;
1560 6492967 : if (!range_of_var_in_loop (r, name, l, phi, src.query ()))
1561 312 : r.set_varying (TREE_TYPE (name));
1562 6492967 : in_scev_call = false;
1563 : }
1564 6901172 : }
1565 :
1566 : // -----------------------------------------------------------------------
1567 :
1568 : // Check if an && or || expression can be folded based on relations. ie
1569 : // c_2 = a_6 > b_7
1570 : // c_3 = a_6 < b_7
1571 : // c_4 = c_2 && c_3
1572 : // c_2 and c_3 can never be true at the same time,
1573 : // Therefore c_4 can always resolve to false based purely on the relations.
1574 :
1575 : void
1576 141815448 : fold_using_range::relation_fold_and_or (irange& lhs_range, gimple *s,
1577 : fur_source &src, vrange &op1,
1578 : vrange &op2)
1579 : {
1580 : // No queries or already folded.
1581 141815448 : if (!src.gori () || lhs_range.singleton_p ())
1582 : return;
1583 :
1584 : // Only care about AND and OR expressions.
1585 90554736 : enum tree_code code = gimple_expr_code (s);
1586 90554736 : bool is_and = false;
1587 90554736 : if (code == BIT_AND_EXPR || code == TRUTH_AND_EXPR)
1588 : is_and = true;
1589 86870846 : else if (code != BIT_IOR_EXPR && code != TRUTH_OR_EXPR)
1590 : return;
1591 :
1592 5220894 : gimple_range_op_handler handler (s);
1593 5220894 : tree lhs = handler.lhs ();
1594 5220894 : tree ssa1 = gimple_range_ssa_p (handler.operand1 ());
1595 5220894 : tree ssa2 = gimple_range_ssa_p (handler.operand2 ());
1596 :
1597 : // Deal with || and && only when there is a full set of symbolics.
1598 5220881 : if (!lhs || !ssa1 || !ssa2
1599 2857298 : || (TREE_CODE (TREE_TYPE (lhs)) != BOOLEAN_TYPE)
1600 2000351 : || (TREE_CODE (TREE_TYPE (ssa1)) != BOOLEAN_TYPE)
1601 7220009 : || (TREE_CODE (TREE_TYPE (ssa2)) != BOOLEAN_TYPE))
1602 : return;
1603 :
1604 : // Now we know its a boolean AND or OR expression with boolean operands.
1605 : // Ideally we search dependencies for common names, and see what pops out.
1606 : // until then, simply try to resolve direct dependencies.
1607 :
1608 1996438 : gimple *ssa1_stmt = SSA_NAME_DEF_STMT (ssa1);
1609 1996438 : gimple *ssa2_stmt = SSA_NAME_DEF_STMT (ssa2);
1610 :
1611 1996438 : gimple_range_op_handler handler1 (ssa1_stmt);
1612 1996438 : gimple_range_op_handler handler2 (ssa2_stmt);
1613 :
1614 : // If either handler is not present, no relation can be found.
1615 1996438 : if (!handler1 || !handler2)
1616 : return;
1617 :
1618 : // Both stmts will need to have 2 ssa names in the stmt.
1619 1868677 : tree ssa1_dep1 = gimple_range_ssa_p (handler1.operand1 ());
1620 1868677 : tree ssa1_dep2 = gimple_range_ssa_p (handler1.operand2 ());
1621 1868677 : tree ssa2_dep1 = gimple_range_ssa_p (handler2.operand1 ());
1622 1868677 : tree ssa2_dep2 = gimple_range_ssa_p (handler2.operand2 ());
1623 :
1624 1868677 : if (!ssa1_dep1 || !ssa1_dep2 || !ssa2_dep1 || !ssa2_dep2)
1625 : return;
1626 :
1627 226364 : if (HONOR_NANS (TREE_TYPE (ssa1_dep1)))
1628 : return;
1629 :
1630 : // Make sure they are the same dependencies, and detect the order of the
1631 : // relationship.
1632 211440 : bool reverse_op2 = true;
1633 211440 : if (ssa1_dep1 == ssa2_dep1 && ssa1_dep2 == ssa2_dep2)
1634 : reverse_op2 = false;
1635 211373 : else if (ssa1_dep1 != ssa2_dep2 || ssa1_dep2 != ssa2_dep1)
1636 : return;
1637 :
1638 72 : int_range<2> bool_one = range_true ();
1639 72 : relation_kind relation1 = handler1.op1_op2_relation (bool_one, op1, op2);
1640 72 : relation_kind relation2 = handler2.op1_op2_relation (bool_one, op1, op2);
1641 72 : if (relation1 == VREL_VARYING || relation2 == VREL_VARYING)
1642 : return;
1643 :
1644 36 : if (reverse_op2)
1645 5 : relation2 = relation_swap (relation2);
1646 :
1647 : // x && y is false if the relation intersection of the true cases is NULL.
1648 36 : if (is_and && relation_intersect (relation1, relation2) == VREL_UNDEFINED)
1649 0 : lhs_range = range_false (boolean_type_node);
1650 : // x || y is true if the union of the true cases is NO-RELATION..
1651 : // ie, one or the other being true covers the full range of possibilities.
1652 36 : else if (!is_and && relation_union (relation1, relation2) == VREL_VARYING)
1653 0 : lhs_range = bool_one;
1654 : else
1655 : return;
1656 :
1657 0 : range_cast (lhs_range, TREE_TYPE (lhs));
1658 0 : if (dump_file && (dump_flags & TDF_DETAILS))
1659 : {
1660 0 : fprintf (dump_file, " Relation adjustment: ");
1661 0 : print_generic_expr (dump_file, ssa1, TDF_SLIM);
1662 0 : fprintf (dump_file, " and ");
1663 0 : print_generic_expr (dump_file, ssa2, TDF_SLIM);
1664 0 : fprintf (dump_file, " combine to produce ");
1665 0 : lhs_range.dump (dump_file);
1666 0 : fputc ('\n', dump_file);
1667 : }
1668 :
1669 : return;
1670 72 : }
1671 :
1672 : // Register any outgoing edge relations from a conditional branch.
1673 :
1674 : void
1675 75529586 : fur_source::register_outgoing_edges (gcond *s, irange &lhs_range,
1676 : edge e0, edge e1)
1677 : {
1678 75529586 : int_range<2> e0_range, e1_range;
1679 75529586 : tree name;
1680 75529586 : basic_block bb = gimple_bb (s);
1681 :
1682 75529586 : gimple_range_op_handler handler (s);
1683 75529586 : if (!handler)
1684 : return;
1685 :
1686 75518896 : if (e0)
1687 : {
1688 : // If this edge is never taken, ignore it.
1689 63109074 : gcond_edge_range (e0_range, e0);
1690 63109074 : e0_range.intersect (lhs_range);
1691 63109074 : if (e0_range.undefined_p ())
1692 27451306 : e0 = NULL;
1693 : }
1694 :
1695 75518896 : if (e1)
1696 : {
1697 : // If this edge is never taken, ignore it.
1698 55225614 : gcond_edge_range (e1_range, e1);
1699 55225614 : e1_range.intersect (lhs_range);
1700 55225614 : if (e1_range.undefined_p ())
1701 32009871 : e1 = NULL;
1702 : }
1703 :
1704 75518896 : if (!e0 && !e1)
1705 : return;
1706 :
1707 : // First, register the gcond itself. This will catch statements like
1708 : // if (a_2 < b_5)
1709 72139885 : tree ssa1 = gimple_range_ssa_p (handler.operand1 ());
1710 72139885 : tree ssa2 = gimple_range_ssa_p (handler.operand2 ());
1711 72139885 : value_range r1,r2;
1712 72139885 : if (ssa1 && ssa2)
1713 : {
1714 22378702 : r1.set_varying (TREE_TYPE (ssa1));
1715 22378702 : r2.set_varying (TREE_TYPE (ssa2));
1716 22378702 : if (e0)
1717 : {
1718 15375555 : relation_kind relation = handler.op1_op2_relation (e0_range, r1, r2);
1719 15375555 : if (relation != VREL_VARYING)
1720 15306988 : register_relation (e0, relation, ssa1, ssa2);
1721 : }
1722 22378702 : if (e1)
1723 : {
1724 13152588 : relation_kind relation = handler.op1_op2_relation (e1_range, r1, r2);
1725 13152588 : if (relation != VREL_VARYING)
1726 13098247 : register_relation (e1, relation, ssa1, ssa2);
1727 : }
1728 : }
1729 :
1730 : // Outgoing relations of GORI exports require a gori engine.
1731 129645670 : if (!gori_ssa ())
1732 14634118 : return;
1733 :
1734 : // Now look for other relations in the exports. This will find stmts
1735 : // leading to the condition such as:
1736 : // c_2 = a_4 < b_7
1737 : // if (c_2)
1738 183462001 : FOR_EACH_GORI_EXPORT_NAME (gori_ssa (), bb, name)
1739 : {
1740 125956234 : if (TREE_CODE (TREE_TYPE (name)) != BOOLEAN_TYPE)
1741 120070494 : continue;
1742 9629662 : gimple *stmt = SSA_NAME_DEF_STMT (name);
1743 9629662 : gimple_range_op_handler handler (stmt);
1744 9629662 : if (!handler)
1745 3743922 : continue;
1746 5885740 : tree ssa1 = gimple_range_ssa_p (handler.operand1 ());
1747 5885740 : tree ssa2 = gimple_range_ssa_p (handler.operand2 ());
1748 5885740 : value_range r (TREE_TYPE (name));
1749 5885740 : if (ssa1 && ssa2)
1750 : {
1751 2520648 : r1.set_varying (TREE_TYPE (ssa1));
1752 2520648 : r2.set_varying (TREE_TYPE (ssa2));
1753 1528273 : if (e0 && gori ()->edge_range_p (r, e0, name, *m_query)
1754 4006943 : && r.singleton_p ())
1755 : {
1756 1352815 : relation_kind relation = handler.op1_op2_relation (r, r1, r2);
1757 1352815 : if (relation != VREL_VARYING)
1758 447569 : register_relation (e0, relation, ssa1, ssa2);
1759 : }
1760 1603269 : if (e1 && gori ()->edge_range_p (r, e1, name, *m_query)
1761 4077111 : && r.singleton_p ())
1762 : {
1763 1168153 : relation_kind relation = handler.op1_op2_relation (r, r1, r2);
1764 1168153 : if (relation != VREL_VARYING)
1765 180042 : register_relation (e1, relation, ssa1, ssa2);
1766 : }
1767 : }
1768 5885740 : }
1769 75529586 : }
|
