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/semaphore.h>
  38.  
  39. #define AT_ONCE         3
  40. #define PRODUCERS       50
  41. #define CONSUMERS       50
  42.  
  43. static semaphore_t sem;
  44.  
  45. static waitq_t can_start;
  46. static atomic_t items_produced;
  47. static atomic_t items_consumed;
  48.  
  49. static void producer(void *arg)
  50. {
  51.     thread_detach(THREAD); 
  52.  
  53.     waitq_sleep(&can_start);
  54.        
  55.     semaphore_down(&sem);
  56.     atomic_inc(&items_produced);
  57.     thread_usleep(250);
  58.     semaphore_up(&sem);
  59. }
  60.  
  61. static void consumer(void *arg)
  62. {
  63.     thread_detach(THREAD); 
  64.    
  65.     waitq_sleep(&can_start);
  66.    
  67.     semaphore_down(&sem);
  68.     atomic_inc(&items_consumed);
  69.     thread_usleep(500);
  70.     semaphore_up(&sem);
  71. }
  72.  
  73. char * test_semaphore1(bool quiet)
  74. {
  75.     int i, j, k;
  76.     int consumers, producers;
  77.    
  78.     waitq_initialize(&can_start);
  79.     semaphore_initialize(&sem, AT_ONCE);
  80.  
  81.     for (i = 1; i <= 3; i++) {
  82.         thread_t *thrd;
  83.  
  84.         atomic_set(&items_produced, 0);
  85.         atomic_set(&items_consumed, 0);
  86.        
  87.         consumers = i * CONSUMERS;
  88.         producers = (4 - i) * PRODUCERS;
  89.        
  90.         printf("Creating %d consumers and %d producers...", consumers, producers);
  91.    
  92.         for (j = 0; j < (CONSUMERS + PRODUCERS) / 2; j++) {
  93.             for (k = 0; k < i; k++) {
  94.                 thrd = thread_create(consumer, NULL, TASK, 0, "consumer", false);
  95.                 if (thrd)
  96.                     thread_ready(thrd);
  97.                 else
  98.                     printf("could not create consumer %d\n", i);
  99.             }
  100.             for (k = 0; k < (4 - i); k++) {
  101.                 thrd = thread_create(producer, NULL, TASK, 0, "producer", false);
  102.                 if (thrd)
  103.                     thread_ready(thrd);
  104.                 else
  105.                     printf("could not create producer %d\n", i);
  106.             }
  107.         }
  108.  
  109.         printf("ok\n");
  110.  
  111.         thread_sleep(1);
  112.         waitq_wakeup(&can_start, WAKEUP_ALL);
  113.    
  114.         while ((items_consumed.count != consumers) || (items_produced.count != producers)) {
  115.             printf("%d consumers remaining, %d producers remaining\n", consumers - items_consumed.count, producers - items_produced.count);
  116.             thread_sleep(1);
  117.         }
  118.     }
  119.    
  120.     return NULL;
  121. }
  122.