1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
/*
* Doubly linked list primitives
* Copyright
* (C) 1992 Joseph H. Allen
*
* This file is part of JOE (Joe's Own Editor)
*/
#include "config.h"
#include "types.h"
__RCSID("$MirOS: contrib/code/jupp/queue.c,v 1.5 2017/12/08 02:00:40 tg Exp $");
#include <stdlib.h>
#include "queue.h"
#include "utils.h"
void *QUEUE;
void *ITEM;
void *LAST;
void *alitem(void *list, int itemsize)
{
STDITEM *freelist = (STDITEM *)list;
if (qempty(STDITEM, link, freelist)) {
STDITEM *i = malloc(itemsize * 16);
STDITEM *z = (STDITEM *)((unsigned char *)i + itemsize * 16);
while (i != z) {
enquef(STDITEM, link, freelist, i);
i = (STDITEM *)((unsigned char *)i + itemsize);
}
}
return (void *)deque_f(STDITEM, link, freelist->link.prev);
}
void frchn(void *list, void *ch)
{
STDITEM *freelist = (STDITEM *)list;
STDITEM *chn = (STDITEM *)ch;
STDITEM *i;
if ((i = chn->link.prev) != chn) {
deque(STDITEM, link, chn);
splicef(STDITEM, link, freelist, i);
}
}
|