2 * rlm_dbm.c authorize: authorize using ndbm database
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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
20 * Copyright 2001 Koulik Andrei, Sandy Service
21 * Copyright 2006 The FreeRADIUS server project
24 #include <freeradius-devel/ident.h>
27 #include <freeradius-devel/autoconf.h>
36 #ifdef HAVE_GDBM_NDBM_H
37 #include <gdbm/ndbm.h>
40 #ifdef HAVE_GDBMNDBM_H
41 #include <gdbm-ndbm.h>
46 #include <freeradius-devel/radiusd.h>
47 #include <freeradius-devel/modules.h>
50 # include "sandymod.h"
54 #define get_user_content dbm_fetch
56 #define SM_JOIN_ATTR 1029
59 # define SM_POOL_ATTR 510
62 typedef struct rlm_dbm_t {
72 typedef struct user_entry {
74 struct user_entry * next;
78 static const CONF_PARSER module_config[] = {
79 { "usersfile", PW_TYPE_STRING_PTR,offsetof(struct rlm_dbm_t,userfile),
81 { NULL, -1, 0, NULL, NULL }
84 static void sm_user_list_wipe (SM_USER_ENTRY **ue) {
86 SM_USER_ENTRY * pue, *nue;
91 while ( pue != NULL ) {
93 DEBUG2("Remove %s from user list", pue -> username);
94 free(pue -> username);
102 * add username un to user list ue;
103 * return 0 if user succefuly added
104 * 1 - if username already exists
105 * -1 - error: no memmory
108 static int sm_user_list_add(SM_USER_ENTRY **ue, const char *un) {
111 if ( strcmp( (*ue) -> username, un) == 0 ) return 1;
112 ue = & ((*ue) -> next);
114 *ue = malloc(sizeof(SM_USER_ENTRY));
115 if ( !*ue ) return -1;
116 (*ue) -> username = strdup(un);
117 DEBUG2("Add %s to user list", (*ue) -> username);
118 (*ue) -> next = NULL ;
119 if ( ! (*ue) -> username ) {
136 static int isfallthrough(VALUE_PAIR *vp) {
139 tmp = pairfind(vp, PW_FALL_THROUGH);
140 return tmp ? tmp -> lvalue : 1; /* if no FALL_THROUGH - keep looking */
144 * find user, parse and return result
147 * username - user name from request
148 * request - pair originated from the nas
149 * mode - search mode SM_SM_ACCUM - accumulative search mode
152 * parsed_users - list of parsed user names for loop removal
155 static int sm_parse_user(DBM *pdb, const char * username, VALUE_PAIR const* request, VALUE_PAIR **config,
156 VALUE_PAIR **reply, SM_USER_ENTRY **ulist)
159 int retcod, found = RLM_MODULE_NOTFOUND, res ;
160 VALUE_PAIR *vp = NULL,* tmp_config = NULL, *tmp_reply = NULL, *nu_reply = NULL;
161 VALUE_PAIR *join_attr;
164 int parse_state = SMP_PATTERN;
165 int continue_search = 1;
169 DEBUG2("sm_parse_user.c: check for loops");
171 if ( (retcod = sm_user_list_add(ulist,username) ) ) {
172 if ( retcod < 0 ) radlog(L_ERR,"rlm_dbm: Couldn't allocate memory");
173 else radlog(L_ERR,"rlm_dbm: Invalid configuration: loop detected");
174 return RLM_MODULE_FAIL;
177 /* retrieve user content */
180 k.dsize = strlen(username) + 1 ; /* username stored with '\0' */
182 d = dbm_fetch(pdb, k);
183 if ( d.dptr == NULL ) {
184 DEBUG2("rlm_dbm: User <%s> not foud in database\n",username);
185 return RLM_MODULE_NOTFOUND;
189 ch [ d.dsize - 1 ] = '\0'; /* should be closed by 0 */
191 DEBUG2("sm_parse_user: start parsing: user: %s", username);
193 /* start parse content */
194 while ( parse_state != SMP_ERROR && *ch && continue_search ) {
198 while( *ch && *ch != '\n') ch++ ;
200 if ( *ch == '\n' ) { *ch = 0; ch++; }
202 DEBUG2("parse buffer: <<%s>>\n",beg);
204 retcod = userparse(beg,&vp);
205 if ( retcod == T_OP_INVALID ) librad_perror("parse error ");
208 case T_COMMA: break; /* continue parse the current list */
209 case T_EOL: DEBUG2("rlm_dbm: recod parsed\n"); /* vp contains full pair list */
210 if ( parse_state == SMP_PATTERN ) { /* pattern line found */
211 DEBUG2("process pattern");
212 /* check pattern against request */
213 if ( paircompare(NULL, request, vp, reply ) == 0 ) {
214 DEBUG2("rlm_dbm: Pattern matched, look for request");
215 pairmove(&tmp_config, &vp);
217 parse_state = SMP_REPLY; /* look for reply */
220 DEBUG2("rlm_dbm: patern not matched, reply skiped");
222 while ( *ch && *ch !='\n' ) ch++;
223 if ( *ch == '\n' ) ch++;
225 } else { /* reply line found */
226 /* look for join-attribute */
227 DEBUG2("rlm_dbm: Reply found");
229 while( (join_attr = pairfind(join_attr,SM_JOIN_ATTR) ) != NULL ) {
230 DEBUG2("rlm_dbm: Proccess nested record: username %s",
231 (char *)join_attr->vp_strvalue);
232 /* res = RLM_MODULE_NOTFOUND; */
233 res = sm_parse_user(pdb, (char *)join_attr->vp_strvalue, request, &tmp_config,
235 DEBUG("rlm_dbm: recived: %d\n",res);
237 case RLM_MODULE_NOTFOUND:
240 default: /* seems error code */
241 parse_state = SMP_ERROR;
242 DEBUG2("rlm_dbm: Nested record error\n");
245 join_attr = join_attr -> next;
247 pairdelete(&vp,SM_JOIN_ATTR);
248 if ( parse_state != SMP_ERROR ) {
249 if ( ! isfallthrough(vp) ) {
251 DEBUG2("rlm_dbm: Break search due Fall-Through = no");
253 pairmove(&vp,&nu_reply);
255 pairmove(&tmp_reply,&vp);
257 parse_state = SMP_PATTERN;
258 found = RLM_MODULE_OK;
261 pairfree(&nu_reply); }
263 default: /* we do not wait that !!!! */
264 parse_state = SMP_ERROR;
265 DEBUG2("rlm_dbm: Unknown token: %d\n",retcod);
270 if ( parse_state == SMP_PATTERN ) {
271 pairmove(config,&tmp_config);
272 pairfree(&tmp_config);
273 pairmove(reply,&tmp_reply);
274 pairfree(&tmp_reply);
276 pairfree(&tmp_config);
277 pairfree(&tmp_reply);
279 DEBUG2("rlm_dbm: Bad final parse state: %d\n",parse_state);
280 found = RLM_MODULE_FAIL ;
286 static int sm_postprocessor(VALUE_PAIR **reply UNUSED) {
290 static int rlm_dbm_instantiate(CONF_SECTION *conf, void **instance) {
291 struct rlm_dbm_t *inst;
293 inst = rad_malloc(sizeof(rlm_dbm_t));
297 memset(inst, 0, sizeof(*inst));
299 if (cf_section_parse(conf, inst, module_config) < 0) {
306 static int rlm_dbm_authorize(void *instance, REQUEST *request)
308 VALUE_PAIR *namepair;
309 VALUE_PAIR *request_pairs;
310 VALUE_PAIR *check_tmp = NULL;
311 VALUE_PAIR *reply_tmp = NULL;
315 SM_USER_ENTRY *ulist = NULL;
318 struct rlm_dbm_t *inst = instance;
320 VALUE_PAIR **check_pairs, **reply_pairs;
322 request_pairs = request->packet->vps;
323 check_pairs = &request->config_items;
324 reply_pairs = &request->reply->vps;
327 * Grab the canonical user name.
329 namepair = request->username;
330 name = namepair ? (char *) namepair->vp_strvalue : "NONE";
332 DEBUG2("rlm_dbm: try open database file: %s\n",inst -> userfile);
335 if ( ( pdb = dbm_open(inst->userfile, O_RDONLY, 0600) ) != NULL ) {
336 DEBUG("rlm_dbm: Call parse_user:\n");
337 found = sm_parse_user(pdb, name, request_pairs, &check_tmp, &reply_tmp, &ulist);
338 if ( found == RLM_MODULE_NOTFOUND ) {
339 sm_user_list_wipe(&ulist);
340 found = sm_parse_user(pdb, "DEFAULT", request_pairs, &check_tmp, &reply_tmp, &ulist);
344 found = RLM_MODULE_FAIL;
345 DEBUG2("rlm_dbm: Cannot open database file: %s\n",
349 if ( found == RLM_MODULE_OK ) {
350 /* do preprocessor for final reply-pair tranformation */
351 if ( !sm_postprocessor(&reply_tmp) ) {
352 pairmove(reply_pairs, &reply_tmp);
353 pairmove(check_pairs, &check_tmp);
354 } else found = RLM_MODULE_FAIL;
356 sm_user_list_wipe(&ulist);
357 pairfree(&reply_tmp);
358 pairfree(&check_tmp);
363 static int rlm_dbm_detach(void *instance)
365 struct rlm_dbm_t *inst = instance;
371 /* globally exported name */
375 0, /* type: reserved */
376 rlm_dbm_instantiate, /* instantiation */
377 rlm_dbm_detach, /* detach */
379 NULL, /* authentication */
380 rlm_dbm_authorize, /* authorization */
381 NULL, /* preaccounting */
382 NULL, /* accounting */
383 NULL, /* checksimul */
384 NULL, /* pre-proxy */
385 NULL, /* post-proxy */