WebSVN – HelenOS – Diff – /branches/sparc/kernel/test/mm/falloc2.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/asm.h>
#include <arch/types.h>
#include <atomic.h>
#include <debug.h>
#include <proc/thread.h>
#include <memstr.h>
#include <arch.h>
 
#define MAX_FRAMES 256
#define MAX_ORDER 8
 
#define THREAD_RUNS 1
#define THREADS 8
 
static atomic_t thread_count;
static atomic_t thread_fail;
static bool sh_quiet;
 
static void falloc(void * arg)
{
    int order, run, allocated, i;
    uint8_t val = THREAD->tid % THREADS;
    index_t k;
   
    void **frames =  (void **) malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC);
    if (frames == NULL) {
        if (!sh_quiet)
            printf("Thread #%" PRIu64 " (cpu%u): Unable to allocate frames\n", THREAD->tid, CPU->id);
        atomic_inc(&thread_fail);
        atomic_dec(&thread_count);
        return;
    }
   
    thread_detach(THREAD);
 
    for (run = 0; run < THREAD_RUNS; run++) {
        for (order = 0; order <= MAX_ORDER; order++) {
            if (!sh_quiet)
                printf("Thread #%" PRIu64 " (cpu%u): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
           
            allocated = 0;
            for (i = 0; i < (MAX_FRAMES >> order); i++) {
                frames[allocated] = frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
                if (frames[allocated]) {
                    memsetb(frames[allocated], FRAME_SIZE << order, val);
                    allocated++;
                } else
                    break;
            }
           
            if (!sh_quiet)
                printf("Thread #%" PRIu64 " (cpu%u): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);
           
            if (!sh_quiet)
                printf("Thread #%" PRIu64 " (cpu%u): Deallocating ... \n", THREAD->tid, CPU->id);
           
            for (i = 0; i < allocated; i++) {
                for (k = 0; k <= (((index_t) FRAME_SIZE << order) - 1); k++) {
                    if (((uint8_t *) frames[i])[k] != val) {
                        if (!sh_quiet)
                            printf("Thread #%" PRIu64 " (cpu%u): Unexpected data (%c) in block %p offset %#" PRIi "\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k);
                        atomic_inc(&thread_fail);
                        goto cleanup;
                    }
                }
                frame_free(KA2PA(frames[i]));
            }
           
            if (!sh_quiet)
                printf("Thread #%" PRIu64 " (cpu%u): Finished run.\n", THREAD->tid, CPU->id);
        }
    }
 
cleanup:   
    free(frames);
   
    if (!sh_quiet)
        printf("Thread #%" PRIu64 " (cpu%u): Exiting\n", THREAD->tid, CPU->id);
    atomic_dec(&thread_count);
}
 
char * test_falloc2(bool quiet)
{
    unsigned int i;
    sh_quiet = quiet;
 
    atomic_set(&thread_count, THREADS);
    atomic_set(&thread_fail, 0);
       
    for (i = 0; i < THREADS; i++) {
        thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false);
        if (!thrd) {
            if (!quiet)
                printf("Could not create thread %u\n", i);
            break;
        }
        thread_ready(thrd);
    }
   
    while (atomic_get(&thread_count) > 0) {
        if (!quiet)
            printf("Threads left: %ld\n", atomic_get(&thread_count));
        thread_sleep(1);
    }
   
    if (atomic_get(&thread_fail) == 0)
        return NULL;
   
    return "Test failed";
}
 

Rev 3343	Rev 3862
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/asm.h>
35	#include <arch/types.h>	36	#include <arch/types.h>
36	#include <atomic.h>	37	#include <atomic.h>
37	#include <debug.h>	38	#include <debug.h>
38	#include <proc/thread.h>	39	#include <proc/thread.h>
39	#include <memstr.h>	40	#include <memstr.h>
40	#include <arch.h>	41	#include <arch.h>
41		42
42	#define MAX_FRAMES 256	43	#define MAX_FRAMES 256
43	#define MAX_ORDER 8	44	#define MAX_ORDER 8
44		45
45	#define THREAD_RUNS 1	46	#define THREAD_RUNS 1
46	#define THREADS 8	47	#define THREADS 8
47		48
48	static atomic_t thread_count;	49	static atomic_t thread_count;
49	static atomic_t thread_fail;	50	static atomic_t thread_fail;
50	static bool sh_quiet;	51	static bool sh_quiet;
51		52
52	static void falloc(void * arg)	53	static void falloc(void * arg)
53	{	54	{
54	int order, run, allocated, i;	55	int order, run, allocated, i;
55	uint8_t val = THREAD->tid % THREADS;	56	uint8_t val = THREAD->tid % THREADS;
56	index_t k;	57	index_t k;
57		58
58	void frames = (void ) malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC);	59	void frames = (void ) malloc(MAX_FRAMES * sizeof(void *), FRAME_ATOMIC);
59	if (frames == NULL) {	60	if (frames == NULL) {
60	if (!sh_quiet)	61	if (!sh_quiet)
61	printf("Thread #%" PRIu64 " (cpu%u): Unable to allocate frames\n", THREAD->tid, CPU->id);	62	printf("Thread #%" PRIu64 " (cpu%u): Unable to allocate frames\n", THREAD->tid, CPU->id);
62	atomic_inc(&thread_fail);	63	atomic_inc(&thread_fail);
63	atomic_dec(&thread_count);	64	atomic_dec(&thread_count);
64	return;	65	return;
65	}	66	}
66		67
67	thread_detach(THREAD);	68	thread_detach(THREAD);
68		69
69	for (run = 0; run < THREAD_RUNS; run++) {	70	for (run = 0; run < THREAD_RUNS; run++) {
70	for (order = 0; order <= MAX_ORDER; order++) {	71	for (order = 0; order <= MAX_ORDER; order++) {
71	if (!sh_quiet)	72	if (!sh_quiet)
72	printf("Thread #%" PRIu64 " (cpu%u): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);	73	printf("Thread #%" PRIu64 " (cpu%u): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
73		74
74	allocated = 0;	75	allocated = 0;
75	for (i = 0; i < (MAX_FRAMES >> order); i++) {	76	for (i = 0; i < (MAX_FRAMES >> order); i++) {
76	frames[allocated] = frame_alloc(order, FRAME_ATOMIC \| FRAME_KA);	77	frames[allocated] = frame_alloc(order, FRAME_ATOMIC \| FRAME_KA);
77	if (frames[allocated]) {	78	if (frames[allocated]) {
78	memsetb(frames[allocated], FRAME_SIZE << order, val);	79	memsetb(frames[allocated], FRAME_SIZE << order, val);
79	allocated++;	80	allocated++;
80	} else	81	} else
81	break;	82	break;
82	}	83	}
83		84
84	if (!sh_quiet)	85	if (!sh_quiet)
85	printf("Thread #%" PRIu64 " (cpu%u): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);	86	printf("Thread #%" PRIu64 " (cpu%u): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);
86		87
87	if (!sh_quiet)	88	if (!sh_quiet)
88	printf("Thread #%" PRIu64 " (cpu%u): Deallocating ... \n", THREAD->tid, CPU->id);	89	printf("Thread #%" PRIu64 " (cpu%u): Deallocating ... \n", THREAD->tid, CPU->id);
89		90
90	for (i = 0; i < allocated; i++) {	91	for (i = 0; i < allocated; i++) {
91	for (k = 0; k <= (((index_t) FRAME_SIZE << order) - 1); k++) {	92	for (k = 0; k <= (((index_t) FRAME_SIZE << order) - 1); k++) {
92	if (((uint8_t *) frames[i])[k] != val) {	93	if (((uint8_t *) frames[i])[k] != val) {
93	if (!sh_quiet)	94	if (!sh_quiet)
94	printf("Thread #%" PRIu64 " (cpu%u): Unexpected data (%c) in block %p offset %#" PRIi "\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k);	95	printf("Thread #%" PRIu64 " (cpu%u): Unexpected data (%c) in block %p offset %#" PRIi "\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k);
95	atomic_inc(&thread_fail);	96	atomic_inc(&thread_fail);
96	goto cleanup;	97	goto cleanup;
97	}	98	}
98	}	99	}
99	frame_free(KA2PA(frames[i]));	100	frame_free(KA2PA(frames[i]));
100	}	101	}
101		102
102	if (!sh_quiet)	103	if (!sh_quiet)
103	printf("Thread #%" PRIu64 " (cpu%u): Finished run.\n", THREAD->tid, CPU->id);	104	printf("Thread #%" PRIu64 " (cpu%u): Finished run.\n", THREAD->tid, CPU->id);
104	}	105	}
105	}	106	}
106		107
107	cleanup:	108	cleanup:
108	free(frames);	109	free(frames);
109		110
110	if (!sh_quiet)	111	if (!sh_quiet)
111	printf("Thread #%" PRIu64 " (cpu%u): Exiting\n", THREAD->tid, CPU->id);	112	printf("Thread #%" PRIu64 " (cpu%u): Exiting\n", THREAD->tid, CPU->id);
112	atomic_dec(&thread_count);	113	atomic_dec(&thread_count);
113	}	114	}
114		115
115	char * test_falloc2(bool quiet)	116	char * test_falloc2(bool quiet)
116	{	117	{
117	unsigned int i;	118	unsigned int i;
118	sh_quiet = quiet;	119	sh_quiet = quiet;
119		120
120	atomic_set(&thread_count, THREADS);	121	atomic_set(&thread_count, THREADS);
121	atomic_set(&thread_fail, 0);	122	atomic_set(&thread_fail, 0);
122		123
123	for (i = 0; i < THREADS; i++) {	124	for (i = 0; i < THREADS; i++) {
124	thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false);	125	thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc", false);
125	if (!thrd) {	126	if (!thrd) {
126	if (!quiet)	127	if (!quiet)
127	printf("Could not create thread %u\n", i);	128	printf("Could not create thread %u\n", i);
128	break;	129	break;
129	}	130	}
130	thread_ready(thrd);	131	thread_ready(thrd);
131	}	132	}
132		133
133	while (atomic_get(&thread_count) > 0) {	134	while (atomic_get(&thread_count) > 0) {
134	if (!quiet)	135	if (!quiet)
135	printf("Threads left: %ld\n", atomic_get(&thread_count));	136	printf("Threads left: %ld\n", atomic_get(&thread_count));
136	thread_sleep(1);	137	thread_sleep(1);
137	}	138	}
138		139
139	if (atomic_get(&thread_fail) == 0)	140	if (atomic_get(&thread_fail) == 0)
140	return NULL;	141	return NULL;
141		142
142	return "Test failed";	143	return "Test failed";
143	}	144	}
144		145

Subversion Repositories HelenOS

(root)/branches/sparc/kernel/test/mm/falloc2.c – Rev 3343 → 3862