Revert "semaphore: fix"

This reverts commit bf726eab3711cf192405d21688a4b21e07b6188a, as it has been reported to cause a regression with processes stuck in __down(), apparently because some missing wakeup. Quoth Sven Wegener: "I'm currently investigating a regression that has showed up with my last git pull yesterday. Bisecting the commits showed bf726e "semaphore: fix" to be the culprit, reverting it fixed the issue. Symptoms: During heavy filesystem usage (e.g. a kernel compile) I get several compiler processes in uninterruptible sleep, blocking all i/o on the filesystem. System is an Intel Core 2 Quad running a 64bit kernel and userspace. Filesystem is xfs on top of lvm. See below for the output of sysrq-w." See http://lkml.org/lkml/2008/5/10/45 for full report. In the meantime, we can just fix the BKL performance regression by reverting back to the good old BKL spinlock implementation instead, since any sleeping lock will generally perform badly, especially if it tries to be fair.

Linus Torvalds committed 18 years ago

Commit 00b41ec1 parent 39f004b1 file · +34 −30Browse files

Unified · Split

kernel/semaphore.c+34−30

@@ -54,9 +54,10 @@ void down(struct semaphore *sem) · 53 unmodified lines
54	54	unsigned long flags;
55	55
56	56	spin_lock_irqsave(&sem->lock, flags);
57		− if (unlikely(!sem->count))
	57	+ if (likely(sem->count > 0))
	58	+ sem->count--;
	59	+ else
58	60	__down(sem);
59		− sem->count--;
60	61	spin_unlock_irqrestore(&sem->lock, flags);
61	62	}
62	63	EXPORT_SYMBOL(down);
@@ -76,10 +77,10 @@ int down_interruptible(struct semaphore *sem) · 13 unmodified lines
76	77	int result = 0;
77	78
78	79	spin_lock_irqsave(&sem->lock, flags);
79		− if (unlikely(!sem->count))
80		− result = __down_interruptible(sem);
81		− if (!result)
	80	+ if (likely(sem->count > 0))
82	81	sem->count--;
	82	+ else
	83	+ result = __down_interruptible(sem);
83	84	spin_unlock_irqrestore(&sem->lock, flags);
84	85
85	86	return result;
@@ -102,10 +103,10 @@ int down_killable(struct semaphore *sem) · 16 unmodified lines
102	103	int result = 0;
103	104
104	105	spin_lock_irqsave(&sem->lock, flags);
105		− if (unlikely(!sem->count))
106		− result = __down_killable(sem);
107		− if (!result)
	106	+ if (likely(sem->count > 0))
108	107	sem->count--;
	108	+ else
	109	+ result = __down_killable(sem);
109	110	spin_unlock_irqrestore(&sem->lock, flags);
110	111
111	112	return result;
@@ -156,10 +157,10 @@ int down_timeout(struct semaphore *sem, long jiffies) · 44 unmodified lines
156	157	int result = 0;
157	158
158	159	spin_lock_irqsave(&sem->lock, flags);
159		− if (unlikely(!sem->count))
160		− result = __down_timeout(sem, jiffies);
161		− if (!result)
	160	+ if (likely(sem->count > 0))
162	161	sem->count--;
	162	+ else
	163	+ result = __down_timeout(sem, jiffies);
163	164	spin_unlock_irqrestore(&sem->lock, flags);
164	165
165	166	return result;
@@ -178,8 +179,9 @@ void up(struct semaphore *sem) · 12 unmodified lines
178	179	unsigned long flags;
179	180
180	181	spin_lock_irqsave(&sem->lock, flags);
181		− sem->count++;
182		− if (unlikely(!list_empty(&sem->wait_list)))
	182	+ if (likely(list_empty(&sem->wait_list)))
	183	+ sem->count++;
	184	+ else
183	185	__up(sem);
184	186	spin_unlock_irqrestore(&sem->lock, flags);
185	187	}
@@ -190,6 +192,7 @@ EXPORT_SYMBOL(up); · 4 unmodified lines
190	192	struct semaphore_waiter {
191	193	struct list_head list;
192	194	struct task_struct *task;
	195	+ int up;
193	196	};
194	197
195	198	/*
@@ -202,34 +205,33 @@ static inline int __sched __down_common(struct semaphore *sem, long state, · 6 unmodified lines
202	205	{
203	206	struct task_struct *task = current;
204	207	struct semaphore_waiter waiter;
205		− int ret = 0;
206	208
207		− waiter.task = task;
208	209	list_add_tail(&waiter.list, &sem->wait_list);
	210	+ waiter.task = task;
	211	+ waiter.up = 0;
209	212
210	213	for (;;) {
211		− if (state == TASK_INTERRUPTIBLE && signal_pending(task)) {
212		− ret = -EINTR;
213		− break;
214		− }
215		− if (state == TASK_KILLABLE && fatal_signal_pending(task)) {
216		− ret = -EINTR;
217		− break;
218		− }
219		− if (timeout <= 0) {
220		− ret = -ETIME;
221		− break;
222		− }
	214	+ if (state == TASK_INTERRUPTIBLE && signal_pending(task))
	215	+ goto interrupted;
	216	+ if (state == TASK_KILLABLE && fatal_signal_pending(task))
	217	+ goto interrupted;
	218	+ if (timeout <= 0)
	219	+ goto timed_out;
223	220	__set_task_state(task, state);
224	221	spin_unlock_irq(&sem->lock);
225	222	timeout = schedule_timeout(timeout);
226	223	spin_lock_irq(&sem->lock);
227		− if (sem->count > 0)
228		− break;
	224	+ if (waiter.up)
	225	+ return 0;
229	226	}
230	227
	228	+ timed_out:
	229	+ list_del(&waiter.list);
	230	+ return -ETIME;
	231	+
	232	+ interrupted:
231	233	list_del(&waiter.list);
232		− return ret;
	234	+ return -EINTR;
233	235	}
234	236
235	237	static noinline void __sched __down(struct semaphore *sem)
@@ -256,5 +258,7 @@ static noinline void __sched __up(struct semaphore *sem) · 20 unmodified lines
256	258	{
257	259	struct semaphore_waiter *waiter = list_first_entry(&sem->wait_list,
258	260	struct semaphore_waiter, list);
	261	+ list_del(&waiter->list);
	262	+ waiter->up = 1;
259	263	wake_up_process(waiter->task);
260	264	}