-
Notifications
You must be signed in to change notification settings - Fork 1
/
list-batman.c
133 lines (97 loc) · 3.01 KB
/
list-batman.c
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
121
122
123
124
125
126
127
128
129
130
131
132
133
/* Copyright (C) 2006 B.A.T.M.A.N. contributors:
* Marek Lindner
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of version 2 of the GNU General Public
* License as published by the Free Software Foundation.
*
* 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 "list-batman.h"
/*
* Insert a new entry between two known consecutive entries.
*
* This is only for internal list manipulation where we know
* the next entries already!
*/
/*
void __list_add( struct list_head *new, struct list_head *prev, struct list_head *next ) {
new->next = next;
prev->next = new;
}
*/
/**
* list_add - add a new entry
* @new: new entry to be added
* @head: list head to add it after
*
* Insert a new entry after the specified head.
* This is good for implementing stacks.
*/
void list_add( struct list_head *new, struct list_head_first *head ) {
// __list_add( new, (struct list_head *)head, head->next );
new->next = head->next;
((struct list_head *)head)->next = new;
if ( head->prev == (struct list_head *)head )
head->prev = new;
}
/**
* list_add_tail - add a new entry
* @new: new entry to be added
* @head: list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
void list_add_tail( struct list_head *new, struct list_head_first *head ) {
// __list_add( new, head->prev, (struct list_head *)head );
new->next = (struct list_head *)head;
head->prev->next = new;
head->prev = new;
}
void list_add_before( struct list_head *prev_node, struct list_head *next_node, struct list_head *new_node ) {
prev_node->next = new_node;
new_node->next = next_node;
}
/*
* Delete a list entry by making the next entries
* point to each other.
*
* This is only for internal list manipulation where we know
* the next entries already!
*/
/*
void __list_del( struct list_head *prev, struct list_head *next ) {
prev->next = next;
}
*/
/**
* list_del - deletes entry from list.
* @entry: the element to delete from the list.
* Note: list_empty on entry does not return true after this, the entry is in an undefined state.
*/
void list_del( struct list_head *prev_entry, struct list_head *entry, struct list_head_first *head ) {
if ( head->prev == entry )
head->prev = prev_entry;
// __list_del( prev_entry, entry->next );
prev_entry->next = entry->next;
entry->next = (void *) 0;
}
/**
* list_empty - tests whether a list is empty
* @head: the list to test.
*/
/*
int list_empty( struct list_head_first *head ) {
return head->next == (struct list_head *)head;
}
*/