Searched refs:bounds (Results 1 - 25 of 62) sorted by relevance

123

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/ext/
H A Dpr59378.C4 void traverse(v4si& bounds){ argument
6 bounds = __builtin_shuffle(bounds, m);
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/
H A Dissue4232.go11 _ = a[-1] // ERROR "invalid array index -1|index out of bounds"
12 _ = a[-1:] // ERROR "invalid slice index -1|index out of bounds"
13 _ = a[:-1] // ERROR "invalid slice index -1|index out of bounds"
14 _ = a[10] // ERROR "invalid array index 10|index out of bounds"
17 _ = s[-1] // ERROR "invalid slice index -1|index out of bounds"
18 _ = s[-1:] // ERROR "invalid slice index -1|index out of bounds"
19 _ = s[:-1] // ERROR "invalid slice index -1|index out of bounds"
23 _ = c[-1] // ERROR "invalid string index -1|index out of bounds"
24 _ = c[-1:] // ERROR "invalid slice index -1|index out of bounds"
25 _ = c[:-1] // ERROR "invalid slice index -1|index out of bounds"
[all...]
H A Dissue4353.go8 // instead of an out of bounds panic.
H A Dbug102.go11 s := string(b[0:]) // out of bounds trap
H A Dissue4348.go8 // illegal instructions when using large array bounds or indexes.
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20021010-2.c26 IOGBounds bounds = global_bounds; local
28 if (saveRect.minx < bounds.minx) saveRect.minx = bounds.minx;
29 if (saveRect.maxx > bounds.maxx) saveRect.maxx = bounds.maxx;
31 vramPtr = global_vramPtr + (saveRect.miny - bounds.miny) ;
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/mpx/
H A Dmacro.c2 /* { dg-options "-fcheck-pointer-bounds -mmpx" } */
12 #error -fcheck-pointer-bounds is required
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/
H A Dbounds.go7 // Test, using compiler diagnostic flags, that bounds check elimination
64 use(a1k[ui8]) // ERROR "index bounds check elided"
65 use(a100k[ui8]) // ERROR "index bounds check elided"
67 use(p1k[ui8]) // ERROR "index bounds check elided"
68 use(p100k[ui8]) // ERROR "index bounds check elided"
82 use(a100k[ui16]) // ERROR "index bounds check elided"
85 use(p100k[ui16]) // ERROR "index bounds check elided"
131 use(a1k[ui%999]) // ERROR "index bounds check elided"
132 use(a100k[ui%999]) // ERROR "index bounds check elided"
134 use(p1k[ui%999]) // ERROR "index bounds chec
[all...]
H A Dslice3err.go98 // check out of bounds indices on array
99 _ = array[11:11] // ERROR "out of bounds"
100 _ = array[11:12] // ERROR "out of bounds"
101 _ = array[11:] // ERROR "out of bounds"
102 _ = array[:11] // ERROR "out of bounds"
103 _ = array[1:11] // ERROR "out of bounds"
104 _ = array[1:11:12] // ERROR "out of bounds"
105 _ = array[1:2:11] // ERROR "out of bounds"
106 _ = array[1:11:3] // ERROR "out of bounds|invalid slice index"
107 _ = array[11:2:3] // ERROR "out of bounds|inverte
[all...]
H A Dindex0.go7 // Generate test of index and slice bounds checks.
H A Dindex1.go7 // Generate test of index and slice bounds checks.
H A Dindex2.go7 // Generate test of index and slice bounds checks.
/haiku-buildtools/gcc/gcc/
H A Dtree-chkp.c98 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...]
H A Drtl-chkp.c68 /* Get bounds rtx associated with NODE via
82 /* Associate bounds rtx VAL with NODE. */
92 /* Reset all bounds stored via chkp_set_rtl_bounds. */
106 for bounds. */
244 Function is used by expand to pass bounds for args
247 chkp_emit_bounds_store (rtx bounds, rtx value, rtx mem) argument
251 if (REG_P (bounds) || CONST_INT_P (bounds))
264 if (CONST_INT_P (bounds))
265 bounds
[all...]
H A Dtree-chkp.h37 extern void chkp_check_mem_access (tree first, tree last, tree bounds,
45 extern tree chkp_build_bndstx_call (tree addr, tree ptr, tree bounds);
47 extern void chkp_build_bndstx (tree addr, tree ptr, tree bounds,
H A Drtl-chkp.h35 extern void chkp_emit_bounds_store (rtx bounds, rtx value, rtx mem);
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/
H A Dpr51600.C11 void bounds(double fuzz, unsigned maxdepth) function
/haiku-buildtools/binutils/ld/testsuite/ld-nios2/
H A Dimm5.d12 [0-9a-f]+ <.[^>]*> Address 0x[0-9a-f]+ is out of bounds.
/haiku-buildtools/gcc/libmpx/mpxwrap/
H A DMakefile.am6 libmpxwrappers_la_CFLAGS = -fcheck-pointer-bounds -mmpx -fno-chkp-check-read \
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/mismatch/
H A D2.cc103 con1.bounds.first = array1;
104 con2.bounds.first = array2;
121 con3.bounds.first = array3;
122 con2.bounds.first = array2;
139 con3.bounds.first = array3;
140 con2.bounds.first = array2;
157 con3.bounds.first = array3;
158 con2.bounds.first = array2;
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/
H A Dtestsuite_iterators.h524 typename ItType<T>::ContainerType bounds; member in struct:__gnu_test::test_container
525 test_container(T* _first, T* _last):bounds(_first, _last)
531 ITERATOR_VERIFY(pos >= 0 && pos <= (bounds.last - bounds.first));
532 return ItType<T>(bounds.first + pos, &bounds);
538 ITERATOR_VERIFY(pos >= bounds.first && pos <= bounds.last);
539 return ItType<T>(pos, &bounds);
544 { return (bounds
[all...]
/haiku-buildtools/cloog/test/
H A DMakefile.am63 basic-bounds-1 \
64 basic-bounds-2 \
65 basic-bounds-3 \
66 basic-bounds-4 \
67 basic-bounds-5 \
68 basic-bounds-6 \
193 basic-bounds-2 \
/haiku-buildtools/binutils/gas/testsuite/gas/d10v/
H A Dinstruction_packing-005.d28 0: Address 0x0+ is out of bounds.
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/d10v/
H A Dinstruction_packing-005.d28 0: Address 0x0+ is out of bounds.
/haiku-buildtools/isl/
H A Disl_sample.c116 struct isl_mat *bounds = NULL; local
123 bounds = isl_mat_alloc(bset->ctx, 1+dim, 1+dim);
124 if (!bounds)
127 isl_int_set_si(bounds->row[0][0], 1);
128 isl_seq_clr(bounds->row[0]+1, dim);
129 bounds->n_row = 1;
132 return bounds;
136 isl_mat_free(bounds);
140 isl_seq_cpy(bounds->row[1], bset->ineq[0], bounds
206 struct isl_mat *bounds = NULL; local
[all...]

Completed in 129 milliseconds

123