| 1 | // | 
|---|
| 2 | // rnglocktest.cc | 
|---|
| 3 | // | 
|---|
| 4 | // Copyright (C) 1996 Limit Point Systems, Inc. | 
|---|
| 5 | // | 
|---|
| 6 | // Author: Curtis Janssen <cljanss@limitpt.com> | 
|---|
| 7 | // Maintainer: LPS | 
|---|
| 8 | // | 
|---|
| 9 | // This file is part of the SC Toolkit. | 
|---|
| 10 | // | 
|---|
| 11 | // The SC Toolkit is free software; you can redistribute it and/or modify | 
|---|
| 12 | // it under the terms of the GNU Library General Public License as published by | 
|---|
| 13 | // the Free Software Foundation; either version 2, or (at your option) | 
|---|
| 14 | // any later version. | 
|---|
| 15 | // | 
|---|
| 16 | // The SC Toolkit is distributed in the hope that it will be useful, | 
|---|
| 17 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|---|
| 18 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|---|
| 19 | // GNU Library General Public License for more details. | 
|---|
| 20 | // | 
|---|
| 21 | // You should have received a copy of the GNU Library General Public License | 
|---|
| 22 | // along with the SC Toolkit; see the file COPYING.LIB.  If not, write to | 
|---|
| 23 | // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. | 
|---|
| 24 | // | 
|---|
| 25 | // The U.S. Government is granted a limited license as per AL 91-7. | 
|---|
| 26 | // | 
|---|
| 27 |  | 
|---|
| 28 | #define TEST 1 | 
|---|
| 29 | #define VERBOSE 0 | 
|---|
| 30 |  | 
|---|
| 31 | #include <math.h> | 
|---|
| 32 | #include <stdlib.h> | 
|---|
| 33 | #include <util/misc/formio.h> | 
|---|
| 34 | #include <util/group/rnglock.h> | 
|---|
| 35 |  | 
|---|
| 36 | using namespace std; | 
|---|
| 37 | using namespace sc; | 
|---|
| 38 |  | 
|---|
| 39 | main() | 
|---|
| 40 | { | 
|---|
| 41 | const int size = 10000; | 
|---|
| 42 | int bin[size]; | 
|---|
| 43 | int i; | 
|---|
| 44 |  | 
|---|
| 45 | RangeLock lock; | 
|---|
| 46 |  | 
|---|
| 47 | for (i=0; i<size; i++) bin[i] = 0; | 
|---|
| 48 |  | 
|---|
| 49 | for (i=0; i<10000; i++) { | 
|---|
| 50 | int start = random()%size; | 
|---|
| 51 | int length = random()%30; | 
|---|
| 52 | if (length == 0) length++; | 
|---|
| 53 | int fence = start + length; | 
|---|
| 54 | if (fence > size) fence = size; | 
|---|
| 55 | int val = random()%2 ? -1:1; | 
|---|
| 56 | val = 1; | 
|---|
| 57 | #if VERBOSE | 
|---|
| 58 | ExEnv::out0() << scprintf("adding block %d: start = %d, fence = %d, val = %d\n", | 
|---|
| 59 | i, start, fence, val); | 
|---|
| 60 | #endif | 
|---|
| 61 | lock.sum(start, fence, val); | 
|---|
| 62 | for (int j=start; j<fence; j++) { | 
|---|
| 63 | bin[j] += val; | 
|---|
| 64 | } | 
|---|
| 65 | } | 
|---|
| 66 |  | 
|---|
| 67 | ExEnv::out0() << "printing nonzero deltas" << endl; | 
|---|
| 68 |  | 
|---|
| 69 | for (i=0; i<size; i++) { | 
|---|
| 70 | int delta = bin[i] - lock.lockvalue(i); | 
|---|
| 71 | if (delta) ExEnv::out0() << scprintf(" %5d: %8d (%8d %8d)\n", i, delta, | 
|---|
| 72 | bin[i], lock.lockvalue(i)); | 
|---|
| 73 | } | 
|---|
| 74 |  | 
|---|
| 75 | return 0; | 
|---|
| 76 | } | 
|---|
| 77 |  | 
|---|
| 78 | ///////////////////////////////////////////////////////////////////////////// | 
|---|
| 79 |  | 
|---|
| 80 | // Local Variables: | 
|---|
| 81 | // mode: c++ | 
|---|
| 82 | // c-file-style: "CLJ" | 
|---|
| 83 | // End: | 
|---|