| /netbsd/external/gpl3/gcc/dist/gcc/analyzer/ |
| H A D | store.h | 253 bool contains_p (bit_offset_t offset) const in contains_p() function
259 bool contains_p (const bit_range &other, bit_range *out) const;
300 bool contains_p (byte_offset_t offset) const in contains_p() function
305 bool contains_p (const byte_range &other, byte_range *out) const;
|
| H A D | trimmed-graph.h | 96 bool contains_p (const exploded_edge *eedge) const in contains_p() function
|
| H A D | sm-malloc.cc | 214 virtual bool contains_p (const deallocator *d) const = 0;
246 bool contains_p (const deallocator *d) const FINAL OVERRIDE;
262 bool contains_p (const deallocator *d) const FINAL OVERRIDE;
556 custom_deallocator_set::contains_p (const deallocator *d) const in contains_p() function in ana::__anon3582e62e0111::custom_deallocator_set
600 standard_deallocator_set::contains_p (const deallocator *d) const in contains_p() function in ana::__anon3582e62e0111::standard_deallocator_set
1868 if (!astate->m_deallocators->contains_p (d)) in on_deallocator_call()
1922 if (!astate->m_deallocators->contains_p (&m_free.m_deallocator)) in on_realloc_call()
|
| H A D | store.cc | 243 bit_range::contains_p (const bit_range &other, bit_range *out) const in contains_p() function in ana::bit_range
245 if (contains_p (other.get_start_bit_offset ()) in contains_p()
246 && contains_p (other.get_last_bit_offset ())) in contains_p()
414 byte_range::contains_p (const byte_range &other, byte_range *out) const in contains_p() function in ana::byte_range
416 if (contains_p (other.get_start_byte_offset ()) in contains_p()
417 && contains_p (other.get_last_byte_offset ())) in contains_p()
1637 if (reg_range.contains_p (bound_range, &subrange)) in maybe_get_compound_binding()
1654 else if (bound_range.contains_p (reg_range, &subrange)) in maybe_get_compound_binding()
|
| H A D | constraint-manager.h | 90 bool contains_p (tree cst) const;
|
| H A D | constraint-manager.cc | 475 bounded_range::contains_p (tree cst) const in contains_p() function in ana::bounded_range
764 if (iter.contains_p (cst)) in contain_p()
4111 ASSERT_TRUE (br_u8_0.contains_p (u8_0)); in test_bounded_range()
4112 ASSERT_FALSE (br_u8_0.contains_p (u8_1)); in test_bounded_range()
4113 ASSERT_TRUE (br_u8_0.contains_p (s8_0)); in test_bounded_range()
4114 ASSERT_FALSE (br_u8_0.contains_p (s8_1)); in test_bounded_range()
|
| H A D | region-model-manager.cc | 1009 if (!field_bytes.contains_p (bytes, &bytes_within_field)) in get_field_at_byte_range()
|
| H A D | diagnostic-manager.cc | 488 if (!tg.contains_p (succ_eedge)) in process_worklist_item()
|
| H A D | ChangeLog | 1415 (bounded_range::contains_p): New.
2228 (bit_range::contains_p): New.
2230 (byte_range::contains_p): New.
2279 (bit_range::contains_p): New.
2280 (byte_range::contains_p): New.
3248 (custom_deallocator_set::contains_p): New.
3252 (standard_deallocator_set::contains_p): New.
|
| /netbsd/external/gpl3/gcc/dist/gcc/ |
| H A D | range-op.cc | 482 if (lhs.contains_p (build_zero_cst (lhs.type ()))) in get_bool_state()
554 if (!lhs.contains_p (build_zero_cst (lhs.type ()))) in op1_op2_relation()
664 if (!lhs.contains_p (build_zero_cst (lhs.type ()))) in op1_op2_relation()
834 if (!lhs.contains_p (build_zero_cst (lhs.type ()))) in op1_op2_relation()
2091 if (!lhs.contains_p (build_zero_cst (type))) in op1_range()
2512 || rh.contains_p (build_zero_cst (rh.type ()))) in fold_range()
2848 if (!lhs.contains_p (build_zero_cst (type))) in set_nonzero_range_from_mask()
4298 ASSERT_TRUE (res.contains_p (val)); in range_op_lshift_tests()
4359 ASSERT_FALSE (op1.contains_p (UINT (3))); in range_op_rshift_tests()
4368 ASSERT_FALSE (op1.contains_p (INT (-2))); in range_op_rshift_tests()
[all …]
|
| H A D | value-range.cc | 594 return contains_p (val); in value_inside_range()
629 irange::contains_p (tree cst) const in contains_p() function in irange
641 return numeric_range.contains_p (cst); in contains_p()
2277 ASSERT_FALSE (i1.contains_p (build_int_cst (integer_type_node, 15))); in range_tests_int_range_max()
2455 ASSERT_TRUE (r1.contains_p (INT (7))); in range_tests_misc()
2458 ASSERT_TRUE (r1.contains_p (SCHAR(15))); in range_tests_misc()
2459 ASSERT_FALSE (r1.contains_p (SCHAR(300))); in range_tests_misc()
2543 ASSERT_TRUE (vv.contains_p (UINT (2))); in range_tests_misc()
2551 ASSERT_TRUE (r0.contains_p (UINT (2))); in range_tests_misc()
|
| H A D | value-range.h | 71 bool contains_p (tree) const; in class()
|
| H A D | gimple-loop-versioning.cc | 1479 && !r.contains_p (build_one_cst (TREE_TYPE (name)))) in prune_loop_conditions()
|
| H A D | gimple-range-gori.cc | 783 return (r.singleton_p () || !r.contains_p (build_zero_cst (type))); in range_is_either_true_or_false()
|
| H A D | ipa-cp.cc | 6201 && !plats->m_value_range.m_vr.contains_p (val->value)) in decide_whether_version_node()
|
| H A D | fold-const.cc | 10807 && !vr.contains_p (wide_int_to_tree (TREE_TYPE (t), w))) in expr_not_equal_to()
|
| H A D | ChangeLog-2019 | 4848 (contains_p): Same.
4978 upper_bound, contains_p, invert, intersect...
11522 (value_range_base::contains_p): New.
11531 Add methods for union_, intersect, operator==, contains_p,
|
| H A D | ChangeLog-2021 | 10420 * ipa-modref-tree.h (modref_access_node::contains_p): Handle offsets
|
| H A D | ChangeLog-2020 | 16436 (irange::contains_p): Same.
|
| /netbsd/external/gpl3/gcc.old/dist/gcc/ |
| H A D | value-range.h | 89 bool contains_p (tree) const; in class()
|
| H A D | range-op.cc | 1713 else if (lh.contains_p (build_zero_cst (lh.type ())) in fold_range()
1714 || rh.contains_p (build_zero_cst (rh.type ()))) in fold_range()
2548 else if (!lh.contains_p (build_zero_cst (lh.type ()))) in fold_range()
2914 ASSERT_TRUE (r1.contains_p (INT (7))); in range_tests()
2917 ASSERT_TRUE (r1.contains_p (SCHAR(15))); in range_tests()
2918 ASSERT_FALSE (r1.contains_p (SCHAR(300))); in range_tests()
|
| H A D | value-range.cc | 508 value_range::contains_p (tree cst) const in contains_p() function in value_range
515 return numeric_range.contains_p (cst); in contains_p()
|