blob: f4640442f1475fa63326ac8f81fe867d7b58a38b (
plain)
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
/*
* active port forwarder - software for secure forwarding
* Copyright (C) 2003-2007 jeremian <jeremian [at] poczta.fm>
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
*/
#include <config.h>
#include <stdlib.h>
#include <assert.h>
#include "port_list_struct.h"
/*
* Function name: PortList_new
* Description: Creates and initialies new PortList structure.
* Returns: Newly created PortList structure.
*/
PortList*
PortList_new()
{
PortList* tmp = calloc(1, sizeof(PortList));
assert(tmp != NULL);
if (tmp == NULL) {
return NULL;
}
return tmp;
}
/*
* Function name: PortList_free
* Description: Frees the memory allocated for PortList structure.
* Arguments: pl - pointer to pointer to PortList structure
*/
void
PortList_free(PortList** pl)
{
assert(pl != NULL);
if (pl == NULL) {
return;
}
assert((*pl) != NULL);
if ((*pl) == NULL) {
return;
}
PortList_clear((*pl));
free((*pl));
(*pl) = NULL;
}
/*
* Function name: PortList_insert_back
* Description: Inserts new node at the end of the list.
* Arguments: pl - pointer to PortList structure
* pln - pointer to PortListNode structure
*/
void
PortList_insert_back(PortList* pl, PortListNode* pln)
{
assert(pl != NULL);
if (pl == NULL) {
return;
}
assert(pln != NULL);
if (pln == NULL) {
return;
}
if (pl->tail) {
pl->tail->nextNode = pln;
}
else {
pl->head = pln;
}
pl->tail = pln;
pln->nextNode = NULL;
pl->size += 1;
}
/*
* Function name: PortList_get_nth
* Description: Get the nth node from the beginning of the list.
* Arguments: pl - pointer to PortList structure
* n - the number of the node
* Returns: Nth node from the beginning of the list.
*/
PortListNode*
PortList_get_nth(PortList* pl, int n)
{
PortListNode* tmp;
assert(pl != NULL);
if (pl == NULL) {
return NULL;
}
assert(n >= 0);
assert(n < PortList_get_size(pl));
tmp = pl->head;
while (tmp) {
if (n <= 0) {
return tmp;
}
n -= 1;
tmp = PortListNode_get_nextNode(tmp);
}
return NULL;
}
/*
* Function name: PortList_get_size
* Description: Returns the size of the list.
* Arguments: pl - pointer to PortList structure
* Returns: The size of the list.
*/
int
PortList_get_size(PortList* pl)
{
assert(pl != NULL);
if (pl == NULL) {
return -1;
}
return pl->size;
}
/*
* Function name: PortList_clear
* Description: Deletes all nodes from the list.
* Arguments: pl - pointer to PortList structure
*/
void
PortList_clear(PortList* pl)
{
PortListNode* tmp;
assert(pl != NULL);
if (pl == NULL) {
return;
}
while (pl->head) {
tmp = pl->head;
if (tmp == pl->tail) {
pl->head = pl->tail = NULL;
}
else {
pl->head = PortListNode_get_nextNode(pl->head);
}
PortListNode_free(&tmp);
}
pl->size = 0;
}
|
