| /***************************************************************************** |
| |
| Licensed to Accellera Systems Initiative Inc. (Accellera) under one or |
| more contributor license agreements. See the NOTICE file distributed |
| with this work for additional information regarding copyright ownership. |
| Accellera licenses this file to you under the Apache License, Version 2.0 |
| (the "License"); you may not use this file except in compliance with the |
| License. You may obtain a copy of the License at |
| |
| http://www.apache.org/licenses/LICENSE-2.0 |
| |
| Unless required by applicable law or agreed to in writing, software |
| distributed under the License is distributed on an "AS IS" BASIS, |
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or |
| implied. See the License for the specific language governing |
| permissions and limitations under the License. |
| |
| *****************************************************************************/ |
| |
| /***************************************************************************** |
| |
| stab2.cpp -- |
| |
| Original Author: Martin Janssen, Synopsys, Inc., 2002-02-15 |
| |
| *****************************************************************************/ |
| |
| /***************************************************************************** |
| |
| MODIFICATION LOG - modifiers, enter your name, affiliation, date and |
| changes you are making here. |
| |
| Name, Affiliation, Date: |
| Description of Modification: |
| |
| *****************************************************************************/ |
| |
| #include "systemc.h" |
| |
| int |
| sc_main( int argc, char* argv[] ) |
| { |
| int i; |
| sc_bv<325> x; |
| sc_lv<142> y; |
| |
| sc_signed z(103); |
| sc_unsigned w(291); |
| |
| for (i = 0; i < 325; ++i) { |
| x[i] = ((i & 1) ^ ((i >> 1) & 1)); |
| }; |
| for (i = 0; i < 325; ++i) { |
| sc_assert( x[i] == ((i & 1) ^ ((i >> 1) & 1)) ); |
| }; |
| for (i = 0; i < 142; ++i) { |
| y[i] = ((i & 1) ^ ((i >> 2) & 1)); |
| } |
| for (i = 0; i < 142; ++i) { |
| // sc_assert( y[i] == char((i & 1) ^ ((i >> 2) & 1)) ); |
| sc_assert( y[i] == ((i & 1) ^ ((i >> 2) & 1)) ); |
| } |
| for (i = 0; i < 103; ++i) { |
| z[i] = (((i >> 2) & 1) ^ ((i >> 1) & 1)); |
| } |
| for (i = 0; i < 103; ++i) { |
| sc_assert( (bool) z[i] == (((i >> 2) & 1) ^ ((i >> 1) & 1)) ); |
| } |
| for (i = 0; i < 291; ++i) { |
| w[i] = (((i >> 3) & 1) ^ ((i >> 1) & 1)); |
| } |
| for (i = 0; i < 291; ++i) { |
| sc_assert( (bool) w[i] == (((i >> 3) & 1) ^ ((i >> 1) & 1)) ); |
| } |
| |
| cout << x << endl; |
| cout << x.to_string() << endl; |
| cout << y << endl; |
| cout << y.to_string() << endl; |
| cout << z << endl; |
| cout << w << endl; |
| |
| for (int k = 0; k < 10; ++k) { |
| cerr << "k = " << k << endl; |
| |
| for (i = 0; i < 100; ++i) { |
| int j; |
| |
| if (k == 0) { |
| cout << "i = " << i << endl; |
| cout << x.range(i + 224, i) << endl; |
| cout << x.range(i + 224, i).to_string() << endl; |
| cout << y.range(i + 41, i) << endl; |
| cout << y.range(i + 41, i).to_string() << endl; |
| cout << sc_signed(z.range(i + 2, i)) << endl; |
| cout << sc_unsigned(w.range(i + 190, i)) << endl; |
| cout << x.range(i, i + 224) << endl; |
| cout << x.range(i, i + 224).to_string() << endl; |
| cout << y.range(i, i + 41) << endl; |
| cout << y.range(i, i + 41).to_string() << endl; |
| cout << sc_signed(z.range(i, i + 2)) << endl; |
| cout << sc_unsigned(w.range(i, i + 190)) << endl; |
| } else { |
| (void) x.range(i + 224, i); |
| (void) y.range(i + 41, i); |
| (void) sc_signed(z.range(i + 2, i)); |
| (void) sc_unsigned(w.range(i + 190, i)); |
| } |
| |
| sc_bv<225> foo; |
| sc_bv<225> foo1; |
| sc_bv<450> foo2; |
| foo = x.range(i + 224, i); |
| foo1 = x.range(i, i + 224); |
| foo2 = (foo1, foo); |
| for (j = 0; j < 225; ++j) { |
| sc_assert( foo[j] == x[i + j] ); |
| sc_assert( foo1[224 - j] == x[i + j] ); |
| sc_assert( foo2.range(449,225) == foo1 ); |
| sc_assert( foo2.range(224,0) == foo ); |
| } |
| // (foo, foo1) = (foo1, foo); |
| (foo, foo1) = foo2; |
| for (j = 0; j < 225; ++j) { |
| sc_assert( foo1[j] == x[i + j] ); |
| sc_assert( foo[224 - j] == x[i + j] ); |
| sc_assert( foo2.range(449,225) == foo ); |
| sc_assert( foo2.range(224,0) == foo1 ); |
| } |
| |
| sc_lv<42> bar; |
| sc_lv<42> bar1; |
| sc_lv<84> bar2; |
| bar = y.range(i + 41, i); |
| bar1 = y.range(i, i + 41); |
| bar2 = (bar1, bar); |
| for (j = 0; j < 42; ++j) { |
| sc_assert( bar[j] == y[i + j] ); |
| sc_assert( bar1[41 - j] == y[i + j] ); |
| sc_assert( bar2.range(83,42) == bar1 ); |
| sc_assert( bar2.range(41,0) == bar ); |
| } |
| // (bar, bar1) = (bar1, bar); |
| (bar, bar1) = bar2; |
| for (j = 0; j < 42; ++j) { |
| sc_assert( bar1[j] == y[i + j] ); |
| sc_assert( bar[41 - j] == y[i + j] ); |
| sc_assert( bar2.range(83,42) == bar ); |
| sc_assert( bar2.range(41,0) == bar1 ); |
| } |
| |
| sc_signed baz(3); |
| sc_signed baz1(3); |
| baz = z.range(i + 2, i); |
| baz1 = z.range(i, i + 2); |
| for (j = 0; j < 3; ++j) { |
| sc_assert( baz[j] == z[i + j] ); |
| sc_assert( baz1[2 - j] == z[i + j] ); |
| } |
| |
| sc_unsigned quux(191); |
| sc_unsigned quux1(191); |
| quux = w.range(i + 190, i); |
| quux1 = w.range(i, i + 190); |
| for (j = 0; j < 191; ++j) { |
| sc_assert( quux[j] == w[i + j] ); |
| sc_assert( quux1[190 - j] == w[i + j] ); |
| } |
| } |
| } |
| return 0; |
| } |