Subversion Repositories HelenOS

Rev

Rev 2042 | Rev 2053 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2006 Sergey Bondari
  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 <print.h>
  30. #include <test.h>
  31. #include <mm/page.h>
  32. #include <mm/frame.h>
  33. #include <mm/slab.h>
  34. #include <arch/mm/page.h>
  35. #include <arch/types.h>
  36. #include <atomic.h>
  37. #include <debug.h>
  38. #include <proc/thread.h>
  39. #include <memstr.h>
  40. #include <arch.h>
  41.  
  42. #define MAX_FRAMES 256
  43. #define MAX_ORDER 8
  44.  
  45. #define THREAD_RUNS 1
  46. #define THREADS 8
  47.  
  48. static atomic_t thread_count;
  49. static atomic_t thread_fail;
  50.  
  51. static void falloc(void * arg)
  52. {
  53.     int order, run, allocated, i;
  54.     uint8_t val = THREAD->tid % THREADS;
  55.     index_t k;
  56.    
  57.     uintptr_t * frames =  (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), FRAME_ATOMIC);
  58.     if (frames == NULL) {
  59.         printf("Thread #%d (cpu%d): Unable to allocate frames\n", THREAD->tid, CPU->id);
  60.         atomic_inc(&thread_fail);
  61.         atomic_dec(&thread_count);
  62.         return;
  63.     }
  64.    
  65.     thread_detach(THREAD);
  66.  
  67.     for (run = 0; run < THREAD_RUNS; run++) {
  68.         for (order = 0; order <= MAX_ORDER; order++) {
  69.             printf("Thread #%d (cpu%d): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
  70.             allocated = 0;
  71.             for (i = 0; i < (MAX_FRAMES >> order); i++) {
  72.                 frames[allocated] = (uintptr_t)frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
  73.                 if (frames[allocated]) {
  74.                     memsetb(frames[allocated], FRAME_SIZE << order, val);
  75.                     allocated++;
  76.                 } else
  77.                     break;
  78.             }
  79.             printf("Thread #%d (cpu%d): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);
  80.  
  81.             printf("Thread #%d (cpu%d): Deallocating ... \n", THREAD->tid, CPU->id);
  82.             for (i = 0; i < allocated; i++) {
  83.                 for (k = 0; k <= ((FRAME_SIZE << order) - 1); k++) {
  84.                     if (((uint8_t *) frames[i])[k] != val) {
  85.                         printf("Thread #%d (cpu%d): Unexpected data (%d) in block %p offset %#zx\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k);
  86.                         atomic_inc(&thread_fail);
  87.                         goto cleanup;
  88.                     }
  89.                 }
  90.                 frame_free(KA2PA(frames[i]));
  91.             }
  92.             printf("Thread #%d (cpu%d): Finished run.\n", THREAD->tid, CPU->id);
  93.         }
  94.     }
  95.  
  96. cleanup:   
  97.     free(frames);
  98.     printf("Thread #%d (cpu%d): Exiting\n", THREAD->tid, CPU->id);
  99.     atomic_dec(&thread_count);
  100. }
  101.  
  102. char * test_falloc2(bool quiet)
  103. {
  104.     unsigned int i;
  105.  
  106.     atomic_set(&thread_count, THREADS);
  107.     atomic_set(&thread_fail, 0);
  108.        
  109.     for (i = 0; i < THREADS; i++) {
  110.         thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false);
  111.         if (!thrd) {
  112.             printf("Could not create thread %d\n", i);
  113.             break;
  114.         }
  115.         thread_ready(thrd);
  116.     }
  117.    
  118.     while (atomic_get(&thread_count) > 0) {
  119.         printf("Threads left: %d\n", atomic_get(&thread_count));
  120.         thread_sleep(1);
  121.     }
  122.    
  123.     if (atomic_get(&thread_fail) == 0)
  124.         return NULL;
  125.    
  126.     return "Test failed";
  127. }
  128.