diff options
author | YamaArashi <shadow962@live.com> | 2016-02-15 16:00:37 -0800 |
---|---|---|
committer | YamaArashi <shadow962@live.com> | 2016-02-15 16:00:37 -0800 |
commit | 2f209e7d2884f9658a996adeb896233db9fecdad (patch) | |
tree | cc0806a5f4fdaca67ef39a9bb583347c68b54edd /libiberty/insque.c | |
parent | 526fd830c2ce8da3397bc08a267db5aea78db6f3 (diff) |
kill libiberty
Diffstat (limited to 'libiberty/insque.c')
-rwxr-xr-x | libiberty/insque.c | 50 |
1 files changed, 0 insertions, 50 deletions
diff --git a/libiberty/insque.c b/libiberty/insque.c deleted file mode 100755 index 775019f..0000000 --- a/libiberty/insque.c +++ /dev/null @@ -1,50 +0,0 @@ -/* 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; -} |