H A D | tree-chkp.c | 98 out-of-bounds memory accesses. Checks are performed by computing 99 bounds for each pointer and then comparing address of accessed 111 against bounds of dereferenced pointer. Obviously safe memory 126 where __bound_tmp.1_3 are bounds computed for pointer p_1, 132 When pointer is stored in memory we need to store its bounds. To 134 we have to keep data layout and store bounds in special bound tables 135 via special checker call. Implementation of bounds table may vary for 138 with different bounds stored in different places) with bounds. 139 Another checker builtin allows to get bounds fo 553 bitmap bounds; local 693 chkp_mark_completed_bounds(tree bounds) argument 707 chkp_completed_bounds(tree bounds) argument 722 chkp_register_incomplete_bounds(tree bounds, tree ptr) argument 738 chkp_incomplete_bounds(tree bounds) argument 781 chkp_may_complete_phi_bounds(tree const &bounds, tree *slot ATTRIBUTE_UNUSED, bool *res) argument 823 chkp_recompute_phi_bounds(tree const &bounds, tree *slot, void *res ATTRIBUTE_UNUSED) argument 852 chkp_mark_invalid_bounds(tree bounds) argument 866 chkp_valid_bounds(tree bounds) argument 881 chkp_find_valid_phi_bounds(tree const &bounds, tree *slot, bool *res) argument 916 chkp_mark_invalid_bounds_walker(tree const &bounds, tree *slot ATTRIBUTE_UNUSED, void *res ATTRIBUTE_UNUSED) argument 1344 tree bounds; local 1381 chkp_check_lower(tree addr, tree bounds, gimple_stmt_iterator iter, location_t location, tree dirflag) argument 1428 chkp_check_upper(tree addr, tree bounds, gimple_stmt_iterator iter, location_t location, tree dirflag) argument 1476 chkp_check_mem_access(tree first, tree last, tree bounds, gimple_stmt_iterator iter, location_t location, tree dirflag) argument 1497 tree bounds = chkp_find_bounds (addr, gsi); local 1526 tree bounds = chkp_find_bounds (addr, gsi); local 1848 tree bounds = chkp_find_bounds (arg, gsi); local 1864 tree bounds = chkp_find_bounds (ptr, gsi); local 2054 tree bounds; local 2236 tree bounds; local 2363 tree bounds = TREE_CHAIN (parm); local 2379 tree bounds; local 2460 tree bounds; local 2490 chkp_build_bndstx_call(tree addr, tree ptr, tree bounds) argument 2505 chkp_build_bndstx(tree addr, tree ptr, tree bounds, gimple_stmt_iterator *gsi) argument 2539 tree bounds = NULL_TREE; local 2765 tree var, bounds; local 2991 tree bounds, size_reloc, lb, size, max_size, cond; local 3075 tree bounds; local 3140 tree bounds; local 3189 tree bounds; local 3269 chkp_narrow_bounds_to_field(tree bounds, tree component, gimple_stmt_iterator *iter) argument 3300 chkp_parse_array_and_component_ref(tree node, tree *ptr, tree *elt, bool *safe, bool *bitfield, tree *bounds, gimple_stmt_iterator *iter, bool innermost_bounds) argument 3428 tree bounds = chkp_get_registered_addr_bounds (obj); local 3507 tree bounds = NULL_TREE; local 3771 tree bounds = chkp_find_bounds (rhs, iter); local 3875 tree bounds = NULL_TREE; local 4273 tree bounds = chkp_get_next_bounds_parm (arg); local 4297 tree bounds = chkp_get_next_bounds_parm (arg); local 4303 bounds, &iter); local [all...] |