1 /* SMP- and interrupt-safe semaphores.
2 * PA-RISC version by Matthew Wilcox
4 * Linux/PA-RISC Project (http://www.parisc-linux.org/)
5 * Copyright (C) 1996 Linus Torvalds
6 * Copyright (C) 1999-2001 Matthew Wilcox < willy at debian d0T org >
7 * Copyright (C) 2000 Grant Grundler < grundler a debian org >
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24 #ifndef _ASM_PARISC_SEMAPHORE_H
25 #define _ASM_PARISC_SEMAPHORE_H
27 #include <linux/spinlock.h>
28 #include <linux/wait.h>
29 #include <linux/rwsem.h>
31 #include <asm/system.h>
34 * The `count' is initialised to the number of people who are allowed to
35 * take the lock. (Normally we want a mutex, so this is `1'). if
36 * `count' is positive, the lock can be taken. if it's 0, no-one is
37 * waiting on it. if it's -1, at least one task is waiting.
42 wait_queue_head_t wait
;
45 #define __SEMAPHORE_INITIALIZER(name, n) \
47 .sentry = SPIN_LOCK_UNLOCKED, \
49 .wait = __WAIT_QUEUE_HEAD_INITIALIZER((name).wait) \
52 #define __MUTEX_INITIALIZER(name) \
53 __SEMAPHORE_INITIALIZER(name,1)
55 #define __DECLARE_SEMAPHORE_GENERIC(name,count) \
56 struct semaphore name = __SEMAPHORE_INITIALIZER(name,count)
58 #define DECLARE_MUTEX(name) __DECLARE_SEMAPHORE_GENERIC(name,1)
59 #define DECLARE_MUTEX_LOCKED(name) __DECLARE_SEMAPHORE_GENERIC(name,0)
61 extern inline void sema_init (struct semaphore
*sem
, int val
)
63 *sem
= (struct semaphore
)__SEMAPHORE_INITIALIZER((*sem
),val
);
66 static inline void init_MUTEX (struct semaphore
*sem
)
71 static inline void init_MUTEX_LOCKED (struct semaphore
*sem
)
76 static inline int sem_getcount(struct semaphore
*sem
)
81 asmlinkage
void __down(struct semaphore
* sem
);
82 asmlinkage
int __down_interruptible(struct semaphore
* sem
);
83 asmlinkage
void __up(struct semaphore
* sem
);
85 /* Semaphores can be `tried' from irq context. So we have to disable
86 * interrupts while we're messing with the semaphore. Sorry.
89 extern __inline__
void down(struct semaphore
* sem
)
92 spin_lock_irq(&sem
->sentry
);
98 spin_unlock_irq(&sem
->sentry
);
101 extern __inline__
int down_interruptible(struct semaphore
* sem
)
105 spin_lock_irq(&sem
->sentry
);
106 if (sem
->count
> 0) {
109 ret
= __down_interruptible(sem
);
111 spin_unlock_irq(&sem
->sentry
);
116 * down_trylock returns 0 on success, 1 if we failed to get the lock.
117 * May not sleep, but must preserve irq state
119 extern __inline__
int down_trylock(struct semaphore
* sem
)
123 spin_lock_irqsave(&sem
->sentry
, flags
);
124 count
= sem
->count
- 1;
127 spin_unlock_irqrestore(&sem
->sentry
, flags
);
132 * Note! This is subtle. We jump to wake people up only if
133 * the semaphore was negative (== somebody was waiting on it).
135 extern __inline__
void up(struct semaphore
* sem
)
138 spin_lock_irqsave(&sem
->sentry
, flags
);
139 if (sem
->count
< 0) {
144 spin_unlock_irqrestore(&sem
->sentry
, flags
);
147 #endif /* _ASM_PARISC_SEMAPHORE_H */