Subversion Repositories HelenOS-historic

Rev

Rev 735 | Go to most recent revision | Details | Last modification | View Log | RSS feed

Rev Author Line No. Line
692 bondari 1
/*
2
 * Copyright (C) 2006 Sergey Bondari
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
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
15
 *   derived from this software without specific prior written permission.
16
 *
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
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
#include <print.h>
29
#include <test.h>
30
#include <mm/page.h>
31
#include <mm/frame.h>
32
#include <arch/mm/page.h>
33
#include <arch/types.h>
34
#include <arch/atomic.h>
35
#include <debug.h>
36
#include <proc/thread.h>
37
#include <memstr.h>
38
 
39
#define MAX_FRAMES 128
40
#define MAX_ORDER 3
41
 
42
#define THREAD_RUNS 2
43
#define THREADS 6
44
 
45
static void thread(void * arg);
46
static void failed(void);
47
 
48
static atomic_t thread_count;
49
 
50
void thread(void * arg) {
51
    int status, order, run, allocated,i;
52
 
53
    __u8 val = *((__u8 *) arg);
54
 
55
    __address frames[MAX_FRAMES];
56
 
57
    for (run=0;run<THREAD_RUNS;run++) {
58
 
59
        for (order=0;order<=MAX_ORDER;order++) {
60
            printf("Allocating %d frames blocks ... ", 1<<order);
61
            allocated = 0;
62
            for (i=0;i<MAX_FRAMES>>order;i++) {
63
                frames[allocated] = frame_alloc(FRAME_NON_BLOCKING | FRAME_KA,order, &status);
64
                if (status == 0) {
65
                    memsetb(frames[allocated], (1 << order) * FRAME_SIZE - 1, val);
66
                    allocated++;
67
                } else {
68
                    break;
69
                }
70
            }
71
 
72
            printf("%d blocks alocated.\n", allocated);
73
 
74
            printf("Deallocating ... ");
75
            for (i=0;i<allocated;i++) {
76
                /* add memtest here */
77
                frame_free(frames[i]);
78
            }
79
            printf("done.\n");
80
        }
81
    }
82
 
83
 
84
    atomic_dec(&thread_count);
85
 
86
}
87
 
88
 
89
void failed(void) {
90
    panic("Test failed.\n");
91
}
92
 
93
 
94
void test(void) {
95
    int i;
96
 
97
    atomic_set(&thread_count, THREADS);
98
 
99
    for (i=1;i<=THREADS;i++) {
100
        thread_t * thrd;
101
        thrd = thread_create(thread, &i, TASK, 0);
102
        if (thrd) thread_ready(thrd); else failed();
103
    }
104
 
105
    while (thread_count.count);
106
 
107
    printf("Test passed\n");
108
}
109