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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
/*
Copyright (C) 1996-2025 Free Software Foundation, Inc.
This file is part of GNU Inetutils.
GNU Inetutils 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 (at
your option) any later version.
GNU Inetutils 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, see `http://www.gnu.org/licenses/'. */
#include <config.h>
#include <intalkd.h>
#include "attribute.h"
typedef struct request_table table_t;
struct request_table
{
table_t *next, *prev;
CTL_MSG request;
time_t time;
};
static table_t *table;
static void
table_delete (table_t *ptr)
{
table_t *t;
if ((t = ptr->prev) != NULL)
t->next = ptr->next;
else
table = ptr->next;
if ((t = ptr->next) != NULL)
t->prev = ptr->prev;
free (ptr);
}
/* Look in the table for an invitation that matches given criteria.
Linear search: premature optimisation is the root of all
Evil) */
static CTL_MSG *
lookup_request (CTL_MSG *request,
int (*comp) (table_t *, CTL_MSG *, time_t *))
{
table_t *ptr;
time_t now;
time (&now);
if (debug)
print_request ("lookup_request", request);
for (ptr = table; ptr;)
{
table_t *next = ptr->next;
if (debug)
print_request ("comparing against: ", &ptr->request);
if ((ptr->time - now) > max_request_ttl)
{
/* the entry is too old */
if (debug)
print_request ("deleting expired entry", &ptr->request);
table_delete (ptr);
}
else
{
if (comp (ptr, request, &now) == 0)
{
if (debug)
print_request ("found", &ptr->request);
return &ptr->request;
}
}
ptr = next;
}
if (debug)
syslog (LOG_DEBUG, "not found");
return NULL;
}
static int
fuzzy_comp (table_t *ptr, CTL_MSG *request, time_t *unused MAYBE_UNUSED)
{
if (ptr->request.type == LEAVE_INVITE
&& strcmp (request->l_name, ptr->request.r_name) == 0
&& strcmp (request->r_name, ptr->request.l_name) == 0)
return 0;
return 1;
}
/* Look in the table for an invitation that matches the current
request looking for an invitation */
CTL_MSG *
find_match (CTL_MSG *request)
{
return lookup_request (request, fuzzy_comp);
}
static int
exact_comp (table_t *ptr, CTL_MSG *request, time_t *now)
{
if (request->type == ptr->request.type
&& request->pid == ptr->request.pid
&& strcmp (request->r_name, ptr->request.r_name) == 0
&& strcmp (request->l_name, ptr->request.l_name) == 0)
{
ptr->time = *now;
return 0;
}
return 1;
}
/* Look for an identical request, as opposed to a complementary
one as find_match does */
CTL_MSG *
find_request (CTL_MSG *request)
{
return lookup_request (request, exact_comp);
}
#define MAX_ID 16000
/* Generate a unique non-zero sequence number */
int
new_id (void)
{
static int current_id = 0;
current_id = (current_id + 1) % MAX_ID;
/* 0 is reserved, helps to pick up bugs */
if (current_id == 0)
current_id = 1;
return current_id;
}
int
insert_table (CTL_MSG *request, CTL_RESPONSE *response)
{
table_t *ptr;
ptr = malloc (sizeof *ptr);
if (!ptr)
{
syslog (LOG_ERR, "Out of memory");
exit (EXIT_FAILURE);
}
request->id_num = new_id ();
if (debug)
print_request ("insert_table", request);
response->id_num = htonl (request->id_num);
time (&ptr->time);
ptr->request = *request;
ptr->prev = NULL;
ptr->next = table;
table = ptr;
return 0;
}
/* Delete the invitation with id 'id_num' */
int
delete_invite (unsigned long id_num)
{
table_t *ptr;
for (ptr = table; ptr; ptr = ptr->next)
if (ptr->request.id_num == id_num)
{
table_delete (ptr);
return SUCCESS;
}
return NOT_HERE;
}
|
