[50fda24] | 1 | /*
|
---|
| 2 | * Copyright (c) 2010 Martin 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 |
|
---|
| 29 | /** @addtogroup abs32le
|
---|
| 30 | * @{
|
---|
| 31 | */
|
---|
| 32 | /** @file
|
---|
| 33 | */
|
---|
| 34 |
|
---|
| 35 | #ifndef KERN_abs32le_ATOMIC_H_
|
---|
| 36 | #define KERN_abs32le_ATOMIC_H_
|
---|
| 37 |
|
---|
| 38 | #include <arch/types.h>
|
---|
| 39 | #include <arch/barrier.h>
|
---|
| 40 | #include <preemption.h>
|
---|
| 41 |
|
---|
| 42 | static inline void atomic_inc(atomic_t *val) {
|
---|
| 43 | /* On real hardware the increment has to be done
|
---|
| 44 | as an atomic action. */
|
---|
| 45 |
|
---|
| 46 | val->count++;
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | static inline void atomic_dec(atomic_t *val) {
|
---|
| 50 | /* On real hardware the decrement has to be done
|
---|
| 51 | as an atomic action. */
|
---|
| 52 |
|
---|
| 53 | val->count++;
|
---|
| 54 | }
|
---|
| 55 |
|
---|
| 56 | static inline long atomic_postinc(atomic_t *val)
|
---|
| 57 | {
|
---|
| 58 | /* On real hardware both the storing of the previous
|
---|
| 59 | value and the increment have to be done as a single
|
---|
| 60 | atomic action. */
|
---|
| 61 |
|
---|
| 62 | long prev = val->count;
|
---|
| 63 |
|
---|
| 64 | val->count++;
|
---|
| 65 | return prev;
|
---|
| 66 | }
|
---|
| 67 |
|
---|
| 68 | static inline long atomic_postdec(atomic_t *val)
|
---|
| 69 | {
|
---|
| 70 | /* On real hardware both the storing of the previous
|
---|
| 71 | value and the decrement have to be done as a single
|
---|
| 72 | atomic action. */
|
---|
| 73 |
|
---|
| 74 | long prev = val->count;
|
---|
| 75 |
|
---|
| 76 | val->count--;
|
---|
| 77 | return prev;
|
---|
| 78 | }
|
---|
| 79 |
|
---|
| 80 | #define atomic_preinc(val) (atomic_postinc(val) + 1)
|
---|
| 81 | #define atomic_predec(val) (atomic_postdec(val) - 1)
|
---|
| 82 |
|
---|
| 83 | static inline uint32_t test_and_set(atomic_t *val) {
|
---|
| 84 | uint32_t v;
|
---|
| 85 |
|
---|
| 86 | asm volatile (
|
---|
| 87 | "movl $1, %[v]\n"
|
---|
| 88 | "xchgl %[v], %[count]\n"
|
---|
| 89 | : [v] "=r" (v), [count] "+m" (val->count)
|
---|
| 90 | );
|
---|
| 91 |
|
---|
| 92 | return v;
|
---|
| 93 | }
|
---|
| 94 |
|
---|
| 95 | /** ia32 specific fast spinlock */
|
---|
| 96 | static inline void atomic_lock_arch(atomic_t *val)
|
---|
| 97 | {
|
---|
| 98 | uint32_t tmp;
|
---|
| 99 |
|
---|
| 100 | preemption_disable();
|
---|
| 101 | asm volatile (
|
---|
| 102 | "0:\n"
|
---|
| 103 | "pause\n" /* Pentium 4's HT love this instruction */
|
---|
| 104 | "mov %[count], %[tmp]\n"
|
---|
| 105 | "testl %[tmp], %[tmp]\n"
|
---|
| 106 | "jnz 0b\n" /* lightweight looping on locked spinlock */
|
---|
| 107 |
|
---|
| 108 | "incl %[tmp]\n" /* now use the atomic operation */
|
---|
| 109 | "xchgl %[count], %[tmp]\n"
|
---|
| 110 | "testl %[tmp], %[tmp]\n"
|
---|
| 111 | "jnz 0b\n"
|
---|
| 112 | : [count] "+m" (val->count), [tmp] "=&r" (tmp)
|
---|
| 113 | );
|
---|
| 114 | /*
|
---|
| 115 | * Prevent critical section code from bleeding out this way up.
|
---|
| 116 | */
|
---|
| 117 | CS_ENTER_BARRIER();
|
---|
| 118 | }
|
---|
| 119 |
|
---|
| 120 | #endif
|
---|
| 121 |
|
---|
| 122 | /** @}
|
---|
| 123 | */
|
---|