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
|
/*
* Copyright (c) 1983 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:
*
* - Redistributions of source code must retain the above
* copyright notice, this list of conditions and the following
* disclaimer.
*
* - 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.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR
* 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.
*
* (BSD License, from tdelibs/doc/common/bsd-license.html)
*/
/*
* 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.
*/
#include "table.h"
#include <sys/param.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#include <syslog.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <signal.h>
#include "proto.h"
#include "defs.h"
#include "machines/forwmach.h"
#define MAX_ID 16000 /* << 2^15 so I don't have sign troubles */
#define NIL ((TABLE_ENTRY *)0)
/*
* Look in the table for an invitation that matches the current
* request looking for an invitation
*/
NEW_CTL_MSG * KTalkdTable::find_match(NEW_CTL_MSG *request)
{
register TABLE_ENTRY *ptr;
time_t current_time;
(void) gettimeofday(&tp, &txp);
current_time = tp.tv_sec;
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if ((ptr->time - current_time) > MAX_LIFE) {
/* the entry is too old */
ktalk_debug("deleting expired entry : id %d",
ptr->request.id_num);
delete_entry(ptr);
continue;
}
if ((strcmp(request->l_name, ptr->request.r_name) == 0) &&
(strcmp(request->r_name, ptr->request.l_name) == 0) &&
(ptr->request.type == LEAVE_INVITE) && (ptr->fwm == 0L))
{ /* Not the forw. machines : they aren't stored to match LOOK_UPs */
ktalk_debug("Found match : id %d", ptr->request.id_num);
return (&ptr->request);
}
}
return ((NEW_CTL_MSG *)0);
}
/*
* Look for an identical request, as opposed to a complimentary
* one as find_match does
*/
NEW_CTL_MSG * KTalkdTable::find_request(NEW_CTL_MSG *request)
{
register TABLE_ENTRY *ptr;
time_t current_time;
(void) 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.
*/
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if ((ptr->time - current_time) > MAX_LIFE) {
/* the entry is too old */
ktalk_debug("deleting expired entry : id %d",
ptr->request.id_num);
delete_entry(ptr);
continue;
}
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;
ktalk_debug("Found identical request : id %d", ptr->request.id_num);
return (&ptr->request);
}
}
return ((NEW_CTL_MSG *)0);
}
void KTalkdTable::insert_table(NEW_CTL_MSG *request, NEW_CTL_RESPONSE *response, ForwMachine * fwm)
{
register TABLE_ENTRY *ptr;
time_t current_time;
gettimeofday(&tp, &txp);
current_time = tp.tv_sec;
request->id_num = new_id();
ktalk_debug("Stored as id %d",request->id_num);
if (response != 0L) response->id_num = htonl(request->id_num);
/* insert a new entry into the top of the list */
ptr = new TABLE_ENTRY;
if (ptr == NIL) {
syslog(LOG_ERR, "insert_table: Out of memory");
_exit(1);
}
ptr->fwm = fwm;
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 KTalkdTable::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 KTalkdTable::delete_invite(uint32_t id_num)
{
register TABLE_ENTRY *ptr;
ptr = table;
ktalk_debug("delete_invite(%d)", id_num);
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if (ptr->request.id_num == id_num)
break;
}
if (ptr != NIL) {
if (ptr->fwm) {
ptr->fwm->sendDelete(); // Calls processDelete() in the child process.
}
ktalk_debug("Deleted : id %d", ptr->request.id_num);
delete_entry(ptr);
return (SUCCESS);
}
return (NOT_HERE);
}
/*
* Classic delete from a double-linked list
*/
void KTalkdTable::delete_entry(register TABLE_ENTRY *ptr)
{
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;
delete ptr;
}
KTalkdTable::~KTalkdTable()
{
register TABLE_ENTRY *ptr;
ptr = table;
ktalk_debug("final_clean()");
for (ptr = table; ptr != 0L; ptr = ptr->next) {
if (ptr->fwm != 0L)
{
ktalk_debug("CLEAN : Found a forwarding machine to clean : id %d",ptr->request.id_num);
delete ptr->fwm;
}
ktalk_debug("CLEAN : Deleting id %d", ptr->request.id_num);
delete_entry(ptr);
}
}
|
