Subversion Repositories HelenOS-historic

Rev

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