Subversion Repositories HelenOS

Rev

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

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 2001-2004 Jakub 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
 
1264 jermar 29
/**
30
 * @file    spinlock.c
31
 * @brief   Spinlocks.
32
 */
33
 
383 jermar 34
#include <synch/spinlock.h>
1104 jermar 35
#include <atomic.h>
153 jermar 36
#include <arch/barrier.h>
383 jermar 37
#include <arch.h>
223 jermar 38
#include <preemption.h>
195 vana 39
#include <print.h>
383 jermar 40
#include <debug.h>
552 palkovsky 41
#include <symtab.h>
1 jermar 42
 
1313 jermar 43
#ifdef CONFIG_FB
44
#include <genarch/fb/fb.h>
45
#endif
46
 
458 decky 47
#ifdef CONFIG_SMP
1 jermar 48
 
383 jermar 49
/** Initialize spinlock
50
 *
51
 * Initialize spinlock.
52
 *
53
 * @param sl Pointer to spinlock_t structure.
54
 */
552 palkovsky 55
void spinlock_initialize(spinlock_t *sl, char *name)
1 jermar 56
{
625 palkovsky 57
    atomic_set(&sl->val, 0);
552 palkovsky 58
#ifdef CONFIG_DEBUG_SPINLOCK
59
    sl->name = name;
60
#endif  
1 jermar 61
}
62
 
383 jermar 63
/** Lock spinlock
64
 *
65
 * Lock spinlock.
66
 * This version has limitted ability to report
67
 * possible occurence of deadlock.
68
 *
69
 * @param sl Pointer to spinlock_t structure.
70
 */
1100 palkovsky 71
#ifdef CONFIG_DEBUG_SPINLOCK
72
void spinlock_lock_debug(spinlock_t *sl)
1 jermar 73
{
557 jermar 74
    count_t i = 0;
552 palkovsky 75
    char *symbol;
557 jermar 76
    bool deadlock_reported = false;
1 jermar 77
 
223 jermar 78
    preemption_disable();
1 jermar 79
    while (test_and_set(&sl->val)) {
1313 jermar 80
 
81
        /*
82
         * We need to be careful about printflock and fb_lock.
83
         * Both of them are used to report deadlocks via
84
         * printf() and fb_putchar().
85
         *
86
         * We trust our code that there is no possible deadlock
87
         * caused by these two locks (except when an exception
88
         * is triggered for instance by printf() or fb_putchar()).
89
         * However, we encountered false positives caused by very
90
         * slow VESA framebuffer interaction (especially when
91
         * run in a simulator) that caused problems with both
92
         * printflock and fb_lock.
93
         *
94
         * Possible deadlocks on both printflock and fb_lock
95
         * are therefore not reported as they would cause an
96
         * infinite recursion.
97
         */
98
        if (sl == &printflock)
99
            continue;
100
#ifdef CONFIG_FB
101
        if (sl == &fb_lock)
102
            continue;
103
#endif
104
        if (i++ > 300000) {
1224 cejka 105
            printf("cpu%d: looping on spinlock %.*p:%s, caller=%.*p",
106
                   CPU->id, sizeof(__address) * 2, sl, sl->name, sizeof(__address) * 2, CALLER);
622 palkovsky 107
            symbol = get_symtab_entry(CALLER);
552 palkovsky 108
            if (symbol)
109
                printf("(%s)", symbol);
110
            printf("\n");
1 jermar 111
            i = 0;
557 jermar 112
            deadlock_reported = true;
1 jermar 113
        }
114
    }
383 jermar 115
 
557 jermar 116
    if (deadlock_reported)
117
        printf("cpu%d: not deadlocked\n", CPU->id);
118
 
383 jermar 119
    /*
120
     * Prevent critical section code from bleeding out this way up.
121
     */
153 jermar 122
    CS_ENTER_BARRIER();
1 jermar 123
}
124
#endif
125
 
383 jermar 126
/** Lock spinlock conditionally
127
 *
128
 * Lock spinlock conditionally.
129
 * If the spinlock is not available at the moment,
130
 * signal failure.
131
 *
132
 * @param sl Pointer to spinlock_t structure.
133
 *
134
 * @return Zero on failure, non-zero otherwise.
135
 */
1 jermar 136
int spinlock_trylock(spinlock_t *sl)
137
{
153 jermar 138
    int rc;
139
 
223 jermar 140
    preemption_disable();
153 jermar 141
    rc = !test_and_set(&sl->val);
383 jermar 142
 
143
    /*
144
     * Prevent critical section code from bleeding out this way up.
145
     */
153 jermar 146
    CS_ENTER_BARRIER();
223 jermar 147
 
148
    if (!rc)
149
        preemption_enable();
153 jermar 150
 
151
    return rc;
1 jermar 152
}
153
 
154
#endif