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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
/*
* SCCS: @(#)llist.c 1.6 (96/11/04)
*
* UniSoft Ltd., London, England
*
* (C) Copyright 1992 X/Open Company Limited
*
* All rights reserved. No part of this source code may be reproduced,
* stored in a retrieval system, or transmitted, in any form or by any
* means, electronic, mechanical, photocopying, recording or otherwise,
* except as stated in the end-user licence agreement, without the prior
* permission of the copyright owners.
*
* X/Open and the 'X' symbol are trademarks of X/Open Company Limited in
* the UK and other countries.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
/************************************************************************
SCCS: @(#)llist.c 1.6 96/11/04 TETware release 3.3
NAME: llist.c
PRODUCT: TETware
AUTHOR: Andrew Dingwall, UniSoft Ltd.
DATE CREATED: April 1992
DESCRIPTION:
functions to manipulate doubly linked lists
MODIFICATIONS:
************************************************************************/
#include "dtmac.h"
#include "llist.h"
#include "error.h"
/*
** tet_listinsert() - insert new element at the head of a linked list
*/
void tet_listinsert(head, elem)
register struct llist **head, *elem;
{
ASSERT(head);
ASSERT(elem);
if (*head)
(*head)->last = elem;
elem->next = *head;
elem->last = (struct llist *) 0;
*head = elem;
}
/*
** tet_listremove() - remove an element from a linked list
*/
void tet_listremove(head, elem)
register struct llist **head, *elem;
{
ASSERT(head);
ASSERT(elem);
if (elem->next)
elem->next->last = elem->last;
if (elem->last)
elem->last->next = elem->next;
else {
ASSERT(elem == *head);
*head = elem->next;
}
elem->last = elem->next = (struct llist *) 0;
}
|
