Subversion Repositories HelenOS

Rev

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