summaryrefslogtreecommitdiff
path: root/libiberty/insque.c
diff options
context:
space:
mode:
authorhuderlem <huderlem@gmail.com>2020-02-15 09:06:38 -0600
committerGitHub <noreply@github.com>2020-02-15 09:06:38 -0600
commit74e171579e0bbefbd72b83f3764fe504464bbdbe (patch)
tree8db5aacbe963fef56eb2d9965fc87db1a6642387 /libiberty/insque.c
parent27176890c4a688ea7de44d3f55af32827016a9fd (diff)
parentc6bcd24dfe44d58ed1b6bef6653270dbf6cd6bfa (diff)
Merge pull request #30 from camthesaxman/arm_support
Build ARM compiler
Diffstat (limited to 'libiberty/insque.c')
-rwxr-xr-xlibiberty/insque.c50
1 files changed, 50 insertions, 0 deletions
diff --git a/libiberty/insque.c b/libiberty/insque.c
new file mode 100755
index 0000000..775019f
--- /dev/null
+++ b/libiberty/insque.c
@@ -0,0 +1,50 @@
+/* insque(3C) routines
+ This file is in the public domain. */
+
+/*
+NAME
+ insque, remque -- insert, remove an element from a queue
+
+SYNOPSIS
+ struct qelem {
+ struct qelem *q_forw;
+ struct qelem *q_back;
+ char q_data[];
+ };
+
+ void insque (struct qelem *elem, struct qelem *pred)
+
+ void remque (struct qelem *elem)
+
+DESCRIPTION
+ Routines to manipulate queues built from doubly linked lists.
+ The insque routine inserts ELEM in the queue immediately after
+ PRED. The remque routine removes ELEM from its containing queue.
+*/
+
+
+struct qelem {
+ struct qelem *q_forw;
+ struct qelem *q_back;
+};
+
+
+void
+insque (elem, pred)
+ struct qelem *elem;
+ struct qelem *pred;
+{
+ elem -> q_forw = pred -> q_forw;
+ pred -> q_forw -> q_back = elem;
+ elem -> q_back = pred;
+ pred -> q_forw = elem;
+}
+
+
+void
+remque (elem)
+ struct qelem *elem;
+{
+ elem -> q_forw -> q_back = elem -> q_back;
+ elem -> q_back -> q_forw = elem -> q_forw;
+}