| 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 <typedefs.h>
|
|---|
| 39 | #include <arch/barrier.h>
|
|---|
| 40 | #include <preemption.h>
|
|---|
| 41 | #include <verify.h>
|
|---|
| 42 | #include <trace.h>
|
|---|
| 43 |
|
|---|
| 44 | NO_TRACE ATOMIC static inline void atomic_inc(atomic_t *val)
|
|---|
| 45 | WRITES(&val->count)
|
|---|
| 46 | REQUIRES_EXTENT_MUTABLE(val)
|
|---|
| 47 | REQUIRES(val->count < ATOMIC_COUNT_MAX)
|
|---|
| 48 | {
|
|---|
| 49 | /* On real hardware the increment has to be done
|
|---|
| 50 | as an atomic action. */
|
|---|
| 51 |
|
|---|
| 52 | val->count++;
|
|---|
| 53 | }
|
|---|
| 54 |
|
|---|
| 55 | NO_TRACE ATOMIC static inline void atomic_dec(atomic_t *val)
|
|---|
| 56 | WRITES(&val->count)
|
|---|
| 57 | REQUIRES_EXTENT_MUTABLE(val)
|
|---|
| 58 | REQUIRES(val->count > ATOMIC_COUNT_MIN)
|
|---|
| 59 | {
|
|---|
| 60 | /* On real hardware the decrement has to be done
|
|---|
| 61 | as an atomic action. */
|
|---|
| 62 |
|
|---|
| 63 | val->count--;
|
|---|
| 64 | }
|
|---|
| 65 |
|
|---|
| 66 | NO_TRACE ATOMIC static inline atomic_count_t atomic_postinc(atomic_t *val)
|
|---|
| 67 | WRITES(&val->count)
|
|---|
| 68 | REQUIRES_EXTENT_MUTABLE(val)
|
|---|
| 69 | REQUIRES(val->count < ATOMIC_COUNT_MAX)
|
|---|
| 70 | {
|
|---|
| 71 | /* On real hardware both the storing of the previous
|
|---|
| 72 | value and the increment have to be done as a single
|
|---|
| 73 | atomic action. */
|
|---|
| 74 |
|
|---|
| 75 | atomic_count_t prev = val->count;
|
|---|
| 76 |
|
|---|
| 77 | val->count++;
|
|---|
| 78 | return prev;
|
|---|
| 79 | }
|
|---|
| 80 |
|
|---|
| 81 | NO_TRACE ATOMIC static inline atomic_count_t atomic_postdec(atomic_t *val)
|
|---|
| 82 | WRITES(&val->count)
|
|---|
| 83 | REQUIRES_EXTENT_MUTABLE(val)
|
|---|
| 84 | REQUIRES(val->count > ATOMIC_COUNT_MIN)
|
|---|
| 85 | {
|
|---|
| 86 | /* On real hardware both the storing of the previous
|
|---|
| 87 | value and the decrement have to be done as a single
|
|---|
| 88 | atomic action. */
|
|---|
| 89 |
|
|---|
| 90 | atomic_count_t prev = val->count;
|
|---|
| 91 |
|
|---|
| 92 | val->count--;
|
|---|
| 93 | return prev;
|
|---|
| 94 | }
|
|---|
| 95 |
|
|---|
| 96 | #define atomic_preinc(val) (atomic_postinc(val) + 1)
|
|---|
| 97 | #define atomic_predec(val) (atomic_postdec(val) - 1)
|
|---|
| 98 |
|
|---|
| 99 | NO_TRACE ATOMIC static inline atomic_count_t test_and_set(atomic_t *val)
|
|---|
| 100 | WRITES(&val->count)
|
|---|
| 101 | REQUIRES_EXTENT_MUTABLE(val)
|
|---|
| 102 | {
|
|---|
| 103 | /* On real hardware the retrieving of the original
|
|---|
| 104 | value and storing 1 have to be done as a single
|
|---|
| 105 | atomic action. */
|
|---|
| 106 |
|
|---|
| 107 | atomic_count_t prev = val->count;
|
|---|
| 108 | val->count = 1;
|
|---|
| 109 | return prev;
|
|---|
| 110 | }
|
|---|
| 111 |
|
|---|
| 112 | NO_TRACE static inline void atomic_lock_arch(atomic_t *val)
|
|---|
| 113 | WRITES(&val->count)
|
|---|
| 114 | REQUIRES_EXTENT_MUTABLE(val)
|
|---|
| 115 | {
|
|---|
| 116 | do {
|
|---|
| 117 | while (val->count);
|
|---|
| 118 | } while (test_and_set(val));
|
|---|
| 119 | }
|
|---|
| 120 |
|
|---|
| 121 | #endif
|
|---|
| 122 |
|
|---|
| 123 | /** @}
|
|---|
| 124 | */
|
|---|