blob: 6d2f838139fe56898689a6be702d8d00769a784c (
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
|
/*
* rhctl
*
* Copyright (C) 2009 Christian Pointner <equinox@spreadspace.org>
*
* This file is part of rhctl.
*
* rhctl 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 3 of the License, or
* any later version.
*
* rhctl 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 rhctl. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include "client_list.h"
#include "datatypes.h"
client_t* client_get_last(client_t* first)
{
if(!first)
return NULL;
while(first->next) {
first = first->next;
}
return first;
}
int client_add(client_t** first, int fd)
{
if(!first)
return -1;
client_t* new_client = malloc(sizeof(client_t));
if(!new_client)
return -2;
new_client->fd = fd;
new_client->status_listener = 0;
new_client->error_listener = 0;
new_client->request_listener = 0;
new_client->next = NULL;
new_client->buffer.offset = 0;
if(!(*first)) {
*first = new_client;
return 0;
}
client_get_last(*first)->next = new_client;
return 0;
}
void client_remove(client_t** first, int fd)
{
if(!first || !(*first))
return;
client_t* deletee = *first;
if((*first)->fd == fd) {
*first = (*first)->next;
close(deletee->fd);
free(deletee);
return;
}
client_t* prev = deletee;
deletee = deletee->next;
while(deletee) {
if(deletee->fd == fd) {
prev->next = deletee->next;
close(deletee->fd);
free(deletee);
return;
}
prev = deletee;
deletee = deletee->next;
}
}
client_t* client_find(client_t* first, int fd)
{
if(!first)
return NULL;
while(first) {
if(first->fd == fd)
return first;
first = first->next;
}
return NULL;
}
void client_clear(client_t** first)
{
if(!first || !(*first))
return;
while(*first) {
client_t* deletee = *first;
*first = (*first)->next;
close(deletee->fd);
free(deletee);
}
}
|
