Subversion Repositories HelenOS

Rev

Rev 2021 | Rev 2029 | 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 <debug.h>
  37. #include <align.h>
  38.  
  39. #define MAX_FRAMES 1024
  40. #define MAX_ORDER 8
  41. #define TEST_RUNS 2
  42.  
  43. char * test_falloc1(void) {
  44.     uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), 0);
  45.     int results[MAX_ORDER + 1];
  46.    
  47.     int i, order, run;
  48.     int allocated;
  49.  
  50.     ASSERT(TEST_RUNS > 1);
  51.     if (frames == NULL)
  52.         return "Unable to allocate frames";
  53.  
  54.     for (run = 0; run < TEST_RUNS; run++) {
  55.         for (order = 0; order <= MAX_ORDER; order++) {
  56.             printf("Allocating %d frames blocks ... ", 1 << order);
  57.             allocated = 0;
  58.             for (i = 0; i < MAX_FRAMES >> order; i++) {
  59.                 frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
  60.                
  61.                 if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
  62.                     printf("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
  63.                     return "Test failed";
  64.                 }
  65.                
  66.                 if (frames[allocated])
  67.                     allocated++;
  68.                 else {
  69.                     printf("done. ");
  70.                     break;
  71.                 }
  72.             }
  73.            
  74.             printf("%d blocks allocated.\n", allocated);
  75.        
  76.             if (run) {
  77.                 if (results[order] != allocated)
  78.                     return "Possible frame leak";
  79.             } else
  80.                 results[order] = allocated;
  81.            
  82.             printf("Deallocating ... ");
  83.             for (i = 0; i < allocated; i++)
  84.                 frame_free(KA2PA(frames[i]));
  85.             printf("done.\n");
  86.         }
  87.     }
  88.  
  89.     free(frames);
  90.    
  91.     return NULL;
  92. }
  93.