rwlocktest.c revision 677833bc953b6cb418c701facbdcf4aa18d6c44e
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is the Netscape Portable Runtime (NSPR).
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1998-2000
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
/*
*
* RWLock tests
*
* Several threads are created to access and modify data arrays using
* PRRWLocks for synchronization. Two data arrays, array_A and array_B, are
* initialized with random data and a third array, array_C, is initialized
* with the sum of the first 2 arrays.
*
* Each one of the threads acquires a read lock to verify that the sum of
* the arrays A and B is equal to array C, and acquires a write lock to
* consistently update arrays A and B so that their is equal to array C.
*
*/
#include "nspr.h"
#include "plgetopt.h"
#include "prrwlock.h"
static int _debug_on;
static void update_array(void);
static void check_array(void);
typedef struct thread_args {
} thread_args;
#define DEFAULT_THREAD_CNT 4
#define DEFAULT_LOOP_CNT 100
#define TEST_ARRAY_SIZE 100
{
PRInt32 i;
{
if (PL_OPT_BAD == os) continue;
{
case 'd': /* debug mode */
_debug_on = 1;
break;
case 't': /* thread count */
break;
case 'c': /* loop count */
break;
default:
break;
}
}
PR_GetError());
return 1;
}
/*
* allocate and initialize data arrays
*/
cnt = 0;
for (i=0; i < TEST_ARRAY_SIZE;i++) {
}
if (_debug_on)
/*
* create LOCAL and GLOBAL threads alternately
*/
if (cnt & 1)
else
0);
PR_GetError());
PR_ProcessExit(2);
}
if (_debug_on)
}
}
printf("PASS\n");
return 0;
}
{
/*
* verify sum, update arrays and verify sum again
*/
check_array();
update_array();
check_array();
}
if (_debug_on)
"Thread[0x%x] lock = 0x%x exiting\n",
}
static void check_array(void)
{
PRInt32 i;
for (i=0; i < TEST_ARRAY_SIZE;i++)
PR_ProcessExit(1);
}
}
static void update_array(void)
{
PRInt32 i;
for (i=0; i < TEST_ARRAY_SIZE;i++) {
array_A[i] += i;
array_B[i] -= i;
}
}