Subversion Repositories HelenOS-historic

Rev

Rev 724 | Rev 745 | 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. #include <print.h>
  29. #include <test.h>
  30. #include <mm/page.h>
  31. #include <mm/frame.h>
  32. #include <mm/heap.h>
  33. #include <arch/mm/page.h>
  34. #include <arch/types.h>
  35. #include <debug.h>
  36.  
  37. #define MAX_FRAMES 1024
  38. #define MAX_ORDER 8
  39. #define TEST_RUNS 2
  40.  
  41. void test(void) {
  42.     __address * frames = (__address *) malloc(MAX_FRAMES*sizeof(__address));
  43.     int results[MAX_ORDER+1];
  44.    
  45.     int i, order, run;
  46.     int allocated;
  47.     int status;
  48.  
  49.     ASSERT(TEST_RUNS > 1);
  50.  
  51.     for (run=0;run<=TEST_RUNS;run++) {
  52.         for (order=0;order<=MAX_ORDER;order++) {
  53.             printf("Allocating %d frames blocks ... ", 1<<order);
  54.             allocated = 0;
  55.             for (i=0;i<MAX_FRAMES>>order;i++) {
  56.                 frames[allocated] = frame_alloc(FRAME_NON_BLOCKING | FRAME_KA, order, &status);
  57.                
  58.                 if (frames[allocated] % (FRAME_SIZE << order) != 0) {
  59.                     panic("Test failed. Block at address %X (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
  60.                 }
  61.                
  62.                 if (status == 0) {
  63.                     allocated++;
  64.                 } else {
  65.                     printf("done. ");
  66.                     break;
  67.                 }
  68.             }
  69.        
  70.             printf("%d blocks alocated.\n", allocated);
  71.        
  72.             if (run) {
  73.                 if (results[order] != allocated) {
  74.                     panic("Test failed. Frame leak possible.\n");
  75.                 }
  76.             } else results[order] = allocated;
  77.            
  78.             printf("Deallocating ... ");
  79.             for (i=0;i<allocated;i++) {
  80.                 frame_free(frames[i]);
  81.             }
  82.             printf("done.\n");
  83.         }
  84.     }
  85.  
  86.     free(frames);
  87.    
  88.     printf("Test passed\n");
  89. }
  90.  
  91.