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>
 
#ifdef CONFIG_BENCH
#include <arch/cycle.h>
#endif
 
#define MAX_FRAMES 1024
#define MAX_ORDER 8
#define TEST_RUNS 2
 
void test_falloc1(void) {
#ifdef CONFIG_BENCH
    uint64_t t0 = get_cycle();
#endif
    uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES*sizeof(uintptr_t), 0);
    int results[MAX_ORDER+1];
   
    int i, order, run;
    int allocated;
 
    ASSERT(TEST_RUNS > 1);
    ASSERT(frames != NULL)
 
    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] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
               
                if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
                    panic("Test failed. Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
                }
               
                if (frames[allocated]) {
                    allocated++;
                } else {
                    printf("done. ");
                    break;
                }
            }
       
            printf("%d blocks allocated.\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(KA2PA(frames[i]));
            }
            printf("done.\n");
        }
    }
 
    free(frames);
   
    printf("Test passed.\n");
#ifdef CONFIG_BENCH
    uint64_t dt = get_cycle() - t0;
    printf("Time: %.*d cycles\n", sizeof(dt) * 2, dt);
#endif
}
 
 

Rev 1787	Rev 2021
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 <mm/slab.h>	32	#include <mm/slab.h>
33	#include <arch/mm/page.h>	33	#include <arch/mm/page.h>
34	#include <arch/types.h>	34	#include <arch/types.h>
35	#include <debug.h>	35	#include <debug.h>
36	#include <align.h>	36	#include <align.h>
37		37
-		38	#ifdef CONFIG_BENCH
-		39	#include <arch/cycle.h>
-		40	#endif
-		41
38	#define MAX_FRAMES 1024	42	#define MAX_FRAMES 1024
39	#define MAX_ORDER 8	43	#define MAX_ORDER 8
40	#define TEST_RUNS 2	44	#define TEST_RUNS 2
41		45
42	void test(void) {	46	void test_falloc1(void) {
-		47	#ifdef CONFIG_BENCH
-		48	uint64_t t0 = get_cycle();
-		49	#endif
43	uintptr_t * frames = (uintptr_t ) malloc(MAX_FRAMESsizeof(uintptr_t), 0);	50	uintptr_t * frames = (uintptr_t ) malloc(MAX_FRAMESsizeof(uintptr_t), 0);
44	int results[MAX_ORDER+1];	51	int results[MAX_ORDER+1];
45		52
46	int i, order, run;	53	int i, order, run;
47	int allocated;	54	int allocated;
48		55
49	ASSERT(TEST_RUNS > 1);	56	ASSERT(TEST_RUNS > 1);
50	ASSERT(frames != NULL)	57	ASSERT(frames != NULL)
51		58
52	for (run = 0; run < TEST_RUNS; run++) {	59	for (run = 0; run < TEST_RUNS; run++) {
53	for (order = 0; order <= MAX_ORDER; order++) {	60	for (order = 0; order <= MAX_ORDER; order++) {
54	printf("Allocating %d frames blocks ... ", 1 << order);	61	printf("Allocating %d frames blocks ... ", 1 << order);
55	allocated = 0;	62	allocated = 0;
56	for (i = 0; i < MAX_FRAMES >> order; i++) {	63	for (i = 0; i < MAX_FRAMES >> order; i++) {
57	frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC \| FRAME_KA);	64	frames[allocated] = (uintptr_t) frame_alloc(order, FRAME_ATOMIC \| FRAME_KA);
58		65
59	if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {	66	if (ALIGN_UP(frames[allocated], FRAME_SIZE << order) != frames[allocated]) {
60	panic("Test failed. Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);	67	panic("Test failed. Block at address %p (size %dK) is not aligned\n", frames[allocated], (FRAME_SIZE << order) >> 10);
61	}	68	}
62		69
63	if (frames[allocated]) {	70	if (frames[allocated]) {
64	allocated++;	71	allocated++;
65	} else {	72	} else {
66	printf("done. ");	73	printf("done. ");
67	break;	74	break;
68	}	75	}
69	}	76	}
70		77
71	printf("%d blocks allocated.\n", allocated);	78	printf("%d blocks allocated.\n", allocated);
72		79
73	if (run) {	80	if (run) {
74	if (results[order] != allocated) {	81	if (results[order] != allocated) {
75	panic("Test failed. Frame leak possible.\n");	82	panic("Test failed. Frame leak possible.\n");
76	}	83	}
77	} else	84	} else
78	results[order] = allocated;	85	results[order] = allocated;
79		86
80	printf("Deallocating ... ");	87	printf("Deallocating ... ");
81	for (i = 0; i < allocated; i++) {	88	for (i = 0; i < allocated; i++) {
82	frame_free(KA2PA(frames[i]));	89	frame_free(KA2PA(frames[i]));
83	}	90	}
84	printf("done.\n");	91	printf("done.\n");
85	}	92	}
86	}	93	}
87		94
88	free(frames);	95	free(frames);
89		96
90	printf("Test passed.\n");	97	printf("Test passed.\n");
-		98	#ifdef CONFIG_BENCH
-		99	uint64_t dt = get_cycle() - t0;
-		100	printf("Time: %.d cycles\n", sizeof(dt) 2, dt);
-		101	#endif
91	}	102	}
92		103
93		104

Subversion Repositories HelenOS

(root)/trunk/kernel/test/mm/falloc1.c – Rev 1787 → 2021