HomeSort by: relevance | last modified time | path
    Searched defs:vr1 (Results 1 - 9 of 9) sorted by relevancy

  /src/external/gpl3/gcc.old/dist/gcc/
value-range.cc 560 value_range vr0, vr1; local
561 ranges_from_anti_range ((const value_range *) this, &vr0, &vr1);
754 /* [] is vr0, () is vr1 in the following classification comments. */
937 enough to special case when vr1's range is relatively wide.
1055 correct estimate unless VR1 is a constant singleton range
1068 ranges VR0 and VR1, set VR0 to the intersection of both ranges.
1072 irange::legacy_intersect (irange *vr0, const irange *vr1)
1075 gcc_checking_assert (vr1->legacy_mode_p ());
1077 if (vr1->varying_p ())
1081 vr0->set (vr1->min (), vr1->max (), vr1->kind ())
    [all...]
tree-vrp.cc 713 const value_range *vr1)
733 || !range_includes_zero_p (vr1))
736 || (range_int_cst_p (vr1)
737 && !tree_int_cst_sign_bit (vr1->max ()))))
739 else if (vr0->zero_p () && vr1->zero_p ())
757 value_range vr0 = *vr0_, vr1 = *vr1_; local
776 if (vr1.kind () == VR_ANTI_RANGE
777 && ranges_from_anti_range (&vr1, &vrtem0, &vrtem1))
791 value_range_kind vr0_kind = vr0.kind (), vr1_kind = vr1.kind ();
793 tree vr1_min = vr1.min (), vr1_max = vr1.max ()
995 value_range vr1 = drop_undefines_to_varying (vr1_, expr_type); local
    [all...]
vr-values.cc 830 value_range vr0, vr1; local
839 vr1 = *(get_value_range (op1));
841 vr1.set (op1);
843 vr1.set_varying (TREE_TYPE (op1));
850 if (vr0.varying_p () && !vr1.varying_p ())
852 else if (vr1.varying_p () && !vr0.varying_p ())
853 vr1 = value_range (vrp_val_min (expr_type), vrp_val_max (expr_type));
856 range_fold_binary_expr (vr, code, expr_type, &vr0, &vr1);
923 && vr1.kind () == VR_RANGE
924 && symbolic_range_based_on_p (&vr1, op0)
1007 const value_range_equiv *vr1 = &tem1; local
1063 value_range vr0, vr1; local
1315 value_range_equiv vr0, vr1; local
1725 value_range maxvr, vr0, vr1; local
2148 const value_range_equiv *vr1 = get_vr_for_comparison (i1, &tem_vr1, s); local
2211 const value_range_equiv *vr0, *vr1; local
3036 const value_range_equiv *vr1 = query->get_value_range (op1, stmt); local
3269 value_range vr0, vr1; local
    [all...]
tree-ssa-sccvn.cc 242 vn_reference_hasher::hash (const vn_reference_s *vr1)
244 return vr1->hashcode;
701 /* Compute a hash for the reference operation VR1 and return it. */
704 vn_reference_compute_hash (const vn_reference_t vr1)
713 FOR_EACH_VEC_ELT (vr1->operands, i, vro)
747 if (vr1->vuse)
748 result += SSA_NAME_VERSION (vr1->vuse);
753 /* Return true if reference operations VR1 and VR2 are equivalent. This
757 vn_reference_eq (const_vn_reference_t const vr1, const_vn_reference_t const vr2)
762 if (vr1->hashcode != vr2->hashcode
2376 vn_reference_s vr1; local
3671 struct vn_reference_s vr1; local
3767 struct vn_reference_s vr1; local
3869 vn_reference_t vr1; local
3933 vn_reference_t vr1; local
5198 struct vn_reference_s vr1; local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
value-range.cc 2401 // Test that even though vr1 covers the strict enum domain ([0, 3]),
2403 int_range<1> vr1 = range (rtype, 0, 1); local
2405 vr1.union_ (vr2);
2406 ASSERT_TRUE (vr1 == range (rtype, 0, 3));
2407 ASSERT_FALSE (vr1.varying_p ());
2410 int_range<2> ir1 (vr1);
2411 ASSERT_TRUE (ir1 == vr1);
2415 vr1 = int_range<2> (rtype,
2418 ir1 = vr1;
2419 ASSERT_TRUE (ir1 == vr1);
    [all...]
vr-values.cc 88 value_range vr0, vr1; local
91 if (!query->range_of_expr (vr1, op1, s) || vr1.undefined_p ())
92 vr1.set_varying (TREE_TYPE (op1));
96 tree vr1min = wide_int_to_tree (TREE_TYPE (op1), vr1.lower_bound ());
97 tree vr1max = wide_int_to_tree (TREE_TYPE (op1), vr1.upper_bound ());
124 w[2] = widest2_int::from (vr1.lower_bound (), sign1);
125 w[3] = widest2_int::from (vr1.upper_bound (), sign1);
671 value_range vr1; local
672 if (!query->range_of_expr (vr1, op1, stmt)
845 value_range vr0, vr1; local
    [all...]
tree-ssa-sccvn.cc 248 vn_reference_hasher::hash (const vn_reference_s *vr1)
250 return vr1->hashcode;
707 /* Compute a hash for the reference operation VR1 and return it. */
710 vn_reference_compute_hash (const vn_reference_t vr1)
719 FOR_EACH_VEC_ELT (vr1->operands, i, vro)
751 /* Do not hash vr1->offset or vr1->max_size, we want to get collisions
755 if (vr1->vuse)
756 result += SSA_NAME_VERSION (vr1->vuse);
761 /* Return true if reference operations VR1 and VR2 are equivalent. Thi
2469 vn_reference_s vr1; local
3921 struct vn_reference_s vr1; local
4021 struct vn_reference_s vr1; local
4170 vn_reference_t vr1; local
4276 vn_reference_t vr1; local
5614 struct vn_reference_s vr1; local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/config/rs6000/
rs6000.cc 7072 eg: vr1[0] = { xxxxxxxA, xxxxxxxB };
7073 vr1[1] = { xxxxxxxC, xxxxxxxD };
7075 vr1[7] = { xxxxxxxO, xxxxxxxP }; */
7076 rtx vr1[8];
7079 vr1[i] = gen_reg_rtx (V2DImode);
7080 emit_insn (gen_vsx_concat_v2di (vr1[i], op[i * 2],
7093 emit_insn (gen_altivec_vpkudum (vr2[i], vr1[i * 2],
7094 vr1[i * 2 + 1]));
7064 rtx vr1[8]; local
  /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/
rs6000.cc 6996 eg: vr1[0] = { xxxxxxxA, xxxxxxxB };
6997 vr1[1] = { xxxxxxxC, xxxxxxxD };
6999 vr1[7] = { xxxxxxxO, xxxxxxxP }; */
7000 rtx vr1[8];
7003 vr1[i] = gen_reg_rtx (V2DImode);
7004 emit_insn (gen_vsx_concat_v2di (vr1[i], op[i * 2],
7017 emit_insn (gen_altivec_vpkudum (vr2[i], vr1[i * 2],
7018 vr1[i * 2 + 1]));
6988 rtx vr1[8]; local

Completed in 89 milliseconds