WebSVN – HelenOS-historic – Diff – /kernel/trunk/test/mm/falloc1/test.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 <arch/mm/page.h>
#include <arch/types.h>
#include <debug.h>
 
#define MAX_FRAMES 2048
#define MAX_ORDER 8
#define TEST_RUNS 4
 
void test(void) {
    __address frames[MAX_FRAMES];
    int results[MAX_ORDER+1];
   
    int i, order, run;
    int allocated;
    int status;
 
    ASSERT(TEST_RUNS > 1);
 
    for (run=0;run<=TEST_RUNS;run++) {
        for (order=0;order<=MAX_ORDER;order++) {
            printf("Allocating %d frames blocks ... ", 1<<order);
            allocated = 0;
            for (i=0;i<MAX_FRAMES>>order;i++) {
                frames[allocated] = frame_alloc(FRAME_NON_BLOCKING, order, &status);
               
                if (frames[allocated] % (FRAME_SIZE << order) != 0) {
                    panic("Test failed. Block at address %X (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
                }
               
                if (status == 0) {
                    allocated++;
                } else {
                    printf("done. ");
                    break;
                }
            }
       
            printf("%d blocks alocated.\n", allocated);
       
            if (run) {
                if (results[order] != allocated) {
                    panic("Test failed. Frame leak possible.\n");
                }
            } else results[order] = allocated;
           
            printf("Deallocating ... ");
            for (i=0;i<allocated;i++) {
                frame_free(frames[i]);
            }
            printf("done.\n");
        }
    }
 
 
   
    printf("Test passed\n");
}
 
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/test/mm/falloc1/test.c – Rev 689 → 724