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 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
|
//=============================================================================
/**
* @file Reader_Writer_Test.cpp
*
* $Id: Reader_Writer_Test.cpp 93638 2011-03-24 13:16:05Z johnnyw $
*
* This test program verifies the functionality of the ACE_OS
* implementation of readers/writer locks on Win32 and Posix
* pthreads.
*
*
* @author Prashant Jain <pjain@cs.wustl.edu> and Doug C. Schmidt <schmidt@cs.wustl.edu>
*/
//=============================================================================
#include "test_config.h"
#include "ace/Thread.h"
#include "ace/Thread_Manager.h"
#include "ace/Get_Opt.h"
#include "ace/Atomic_Op.h"
#include "ace/OS_NS_unistd.h"
#include "ace/Guard_T.h"
#include "ace/RW_Thread_Mutex.h"
#include "ace/Time_Value.h"
#if defined (ACE_HAS_THREADS)
// Default number of iterations.
#if defined (VXWORKS)
// So the test doesn't run for too long . . .
static size_t n_iterations = 25;
#else
static size_t n_iterations = 50;
#endif /* VXWORKS */
// Default number of loops.
#if defined (VXWORKS)
// thr_yield () and/or thr_equal () are expensive on VxWorks, apparently.
static size_t n_loops = 10;
#else
static size_t n_loops = 100;
#endif /* VXWORKS */
// Default number of readers.
static size_t n_readers = 6;
// Default number of writers.
static size_t n_writers = 4;
// Thread id of last writer.
static ACE_thread_t shared_data;
// Lock for shared_data.
static ACE_RW_Thread_Mutex rw_mutex;
// Count of the number of readers and writers.
static ACE_Atomic_Op<ACE_Thread_Mutex, long> current_readers;
static ACE_Atomic_Op<ACE_Thread_Mutex, long> current_writers;
// Explain usage and exit.
static void
print_usage_and_die (void)
{
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("usage: %n [-r n_readers] [-w n_writers] [-n iteration_count]\n")));
ACE_OS::exit (1);
}
static void
parse_args (int argc, ACE_TCHAR *argv[])
{
ACE_Get_Opt get_opt (argc, argv, ACE_TEXT ("r:w:n:"));
int c;
while ((c = get_opt ()) != -1)
switch (c)
{
case 'r':
n_readers = ACE_OS::atoi (get_opt.opt_arg ());
break;
case 'w':
n_writers = ACE_OS::atoi (get_opt.opt_arg ());
break;
case 'n':
n_iterations = ACE_OS::atoi (get_opt.opt_arg ());
break;
default:
print_usage_and_die ();
break;
}
}
// Iterate <n_iterations> each time checking that nobody modifies the data
// while we have a read lock.
static void *
reader (void *)
{
ACE_DEBUG ((LM_DEBUG, ACE_TEXT (" (%t) reader starting\n")));
// We use a random pause, around 2msec with 1msec jittering.
int usecs = 1000 + ACE_OS::rand() % 2000;
ACE_Time_Value pause(0, usecs);
for (size_t iterations = 1; iterations <= n_iterations; iterations++)
{
ACE_OS::sleep (pause);
ACE_READ_GUARD_RETURN (ACE_RW_Thread_Mutex, g, rw_mutex, 0);
// int n = ++current_readers;
// ACE_DEBUG ((LM_DEBUG, ACE_TEXT (" (%t) I'm reader number %d\n"), n));
if (current_writers > 0)
ACE_DEBUG ((LM_DEBUG, ACE_TEXT (" (%t) writers found!!!\n")));
ACE_thread_t data = shared_data;
for (size_t loop = 1; loop <= n_loops; loop++)
{
ACE_Thread::yield ();
if (!ACE_OS::thr_equal (shared_data, data))
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT (" (%t) somebody changed %d to %d\n"),
data, shared_data));
}
int result = rw_mutex.tryacquire_write_upgrade ();
if (result == 0)
{
--current_readers;
++current_writers;
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("(%t) upgraded to write lock!\n")));
ACE_thread_t self = ACE_Thread::self ();
shared_data = self;
data = self;
for (size_t loop = 1; loop <= n_loops; loop++)
{
if (ACE_OS::thr_equal (shared_data, data) == 0)
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("(%t) upgraded writer error: somebody changed %d to %d\n"),
data,
shared_data));
}
--current_writers;
// we were a writer
}
else if (result == -1 && errno == EBUSY)
{
--current_readers;
// we were still a reader
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("(%t) could not upgrade to write lock!\n")));
}
else // result == -1
{
// These #ifs should generally match the logic in OS_NS_Thread.inl.
# if defined (ACE_HAS_PTHREADS_UNIX98_EXT) || !defined (ACE_LACKS_RWLOCK_T)
// In this case we have native RW locks support, but native RW
// locks may not support upgrading!
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("(%t) %p\n"),
ACE_TEXT ("can't upgrade write lock"),
1));
# else
// In this case we do not have native RW locks, but therefore the
// emulation, which supports upgradable write locks.
ACE_ERROR ((LM_ERROR,
ACE_TEXT ("(%t) %p\n"),
ACE_TEXT ("failure in upgrading to write lock"),
1));
# endif /* ACE_HAS_PTHREADS_UNIX98_EXT || !ACE_LACKS_RWLOCK_T */
}
//ACE_DEBUG ((LM_DEBUG, ACE_TEXT (" (%t) done with reading guarded data\n")));
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("(%t) reader finished %d iterations at %T\n"),
iterations));
}
return 0;
}
// Iterate <n_iterations> each time modifying the global data
// and checking that nobody steps on it while we can write it.
static void *
writer (void *)
{
ACE_DEBUG ((LM_DEBUG, ACE_TEXT (" (%t) writer starting\n")));
// We use a random pause, around 2msec with 1msec jittering.
int usecs = 1000 + ACE_OS::rand() % 2000;
ACE_Time_Value pause(0, usecs);
for (size_t iterations = 1; iterations <= n_iterations; iterations++)
{
ACE_OS::sleep (pause);
ACE_WRITE_GUARD_RETURN (ACE_RW_Thread_Mutex, g, rw_mutex, 0);
++current_writers;
if (current_writers > 1)
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT (" (%t) other writers found!!!\n")));
if (current_readers > 0)
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT (" (%t) readers found!!!\n")));
ACE_thread_t self = ACE_Thread::self ();
shared_data = self;
for (size_t loop = 1; loop <= n_loops; loop++)
{
ACE_Thread::yield ();
if (!ACE_OS::thr_equal (shared_data, self))
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT (" (%t) somebody wrote on my data %d\n"),
shared_data));
}
--current_writers;
ACE_DEBUG((LM_DEBUG, ACE_TEXT (" (%t) write %d done at %T\n"), iterations));
}
return 0;
}
#endif /* ACE_HAS_THREADS */
// Spawn off threads.
int run_main (int argc, ACE_TCHAR *argv[])
{
ACE_START_TEST (ACE_TEXT ("Reader_Writer_Test"));
#if defined (ACE_HAS_THREADS)
parse_args (argc, argv);
current_readers = 0; // Possibly already done
current_writers = 0; // Possibly already done
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT (" (%t) main thread starting\n")));
if (ACE_Thread_Manager::instance ()->spawn_n (n_readers,
ACE_THR_FUNC (reader),
0,
THR_NEW_LWP) == -1)
ACE_ERROR_RETURN ((LM_ERROR,
ACE_TEXT ("%p\n"),
ACE_TEXT ("spawn_n")), 1);
else if (ACE_Thread_Manager::instance ()->spawn_n (n_writers,
ACE_THR_FUNC (writer),
0,
THR_NEW_LWP) == -1)
ACE_ERROR_RETURN ((LM_ERROR,
ACE_TEXT ("%p\n"),
ACE_TEXT ("spawn_n")), 1);
ACE_Thread_Manager::instance ()->wait ();
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT (" (%t) exiting main thread\n")));
#else
ACE_UNUSED_ARG (argc);
ACE_UNUSED_ARG (argv);
ACE_ERROR ((LM_INFO,
ACE_TEXT ("threads not supported on this platform\n")));
#endif /* ACE_HAS_THREADS */
ACE_END_TEST;
return 0;
}
|