WebSVN – HelenOS – Diff – /trunk/kernel/test/mm/falloc1.c


/*
 * Copyright (c) 2006 Sergey Bondari
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <print.h>
#include <test.h>
#include <mm/page.h>
#include <mm/frame.h>
#include <mm/slab.h>
#include <arch/mm/page.h>
#include <arch/types.h>
#include <debug.h>
#include <align.h>
 
#define MAX_FRAMES 1024
#define MAX_ORDER 8
#define TEST_RUNS 2
 
char * test_falloc1(bool quiet) {
    uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), 0);
    int results[MAX_ORDER + 1];
   
    int i, order, run;
    int allocated;
   
    if (TEST_RUNS < 2)
        return "Test is compiled with TEST_RUNS < 2";
   
    if (frames == NULL)
        return "Unable to allocate frames";
 
    for (run = 0; run < TEST_RUNS; run++) {
        for (order = 0; order <= MAX_ORDER; order++) {
            if (!quiet)
                printf("Allocating %d frames blocks ... ", 1 << order);
           
            allocated = 0;
            for (i = 0; i < MAX_FRAMES >> order; i++) {
                frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
               
                if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
                    if (!quiet)
                        printf("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
                    return "Test failed";
                }
               
                if (frames[allocated])
                    allocated++;
                else {
                    if (!quiet)
                        printf("done. ");
                    break;
                }
            }
           
            if (!quiet)
                printf("%d blocks allocated.\n", allocated);
       
            if (run) {
                if (results[order] != allocated)
                    return "Possible frame leak";
            } else
                results[order] = allocated;
           
            if (!quiet)
                printf("Deallocating ... ");
           
            for (i = 0; i < allocated; i++)
                frame_free(KA2PA(frames[i]));
           
            if (!quiet)
                printf("done.\n");
        }
    }
 
    free(frames);
   
    return NULL;
}
 

Rev 2053	Rev 2071
1	/*	1	/*
2	* Copyright (C) 2006 Sergey Bondari	2	* Copyright (c) 2006 Sergey Bondari
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	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	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.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <print.h>	29	#include <print.h>
30	#include <test.h>	30	#include <test.h>
31	#include <mm/page.h>	31	#include <mm/page.h>
32	#include <mm/frame.h>	32	#include <mm/frame.h>
33	#include <mm/slab.h>	33	#include <mm/slab.h>
34	#include <arch/mm/page.h>	34	#include <arch/mm/page.h>
35	#include <arch/types.h>	35	#include <arch/types.h>
36	#include <debug.h>	36	#include <debug.h>
37	#include <align.h>	37	#include <align.h>
38		38
39	#define MAX_FRAMES 1024	39	#define MAX_FRAMES 1024
40	#define MAX_ORDER 8	40	#define MAX_ORDER 8
41	#define TEST_RUNS 2	41	#define TEST_RUNS 2
42		42
43	char * test_falloc1(bool quiet) {	43	char * test_falloc1(bool quiet) {
44	uintptr_t * frames = (uintptr_t ) malloc(MAX_FRAMES sizeof(uintptr_t), 0);	44	uintptr_t * frames = (uintptr_t ) malloc(MAX_FRAMES sizeof(uintptr_t), 0);
45	int results[MAX_ORDER + 1];	45	int results[MAX_ORDER + 1];
46		46
47	int i, order, run;	47	int i, order, run;
48	int allocated;	48	int allocated;
49		49
50	if (TEST_RUNS < 2)	50	if (TEST_RUNS < 2)
51	return "Test is compiled with TEST_RUNS < 2";	51	return "Test is compiled with TEST_RUNS < 2";
52		52
53	if (frames == NULL)	53	if (frames == NULL)
54	return "Unable to allocate frames";	54	return "Unable to allocate frames";
55		55
56	for (run = 0; run < TEST_RUNS; run++) {	56	for (run = 0; run < TEST_RUNS; run++) {
57	for (order = 0; order <= MAX_ORDER; order++) {	57	for (order = 0; order <= MAX_ORDER; order++) {
58	if (!quiet)	58	if (!quiet)
59	printf("Allocating %d frames blocks ... ", 1 << order);	59	printf("Allocating %d frames blocks ... ", 1 << order);
60		60
61	allocated = 0;	61	allocated = 0;
62	for (i = 0; i < MAX_FRAMES >> order; i++) {	62	for (i = 0; i < MAX_FRAMES >> order; i++) {
63	frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC \| FRAME_KA);	63	frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC \| FRAME_KA);
64		64
65	if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {	65	if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
66	if (!quiet)	66	if (!quiet)
67	printf("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);	67	printf("Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
68	return "Test failed";	68	return "Test failed";
69	}	69	}
70		70
71	if (frames[allocated])	71	if (frames[allocated])
72	allocated++;	72	allocated++;
73	else {	73	else {
74	if (!quiet)	74	if (!quiet)
75	printf("done. ");	75	printf("done. ");
76	break;	76	break;
77	}	77	}
78	}	78	}
79		79
80	if (!quiet)	80	if (!quiet)
81	printf("%d blocks allocated.\n", allocated);	81	printf("%d blocks allocated.\n", allocated);
82		82
83	if (run) {	83	if (run) {
84	if (results[order] != allocated)	84	if (results[order] != allocated)
85	return "Possible frame leak";	85	return "Possible frame leak";
86	} else	86	} else
87	results[order] = allocated;	87	results[order] = allocated;
88		88
89	if (!quiet)	89	if (!quiet)
90	printf("Deallocating ... ");	90	printf("Deallocating ... ");
91		91
92	for (i = 0; i < allocated; i++)	92	for (i = 0; i < allocated; i++)
93	frame_free(KA2PA(frames[i]));	93	frame_free(KA2PA(frames[i]));
94		94
95	if (!quiet)	95	if (!quiet)
96	printf("done.\n");	96	printf("done.\n");
97	}	97	}
98	}	98	}
99		99
100	free(frames);	100	free(frames);
101		101
102	return NULL;	102	return NULL;
103	}	103	}
104		104

Subversion Repositories HelenOS

(root)/trunk/kernel/test/mm/falloc1.c – Rev 2053 → 2071