WebSVN – HelenOS-historic – Diff – /kernel/trunk/test/mm/falloc2/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 <mm/heap.h>
#include <arch/mm/page.h>
#include <arch/types.h>
#include <arch/atomic.h>
#include <debug.h>
#include <proc/thread.h>
#include <memstr.h>
 
#define MAX_FRAMES 256
#define MAX_ORDER 8
 
#define THREAD_RUNS 1
#define THREADS 8
 
static void thread(void * arg);
static void failed(void);
 
static atomic_t thread_count;
 
void thread(void * arg) {
    int status, order, run, allocated,i;
   
    __u8 val = *((__u8 *) arg);
    index_t k;
   
    __address * frames =  (__address *) malloc(MAX_FRAMES * sizeof(__address));
 
    for (run=0;run<THREAD_RUNS;run++) {
   
        for (order=0;order<=MAX_ORDER;order++) {
            printf("Thread #%d: Allocating %d frames blocks ... \n",val, 1<<order);
            allocated = 0;
            for (i=0;i < (MAX_FRAMES >> order);i++) {
                frames[allocated] = frame_alloc(FRAME_NON_BLOCKING | FRAME_KA,order, &status);
                if (status == 0) {
                    memsetb(frames[allocated], (1 << order) * FRAME_SIZE, val);
                    allocated++;
                } else {
                    break;
                }
            }
       
            printf("Thread #%d: %d blocks alocated.\n",val, allocated);
 
            printf("Thread #%d: Deallocating ... \n", val);
            for (i=0;i<allocated;i++) {
           
                for (k=0;k<=((FRAME_SIZE << order) - 1);k++) {
                    if ( ((char *) frames[i])[k] != val ) {
                        printf("Thread #%d: Unexpected data in block %P offset %X\n",val, frames[i], k);
                        failed();
                    }
               
                }
               
                frame_free(frames[i]);
            }
            printf("Thread #%d: Finished run.\n", val);
        }
    }
   
   
    atomic_dec(&thread_count);
 
}
 
 
void failed(void) {
    panic("Test failed.\n");
}
 
 
void test(void) {
    int i;
 
    atomic_set(&thread_count, THREADS);
       
    for (i=1;i<=THREADS;i++) {
        thread_t * thrd;
        thrd = thread_create(thread, &i, TASK, 0);
        if (thrd) thread_ready(thrd); else failed();
    }
   
    while (thread_count.count);
 
    printf("Test passed\n");
}
 
 

Rev 733	Rev 735
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/heap.h>
32	#include <arch/mm/page.h>	33	#include <arch/mm/page.h>
33	#include <arch/types.h>	34	#include <arch/types.h>
34	#include <arch/atomic.h>	35	#include <arch/atomic.h>
35	#include <debug.h>	36	#include <debug.h>
36	#include <proc/thread.h>	37	#include <proc/thread.h>
37	#include <memstr.h>	38	#include <memstr.h>
38		39
39	#define MAX_FRAMES 128	40	#define MAX_FRAMES 256
40	#define MAX_ORDER 2	41	#define MAX_ORDER 8
41		42
42	#define THREAD_RUNS 1	43	#define THREAD_RUNS 1
43	#define THREADS 6	44	#define THREADS 8
44		45
45	static void thread(void * arg);	46	static void thread(void * arg);
46	static void failed(void);	47	static void failed(void);
47		48
48	static atomic_t thread_count;	49	static atomic_t thread_count;
49		50
50	void thread(void * arg) {	51	void thread(void * arg) {
51	int status, order, run, allocated,i;	52	int status, order, run, allocated,i;
52		53
53	__u8 val = ((__u8 ) arg);	54	__u8 val = ((__u8 ) arg);
54	index_t k;	55	index_t k;
55		56
56	__address frames[MAX_FRAMES];	57	__address * frames = (__address ) malloc(MAX_FRAMES sizeof(__address));
57		58
58	for (run=0;run<THREAD_RUNS;run++) {	59	for (run=0;run<THREAD_RUNS;run++) {
59		60
60	for (order=0;order<=MAX_ORDER;order++) {	61	for (order=0;order<=MAX_ORDER;order++) {
61	printf("Thread #%d: Allocating %d frames blocks ... \n",val, 1<<order);	62	printf("Thread #%d: Allocating %d frames blocks ... \n",val, 1<<order);
62	allocated = 0;	63	allocated = 0;
63	for (i=0;i<MAX_FRAMES>>order;i++) {	64	for (i=0;i < (MAX_FRAMES >> order);i++) {
64	frames[allocated] = frame_alloc(FRAME_NON_BLOCKING \| FRAME_KA,order, &status);	65	frames[allocated] = frame_alloc(FRAME_NON_BLOCKING \| FRAME_KA,order, &status);
65	if (status == 0) {	66	if (status == 0) {
66	memsetb(frames[allocated], (1 << order) * FRAME_SIZE, val);	67	memsetb(frames[allocated], (1 << order) * FRAME_SIZE, val);
67	allocated++;	68	allocated++;
68	} else {	69	} else {
69	break;	70	break;
70	}	71	}
71	}	72	}
72		73
73	printf("Thread #%d: %d blocks alocated.\n",val, allocated);	74	printf("Thread #%d: %d blocks alocated.\n",val, allocated);
74		75
75	printf("Thread #%d: Deallocating ... \n", val);	76	printf("Thread #%d: Deallocating ... \n", val);
76	for (i=0;i<allocated;i++) {	77	for (i=0;i<allocated;i++) {
-		78
77	for (k=0;k<=((FRAME_SIZE << order) - 1);k++) {	79	for (k=0;k<=((FRAME_SIZE << order) - 1);k++) {
78	if ( ((char *) frames[i])[k] != val ) {	80	if ( ((char *) frames[i])[k] != val ) {
79	printf("Thread #%d: Unexpected data in block %P offset %X\n",val, frames[i], k);	81	printf("Thread #%d: Unexpected data in block %P offset %X\n",val, frames[i], k);
80	failed();	82	failed();
81	}	83	}
82		84
83	}	85	}
84		86
85	frame_free(frames[i]);	87	frame_free(frames[i]);
86	}	88	}
87	printf("Thread #%d: Finished run.\n", val);	89	printf("Thread #%d: Finished run.\n", val);
88	}	90	}
89	}	91	}
90		92
91		93
92	atomic_dec(&thread_count);	94	atomic_dec(&thread_count);
93		95
94	}	96	}
95		97
96		98
97	void failed(void) {	99	void failed(void) {
98	panic("Test failed.\n");	100	panic("Test failed.\n");
99	}	101	}
100		102
101		103
102	void test(void) {	104	void test(void) {
103	int i;	105	int i;
104		106
105	atomic_set(&thread_count, THREADS);	107	atomic_set(&thread_count, THREADS);
106		108
107	for (i=1;i<=THREADS;i++) {	109	for (i=1;i<=THREADS;i++) {
108	thread_t * thrd;	110	thread_t * thrd;
109	thrd = thread_create(thread, &i, TASK, 0);	111	thrd = thread_create(thread, &i, TASK, 0);
110	if (thrd) thread_ready(thrd); else failed();	112	if (thrd) thread_ready(thrd); else failed();
111	}	113	}
112		114
113	while (thread_count.count);	115	while (thread_count.count);
114		116
115	printf("Test passed\n");	117	printf("Test passed\n");
116	}	118	}
117		119
118		120

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/test/mm/falloc2/test.c – Rev 733 → 735