Subversion Repositories HelenOS-historic

Rev

Rev 627 | Go to most recent revision | 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/atomic.h>
  32. #include <print.h>
  33. #include <proc/thread.h>
  34.  
  35. #include <synch/waitq.h>
  36. #include <synch/semaphore.h>
  37.  
  38. #define AT_ONCE         3
  39. #define PRODUCERS       50
  40. #define CONSUMERS       50
  41.  
  42. static semaphore_t sem;
  43.  
  44. static waitq_t can_start;
  45. static atomic_t items_produced;
  46. static atomic_t items_consumed;
  47.  
  48. static void consumer(void *arg);
  49. static void producer(void *arg);
  50. static void failed(void);
  51.  
  52. void producer(void *arg)
  53. {
  54.     waitq_sleep(&can_start);
  55.        
  56.     semaphore_down(&sem);
  57.     atomic_inc(&items_produced);
  58.     thread_usleep(250);
  59.     semaphore_up(&sem);
  60. }
  61.  
  62. void consumer(void *arg)
  63. {
  64.     waitq_sleep(&can_start);
  65.    
  66.     semaphore_down(&sem);
  67.     atomic_inc(&items_consumed);
  68.     thread_usleep(500);
  69.     semaphore_up(&sem);
  70. }
  71.  
  72. void failed(void)
  73. {
  74.     printf("Test failed prematurely.\n");
  75.     thread_exit();
  76. }
  77.  
  78. void test(void)
  79. {
  80.     int i, j, k;
  81.     int consumers, producers;
  82.    
  83.     printf("Semaphore test #1\n");
  84.    
  85.     waitq_initialize(&can_start);
  86.     semaphore_initialize(&sem, AT_ONCE);
  87.  
  88.  
  89.     for (i=1; i<=3; i++) {
  90.         thread_t *thrd;
  91.  
  92.         atomic_set(&items_produced, 0);
  93.         atomic_set(&items_consumed, 0);
  94.        
  95.         consumers = i * CONSUMERS;
  96.         producers = (4-i) * PRODUCERS;
  97.        
  98.         printf("Creating %d consumers and %d producers...", consumers, producers);
  99.    
  100.         for (j=0; j<(CONSUMERS+PRODUCERS)/2; j++) {
  101.             for (k=0; k<i; k++) {
  102.                 thrd = thread_create(consumer, NULL, TASK, 0, "consumer");
  103.                 if (thrd)
  104.                     thread_ready(thrd);
  105.                 else
  106.                     failed();
  107.             }
  108.             for (k=0; k<(4-i); k++) {
  109.                 thrd = thread_create(producer, NULL, TASK, 0, "producer");
  110.                 if (thrd)
  111.                     thread_ready(thrd);
  112.                 else
  113.                     failed();
  114.             }
  115.         }
  116.  
  117.         printf("ok\n");
  118.  
  119.         thread_sleep(1);
  120.         waitq_wakeup(&can_start, WAKEUP_ALL);
  121.    
  122.         while (items_consumed.count != consumers || items_produced.count != producers) {
  123.             printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed.count, producers - items_produced.count);
  124.             thread_sleep(1);
  125.         }
  126.     }
  127.     printf("Test passed.\n");
  128. }
  129.