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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
|
/*
* Copyright (c) 1983, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
#if 0
static char sccsid[] = "@(#)table.c 8.1 (Berkeley) 6/4/93";
#endif
static const char rcsid[] =
"$Id$";
#endif /* not lint */
/*
* Routines to handle insertion, deletion, etc on the table
* of requests kept by the daemon. Nothing fancy here, linear
* search on a double-linked list. A time is kept with each
* entry so that overly old invitations can be eliminated.
*
* Consider this a mis-guided attempt at modularity
*/
#include <sys/param.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <protocols/talkd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <unistd.h>
#define MAX_ID 16000 /* << 2^15 so I don't have sign troubles */
#define NIL ((TABLE_ENTRY *)0)
extern int debug;
struct timeval tp;
struct timezone txp;
typedef struct table_entry TABLE_ENTRY;
struct table_entry {
CTL_MSG request;
long time;
TABLE_ENTRY *next;
TABLE_ENTRY *last;
};
TABLE_ENTRY *table = NIL;
void delete __P((TABLE_ENTRY *));
CTL_MSG *find_request();
CTL_MSG *find_match();
int new_id __P((void));
void print_request __P((char *, CTL_MSG *));
/*
* Look in the table for an invitation that matches the current
* request looking for an invitation
*/
CTL_MSG *
find_match(request)
register CTL_MSG *request;
{
register TABLE_ENTRY *ptr;
time_t current_time;
gettimeofday(&tp, &txp);
current_time = tp.tv_sec;
if (debug)
print_request("find_match", request);
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if ((ptr->time - current_time) > MAX_LIFE) {
/* the entry is too old */
if (debug)
print_request("deleting expired entry",
&ptr->request);
delete(ptr);
continue;
}
if (debug)
print_request("", &ptr->request);
if (strcmp(request->l_name, ptr->request.r_name) == 0 &&
strcmp(request->r_name, ptr->request.l_name) == 0 &&
ptr->request.type == LEAVE_INVITE)
return (&ptr->request);
}
return ((CTL_MSG *)0);
}
/*
* Look for an identical request, as opposed to a complimentary
* one as find_match does
*/
CTL_MSG *
find_request(request)
register CTL_MSG *request;
{
register TABLE_ENTRY *ptr;
time_t current_time;
gettimeofday(&tp, &txp);
current_time = tp.tv_sec;
/*
* See if this is a repeated message, and check for
* out of date entries in the table while we are it.
*/
if (debug)
print_request("find_request", request);
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if ((ptr->time - current_time) > MAX_LIFE) {
/* the entry is too old */
if (debug)
print_request("deleting expired entry",
&ptr->request);
delete(ptr);
continue;
}
if (debug)
print_request("", &ptr->request);
if (strcmp(request->r_name, ptr->request.r_name) == 0 &&
strcmp(request->l_name, ptr->request.l_name) == 0 &&
request->type == ptr->request.type &&
request->pid == ptr->request.pid) {
/* update the time if we 'touch' it */
ptr->time = current_time;
return (&ptr->request);
}
}
return ((CTL_MSG *)0);
}
void
insert_table(request, response)
CTL_MSG *request;
CTL_RESPONSE *response;
{
register TABLE_ENTRY *ptr;
time_t current_time;
gettimeofday(&tp, &txp);
current_time = tp.tv_sec;
request->id_num = new_id();
response->id_num = htonl(request->id_num);
/* insert a new entry into the top of the list */
ptr = (TABLE_ENTRY *)malloc(sizeof(TABLE_ENTRY));
if (ptr == NIL) {
syslog(LOG_ERR, "insert_table: Out of memory");
_exit(1);
}
ptr->time = current_time;
ptr->request = *request;
ptr->next = table;
if (ptr->next != NIL)
ptr->next->last = ptr;
ptr->last = NIL;
table = ptr;
}
/*
* Generate a unique non-zero sequence number
*/
int
new_id()
{
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);
}
/*
* Delete the invitation with id 'id_num'
*/
int
delete_invite(id_num)
int id_num;
{
register TABLE_ENTRY *ptr;
ptr = table;
if (debug)
syslog(LOG_DEBUG, "delete_invite(%d)", id_num);
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if (ptr->request.id_num == id_num)
break;
if (debug)
print_request("", &ptr->request);
}
if (ptr != NIL) {
delete(ptr);
return (SUCCESS);
}
return (NOT_HERE);
}
/*
* Classic delete from a double-linked list
*/
void
delete(ptr)
register TABLE_ENTRY *ptr;
{
if (debug)
print_request("delete", &ptr->request);
if (table == ptr)
table = ptr->next;
else if (ptr->last != NIL)
ptr->last->next = ptr->next;
if (ptr->next != NIL)
ptr->next->last = ptr->last;
free((char *)ptr);
}
|
