arith07.cpp revision 12855:588919e0e4aa 
1/*****************************************************************************
2
3  Licensed to Accellera Systems Initiative Inc. (Accellera) under one or
4  more contributor license agreements.  See the NOTICE file distributed
5  with this work for additional information regarding copyright ownership.
6  Accellera licenses this file to you under the Apache License, Version 2.0
7  (the "License"); you may not use this file except in compliance with the
8  License.  You may obtain a copy of the License at
9
10    http://www.apache.org/licenses/LICENSE-2.0
11
12  Unless required by applicable law or agreed to in writing, software
13  distributed under the License is distributed on an "AS IS" BASIS,
14  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
15  implied.  See the License for the specific language governing
16  permissions and limitations under the License.
17
18 *****************************************************************************/
19
20/*****************************************************************************
21
22  arith07.cpp --
23
24  Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15
25
26 *****************************************************************************/
27
28/*****************************************************************************
29
30  MODIFICATION LOG - modifiers, enter your name, affiliation, date and
31  changes you are making here.
32
33      Name, Affiliation, Date:
34  Description of Modification:
35
36 *****************************************************************************/
37
38#include <stdlib.h>
39#include "systemc.h"
40#include "isaac.h"
41
42QTIsaac<8> rng;		// Platform independent random number generator.
43
44#define TEST(A,B) \
45{ \
46    if ( A != B ) \
47        cout << #A << " (" << A << ") != " << #B << "(" << B << ")" << endl; \
48}
49
50int
51sc_main( int argc, char* argv[] )
52{
53    unsigned int vali[5] = { 0, 1, (unsigned)-1, 7, (unsigned)-8 };
54    unsigned int valj[5] = { 0, 1, (unsigned)-1, 7, (unsigned)-8 };
55
56    for (int i = 3; i < 32; ++i) {
57        for (int j = 3; j < 32; ++j) {
58            cout << "i = " << i << ", j = " << j << endl;
59
60            sc_unsigned x(i);
61            sc_unsigned y(j);
62            sc_unsigned z(64);
63
64            vali[3] = (1 << (i - 1)) - 1;
65            vali[4] = - (1 << (i - 1));
66
67            valj[3] = (1 << (j - 1)) - 1;
68            valj[4] = - (1 << (j - 1));
69
70            for (int ii = 0; ii < 100; ++ii) {
71                for (int jj = 0; jj < 100; ++jj) {
72                    unsigned qi = (ii < 5) ? vali[ii] : (rng.rand() & ((1 << i) - 1));
73                    unsigned qj = (jj < 5) ? valj[jj] : (rng.rand() & ((1 << j) - 1));
74
75                    if (qi & (1 << (i - 1))) {
76                        qi = (qi << (32 - i)) >> (32 - i);
77                    }
78                    if (qj & (1 << (j - 1))) {
79                        qj = (qj << (32 - j)) >> (32 - j);
80                    }
81
82                    x = qi;
83                    TEST(x,qi );
84                    y = qj;
85                    TEST(y,qj );
86                    TEST((x == qj),(qi == qj));
87                    TEST((x == qj),(qj == x));
88                    TEST((x != qj),(qi != qj));
89                    TEST((x != qj),(qj != x));
90                    TEST((x < qj),(qi < qj));
91                    TEST((x < qj),(qj > x));
92                    TEST((x <= qj),(qi <= qj));
93                    TEST((x <= qj),(qj >= x));
94                    TEST((x > qj),(qi > qj));
95                    TEST((x > qj),(qj < x));
96                    TEST((x >= qj),(qi >= qj));
97                    TEST((x >= qj),(qj <= x));
98                    z = x + qj;
99                    TEST((sc_unsigned)( z.range(31,0) ), (qi + qj) );
100                    z = qi + y;
101                    TEST((sc_unsigned)( z.range(31,0) ), (qi + qj) );
102                    z = x - qj;
103                    TEST((sc_unsigned)( z.range(31,0) ), (qi - qj) );
104                    z = qi - y;
105                    TEST((sc_unsigned)( z.range(31,0) ), (qi - qj) );
106                    z = x * qj;
107                    TEST((sc_unsigned)( z.range(31,0) ), (qi * qj) );
108                    z = qi * y;
109                    TEST((sc_unsigned)( z.range(31,0) ), (qi * qj) );
110                    if (qj != 0) {
111                        z = x / qj;
112                        TEST((sc_unsigned)( z.range(31,0) ),(qi/qj));
113                        z = qi / y;
114                        TEST((sc_unsigned)( z.range(31,0) ),(qi/qj));
115                        z = x % qj;
116                        TEST((sc_unsigned)( z.range(31,0) ),(qi%qj));
117                        z = qi % y;
118                        TEST((sc_unsigned)( z.range(31,0) ),(qi%qj));
119                    }
120                    z = x & qj;
121                    TEST((sc_unsigned)( z.range(31,0) ), (qi & qj) );
122                    z = qi & y;
123                    TEST((sc_unsigned)( z.range(31,0) ), (qi & qj) );
124                    z = x | qj;
125                    TEST((sc_unsigned)( z.range(31,0) ), (qi | qj) );
126                    z = qi | y;
127                    TEST((sc_unsigned)( z.range(31,0) ), (qi | qj) );
128                    z = x ^ qj;
129                    TEST((sc_unsigned)( z.range(31,0) ), (qi ^ qj) );
130                    z = qi ^ y;
131                    TEST((sc_unsigned)( z.range(31,0) ), (qi ^ qj) );
132                }
133            }
134        }
135    }
136    return 0;
137}
138