Subversion Repositories HelenOS

Rev

Rev 3386 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
689 bondari 1 
/*
2071 jermar 2 
 * Copyright (c) 2006 Sergey Bondari
689 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 
 */
2028 decky 28 
 
689 bondari 29 
#include <print.h>
30 
#include <test.h>
31 
#include <mm/page.h>
32 
#include <mm/frame.h>
814 palkovsky 33 
#include <mm/slab.h>
689 bondari 34 
#include <arch/mm/page.h>
35 
#include <arch/types.h>
36 
#include <debug.h>
745 jermar 37 
#include <align.h>
689 bondari 38 
 
4263 mejdrech 39 
#define MAX_FRAMES  1024
40 
#define MAX_ORDER   8
41 
#define TEST_RUNS   2
689 bondari 42 
 
4263 mejdrech 43 
char *test_falloc1(void) {
44 
    uintptr_t *frames
45 
        = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), 0);
2028 decky 46 
    int results[MAX_ORDER + 1];
689 bondari 47 
 
48 
    int i, order, run;
49 
    int allocated;
2029 decky 50 
 
51 
    if (TEST_RUNS < 2)
52 
        return "Test is compiled with TEST_RUNS < 2";
53 
 
2028 decky 54 
    if (frames == NULL)
55 
        return "Unable to allocate frames";
4263 mejdrech 56 
 
745 jermar 57 
    for (run = 0; run < TEST_RUNS; run++) {
58 
        for (order = 0; order <= MAX_ORDER; order++) {
4263 mejdrech 59 
            TPRINTF("Allocating %d frames blocks ... ", 1 << order);
2053 decky 60 
 
689 bondari 61 
            allocated = 0;
745 jermar 62 
            for (i = 0; i < MAX_FRAMES >> order; i++) {
1780 jermar 63 
                frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
724 palkovsky 64 
 
745 jermar 65 
                if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
4263 mejdrech 66 
                    TPRINTF("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
2028 decky 67 
                    return "Test failed";
724 palkovsky 68 
                }
69 
 
2028 decky 70 
                if (frames[allocated])
689 bondari 71 
                    allocated++;
2028 decky 72 
                else {
4263 mejdrech 73 
                    TPRINTF("done. ");
689 bondari 74 
                    break;
75 
                }
76 
            }
2028 decky 77 
 
4263 mejdrech 78 
            TPRINTF("%d blocks allocated.\n", allocated);
79 
 
689 bondari 80 
            if (run) {
2028 decky 81 
                if (results[order] != allocated)
82 
                    return "Possible frame leak";
745 jermar 83 
            } else
84 
                results[order] = allocated;
689 bondari 85 
 
4263 mejdrech 86 
            TPRINTF("Deallocating ... ");
2053 decky 87 
 
2028 decky 88 
            for (i = 0; i < allocated; i++)
1760 palkovsky 89 
                frame_free(KA2PA(frames[i]));
2053 decky 90 
 
4263 mejdrech 91 
            TPRINTF("done.\n");
689 bondari 92 
        }
93 
    }
4263 mejdrech 94 
 
735 bondari 95 
    free(frames);
689 bondari 96 
 
2028 decky 97 
    return NULL;
689 bondari 98 
}