rwsem.c 8.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4
/* rwsem.c: R/W semaphores: contention handling functions
 *
 * Written by David Howells (dhowells@redhat.com).
 * Derived from arch/i386/kernel/semaphore.c
5 6
 *
 * Writer lock-stealing by Alex Shi <alex.shi@intel.com>
L
Linus Torvalds 已提交
7 8 9 10
 */
#include <linux/rwsem.h>
#include <linux/sched.h>
#include <linux/init.h>
11
#include <linux/export.h>
L
Linus Torvalds 已提交
12

13 14 15 16 17 18 19 20 21 22 23
/*
 * Initialize an rwsem:
 */
void __init_rwsem(struct rw_semaphore *sem, const char *name,
		  struct lock_class_key *key)
{
#ifdef CONFIG_DEBUG_LOCK_ALLOC
	/*
	 * Make sure we are not reinitializing a held semaphore:
	 */
	debug_check_no_locks_freed((void *)sem, sizeof(*sem));
24
	lockdep_init_map(&sem->dep_map, name, key, 0);
25 26
#endif
	sem->count = RWSEM_UNLOCKED_VALUE;
27
	raw_spin_lock_init(&sem->wait_lock);
28 29 30 31 32
	INIT_LIST_HEAD(&sem->wait_list);
}

EXPORT_SYMBOL(__init_rwsem);

33 34 35 36 37
enum rwsem_waiter_type {
	RWSEM_WAITING_FOR_WRITE,
	RWSEM_WAITING_FOR_READ
};

L
Linus Torvalds 已提交
38 39 40
struct rwsem_waiter {
	struct list_head list;
	struct task_struct *task;
41
	enum rwsem_waiter_type type;
L
Linus Torvalds 已提交
42 43
};

44 45 46 47 48 49 50 51
/* Wake types for __rwsem_do_wake().  Note that RWSEM_WAKE_NO_ACTIVE and
 * RWSEM_WAKE_READ_OWNED imply that the spinlock must have been kept held
 * since the rwsem value was observed.
 */
#define RWSEM_WAKE_ANY        0 /* Wake whatever's at head of wait list */
#define RWSEM_WAKE_NO_ACTIVE  1 /* rwsem was observed with no active thread */
#define RWSEM_WAKE_READ_OWNED 2 /* rwsem was observed to be read owned */

L
Linus Torvalds 已提交
52 53 54 55 56
/*
 * handle the lock release when processes blocked on it that can now run
 * - if we come here from up_xxxx(), then:
 *   - the 'active part' of count (&0x0000ffff) reached 0 (but may have changed)
 *   - the 'waiting part' of count (&0xffff0000) is -ve (and will still be so)
57
 * - there must be someone on the queue
L
Linus Torvalds 已提交
58 59 60 61
 * - the spinlock must be held by the caller
 * - woken process blocks are discarded from the list after having task zeroed
 * - writers are only woken if downgrading is false
 */
62 63
static struct rw_semaphore *
__rwsem_do_wake(struct rw_semaphore *sem, int wake_type)
L
Linus Torvalds 已提交
64 65 66 67
{
	struct rwsem_waiter *waiter;
	struct task_struct *tsk;
	struct list_head *next;
68
	signed long woken, loop, adjustment;
L
Linus Torvalds 已提交
69

70
	waiter = list_entry(sem->wait_list.next, struct rwsem_waiter, list);
71
	if (waiter->type != RWSEM_WAITING_FOR_WRITE)
72 73
		goto readers_only;

74
	if (wake_type == RWSEM_WAKE_READ_OWNED)
75 76 77
		/* Another active reader was observed, so wakeup is not
		 * likely to succeed. Save the atomic op.
		 */
78
		goto out;
L
Linus Torvalds 已提交
79

80 81
	/* Wake up the writing waiter and let the task grab the sem: */
	wake_up_process(waiter->task);
L
Linus Torvalds 已提交
82 83
	goto out;

84
 readers_only:
85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
	/* If we come here from up_xxxx(), another thread might have reached
	 * rwsem_down_failed_common() before we acquired the spinlock and
	 * woken up a waiter, making it now active.  We prefer to check for
	 * this first in order to not spend too much time with the spinlock
	 * held if we're not going to be able to wake up readers in the end.
	 *
	 * Note that we do not need to update the rwsem count: any writer
	 * trying to acquire rwsem will run rwsem_down_write_failed() due
	 * to the waiting threads and block trying to acquire the spinlock.
	 *
	 * We use a dummy atomic update in order to acquire the cache line
	 * exclusively since we expect to succeed and run the final rwsem
	 * count adjustment pretty soon.
	 */
	if (wake_type == RWSEM_WAKE_ANY &&
100 101
	    rwsem_atomic_update(0, sem) < RWSEM_WAITING_BIAS)
		/* Someone grabbed the sem for write already */
102
		goto out;
L
Linus Torvalds 已提交
103

104 105 106
	/* Grant an infinite number of read locks to the readers at the front
	 * of the queue.  Note we increment the 'active part' of the count by
	 * the number of readers before waking any processes up.
L
Linus Torvalds 已提交
107 108 109 110 111 112 113 114 115 116 117
	 */
	woken = 0;
	do {
		woken++;

		if (waiter->list.next == &sem->wait_list)
			break;

		waiter = list_entry(waiter->list.next,
					struct rwsem_waiter, list);

118
	} while (waiter->type != RWSEM_WAITING_FOR_WRITE);
L
Linus Torvalds 已提交
119

120
	adjustment = woken * RWSEM_ACTIVE_READ_BIAS;
121
	if (waiter->type != RWSEM_WAITING_FOR_WRITE)
122 123
		/* hit end of list above */
		adjustment -= RWSEM_WAITING_BIAS;
L
Linus Torvalds 已提交
124

125
	rwsem_atomic_add(adjustment, sem);
L
Linus Torvalds 已提交
126 127

	next = sem->wait_list.next;
128
	for (loop = woken; loop > 0; loop--) {
L
Linus Torvalds 已提交
129 130 131
		waiter = list_entry(next, struct rwsem_waiter, list);
		next = waiter->list.next;
		tsk = waiter->task;
132
		smp_mb();
L
Linus Torvalds 已提交
133 134 135 136 137 138 139 140 141 142
		waiter->task = NULL;
		wake_up_process(tsk);
		put_task_struct(tsk);
	}

	sem->wait_list.next = next;
	next->prev = &sem->wait_list;

 out:
	return sem;
143 144 145 146 147 148 149 150
}

/* Try to get write sem, caller holds sem->wait_lock: */
static int try_get_writer_sem(struct rw_semaphore *sem,
					struct rwsem_waiter *waiter)
{
	struct rwsem_waiter *fwaiter;
	long oldcount, adjustment;
L
Linus Torvalds 已提交
151

152 153
	/* only steal when first waiter is writing */
	fwaiter = list_entry(sem->wait_list.next, struct rwsem_waiter, list);
154
	if (fwaiter->type != RWSEM_WAITING_FOR_WRITE)
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174
		return 0;

	adjustment = RWSEM_ACTIVE_WRITE_BIAS;
	/* Only one waiter in the queue: */
	if (fwaiter == waiter && waiter->list.next == &sem->wait_list)
		adjustment -= RWSEM_WAITING_BIAS;

try_again_write:
	oldcount = rwsem_atomic_update(adjustment, sem) - adjustment;
	if (!(oldcount & RWSEM_ACTIVE_MASK)) {
		/* No active lock: */
		struct task_struct *tsk = waiter->task;

		list_del(&waiter->list);
		smp_mb();
		put_task_struct(tsk);
		tsk->state = TASK_RUNNING;
		return 1;
	}
	/* some one grabbed the sem already */
175
	if (rwsem_atomic_update(-adjustment, sem) & RWSEM_ACTIVE_MASK)
176
		return 0;
177
	goto try_again_write;
L
Linus Torvalds 已提交
178 179 180 181 182
}

/*
 * wait for a lock to be granted
 */
183
static struct rw_semaphore __sched *
L
Linus Torvalds 已提交
184
rwsem_down_failed_common(struct rw_semaphore *sem,
185
			 enum rwsem_waiter_type type, signed long adjustment)
L
Linus Torvalds 已提交
186
{
187
	struct rwsem_waiter waiter;
L
Linus Torvalds 已提交
188 189 190 191
	struct task_struct *tsk = current;
	signed long count;

	/* set up my own style of waitqueue */
192
	waiter.task = tsk;
193
	waiter.type = type;
L
Linus Torvalds 已提交
194 195
	get_task_struct(tsk);

196
	raw_spin_lock_irq(&sem->wait_lock);
197 198
	if (list_empty(&sem->wait_list))
		adjustment += RWSEM_WAITING_BIAS;
199
	list_add_tail(&waiter.list, &sem->wait_list);
L
Linus Torvalds 已提交
200

201
	/* we're now waiting on the lock, but no longer actively locking */
L
Linus Torvalds 已提交
202 203
	count = rwsem_atomic_update(adjustment, sem);

204 205 206 207 208 209 210
	/* If there are no active locks, wake the front queued process(es) up.
	 *
	 * Alternatively, if we're called from a failed down_write(), there
	 * were already threads queued before us and there are no active
	 * writers, the lock must be read owned; so we try to wake any read
	 * locks that were queued ahead of us. */
	if (count == RWSEM_WAITING_BIAS)
211
		sem = __rwsem_do_wake(sem, RWSEM_WAKE_NO_ACTIVE);
212 213 214
	else if (count > RWSEM_WAITING_BIAS &&
		 adjustment == -RWSEM_ACTIVE_WRITE_BIAS)
		sem = __rwsem_do_wake(sem, RWSEM_WAKE_READ_OWNED);
L
Linus Torvalds 已提交
215

216
	raw_spin_unlock_irq(&sem->wait_lock);
L
Linus Torvalds 已提交
217 218

	/* wait to be given the lock */
219 220
	while (true) {
		set_task_state(tsk, TASK_UNINTERRUPTIBLE);
221
		if (!waiter.task)
L
Linus Torvalds 已提交
222
			break;
223 224 225

		raw_spin_lock_irq(&sem->wait_lock);
		/* Try to get the writer sem, may steal from the head writer: */
226
		if (type == RWSEM_WAITING_FOR_WRITE)
227 228 229 230 231
			if (try_get_writer_sem(sem, &waiter)) {
				raw_spin_unlock_irq(&sem->wait_lock);
				return sem;
			}
		raw_spin_unlock_irq(&sem->wait_lock);
L
Linus Torvalds 已提交
232 233 234 235 236 237 238 239 240 241 242
		schedule();
	}

	tsk->state = TASK_RUNNING;

	return sem;
}

/*
 * wait for the read lock to be granted
 */
243
struct rw_semaphore __sched *rwsem_down_read_failed(struct rw_semaphore *sem)
L
Linus Torvalds 已提交
244
{
245 246
	return rwsem_down_failed_common(sem, RWSEM_WAITING_FOR_READ,
					-RWSEM_ACTIVE_READ_BIAS);
L
Linus Torvalds 已提交
247 248 249 250 251
}

/*
 * wait for the write lock to be granted
 */
252
struct rw_semaphore __sched *rwsem_down_write_failed(struct rw_semaphore *sem)
L
Linus Torvalds 已提交
253
{
254 255
	return rwsem_down_failed_common(sem, RWSEM_WAITING_FOR_WRITE,
					-RWSEM_ACTIVE_WRITE_BIAS);
L
Linus Torvalds 已提交
256 257 258 259 260 261
}

/*
 * handle waking up a waiter on the semaphore
 * - up_read/up_write has decremented the active part of count if we come here
 */
262
struct rw_semaphore *rwsem_wake(struct rw_semaphore *sem)
L
Linus Torvalds 已提交
263 264 265
{
	unsigned long flags;

266
	raw_spin_lock_irqsave(&sem->wait_lock, flags);
L
Linus Torvalds 已提交
267 268 269

	/* do nothing if list empty */
	if (!list_empty(&sem->wait_list))
270
		sem = __rwsem_do_wake(sem, RWSEM_WAKE_ANY);
L
Linus Torvalds 已提交
271

272
	raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
L
Linus Torvalds 已提交
273 274 275 276 277 278 279 280 281

	return sem;
}

/*
 * downgrade a write lock into a read lock
 * - caller incremented waiting part of count and discovered it still negative
 * - just wake up any readers at the front of the queue
 */
282
struct rw_semaphore *rwsem_downgrade_wake(struct rw_semaphore *sem)
L
Linus Torvalds 已提交
283 284 285
{
	unsigned long flags;

286
	raw_spin_lock_irqsave(&sem->wait_lock, flags);
L
Linus Torvalds 已提交
287 288 289

	/* do nothing if list empty */
	if (!list_empty(&sem->wait_list))
290
		sem = __rwsem_do_wake(sem, RWSEM_WAKE_READ_OWNED);
L
Linus Torvalds 已提交
291

292
	raw_spin_unlock_irqrestore(&sem->wait_lock, flags);
L
Linus Torvalds 已提交
293 294 295 296 297 298 299 300

	return sem;
}

EXPORT_SYMBOL(rwsem_down_read_failed);
EXPORT_SYMBOL(rwsem_down_write_failed);
EXPORT_SYMBOL(rwsem_wake);
EXPORT_SYMBOL(rwsem_downgrade_wake);