Subversion Repositories HelenOS-historic

Rev

Rev 195 | Rev 383 | 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
 
29
#include <arch.h>
30
 
111 palkovsky 31
#include <arch/atomic.h>
153 jermar 32
#include <arch/barrier.h>
1 jermar 33
#include <synch/spinlock.h>
223 jermar 34
#include <preemption.h>
195 vana 35
#include <print.h>
1 jermar 36
 
37
#ifdef __SMP__
38
 
39
void spinlock_initialize(spinlock_t *sl)
40
{
41
    sl->val = 0;
42
}
43
 
44
#ifdef DEBUG_SPINLOCK
45
void spinlock_lock(spinlock_t *sl)
46
{
47
    int i = 0;
48
    __address caller = ((__u32 *) &sl)[-1];
49
 
223 jermar 50
    preemption_disable();
1 jermar 51
    while (test_and_set(&sl->val)) {
52
        if (i++ > 300000) {
15 jermar 53
            printf("cpu%d: looping on spinlock %X, caller=%X\n", CPU->id, sl, caller);
1 jermar 54
            i = 0;
55
        }
56
    }
153 jermar 57
    CS_ENTER_BARRIER();
1 jermar 58
 
59
}
60
#else
61
void spinlock_lock(spinlock_t *sl)
62
{
223 jermar 63
    preemption_disable();
64
 
1 jermar 65
    /*
66
     * Each architecture has its own efficient/recommended
67
     * implementation of spinlock.
68
     */
69
    spinlock_arch(&sl->val);
153 jermar 70
    CS_ENTER_BARRIER();
1 jermar 71
}
72
#endif
73
 
74
int spinlock_trylock(spinlock_t *sl)
75
{
153 jermar 76
    int rc;
77
 
223 jermar 78
    preemption_disable();
153 jermar 79
    rc = !test_and_set(&sl->val);
80
    CS_ENTER_BARRIER();
223 jermar 81
 
82
    if (!rc)
83
        preemption_enable();
153 jermar 84
 
85
    return rc;
1 jermar 86
}
87
 
88
void spinlock_unlock(spinlock_t *sl)
89
{
153 jermar 90
    CS_LEAVE_BARRIER();
1 jermar 91
    sl->val = 0;
223 jermar 92
    preemption_enable();
1 jermar 93
}
94
 
95
#endif