summaryrefslogtreecommitdiff
path: root/libc/misc/insremque/insremque.c
diff options
context:
space:
mode:
authorManuel Novoa III <mjn3@codepoet.org>2002-12-02 16:20:50 +0000
committerManuel Novoa III <mjn3@codepoet.org>2002-12-02 16:20:50 +0000
commit0de7f32b93af44a9ae3b5126b1ec5558fd51e14f (patch)
tree1f75d7d4c61c262ffe0a0bb5a2f7915749a5339b /libc/misc/insremque/insremque.c
parentbf10e6efd441bcd261c325323dda0957d529abf5 (diff)
Add hsearch and hsearch_r. Consolidate all functions prototyped in
search.h in one directory.
Diffstat (limited to 'libc/misc/insremque/insremque.c')
-rw-r--r--libc/misc/insremque/insremque.c51
1 files changed, 0 insertions, 51 deletions
diff --git a/libc/misc/insremque/insremque.c b/libc/misc/insremque/insremque.c
deleted file mode 100644
index 7f156c601..000000000
--- a/libc/misc/insremque/insremque.c
+++ /dev/null
@@ -1,51 +0,0 @@
-/* Copyright (C) 1992, 1995, 1996 Free Software Foundation, Inc.
- This file is part of the GNU C Library.
-
- The GNU C Library 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.
-
- The GNU C Library 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.
-
- You should have received a copy of the GNU Library General Public
- License along with the GNU C Library; see the file COPYING.LIB. If not,
- write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA. */
-
-#include <features.h>
-#define __USE_GNU
-#include <stddef.h>
-#ifndef _SVID_SOURCE
-#define _SVID_SOURCE 1
-#endif
-#include <search.h>
-
-/* Insert ELEM into a doubly-linked list, after PREV. */
-
-void
-insque (void *elem, void *prev)
-{
- struct qelem *next = ((struct qelem *) prev)->q_forw;
- ((struct qelem *) prev)->q_forw = (struct qelem *) elem;
- if (next != NULL)
- next->q_back = (struct qelem *) elem;
- ((struct qelem *) elem)->q_forw = next;
- ((struct qelem *) elem)->q_back = (struct qelem *) prev;
-}
-
-/* Unlink ELEM from the doubly-linked list that it is in. */
-
-void
-remque (void *elem)
-{
- struct qelem *next = ((struct qelem *) elem)->q_forw;
- struct qelem *prev = ((struct qelem *) elem)->q_back;
- if (next != NULL)
- next->q_back = prev;
- if (prev != NULL)
- prev->q_forw = (struct qelem *) next;
-}