File: semaphore.c

package info (click to toggle)
kernel-source-2.4.14 2.4.14-1
  • links: PTS
  • area: main
  • in suites: woody
  • size: 139,160 kB
  • ctags: 428,423
  • sloc: ansic: 2,435,554; asm: 141,119; makefile: 8,258; sh: 3,099; perl: 2,561; yacc: 1,177; cpp: 755; tcl: 577; lex: 352; awk: 251; lisp: 218; sed: 72
file content (265 lines) | stat: -rw-r--r-- 6,580 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
/*
 * Alpha semaphore implementation.
 *
 * (C) Copyright 1996 Linus Torvalds
 * (C) Copyright 1999, 2000 Richard Henderson
 */

#include <linux/sched.h>


/*
 * Semaphores are implemented using a two-way counter:
 * 
 * The "count" variable is decremented for each process that tries to sleep,
 * while the "waking" variable is incremented when the "up()" code goes to
 * wake up waiting processes.
 *
 * Notably, the inline "up()" and "down()" functions can efficiently test
 * if they need to do any extra work (up needs to do something only if count
 * was negative before the increment operation.
 *
 * waking_non_zero() (from asm/semaphore.h) must execute atomically.
 *
 * When __up() is called, the count was negative before incrementing it,
 * and we need to wake up somebody.
 *
 * This routine adds one to the count of processes that need to wake up and
 * exit.  ALL waiting processes actually wake up but only the one that gets
 * to the "waking" field first will gate through and acquire the semaphore.
 * The others will go back to sleep.
 *
 * Note that these functions are only called when there is contention on the
 * lock, and as such all this is the "non-critical" part of the whole
 * semaphore business. The critical part is the inline stuff in
 * <asm/semaphore.h> where we want to avoid any extra jumps and calls.
 */

/*
 * Perform the "down" function.  Return zero for semaphore acquired,
 * return negative for signalled out of the function.
 *
 * If called from down, the return is ignored and the wait loop is
 * not interruptible.  This means that a task waiting on a semaphore
 * using "down()" cannot be killed until someone does an "up()" on
 * the semaphore.
 *
 * If called from down_interruptible, the return value gets checked
 * upon return.  If the return value is negative then the task continues
 * with the negative value in the return register (it can be tested by
 * the caller).
 *
 * Either form may be used in conjunction with "up()".
 */

void
__down_failed(struct semaphore *sem)
{
	DECLARE_WAITQUEUE(wait, current);

#if DEBUG_SEMAPHORE
	printk("%s(%d): down failed(%p)\n",
	       current->comm, current->pid, sem);
#endif

	current->state = TASK_UNINTERRUPTIBLE;
	wmb();
	add_wait_queue_exclusive(&sem->wait, &wait);

	/* At this point we know that sem->count is negative.  In order
	   to avoid racing with __up, we must check for wakeup before
	   going to sleep the first time.  */

	while (1) {
		long ret, tmp;

		/* An atomic conditional decrement of sem->waking.  */
		__asm__ __volatile__(
			"1:	ldl_l	%1,%2\n"
			"	blt	%1,2f\n"
			"	subl	%1,1,%0\n"
			"	stl_c	%0,%2\n"
			"	beq	%0,3f\n"
			"2:\n"
			".subsection 2\n"
			"3:	br	1b\n"
			".previous"
			: "=r"(ret), "=&r"(tmp), "=m"(sem->waking)
			: "0"(0));

		if (ret)
			break;

		schedule();
		set_task_state(current, TASK_UNINTERRUPTIBLE);
	}

	remove_wait_queue(&sem->wait, &wait);
	current->state = TASK_RUNNING;

#if DEBUG_SEMAPHORE
	printk("%s(%d): down acquired(%p)\n",
	       current->comm, current->pid, sem);
#endif
}

int
__down_failed_interruptible(struct semaphore *sem)
{
	DECLARE_WAITQUEUE(wait, current);
	long ret;

#if DEBUG_SEMAPHORE
	printk("%s(%d): down failed(%p)\n",
	       current->comm, current->pid, sem);
#endif

	current->state = TASK_INTERRUPTIBLE;
	wmb();
	add_wait_queue_exclusive(&sem->wait, &wait);

	while (1) {
		long tmp, tmp2, tmp3;

		/* We must undo the sem->count down_interruptible decrement
		   simultaneously and atomicly with the sem->waking
		   adjustment, otherwise we can race with __up.  This is
		   accomplished by doing a 64-bit ll/sc on two 32-bit words.
		
		   "Equivalent" C.  Note that we have to do this all without
		   (taken) branches in order to be a valid ll/sc sequence.

		   do {
		       tmp = ldq_l;
		       ret = 0;
		       if (tmp >= 0) {			// waking >= 0
		           tmp += 0xffffffff00000000;	// waking -= 1
		           ret = 1;
		       }
		       else if (pending) {
			   // count += 1, but since -1 + 1 carries into the
			   // high word, we have to be more careful here.
			   tmp = (tmp & 0xffffffff00000000)
				 | ((tmp + 1) & 0x00000000ffffffff);
		           ret = -EINTR;
		       }
		       tmp = stq_c = tmp;
		   } while (tmp == 0);
		*/

		__asm__ __volatile__(
			"1:	ldq_l	%1,%4\n"
			"	lda	%0,0\n"
			"	cmovne	%5,%6,%0\n"
			"	addq	%1,1,%2\n"
			"	and	%1,%7,%3\n"
			"	andnot	%2,%7,%2\n"
			"	cmovge	%1,1,%0\n"
			"	or	%3,%2,%2\n"
			"	addq	%1,%7,%3\n"
			"	cmovne	%5,%2,%1\n"
			"	cmovge	%2,%3,%1\n"
			"	stq_c	%1,%4\n"
			"	beq	%1,3f\n"
			"2:\n"
			".subsection 2\n"
			"3:	br	1b\n"
			".previous"
			: "=&r"(ret), "=&r"(tmp), "=&r"(tmp2),
			  "=&r"(tmp3), "=m"(*sem)
			: "r"(signal_pending(current)), "r"(-EINTR),
			  "r"(0xffffffff00000000));

		/* At this point we have ret
		  	1	got the lock
		  	0	go to sleep
		  	-EINTR	interrupted  */
		if (ret != 0)
			break;

		schedule();
		set_task_state(current, TASK_INTERRUPTIBLE);
	}

	remove_wait_queue(&sem->wait, &wait);
	current->state = TASK_RUNNING;
	wake_up(&sem->wait);

#if DEBUG_SEMAPHORE
	printk("%s(%d): down %s(%p)\n",
	       current->comm, current->pid,
	       (ret < 0 ? "interrupted" : "acquired"), sem);
#endif

	/* Convert "got the lock" to 0==success.  */
	return (ret < 0 ? ret : 0);
}

void
__up_wakeup(struct semaphore *sem)
{
	wake_up(&sem->wait);
}

void
down(struct semaphore *sem)
{
#if WAITQUEUE_DEBUG
	CHECK_MAGIC(sem->__magic);
#endif
#if DEBUG_SEMAPHORE
	printk("%s(%d): down(%p) <count=%d> from %p\n",
	       current->comm, current->pid, sem,
	       atomic_read(&sem->count), __builtin_return_address(0));
#endif
	__down(sem);
}

int
down_interruptible(struct semaphore *sem)
{
#if WAITQUEUE_DEBUG
	CHECK_MAGIC(sem->__magic);
#endif
#if DEBUG_SEMAPHORE
	printk("%s(%d): down(%p) <count=%d> from %p\n",
	       current->comm, current->pid, sem,
	       atomic_read(&sem->count), __builtin_return_address(0));
#endif
	return __down_interruptible(sem);
}

int
down_trylock(struct semaphore *sem)
{
	int ret;

#if WAITQUEUE_DEBUG
	CHECK_MAGIC(sem->__magic);
#endif

	ret = __down_trylock(sem);

#if DEBUG_SEMAPHORE
	printk("%s(%d): down_trylock %s from %p\n",
	       current->comm, current->pid,
	       ret ? "failed" : "acquired",
	       __builtin_return_address(0));
#endif

	return ret;
}

void
up(struct semaphore *sem)
{
#if WAITQUEUE_DEBUG
	CHECK_MAGIC(sem->__magic);
#endif
#if DEBUG_SEMAPHORE
	printk("%s(%d): up(%p) <count=%d> from %p\n",
	       current->comm, current->pid, sem,
	       atomic_read(&sem->count), __builtin_return_address(0));
#endif
	__up(sem);
}