1
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
3
* Authors: Jeffrey Stedfast <fejj@ximian.com>
5
* Copyright 2003-2004 Ximian, Inc. (www.ximian.com)
7
* This program is free software; you can redistribute it and/or modify
8
* it under the terms of the GNU General Public License as published by
9
* the Free Software Foundation; either version 2 of the License, or
10
* (at your option) any later version.
12
* This program is distributed in the hope that it will be useful,
13
* but WITHOUT ANY WARRANTY; without even the implied warranty of
14
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
* GNU General Public License for more details.
17
* You should have received a copy of the GNU General Public License
18
* along with this program; if not, write to the Free Software
19
* Foundation, Inc., 59 Temple Street #330, Boston, MA 02111-1307, USA.
31
list_init (List *list)
33
list->head = (ListNode *) &list->tail;
35
list->tailpred = (ListNode *) &list->head;
39
list_is_empty (List *list)
41
return list->head == (ListNode *) &list->tail;
45
list_length (List *list)
60
list_unlink_head (List *list)
76
list_unlink_tail (List *list)
92
list_prepend_node (List *list, ListNode *node)
94
node->next = list->head;
95
node->prev = (ListNode *) &list->head;
96
list->head->prev = node;
103
list_append_node (List *list, ListNode *node)
105
node->next = (ListNode *) &list->tail;
106
node->prev = list->tailpred;
107
list->tailpred->next = node;
108
list->tailpred = node;
114
list_node_unlink (ListNode *node)
116
node->next->prev = node->prev;
117
node->prev->next = node->next;