list.c File Reference

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

Include dependency graph for list.c:

Go to the source code of this file.

Functions
void	listh_init (ListHead *head)
void	listh_prepend (ListHead *head, List *list)
void	listh_append (ListHead *head, List *list)
void	listh_add_before (ListHead *head, List *at, List *list)
void	listh_add_after (ListHead *head, List *at, List *list)
void	listh_remove (ListHead *head, List *list)
void	listh_concat (ListHead *h1, ListHead *h2)
void	listh_catcon (ListHead *h1, ListHead *h2)

Function Documentation

void listh_add_after	(	ListHead *	head,
		List *	at,
		List *	list
	)

Definition at line 64 of file list.c.

{
    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_add_before	(	ListHead *	head,
		List *	at,
		List *	list
	)

Definition at line 52 of file list.c.

{
    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_append	(	ListHead *	head,
		List *	list
	)

Definition at line 40 of file list.c.

{
    list->next = NULL;
    list->prev = head->tail;
    if(head->tail)
        head->tail->next = list;
    else
        head->head = list;
    head->tail = list;
    head->count++;
}

Here is the caller graph for this function:

void listh_catcon	(	ListHead *	h1,
		ListHead *	h2
	)

Definition at line 108 of file list.c.

{
    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;
}

void listh_concat	(	ListHead *	h1,
		ListHead *	h2
	)

Definition at line 94 of file list.c.

{
    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_init

(

ListHead *

head)

Definition at line 22 of file list.c.

{
    head->head = head->tail = NULL;
    head->count = 0;
}

Here is the caller graph for this function:

void listh_prepend	(	ListHead *	head,
		List *	list
	)

Definition at line 28 of file list.c.

{
    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++;
}

Here is the caller graph for this function:

void listh_remove	(	ListHead *	head,
		List *	list
	)

Definition at line 76 of file list.c.

{
    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;
}

Here is the caller graph for this function: