Subversion Repositories HelenOS

Rev

Rev 2927 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
418 jermar 1
/*
2071 jermar 2
 * Copyright (c) 2005 Jakub Jermar
418 jermar 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
 
1784 jermar 29
/** @addtogroup sparc64
1702 cejka 30
 * @{
31
 */
32
/** @file
33
 */
34
 
1860 jermar 35
#ifndef KERN_sparc64_BARRIER_H_
36
#define KERN_sparc64_BARRIER_H_
418 jermar 37
 
38
/*
2047 jermar 39
 * Our critical section barriers are prepared for the weakest RMO memory model.
418 jermar 40
 */
2047 jermar 41
#define CS_ENTER_BARRIER()              \
2272 jermar 42
    asm volatile (                  \
2047 jermar 43
        "membar #LoadLoad | #LoadStore\n"   \
44
        ::: "memory"                \
45
    )
46
#define CS_LEAVE_BARRIER()              \
2272 jermar 47
    asm volatile (                  \
2047 jermar 48
        "membar #StoreStore\n"          \
49
        "membar #LoadStore\n"           \
50
        ::: "memory"                \
51
    )
418 jermar 52
 
2047 jermar 53
#define memory_barrier()    \
2082 decky 54
    asm volatile ("membar #LoadLoad | #StoreStore\n" ::: "memory")
2047 jermar 55
#define read_barrier()      \
2082 decky 56
    asm volatile ("membar #LoadLoad\n" ::: "memory")
2047 jermar 57
#define write_barrier()     \
2082 decky 58
    asm volatile ("membar #StoreStore\n" ::: "memory")
418 jermar 59
 
3153 svoboda 60
#define flush(a)        \
61
    asm volatile ("flush %0\n" :: "r" ((a)) : "memory")
62
 
63
/** Flush Instruction pipeline. */
64
static inline void flush_pipeline(void)
613 jermar 65
{
66
    /*
760 jermar 67
     * The FLUSH instruction takes address parameter.
68
     * As such, it may trap if the address is not found in DTLB.
1854 jermar 69
     *
70
     * The entire kernel text is mapped by a locked ITLB and
71
     * DTLB entries. Therefore, when this function is called,
72
     * the %o7 register will always be in the range mapped by
73
     * DTLB.
613 jermar 74
     */
883 jermar 75
 
2082 decky 76
        asm volatile ("flush %o7\n");
613 jermar 77
}
569 jermar 78
 
760 jermar 79
/** Memory Barrier instruction. */
758 jermar 80
static inline void membar(void)
81
{
2082 decky 82
    asm volatile ("membar #Sync\n");
758 jermar 83
}
84
 
3153 svoboda 85
#define smc_coherence(a)    \
86
{               \
87
    write_barrier();    \
88
    flush((a));     \
89
}
90
 
91
#define FLUSH_INVAL_MIN     4
92
#define smc_coherence_block(a, l)           \
93
{                           \
94
    unsigned long i;                \
95
    write_barrier();                \
96
    for (i = 0; i < (l); i += FLUSH_INVAL_MIN)  \
97
        flush((void *)(a) + i);         \
98
}
99
 
418 jermar 100
#endif
1702 cejka 101
 
1784 jermar 102
/** @}
1702 cejka 103
 */