Open Menu / tests / bounded_ptr_src / arith.inc_dec.cpp
Loading...
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
//
// Tests for
//  bounded_ptr& operator++();
//  bounded_ptr operator++(int);
//  bounded_ptr& operator--();
//  bounded_ptr operator--(int);
//

#include <libkern/c++/bounded_ptr.h>
#include <array>
#include <darwintest.h>
#include <darwintest_utils.h>
#include "test_utils.h"

#define _assert(...) T_ASSERT_TRUE((__VA_ARGS__), # __VA_ARGS__)

struct T {
	int i;
};

template <typename T, typename QualT>
static void
tests()
{
	std::array<T, 5> array = {T{0}, T{1}, T{2}, T{3}, T{4}};

	{
		// Test pre-increment and pre-decrement
		test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end());
		_assert(&*ptr == &array[0]);

		{
			auto& ref = ++ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[1]);
		}

		{
			auto& ref = ++ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[2]);
		}
		{
			auto& ref = ++ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[3]);
		}
		{
			auto& ref = ++ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[4]);
		}
		{
			auto& ref = ++ptr;
			_assert(&ref == &ptr);
			// ptr is now one-past-last
		}
		{
			auto& ref = --ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[4]);
		}
		{
			auto& ref = --ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[3]);
		}
		{
			auto& ref = --ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[2]);
		}
		{
			auto& ref = --ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[1]);
		}
		{
			auto& ref = --ptr;
			_assert(&ref == &ptr);
			_assert(&*ptr == &array[0]);
		}
	}
	{
		// Test post-increment and post-decrement
		test_bounded_ptr<QualT> ptr(array.begin(), array.begin(), array.end());
		_assert(&*ptr == &array[0]);

		{
			auto prev = ptr++;
			_assert(&*prev == &array[0]);
			_assert(&*ptr == &array[1]);
		}
		{
			auto prev = ptr++;
			_assert(&*prev == &array[1]);
			_assert(&*ptr == &array[2]);
		}
		{
			auto prev = ptr++;
			_assert(&*prev == &array[2]);
			_assert(&*ptr == &array[3]);
		}
		{
			auto prev = ptr++;
			_assert(&*prev == &array[3]);
			_assert(&*ptr == &array[4]);
		}
		{
			auto prev = ptr++;
			_assert(&*prev == &array[4]);
			_assert(ptr == array.end());
		}
		{
			auto prev = ptr--;
			_assert(prev == array.end());
			_assert(&*ptr == &array[4]);
		}
		{
			auto prev = ptr--;
			_assert(&*prev == &array[4]);
			_assert(&*ptr == &array[3]);
		}
		{
			auto prev = ptr--;
			_assert(&*prev == &array[3]);
			_assert(&*ptr == &array[2]);
		}
		{
			auto prev = ptr--;
			_assert(&*prev == &array[2]);
			_assert(&*ptr == &array[1]);
		}
		{
			auto prev = ptr--;
			_assert(&*prev == &array[1]);
			_assert(&*ptr == &array[0]);
		}
	}
}

T_DECL(arith_inc_dec, "bounded_ptr.arith.inc_dec", T_META_TAG_VM_PREFERRED) {
	tests<T, T>();
	tests<T, T const>();
	tests<T, T volatile>();
	tests<T, T const volatile>();
}