Subversion Repositories HelenOS-historic

Rev

Rev 1187 | Rev 1201 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 1187 Rev 1190
1 
/*
 1 
/*
2 
 * Copyright (C) 2005 Ondrej Palkovsky
 2 
 * Copyright (C) 2005 Ondrej Palkovsky
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 <proc/scheduler.h>
 29 
#include <proc/scheduler.h>
30 
#include <cpu.h>
 30 
#include <cpu.h>
31 
#include <proc/task.h>
 31 
#include <proc/task.h>
32 
#include <proc/thread.h>
 32 
#include <proc/thread.h>
33 
#include <arch.h>
 33 
#include <arch.h>
34 
#include <arch/context.h>   /* SP_DELTA */
 34 
#include <arch/context.h>   /* SP_DELTA */
35 
#include <arch/asm.h>
 35 
#include <arch/asm.h>
36 
#include <arch/debugger.h>
 36 
#include <arch/debugger.h>
37 
#include <print.h>
 37 
#include <print.h>
38 
#include <arch/pm.h>
 38 
#include <arch/pm.h>
39 
 
 39 
 
40 
/** Perform amd64 specific tasks needed before the new task is run. */
 40 
/** Perform amd64 specific tasks needed before the new task is run.
- 
 
 41 
 *
- 
 
 42 
 * Interrupts are disabled.
- 
 
 43 
 */
41 
void before_task_runs_arch(void)
 44 
void before_task_runs_arch(void)
42 
{
 45 
{
43 
}
 - 
 
44 
 
 - 
 
45 
/** Perform amd64 specific tasks needed before the new thread is scheduled. */
 - 
 
46 
void before_thread_runs_arch(void)
 - 
 
47 
{
 - 
 
48 
    size_t iomap_size;
 46 
    size_t iomap_size;
49 
    ptr_16_64_t cpugdtr;
 47 
    ptr_16_64_t cpugdtr;
50 
    descriptor_t *gdt_p;
 48 
    descriptor_t *gdt_p;
51 
 
 49 
 
52 
    CPU->arch.tss->rsp0 = (__address) &THREAD->kstack[THREAD_STACK_SIZE-SP_DELTA];
 - 
 
53 
 
 - 
 
54 
    /* Syscall support - write address of thread stack pointer to
 - 
 
55 
     * hidden part of gs */
 - 
 
56 
    swapgs();
 - 
 
57 
    write_msr(AMD_MSR_GS, (__u64)&THREAD->kstack);
 - 
 
58 
    swapgs();
 - 
 
59 
 
 - 
 
60 
    /* TLS support - set FS to thread local storage */
 - 
 
61 
    write_msr(AMD_MSR_FS, THREAD->arch.tls);
 - 
 
62 
 
 - 
 
63 
    /*
 50 
    /*
64 
     * Switch the I/O Permission Bitmap, if necessary.
 51 
     * Switch the I/O Permission Bitmap, if necessary.
65 
     *
 - 
 
66 
     * First, copy the I/O Permission Bitmap.
 - 
 
67 
     * This needs to be changed so that the
 - 
 
68 
     * copying is avoided if the same task
 - 
 
69 
     * was already running and the iomap did
 - 
 
70 
     * not change.
 - 
 
71 
     */
 52 
     */
- 
 
 53 
     
- 
 
 54 
    /* First, copy the I/O Permission Bitmap. */
72 
    spinlock_lock(&TASK->lock);
 55 
    spinlock_lock(&TASK->lock);
73 
    iomap_size = TASK->arch.iomap_size;
 56 
    iomap_size = TASK->arch.iomap_size;
74 
    if (iomap_size) {
 57 
    if (iomap_size) {
75 
        ASSERT(TASK->arch.iomap);
 58 
        ASSERT(TASK->arch.iomap);
76 
        memcpy(CPU->arch.tss->iomap, TASK->arch.iomap, iomap_size);
 59 
        memcpy(CPU->arch.tss->iomap, TASK->arch.iomap, iomap_size);
77 
        CPU->arch.tss->iomap[iomap_size] = 0xff;        /* terminating byte */
 60 
        CPU->arch.tss->iomap[iomap_size] = 0xff;        /* terminating byte */
78 
    }
 61 
    }
79 
    spinlock_unlock(&TASK->lock);
 62 
    spinlock_unlock(&TASK->lock);
80 
 
 63 
 
81 
    /* Second, adjust TSS segment limit. */
 64 
    /* Second, adjust TSS segment limit. */
82 
    gdtr_store(&cpugdtr);
 65 
    gdtr_store(&cpugdtr);
83 
    gdt_p = (descriptor_t *) cpugdtr.base;
 66 
    gdt_p = (descriptor_t *) cpugdtr.base;
84 
    gdt_tss_setlimit(&gdt_p[TSS_DES], TSS_BASIC_SIZE + iomap_size - 1);
 67 
    gdt_tss_setlimit(&gdt_p[TSS_DES], TSS_BASIC_SIZE + iomap_size - 1);
85 
    gdtr_load(&cpugdtr);
 68 
    gdtr_load(&cpugdtr);
- 
 
 69 
}
- 
 
 70 
 
- 
 
 71 
/** Perform amd64 specific tasks needed before the new thread is scheduled. */
- 
 
 72 
void before_thread_runs_arch(void)
- 
 
 73 
{
- 
 
 74 
    CPU->arch.tss->rsp0 = (__address) &THREAD->kstack[THREAD_STACK_SIZE-SP_DELTA];
- 
 
 75 
 
- 
 
 76 
    /* Syscall support - write address of thread stack pointer to
- 
 
 77 
     * hidden part of gs */
- 
 
 78 
    swapgs();
- 
 
 79 
    write_msr(AMD_MSR_GS, (__u64)&THREAD->kstack);
- 
 
 80 
    swapgs();
- 
 
 81 
 
- 
 
 82 
    /* TLS support - set FS to thread local storage */
- 
 
 83 
    write_msr(AMD_MSR_FS, THREAD->arch.tls);
86 
 
 84 
 
87 
#ifdef CONFIG_DEBUG_AS_WATCHPOINT
 85 
#ifdef CONFIG_DEBUG_AS_WATCHPOINT
88 
    /* Set watchpoint on AS to ensure that nobody sets it to zero */
 86 
    /* Set watchpoint on AS to ensure that nobody sets it to zero */
89 
    if (CPU->id < BKPOINTS_MAX)
 87 
    if (CPU->id < BKPOINTS_MAX)
90 
        breakpoint_add(&((the_t *) THREAD->kstack)->as,
 88 
        breakpoint_add(&((the_t *) THREAD->kstack)->as,
91 
                   BKPOINT_WRITE | BKPOINT_CHECK_ZERO,
 89 
                   BKPOINT_WRITE | BKPOINT_CHECK_ZERO,
92 
                   CPU->id);
 90 
                   CPU->id);
93 
#endif
 91 
#endif
94 
}
 92 
}
95 
 
 93 
 
96 
void after_thread_ran_arch(void)
 94 
void after_thread_ran_arch(void)
97 
{
 95 
{
98 
}
 96 
}
99 
 
 97