Subversion Repositories HelenOS

Rev

Rev 3343 | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2001-2004 Jakub Jermar
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. #include <test.h>
  30. #include <arch.h>
  31. #include <arch/asm.h>
  32. #include <atomic.h>
  33. #include <print.h>
  34. #include <proc/thread.h>
  35.  
  36. #include <synch/waitq.h>
  37. #include <synch/rwlock.h>
  38.  
  39. #define READERS     50
  40. #define WRITERS     50
  41.  
  42. static rwlock_t rwlock;
  43.  
  44. static waitq_t can_start;
  45. static atomic_t items_read;
  46. static atomic_t items_written;
  47.  
  48. static void writer(void *arg)
  49. {
  50.     thread_detach(THREAD);
  51.  
  52.     waitq_sleep(&can_start);
  53.  
  54.     rwlock_write_lock(&rwlock);
  55.     atomic_inc(&items_written);
  56.     rwlock_write_unlock(&rwlock);
  57. }
  58.  
  59. static void reader(void *arg)
  60. {
  61.     thread_detach(THREAD);
  62.  
  63.     waitq_sleep(&can_start);
  64.    
  65.     rwlock_read_lock(&rwlock);
  66.     atomic_inc(&items_read);
  67.     rwlock_read_unlock(&rwlock);
  68. }
  69.  
  70. char * test_rwlock5(bool quiet)
  71. {
  72.     int i, j, k;
  73.     long readers, writers;
  74.    
  75.     waitq_initialize(&can_start);
  76.     rwlock_initialize(&rwlock);
  77.    
  78.     for (i = 1; i <= 3; i++) {
  79.         thread_t *thrd;
  80.  
  81.         atomic_set(&items_read, 0);
  82.         atomic_set(&items_written, 0);
  83.  
  84.         readers = i * READERS;
  85.         writers = (4 - i) * WRITERS;
  86.  
  87.         printf("Creating %ld readers and %ld writers...", readers, writers);
  88.        
  89.         for (j = 0; j < (READERS + WRITERS) / 2; j++) {
  90.             for (k = 0; k < i; k++) {
  91.                 thrd = thread_create(reader, NULL, TASK, 0, "reader", false);
  92.                 if (thrd)
  93.                     thread_ready(thrd);
  94.                 else
  95.                     printf("Could not create reader %d\n", k);
  96.             }
  97.             for (k = 0; k < (4 - i); k++) {
  98.                 thrd = thread_create(writer, NULL, TASK, 0, "writer", false);
  99.                 if (thrd)
  100.                     thread_ready(thrd);
  101.                 else
  102.                     printf("Could not create writer %d\n", k);
  103.             }
  104.         }
  105.  
  106.         printf("ok\n");
  107.  
  108.         thread_sleep(1);
  109.         waitq_wakeup(&can_start, WAKEUP_ALL);
  110.    
  111.         while ((items_read.count != readers) || (items_written.count != writers)) {
  112.             printf("%d readers remaining, %d writers remaining, readers_in=%d\n", readers - items_read.count, writers - items_written.count, rwlock.readers_in);
  113.             thread_usleep(100000);
  114.         }
  115.     }
  116.    
  117.     return NULL;
  118. }
  119.