insremque.c 1.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253
  1. /* Copyright (C) 1992-2019 Free Software Foundation, Inc.
  2. This file is part of the GNU C Library.
  3. The GNU C Library is free software; you can redistribute it and/or
  4. modify it under the terms of the GNU Lesser General Public
  5. License as published by the Free Software Foundation; either
  6. version 2.1 of the License, or (at your option) any later version.
  7. The GNU C Library is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  10. Lesser General Public License for more details.
  11. You should have received a copy of the GNU Lesser General Public
  12. License along with the GNU C Library; if not, see
  13. <http://www.gnu.org/licenses/>. */
  14. #include <stddef.h>
  15. #include <search.h>
  16. /* Insert ELEM into a doubly-linked list, after PREV. */
  17. void
  18. insque (void *elem, void *prev)
  19. {
  20. if (prev == NULL)
  21. {
  22. ((struct qelem *) elem)->q_forw = NULL;
  23. ((struct qelem *) elem)->q_back = NULL;
  24. }
  25. else
  26. {
  27. struct qelem *next = ((struct qelem *) prev)->q_forw;
  28. ((struct qelem *) prev)->q_forw = (struct qelem *) elem;
  29. if (next != NULL)
  30. next->q_back = (struct qelem *) elem;
  31. ((struct qelem *) elem)->q_forw = next;
  32. ((struct qelem *) elem)->q_back = (struct qelem *) prev;
  33. }
  34. }
  35. /* Unlink ELEM from the doubly-linked list that it is in. */
  36. void
  37. remque (void *elem)
  38. {
  39. struct qelem *next = ((struct qelem *) elem)->q_forw;
  40. struct qelem *prev = ((struct qelem *) elem)->q_back;
  41. if (next != NULL)
  42. next->q_back = prev;
  43. if (prev != NULL)
  44. prev->q_forw = (struct qelem *) next;
  45. }