summaryrefslogtreecommitdiff
path: root/libpthread/linuxthreads.old/queue.h
diff options
context:
space:
mode:
authorBernhard Reutner-Fischer <rep.dot.nop@gmail.com>2008-07-23 11:19:00 +0000
committerBernhard Reutner-Fischer <rep.dot.nop@gmail.com>2008-07-23 11:19:00 +0000
commitf1775381f91f1250b20f1949dfd0364ddb0ee9fc (patch)
tree1326bd7f4dfd8c57f89c4d6b2f13d4f22f578abf /libpthread/linuxthreads.old/queue.h
parentd35b0bc119816825a657f7c9c2a1f062e7048c39 (diff)
- fix inline keyword
Diffstat (limited to 'libpthread/linuxthreads.old/queue.h')
-rw-r--r--libpthread/linuxthreads.old/queue.h8
1 files changed, 4 insertions, 4 deletions
diff --git a/libpthread/linuxthreads.old/queue.h b/libpthread/linuxthreads.old/queue.h
index c7f8471b9..01d18d16e 100644
--- a/libpthread/linuxthreads.old/queue.h
+++ b/libpthread/linuxthreads.old/queue.h
@@ -18,7 +18,7 @@
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)
+static __inline__ void enqueue(pthread_descr * q, pthread_descr th)
{
int prio = th->p_priority;
for (; *q != NULL; q = &((*q)->p_nextwaiting)) {
@@ -31,7 +31,7 @@ static inline void enqueue(pthread_descr * q, pthread_descr th)
*q = th;
}
-static inline pthread_descr dequeue(pthread_descr * q)
+static __inline__ pthread_descr dequeue(pthread_descr * q)
{
pthread_descr th;
th = *q;
@@ -42,7 +42,7 @@ static inline pthread_descr dequeue(pthread_descr * q)
return th;
}
-static inline int remove_from_queue(pthread_descr * q, pthread_descr th)
+static __inline__ int remove_from_queue(pthread_descr * q, pthread_descr th)
{
for (; *q != NULL; q = &((*q)->p_nextwaiting)) {
if (*q == th) {
@@ -54,7 +54,7 @@ static inline int remove_from_queue(pthread_descr * q, pthread_descr th)
return 0;
}
-static inline int queue_is_empty(pthread_descr * q)
+static __inline__ int queue_is_empty(pthread_descr * q)
{
return *q == NULL;
}