2 * mem.c Memory allocation, deallocation stuff.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 * Copyright 2000,2001 The FreeRADIUS server project
21 * Copyright 2001 hereUare Communications, Inc. <raghud@hereuare.com>
26 static const char rcsid[] = "$Id$";
29 * Allocate a new EAP_PACKET
31 EAP_PACKET *eap_packet_alloc(void)
35 rp = rad_malloc(sizeof(EAP_PACKET));
36 memset(rp, 0, sizeof(EAP_PACKET));
43 void eap_packet_free(EAP_PACKET **eap_packet_ptr)
45 EAP_PACKET *eap_packet;
47 if (!eap_packet_ptr) return;
48 eap_packet = *eap_packet_ptr;
49 if (!eap_packet) return;
51 if (eap_packet->type.data) {
53 * This is just a pointer in the packet
54 * so we do not free it but we NULL it
55 free(eap_packet->type.data);
57 eap_packet->type.data = NULL;
60 if (eap_packet->packet) {
61 free(eap_packet->packet);
62 eap_packet->packet = NULL;
67 *eap_packet_ptr = NULL;
71 * Allocate a new EAP_PACKET
73 EAP_DS *eap_ds_alloc(void)
77 eap_ds = rad_malloc(sizeof(EAP_DS));
78 memset(eap_ds, 0, sizeof(EAP_DS));
79 if ((eap_ds->response = eap_packet_alloc()) == NULL) {
83 if ((eap_ds->request = eap_packet_alloc()) == NULL) {
91 void eap_ds_free(EAP_DS **eap_ds_p)
95 if (!eap_ds_p) return;
100 if (eap_ds->response) eap_packet_free(&(eap_ds->response));
101 if (eap_ds->request) eap_packet_free(&(eap_ds->request));
108 * Allocate a new EAP_HANDLER
110 EAP_HANDLER *eap_handler_alloc(void)
112 EAP_HANDLER *handler;
114 handler = rad_malloc(sizeof(EAP_HANDLER));
115 memset(handler, 0, sizeof(EAP_HANDLER));
119 void eap_handler_free(EAP_HANDLER **handler_p)
121 EAP_HANDLER *handler;
123 if ((handler_p == NULL) || (*handler_p == NULL))
126 handler = *handler_p;
127 if (handler->identity) {
128 free(handler->identity);
129 handler->identity = NULL;
132 if (handler->prev_eapds) eap_ds_free(&(handler->prev_eapds));
133 if (handler->eap_ds) eap_ds_free(&(handler->eap_ds));
135 if ((handler->opaque) && (handler->free_opaque)) {
136 handler->free_opaque(handler->opaque);
137 handler->opaque = NULL;
139 else if ((handler->opaque) && (handler->free_opaque == NULL))
140 radlog(L_ERR, "Possible memory leak ...");
142 handler->opaque = NULL;
143 handler->free_opaque = NULL;
144 handler->next = NULL;
150 void eaptype_free(EAP_TYPES *i)
152 if (i->type->detach) (i->type->detach)(i->type_data);
154 if (i->handle) lt_dlclose(i->handle);
157 void eaplist_free(rlm_eap_t *inst)
162 * The sessions are split out into an array, which makes
163 * looking them up a bit faster.
165 for (i = 0; i < 256; i++) {
166 EAP_HANDLER *node, *next;
168 if (inst->sessions[i]) continue;
170 node = inst->sessions[i];
173 eap_handler_free(&node);
177 inst->sessions[i] = NULL;
182 * Add a handler to the set of active sessions.
184 * Since we're adding it to the list, we guess that this means
185 * the packet needs a State attribute. So add one.
187 int eaplist_add(rlm_eap_t *inst, EAP_HANDLER *handler)
192 rad_assert(handler != NULL);
193 rad_assert(handler->request != NULL);
196 * Generate State, since we've been asked to add it to
199 state = generate_state(handler->request->timestamp);
200 pairadd(&(handler->request->reply->vps), state);
203 * Create a unique 'key' for the handler, based
204 * on State, Client-IP-Address, and EAP ID.
206 rad_assert(state->length == EAP_STATE_LEN);
208 memcpy(handler->state, state->strvalue, sizeof(handler->state));
209 handler->src_ipaddr = handler->request->packet->src_ipaddr;
210 handler->eap_id = handler->eap_ds->request->id;
214 * Playing with a data structure shared among threads
215 * means that we need a lock, to avoid conflict.
217 pthread_mutex_lock(&(inst->session_mutex));
221 * We key the array based on the challenge, which is
222 * a random number. This "fans out" the sessions, and
223 * helps to minimize the amount of work we've got to do
226 last = &(inst->sessions[state->strvalue[0]]);
228 while (*last) last = &((*last)->next);
233 pthread_mutex_unlock(&(inst->session_mutex));
237 * The time at which this request was made was the time
238 * at which it was received by the RADIUS server.
240 handler->timestamp = handler->request->timestamp;
242 handler->next = NULL;
245 * We don't need this any more.
247 handler->request = NULL;
253 * Find a a previous EAP-Request sent by us, which matches
254 * the current EAP-Response.
256 * Then, release the handle from the list, and return it to
259 * Also since we fill the eap_ds with the present EAP-Response we
260 * got to free the prev_eapds & move the eap_ds to prev_eapds
262 EAP_HANDLER *eaplist_find(rlm_eap_t *inst, REQUEST *request,
263 eap_packet_t *eap_packet)
265 EAP_HANDLER *node, *next;
267 EAP_HANDLER **first, **last;
270 * We key the sessions off of the 'state' attribute, so it
273 state = pairfind(request->packet->vps, PW_STATE);
275 (state->length != EAP_STATE_LEN)) {
281 * Playing with a data structure shared among threads
282 * means that we need a lock, to avoid conflict.
284 pthread_mutex_lock(&(inst->session_mutex));
287 last = first = &(inst->sessions[state->strvalue[0]]);
289 for (node = *first; node; node = next) {
293 * If the time on this entry has expired,
294 * delete it. We do this while walking the list,
295 * in order to spread out the work of deleting old
298 if ((request->timestamp - node->timestamp) > inst->timer_limit) {
300 eap_handler_free(&node);
305 * Find the previous part of the same conversation,
306 * keying off of the EAP ID, the client IP, and
307 * the State attribute.
309 * If we've found a conversation, then we don't
310 * have to check entries later in the list for
311 * timeout, as they're guaranteed to be newer than
314 if ((node->eap_id == eap_packet->id) &&
315 (node->src_ipaddr == request->packet->src_ipaddr) &&
316 (memcmp(node->state, state->strvalue, state->length) == 0)) {
318 * Check against replays. The client can
319 * re-play a State attribute verbatim, so
320 * we wish to ensure that the attribute falls
321 * within the valid time window, which is
322 * the second at which it was sent out.
324 if (verify_state(state, node->timestamp) != 0) {
325 radlog(L_ERR, "rlm_eap: State verification failed.");
330 DEBUG2(" rlm_eap: Request found, released from the list");
332 * detach the node from the list
338 * Don't bother updating handler->request, etc.
339 * eap_handler() will do that for us.
343 * Remember what the previous request was.
345 eap_ds_free(&(node->prev_eapds));
346 node->prev_eapds = node->eap_ds;
354 last = &(node->next);
359 pthread_mutex_unlock(&(inst->session_mutex));
363 DEBUG2(" rlm_eap: Request not found in the list");