blob: 01d18d16e9490049276d31d01d45e0037ef0c135 (
plain)
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
|
/* Linuxthreads - a simple clone()-based implementation of Posix */
/* threads for Linux. */
/* Copyright (C) 1996 Xavier Leroy (Xavier.Leroy@inria.fr) */
/* */
/* This program is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU Library General Public License */
/* as published by the Free Software Foundation; either version 2 */
/* of the License, or (at your option) any later version. */
/* */
/* This program is distributed in the hope that it will be useful, */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the */
/* GNU Library General Public License for more details. */
/* Waiting queues */
/* Waiting queues are represented by lists of thread descriptors
linked through their p_nextwaiting field. The lists are kept
sorted by decreasing priority, and then decreasing waiting time. */
static __inline__ void enqueue(pthread_descr * q, pthread_descr th)
{
int prio = th->p_priority;
for (; *q != NULL; q = &((*q)->p_nextwaiting)) {
if (prio > (*q)->p_priority) {
th->p_nextwaiting = *q;
*q = th;
return;
}
}
*q = th;
}
static __inline__ pthread_descr dequeue(pthread_descr * q)
{
pthread_descr th;
th = *q;
if (th != NULL) {
*q = th->p_nextwaiting;
th->p_nextwaiting = NULL;
}
return th;
}
static __inline__ int remove_from_queue(pthread_descr * q, pthread_descr th)
{
for (; *q != NULL; q = &((*q)->p_nextwaiting)) {
if (*q == th) {
*q = th->p_nextwaiting;
th->p_nextwaiting = NULL;
return 1;
}
}
return 0;
}
static __inline__ int queue_is_empty(pthread_descr * q)
{
return *q == NULL;
}
|
