| /xnu-11215/tests/bounded_ptr_src/ |
| H A D | arith.difference.cpp | 28 test_bounded_ptr<Left> const a(array.begin(), array.begin(), array.end()); in tests()
29 test_bounded_ptr<Right> const b(array.begin(), array.begin(), array.end()); in tests()
34 test_bounded_ptr<Left> const a(array.begin() + 1, array.begin(), array.end()); in tests()
35 test_bounded_ptr<Right> const b(array.begin(), array.begin(), array.end()); in tests()
40 test_bounded_ptr<Left> const a(array.begin() + 2, array.begin(), array.end()); in tests()
41 test_bounded_ptr<Right> const b(array.begin(), array.begin(), array.end()); in tests()
47 test_bounded_ptr<Right> const b(array.begin(), array.begin(), array.end()); in tests()
53 test_bounded_ptr<Right> const b(array.begin(), array.begin(), array.end()); in tests()
58 test_bounded_ptr<Left> const a(array.end(), array.begin(), array.end()); in tests()
59 test_bounded_ptr<Right> const b(array.begin(), array.begin(), array.end()); in tests()
[all …]
|
| H A D | compare.equal.cpp | 59 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
60 test_bounded_ptr<TQual> const b(array.begin(), array.begin(), array.end()); in tests()
64 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
65 test_bounded_ptr<TQual> const b(array.begin() + 1, array.begin(), array.end()); in tests()
69 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
74 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
75 test_bounded_ptr<TQual> const b(array.end(), array.begin(), array.end()); in tests()
79 test_bounded_ptr<TQual> const a(array.end(), array.begin(), array.end()); in tests()
80 test_bounded_ptr<TQual> const b(array.end(), array.begin(), array.end()); in tests()
87 test_bounded_ptr<TQual> const b(array.begin(), array.begin(), array.end()); in tests()
[all …]
|
| H A D | compare.order.cpp | 75 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
76 test_bounded_ptr<TQual> const b(array.begin(), array.begin(), array.end()); in tests()
80 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
81 test_bounded_ptr<TQual> const b(array.begin() + 1, array.begin(), array.end()); in tests()
85 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
90 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
91 test_bounded_ptr<TQual> const b(array.end(), array.begin(), array.end()); in tests()
95 test_bounded_ptr<TQual> const a(array.end(), array.begin(), array.end()); in tests()
96 test_bounded_ptr<TQual> const b(array.end(), array.begin(), array.end()); in tests()
103 test_bounded_ptr<TQual> const b(array.begin(), array.begin(), array.end()); in tests()
[all …]
|
| H A D | compare.order.raw.cpp | 78 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
87 test_bounded_ptr<TQual> const a(array.begin() + 1, array.begin(), array.end()); in tests()
96 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
105 test_bounded_ptr<TQual> const a(array.end(), array.begin(), array.end()); in tests()
125 test_bounded_ptr<TQual> const a(array.begin(), array.begin() + 2, array.end()); in tests()
134 test_bounded_ptr<TQual> const a(array.end() - 1, array.begin(), array.end() - 2); in tests()
143 test_bounded_ptr<TQual> const a(array.end(), array.begin(), array.end() - 1); in tests()
152 test_bounded_ptr<TQual> const a(array.end() - 1, array.begin(), array.end() - 2); in tests()
164 test_bounded_ptr<TQual> a(array.end() - 1, array.begin(), array.end() - 2); in tests()
190 test_bounded_ptr<Related> const a(array.begin(), array.begin(), array.end() - 1); in tests_convert()
[all …]
|
| H A D | compare.equal.raw.cpp | 56 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
65 test_bounded_ptr<TQual> const a(array.begin() + 1, array.begin(), array.end()); in tests()
74 test_bounded_ptr<TQual> const a(array.begin(), array.begin(), array.end()); in tests()
83 test_bounded_ptr<TQual> const a(array.end(), array.begin(), array.end()); in tests()
103 test_bounded_ptr<TQual> const a(array.begin(), array.begin() + 2, array.end()); in tests()
112 test_bounded_ptr<TQual> const a(array.end() - 1, array.begin(), array.end() - 2); in tests()
121 test_bounded_ptr<TQual> const a(array.end(), array.begin(), array.end() - 1); in tests()
130 test_bounded_ptr<TQual> const a(array.end() - 1, array.begin(), array.end() - 2); in tests()
142 test_bounded_ptr<TQual> a(array.end() - 1, array.begin(), array.end() - 2); in tests()
163 test_bounded_ptr<Derived> const a(array.begin(), array.begin(), array.end() - 1); in tests_convert()
[all …]
|
| H A D | arith.add_assign.cpp | 43 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
49 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
55 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
61 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
67 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
73 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
85 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
91 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
97 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
103 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
[all …]
|
| H A D | arith.subtract_assign.cpp | 40 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
46 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
52 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
58 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
64 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
70 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
82 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
88 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
94 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
100 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
[all …]
|
| H A D | arith.inc_dec.cpp | 25 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
29 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
30 _assert(&*ptr == &array[0]); in tests()
35 _assert(&*ptr == &array[1]); in tests()
41 _assert(&*ptr == &array[2]); in tests()
46 _assert(&*ptr == &array[3]); in tests()
51 _assert(&*ptr == &array[4]); in tests()
61 _assert(&*ptr == &array[4]); in tests()
66 _assert(&*ptr == &array[3]); in tests()
86 test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end()); in tests()
[all …]
|
| H A D | arith.add.cpp | 25 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
33 test_bounded_ptr<QualT> const ptr(array.begin(), array.begin(), array.end()); in tests()
37 _assert(&*res == &array[0]); in tests()
41 _assert(&*res == &array[1]); in tests()
45 _assert(&*res == &array[2]); in tests()
49 _assert(&*res == &array[3]); in tests()
67 test_bounded_ptr<QualT> const ptr(array.end(), array.begin(), array.end()); in tests()
97 test_bounded_ptr<QualT> const ptr(array.begin() + 1, array.begin(), array.end()); in tests()
105 test_bounded_ptr<QualT> const ptr(array.begin(), array.begin(), array.end()); in tests()
110 test_bounded_ptr<QualT> const ptr(array.begin(), array.begin(), array.end()); in tests()
[all …]
|
| H A D | ctor.begin_end.cpp | 27 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
29 test_bounded_ptr<QualT> p(array.begin() + 0, array.begin(), array.end()); in tests()
33 test_bounded_ptr<QualT> p(array.begin() + 1, array.begin(), array.end()); in tests()
37 test_bounded_ptr<QualT> p(array.begin() + 2, array.begin(), array.end()); in tests()
41 test_bounded_ptr<QualT> p(array.begin() + 3, array.begin(), array.end()); in tests()
45 test_bounded_ptr<QualT> p(array.begin() + 4, array.begin(), array.end()); in tests()
56 test_bounded_ptr<QualT> p(array.begin() + 1, array.begin() + 3, array.end()); in tests()
64 test_bounded_ptr<QualT> p(array.begin() + 4, array.begin(), array.begin() + 3); in tests()
72 test_bounded_ptr<QualT> p(array.end(), array.begin(), array.end()); in tests()
94 std::array<Derived, 5> array = {}; variable
[all …]
|
| H A D | subscript.cpp | 40 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
47 test_bounded_ptr<QualT> ptr(array.begin() + 0, array.begin(), array.end()); in tests()
49 _assert(&ref0 == &array[0]); in tests()
52 _assert(&ref1 == &array[1]); in tests()
68 test_bounded_ptr<QualT> ptr(array.begin() + 1, array.begin(), array.end()); in tests()
89 test_bounded_ptr<QualT> ptr(array.begin() + 2, array.begin(), array.end()); in tests()
110 test_bounded_ptr<QualT> ptr(array.begin() + 4, array.begin(), array.end()); in tests()
131 test_bounded_ptr<QualT> ptr(array.end(), array.begin(), array.end()); in tests()
154 libkern::bounded_ptr<QualT, tracking_policy> ptr(array.end() - 1, array.begin(), array.end() - 2); in tests()
181 libkern::bounded_ptr<QualT, tracking_policy> ptr(array.begin() + 1, array.begin(), array.end()); in tests()
[all …]
|
| H A D | unsafe_discard_bounds.cpp | 35 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
42 test_bounded_ptr<QualT> const ptr(array.begin() + 0, array.begin(), array.end()); in tests()
44 _assert(raw == &array[0]); in tests()
51 test_bounded_ptr<QualT> const ptr(array.begin() + 1, array.begin(), array.end()); in tests()
53 _assert(raw == &array[1]); in tests()
60 test_bounded_ptr<QualT> const ptr(array.begin() + 2, array.begin(), array.end()); in tests()
69 test_bounded_ptr<QualT> const ptr(array.begin() + 4, array.begin(), array.end()); in tests()
78 test_bounded_ptr<QualT> const ptr(array.end(), array.begin(), array.end()); in tests()
87 test_bounded_ptr<QualT> ptr(array.end() - 1, array.begin(), array.end() - 2); in tests()
96 test_bounded_ptr<QualT> ptr(array.begin() + 1, array.begin(), array.end()); in tests()
[all …]
|
| H A D | discard_bounds.cpp | 32 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
39 test_bounded_ptr<QualT> const ptr(array.begin() + 0, array.begin(), array.end()); in tests()
41 _assert(raw == &array[0]); in tests()
48 test_bounded_ptr<QualT> const ptr(array.begin() + 1, array.begin(), array.end()); in tests()
50 _assert(raw == &array[1]); in tests()
57 test_bounded_ptr<QualT> const ptr(array.begin() + 2, array.begin(), array.end()); in tests()
59 _assert(raw == &array[2]); in tests()
66 test_bounded_ptr<QualT> const ptr(array.begin() + 4, array.begin(), array.end()); in tests()
76 libkern::bounded_ptr<QualT, tracking_policy> ptr(array.begin() + 1, array.begin(), array.end()); in tests()
89 libkern::bounded_ptr<QualT, tracking_policy> ptr(array.end() - 1, array.begin(), array.end() - 2); in tests()
[all …]
|
| H A D | deref.cpp | 40 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
47 test_bounded_ptr<QualT> ptr(array.begin() + 0, array.begin(), array.end()); in tests()
50 _assert(&ref == &array[0]); in tests()
60 test_bounded_ptr<QualT> ptr(array.begin() + 1, array.begin(), array.end()); in tests()
63 _assert(&ref == &array[1]); in tests()
73 test_bounded_ptr<QualT> ptr(array.begin() + 2, array.begin(), array.end()); in tests()
76 _assert(&ref == &array[2]); in tests()
86 test_bounded_ptr<QualT> ptr(array.begin() + 4, array.begin(), array.end()); in tests()
101 libkern::bounded_ptr<QualT, tracking_policy> ptr(array.begin() + 1, array.begin(), array.end()); in tests()
115 libkern::bounded_ptr<QualT, tracking_policy> ptr(array.end() - 1, array.begin(), array.end() - 2); in tests()
[all …]
|
| H A D | arith.subtract.cpp | 23 std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}}; in tests() local
31 test_bounded_ptr<QualT> const ptr(array.end(), array.begin(), array.end()); in tests()
35 _assert(ptr == array.end()); in tests()
39 _assert(&*res == &array[4]); in tests()
43 _assert(&*res == &array[3]); in tests()
47 _assert(&*res == &array[2]); in tests()
51 _assert(&*res == &array[1]); in tests()
55 _assert(&*res == &array[0]); in tests()
65 test_bounded_ptr<QualT> const ptr(array.begin(), array.begin(), array.end()); in tests()
95 test_bounded_ptr<QualT> const ptr(array.begin() + 4, array.begin(), array.end()); in tests()
[all …]
|
| /xnu-11215/libkern/kxld/ |
| H A D | kxld_array.c | 58 check(array); in kxld_array_init()
80 array->maxitems += array->pool_maxitems; in kxld_array_init()
93 bzero(array, sizeof(*array)); in kxld_array_init()
163 array->pool_maxitems = (u_int) (array->pool_capacity / array->itemsize); in array_init()
164 array->maxitems = array->pool_maxitems; in array_init()
259 if (array) { in kxld_array_reset()
274 if (array) { in kxld_array_clear()
289 if (array) { in kxld_array_deinit()
294 bzero(array, sizeof(*array)); in kxld_array_deinit()
406 array->maxitems += array->pool_maxitems; in kxld_array_resize()
[all …]
|
| /xnu-11215/tests/bounded_array_ref_src/ |
| H A D | slice.cpp | 35 CHECK(&slice[0] == &array[0]); in tests()
41 CHECK(&slice[0] == &array[0]); in tests()
42 CHECK(&slice[1] == &array[1]); in tests()
48 CHECK(&slice[0] == &array[0]); in tests()
49 CHECK(&slice[1] == &array[1]); in tests()
50 CHECK(&slice[2] == &array[2]); in tests()
51 CHECK(&slice[3] == &array[3]); in tests()
52 CHECK(&slice[4] == &array[4]); in tests()
72 CHECK(&slice[0] == &array[1]); in tests()
73 CHECK(&slice[1] == &array[2]); in tests()
[all …]
|
| H A D | ctor.bounded_array.cpp | 25 test_bounded_array_ref<T> view(array); in tests()
26 CHECK(view.data() == array.data()); in tests()
36 test_bounded_array<T, 1> array = {T{11}}; in tests() local
37 test_bounded_array_ref<T> view(array); in tests()
38 CHECK(view.data() == array.data()); in tests()
44 test_bounded_array<T, 0> array = {}; in tests() local
45 test_bounded_array_ref<T> view(array); in tests()
46 CHECK(view.data() == array.data()); in tests()
53 test_bounded_array_ref<T> view = array; in tests()
54 CHECK(view.data() == array.data()); in tests()
[all …]
|
| /xnu-11215/tests/bounded_array_src/ |
| H A D | ctor.default.cpp | 28 test_bounded_array<T, 10> array; in tests() local
29 CHECK(array.size() == 10); in tests()
30 T* end = array.data() + array.size(); in tests()
37 CHECK(array.size() == 10); in tests()
38 T* end = array.data() + array.size(); in tests()
45 CHECK(array.size() == 10); in tests()
46 T* end = array.data() + array.size(); in tests()
53 CHECK(array.size() == 10); in tests()
54 T* end = array.data() + array.size(); in tests()
62 test_bounded_array<T, 0> array; in tests() local
[all …]
|
| H A D | begin_end.cpp | 24 test_bounded_ptr<T> begin = array.begin(); in tests()
25 test_bounded_ptr<T> end = array.end(); in tests()
26 CHECK(begin.discard_bounds() == array.data()); in tests()
31 test_bounded_ptr<T const> begin = array.begin(); in tests()
32 test_bounded_ptr<T const> end = array.end(); in tests()
33 CHECK(begin.discard_bounds() == array.data()); in tests()
39 test_bounded_array<T, 0> array = {}; in tests() local
40 test_bounded_ptr<T> begin = array.begin(); in tests()
41 test_bounded_ptr<T> end = array.end(); in tests()
46 test_bounded_array<T, 0> const array = {}; in tests() local
[all …]
|
| H A D | ctor.aggregate_init.cpp | 32 CHECK(array.size() == 5); in tests()
33 CHECK(array[0] == T(1)); in tests()
34 CHECK(array[1] == T(2)); in tests()
35 CHECK(array[2] == T(3)); in tests()
36 CHECK(array[3] == T(4)); in tests()
37 CHECK(array[4] == T(5)); in tests()
43 CHECK(array[0] == T(1)); in tests()
44 CHECK(array[1] == T(2)); in tests()
45 CHECK(array[2] == T(3)); in tests()
46 CHECK(array[3] == T(4)); in tests()
[all …]
|
| /xnu-11215/tests/safe_allocation_src/ |
| H A D | ctor.nullptr.cpp | 20 CHECK(array.data() == nullptr); in tests()
21 CHECK(array.size() == 0); in tests()
22 CHECK(array.begin() == array.end()); in tests()
26 CHECK(array.data() == nullptr); in tests()
27 CHECK(array.size() == 0); in tests()
28 CHECK(array.begin() == array.end()); in tests()
32 CHECK(array.data() == nullptr); in tests()
33 CHECK(array.size() == 0); in tests()
34 CHECK(array.begin() == array.end()); in tests()
39 CHECK(array.size() == 0); in tests()
[all …]
|
| H A D | ctor.default.cpp | 19 test_safe_allocation<T> array; in tests() local
20 CHECK(array.data() == nullptr); in tests()
21 CHECK(array.size() == 0); in tests()
22 CHECK(array.begin() == array.end()); in tests()
25 test_safe_allocation<T> array{}; in tests() local
26 CHECK(array.data() == nullptr); in tests()
27 CHECK(array.size() == 0); in tests()
28 CHECK(array.begin() == array.end()); in tests()
32 CHECK(array.data() == nullptr); in tests()
33 CHECK(array.size() == 0); in tests()
[all …]
|
| H A D | ctor.allocate.cpp | 30 tracked_safe_allocation<T> array(10, libkern::allocate_memory); in tests() local
32 CHECK(array.data() != nullptr); in tests()
33 CHECK(array.size() == 10); in tests()
34 CHECK(array.begin() == array.data()); in tests()
35 CHECK(array.end() == array.data() + 10); in tests()
46 tracked_safe_allocation<T> array(max_n + 1, libkern::allocate_memory); in tests() local
47 CHECK(array.data() == nullptr); in tests()
48 CHECK(array.size() == 0); in tests()
49 CHECK(array.begin() == array.end()); in tests()
62 tracked_safe_allocation<TrackInit> array(10, libkern::allocate_memory); variable
[all …]
|
| /xnu-11215/libkern/kxld/tests/ |
| H A D | kxld_array_test.c | 45 KXLDArray array; in main() local
53 bzero(&array, sizeof(array)); in main()
63 assert(array.nitems == titems); in main()
67 item = kxld_array_get_item(&array, idx); in main()
72 item = kxld_array_get_item(&array, idx); in main()
89 assert(array.nitems == titems); in main()
111 (void) kxld_array_clear(&array); in main()
112 item = kxld_array_get_item(&array, 0); in main()
122 item = kxld_array_get_slot(&array, 0); in main()
134 assert(array.nitems == titems); in main()
[all …]
|