Subversion Repositories HelenOS

Rev

Rev 1787 | Rev 2028 | 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
 
2021 decky 41
#ifdef CONFIG_BENCH
42
#include <arch/cycle.h>
43
#endif
44
 
735 bondari 45
#define MAX_FRAMES 256
46
#define MAX_ORDER 8
692 bondari 47
 
733 bondari 48
#define THREAD_RUNS 1
735 bondari 49
#define THREADS 8
692 bondari 50
 
1062 jermar 51
static void falloc(void * arg);
692 bondari 52
static void failed(void);
53
 
54
static atomic_t thread_count;
55
 
1062 jermar 56
void falloc(void * arg)
745 jermar 57
{
1767 palkovsky 58
    int order, run, allocated, i;
1780 jermar 59
    uint8_t val = THREAD->tid % THREADS;
733 bondari 60
    index_t k;
692 bondari 61
 
1780 jermar 62
    uintptr_t * frames =  (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), FRAME_ATOMIC);
745 jermar 63
    ASSERT(frames != NULL);
1658 vana 64
 
65
    thread_detach(THREAD);
692 bondari 66
 
745 jermar 67
    for (run = 0; run < THREAD_RUNS; run++) {
68
        for (order = 0; order <= MAX_ORDER; order++) {
786 bondari 69
            printf("Thread #%d (cpu%d): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
692 bondari 70
            allocated = 0;
745 jermar 71
            for (i = 0; i < (MAX_FRAMES >> order); i++) {
1780 jermar 72
                frames[allocated] = (uintptr_t)frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
1767 palkovsky 73
                if (frames[allocated]) {
745 jermar 74
                    memsetb(frames[allocated], FRAME_SIZE << order, val);
692 bondari 75
                    allocated++;
76
                } else {
77
                    break;
78
                }
79
            }
786 bondari 80
            printf("Thread #%d (cpu%d): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);
692 bondari 81
 
786 bondari 82
            printf("Thread #%d (cpu%d): Deallocating ... \n", THREAD->tid, CPU->id);
745 jermar 83
            for (i = 0; i < allocated; i++) {
84
                for (k = 0; k <= ((FRAME_SIZE << order) - 1); k++) {
1780 jermar 85
                    if (((uint8_t *) frames[i])[k] != val) {
1221 decky 86
                        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 87
                        failed();
88
                    }
89
                }
1760 palkovsky 90
                frame_free(KA2PA(frames[i]));
692 bondari 91
            }
786 bondari 92
            printf("Thread #%d (cpu%d): Finished run.\n", THREAD->tid, CPU->id);
692 bondari 93
        }
94
    }
95
 
745 jermar 96
    free(frames);
786 bondari 97
    printf("Thread #%d (cpu%d): Exiting\n", THREAD->tid, CPU->id);
692 bondari 98
    atomic_dec(&thread_count);
99
}
100
 
101
 
745 jermar 102
void failed(void)
103
{
692 bondari 104
    panic("Test failed.\n");
105
}
106
 
107
 
2021 decky 108
void test_falloc2(void)
745 jermar 109
{
2021 decky 110
#ifdef CONFIG_BENCH
111
    uint64_t t0 = get_cycle();
112
#endif
692 bondari 113
    int i;
114
 
115
    atomic_set(&thread_count, THREADS);
116
 
745 jermar 117
    for (i = 0; i < THREADS; i++) {
692 bondari 118
        thread_t * thrd;
1062 jermar 119
        thrd = thread_create(falloc, NULL, TASK, 0, "falloc");
745 jermar 120
        if (thrd)
121
            thread_ready(thrd);
122
        else
123
            failed();
692 bondari 124
    }
125
 
745 jermar 126
    while (thread_count.count)
127
        ;
692 bondari 128
 
745 jermar 129
    printf("Test passed.\n");
2021 decky 130
#ifdef CONFIG_BENCH
131
    uint64_t dt = get_cycle() - t0;
132
    printf("Time: %.*d cycles\n", sizeof(dt) * 2, dt);
133
#endif
692 bondari 134
}