about summary refs log tree commit diff
path: root/linuxthreads/queue.h
diff options
context:
space:
mode:
authorRoland McGrath <roland@gnu.org>2005-07-03 04:40:34 +0000
committerRoland McGrath <roland@gnu.org>2005-07-03 04:40:34 +0000
commit88e3fbcb5d6829f8980d6bb356b1c0cd7a38187b (patch)
tree41b73f55c91439f87d82e5d32b9d8e46e82ce3c1 /linuxthreads/queue.h
parentd19b1b4f2ff49e085b55e8564b52ca17b028e335 (diff)
downloadglibc-88e3fbcb5d6829f8980d6bb356b1c0cd7a38187b.tar.gz
glibc-88e3fbcb5d6829f8980d6bb356b1c0cd7a38187b.tar.xz
glibc-88e3fbcb5d6829f8980d6bb356b1c0cd7a38187b.zip
linuxthreads, linuxthreads_db: Directories removed (preserved in ports repository).
Diffstat (limited to 'linuxthreads/queue.h')
-rw-r--r--linuxthreads/queue.h61
1 files changed, 0 insertions, 61 deletions
diff --git a/linuxthreads/queue.h b/linuxthreads/queue.h
deleted file mode 100644
index 28bd75531c..0000000000
--- a/linuxthreads/queue.h
+++ /dev/null
@@ -1,61 +0,0 @@
-/* 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;
-  ASSERT(th->p_nextwaiting == NULL);
-  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;
-}