Rev 3134 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
156 | decky | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2005 Martin Decky |
156 | decky | 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 | |||
1888 | jermar | 29 | /** @addtogroup ppc32 |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
1888 | jermar | 35 | #ifndef KERN_ppc32_BARRIER_H_ |
36 | #define KERN_ppc32_BARRIER_H_ |
||
156 | decky | 37 | |
1267 | decky | 38 | #define CS_ENTER_BARRIER() asm volatile ("" ::: "memory") |
39 | #define CS_LEAVE_BARRIER() asm volatile ("" ::: "memory") |
||
156 | decky | 40 | |
1267 | decky | 41 | #define memory_barrier() asm volatile ("sync" ::: "memory") |
42 | #define read_barrier() asm volatile ("sync" ::: "memory") |
||
43 | #define write_barrier() asm volatile ("eieio" ::: "memory") |
||
177 | jermar | 44 | |
3143 | svoboda | 45 | /* |
46 | * The IMB sequence used here is valid for all possible cache models |
||
47 | * on uniprocessor. SMP might require a different sequence. |
||
48 | * See PowerPC Programming Environment for 32-Bit Microprocessors, |
||
49 | * chapter 5.1.5.2 |
||
50 | */ |
||
3133 | jermar | 51 | |
3143 | svoboda | 52 | static inline void smc_coherence(void *addr) |
53 | { |
||
54 | asm volatile ( |
||
55 | "dcbst 0, %0\n" |
||
56 | "sync\n" |
||
57 | "icbi 0, %0\n" |
||
58 | "isync\n" |
||
59 | :: "r" (addr) |
||
60 | ); |
||
61 | } |
||
62 | |||
63 | #define COHERENCE_INVAL_MIN 4 |
||
64 | |||
65 | static inline void smc_coherence_block(void *addr, unsigned long len) |
||
66 | { |
||
67 | unsigned long i; |
||
68 | |||
69 | for (i = 0; i < len; i += COHERENCE_INVAL_MIN) { |
||
70 | asm volatile ("dcbst 0, %0\n" :: "r" (addr + i)); |
||
71 | } |
||
72 | |||
73 | asm volatile ("sync"); |
||
74 | |||
75 | for (i = 0; i < len; i += COHERENCE_INVAL_MIN) { |
||
76 | asm volatile ("icbi 0, %0\n" :: "r" (addr + i)); |
||
77 | } |
||
78 | |||
79 | asm volatile ("isync"); |
||
80 | } |
||
81 | |||
156 | decky | 82 | #endif |
1702 | cejka | 83 | |
1888 | jermar | 84 | /** @} |
1702 | cejka | 85 | */ |