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
|
/*
* File: orderingtests.c
* Copyright: (c) 2002 The Regents of the University of California
* Revision: @(#) $Revision: 4434 $
* Date: $Date: 2005-03-17 09:05:29 -0800 (Thu, 17 Mar 2005) $
* Description: Regression test for array ordering code
*
*/
#include "Ordering_IntOrderTest.hh"
#include <sstream>
#include "synch.hh"
static const int TEST_SIZE = 345; /* size of one dimensional arrays */
static const int TEST_DIM1 = 17; /* first dimension of 2-d arrays */
static const int TEST_DIM2 = 13; /* second dimension of 2-d arrays */
#define MYASSERT( AAA ) \
tracker.startPart( ++part_no ); \
magicNumber = clearstack(magicNumber); \
{ \
std::ostringstream buf; \
buf << "(" << __LINE__ << ") " #AAA; \
tracker.writeComment(buf.str()); \
} \
if ( AAA ) result = synch::ResultType_PASS; \
else result = synch::ResultType_FAIL; \
tracker.endPart(part_no, result);
/**
* Fill the stack with random junk.
*/
int clearstack(int magicNumber) {
int chunk[2048], i;
for(i = 0; i < 2048; i++){
chunk[i] = rand() + magicNumber;
}
for(i = 0; i < 16; i++){
magicNumber += chunk[rand() & 2047];
}
return magicNumber;
}
static const int arraySize = 7;
static sidl::array<int32_t>
make1DIMatrix(const int32_t size)
{
sidl::array<int32_t> result= sidl::array<int32_t>::create1d(size);
int32_t i;
for(i = 0; i < size; ++i ){
result.set(i,i);
}
return result;
}
int main(int argc, char **argv)
{
int magicNumber = 1;
synch::ResultType result = synch::ResultType_PASS;
int part_no = 0;
sidl::array<int32_t> A = NULL;
synch::RegOut tracker = synch::RegOut::_create();
tracker.setExpectations(32);
A = Ordering::IntOrderTest::makeColumnIMatrix(arraySize, true);
MYASSERT(A._not_nil() && A.isColumnOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
MYASSERT(Ordering::IntOrderTest::isColumnIMatrixTwo(A));
MYASSERT(Ordering::IntOrderTest::isRowIMatrixTwo(A));
Ordering::IntOrderTest::ensureRow(A);
MYASSERT(A._not_nil() && A.isRowOrder() &&
Ordering::IntOrderTest::isIMatrixTwo(A));
Ordering::IntOrderTest::ensureColumn(A);
MYASSERT(A._not_nil() && A.isColumnOrder() &&
Ordering::IntOrderTest::isIMatrixTwo(A));
Ordering::IntOrderTest::ensureRow(A);
MYASSERT(A._not_nil() && A.isRowOrder() &&
Ordering::IntOrderTest::isIMatrixTwo(A));
Ordering::IntOrderTest::ensureColumn(A);
MYASSERT(A._not_nil() && A.isColumnOrder() &&
Ordering::IntOrderTest::isIMatrixTwo(A));
// A.deleteRef();
A = Ordering::IntOrderTest::makeColumnIMatrix(arraySize, false);
MYASSERT(A._not_nil() && A.isColumnOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
// A.deleteRef();
A = Ordering::IntOrderTest::makeRowIMatrix(arraySize, true);
MYASSERT(A._not_nil() && A.isRowOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
MYASSERT(Ordering::IntOrderTest::isColumnIMatrixTwo(A));
MYASSERT(Ordering::IntOrderTest::isRowIMatrixTwo(A));
// A.deleteRef();
A = Ordering::IntOrderTest::makeRowIMatrix(arraySize, false);
MYASSERT(A._not_nil() && A.isRowOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
// A.deleteRef();
Ordering::IntOrderTest::createColumnIMatrix(arraySize, true, A);
MYASSERT(A._not_nil() && A.isColumnOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
// A.deleteRef();
Ordering::IntOrderTest::createColumnIMatrix(arraySize, false, A);
MYASSERT(A._not_nil() && A.isColumnOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
// A.deleteRef();
Ordering::IntOrderTest::createRowIMatrix(arraySize, true, A);
MYASSERT(A._not_nil() && A.isRowOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
// A.deleteRef();
Ordering::IntOrderTest::createRowIMatrix(arraySize, false, A);
MYASSERT(A._not_nil() && A.isRowOrder());
MYASSERT(Ordering::IntOrderTest::isIMatrixTwo(A));
// A.deleteRef();
A = Ordering::IntOrderTest::makeIMatrix(arraySize, true);
MYASSERT(A._not_nil() && Ordering::IntOrderTest::isIMatrixFour(A));
MYASSERT(Ordering::IntOrderTest::isColumnIMatrixFour(A));
MYASSERT(Ordering::IntOrderTest::isRowIMatrixFour(A));
// A.deleteRef();
A = make1DIMatrix(arraySize);
MYASSERT(A._not_nil() && Ordering::IntOrderTest::isIMatrixOne(A));
MYASSERT(Ordering::IntOrderTest::isColumnIMatrixOne(A));
MYASSERT(Ordering::IntOrderTest::isRowIMatrixOne(A));
// A.deleteRef();
MYASSERT(Ordering::IntOrderTest::isSliceWorking(true));
MYASSERT(Ordering::IntOrderTest::isSliceWorking(false));
tracker.close();
return 0;
}
|
