File: orderingtests.c

package info (click to toggle)
babel 0.10.2-1
  • links: PTS
  • area: contrib
  • in suites: sarge
  • size: 43,932 kB
  • ctags: 29,707
  • sloc: java: 74,695; ansic: 73,142; cpp: 40,649; sh: 18,411; f90: 10,062; fortran: 6,727; python: 6,406; makefile: 3,866; xml: 118; perl: 48
file content (146 lines) | stat: -rw-r--r-- 4,924 bytes parent folder | download
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
/*
 * 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.h"
#include <stdio.h>
#include <stdlib.h>
#include "synch.h"


static void declare_part(synch_RegOut tracker, int * part_no ) {
  synch_RegOut_startPart(tracker, ++(*part_no));
}

static void end_part( synch_RegOut tracker, int part_no, 
                      enum synch_ResultType__enum result) 
{
  synch_RegOut_endPart(tracker, 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;
}

#define MYASSERT( AAA ) \
  declare_part(tracker,  &part_no ); \
  magicNumber = clearstack(magicNumber); \
  synch_RegOut_writeComment(tracker, #AAA); \
  if ( AAA ) result = synch_ResultType_PASS; \
  else result = synch_ResultType_FAIL;  \
  end_part( tracker, part_no, result);


static const int arraySize = 7;

static struct sidl_int__array*
make1DIMatrix(const int32_t size)
{
  struct sidl_int__array *result=NULL;
  int32_t i;
  result = sidl_int__array_create1d(size);
  for(i = 0; i < size; ++i ){
    sidlArrayElem1(result, i) = i;
  }
  return result;
}

int main(int argc, char **argv)
{
  int magicNumber = 1;
  enum synch_ResultType__enum result = synch_ResultType_PASS;
  synch_RegOut tracker = synch_RegOut__create();
  int part_no = 0;
  
  struct sidl_int__array *A = NULL;
  synch_RegOut_setExpectations(tracker, 32);
  A = Ordering_IntOrderTest_makeColumnIMatrix(arraySize, TRUE);
  MYASSERT(A && sidl_int__array_isColumnOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  MYASSERT(Ordering_IntOrderTest_isColumnIMatrixTwo(A));
  MYASSERT(Ordering_IntOrderTest_isRowIMatrixTwo(A));
  Ordering_IntOrderTest_ensureRow(&A);
  MYASSERT(A && sidl_int__array_isRowOrder(A) &&
           Ordering_IntOrderTest_isIMatrixTwo(A));
  Ordering_IntOrderTest_ensureColumn(&A);
  MYASSERT(A && sidl_int__array_isColumnOrder(A) &&
           Ordering_IntOrderTest_isIMatrixTwo(A));
  Ordering_IntOrderTest_ensureRow(&A);
  MYASSERT(A && sidl_int__array_isRowOrder(A) &&
           Ordering_IntOrderTest_isIMatrixTwo(A));
  Ordering_IntOrderTest_ensureColumn(&A);
  MYASSERT(A && sidl_int__array_isColumnOrder(A) &&
           Ordering_IntOrderTest_isIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  A = Ordering_IntOrderTest_makeColumnIMatrix(arraySize, FALSE);
  MYASSERT(A && sidl_int__array_isColumnOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  A = Ordering_IntOrderTest_makeRowIMatrix(arraySize, TRUE);
  MYASSERT(A && sidl_int__array_isRowOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  MYASSERT(Ordering_IntOrderTest_isColumnIMatrixTwo(A));
  MYASSERT(Ordering_IntOrderTest_isRowIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  A = Ordering_IntOrderTest_makeRowIMatrix(arraySize, FALSE);
  MYASSERT(A && sidl_int__array_isRowOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  Ordering_IntOrderTest_createColumnIMatrix(arraySize, TRUE, &A);
  MYASSERT(A && sidl_int__array_isColumnOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  Ordering_IntOrderTest_createColumnIMatrix(arraySize, FALSE, &A);
  MYASSERT(A && sidl_int__array_isColumnOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  Ordering_IntOrderTest_createRowIMatrix(arraySize, TRUE, &A);
  MYASSERT(A && sidl_int__array_isRowOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  Ordering_IntOrderTest_createRowIMatrix(arraySize, FALSE, &A);
  MYASSERT(A && sidl_int__array_isRowOrder(A));
  MYASSERT(Ordering_IntOrderTest_isIMatrixTwo(A));
  sidl_int__array_deleteRef(A); A = NULL;

  A = Ordering_IntOrderTest_makeIMatrix(arraySize, TRUE);
  MYASSERT(A && Ordering_IntOrderTest_isIMatrixFour(A));
  MYASSERT(Ordering_IntOrderTest_isColumnIMatrixFour(A));
  MYASSERT(Ordering_IntOrderTest_isRowIMatrixFour(A));
  sidl_int__array_deleteRef(A); A = NULL;

  A = make1DIMatrix(arraySize);
  MYASSERT(A && Ordering_IntOrderTest_isIMatrixOne(A));
  MYASSERT(Ordering_IntOrderTest_isColumnIMatrixOne(A));
  MYASSERT(Ordering_IntOrderTest_isRowIMatrixOne(A));
  sidl_int__array_deleteRef(A); A = NULL;

  MYASSERT(Ordering_IntOrderTest_isSliceWorking(TRUE));
  MYASSERT(Ordering_IntOrderTest_isSliceWorking(FALSE));

  synch_RegOut_close(tracker);
  synch_RegOut_deleteRef(tracker);
  return 0;
}