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
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
/*
 * Copyright (C) 2000, Matias Atria
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 */

#include <config.h>
#include "common.h"

void	listh_init(ListHead *head)
{
	head->head = head->tail = NULL;
	head->count = 0;
}

void	listh_prepend(ListHead *head, List *list)
{
	list->prev = NULL;
	list->next = head->head;
	if(head->head)
		head->head->prev = list;
	head->head = list;
	if(!head->tail)
		head->tail = list;
	head->count++;
}

void	listh_append(ListHead *head, List *list)
{
	list->next = NULL;
	list->prev = head->tail;
	if(head->tail)
		head->tail->next = list;
	else
		head->head = list;
	head->tail = list;
	head->count++;
}

void	listh_add_before(ListHead *head, List *at, List *list)
{
	if(at == head->head || head->head == NULL)
		listh_prepend(head, list);
	else {
		list->next = at;
		list->prev = at->prev;
		at->prev = list;
		head->count++;
	}
}

void	listh_add_after(ListHead *head, List *at, List *list)
{
	if(at == head->tail || !head->tail)
		listh_append(head, list);
	else {
		list->prev = at;
		list->next = at->next;
		at->next = list;
		head->count++;
	}
}

void	listh_remove(ListHead *head, List *list)
{
	if(list == head->head) {
		head->head = list->next;
		if(head->head)
			head->head->prev = NULL;
	} else if(list == head->tail) {
		head->tail = list->prev;
		if(head->tail)
			head->tail->next = NULL;
	} else {
		list->next->prev = list->prev;
		list->prev->next = list->next;
	}
	if(--head->count == 0)
		head->head = head->tail = NULL;
}

void	listh_concat(ListHead *h1, ListHead *h2)
{
	if(h2->head == NULL)
		; /* do nothing */
	else if(h1->tail == NULL)
		h1->head = h2->head;
	else {
		h1->tail->next = h2->head;
		h2->head->prev = h1->tail;
	}
	h1->tail = h2->tail;
	h1->count += h2->count;
}

void	listh_catcon(ListHead *h1, ListHead *h2)
{
	if(h2->head == NULL)
		; /* do nothing */
	else if(h1->head == NULL)
		h1->tail = h2->tail;
	else {
		h1->head->prev = h2->tail;
		h2->tail->next = h1->head;
	}
	h1->head = h2->head;
	h1->count += h2->count;
}