The FreeRADIUS server $Id: 15bac2a4c627c01d1aa2047687b3418955ac7f00 $
Loading...
Searching...
No Matches
rlm_perl.c
Go to the documentation of this file.
1/*
2 * This program is is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License as published by
4 * the Free Software Foundation; either version 2 of the License, or (at
5 * your option) any later version.
6 *
7 * This program is distributed in the hope that it will be useful,
8 * but WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10 * GNU General Public License for more details.
11 *
12 * You should have received a copy of the GNU General Public License
13 * along with this program; if not, write to the Free Software
14 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
15 */
16
17/**
18 * $Id: 2190b02cf5e1489a1a1d8883eab6addcc2099fd6 $
19 * @file rlm_perl.c
20 * @brief Translates requests between the server an a perl interpreter.
21 *
22 * @copyright 2002,2006 The FreeRADIUS server project
23 * @copyright 2002 Boian Jordanov (bjordanov@orbitel.bg)
24 */
25RCSID("$Id: 2190b02cf5e1489a1a1d8883eab6addcc2099fd6 $")
26
27#define LOG_PREFIX "perl"
28
29#include <freeradius-devel/server/base.h>
30#include <freeradius-devel/server/module_rlm.h>
31#include <freeradius-devel/util/debug.h>
32#include <freeradius-devel/unlang/xlat_func.h>
33#include <freeradius-devel/unlang/xlat.h>
34#include <freeradius-devel/radius/radius.h>
35
37DIAG_OFF(compound-token-split-by-macro) /* Perl does horrible things with macros */
39
40#ifdef INADDR_ANY
41# undef INADDR_ANY
42#endif
43#include <EXTERN.h>
44#include <perl.h>
45#include <XSUB.h>
46#include <dlfcn.h>
47#include <semaphore.h>
48
49#if defined(__APPLE__) || defined(__FreeBSD__)
50extern char **environ;
51#endif
52
53#ifndef USE_ITHREADS
54# error perl must be compiled with USE_ITHREADS
55#endif
56
57typedef struct {
58 char const *function_name; //!< Name of the function being called
59 char *name1; //!< Section name1 where this is called
60 char *name2; //!< Section name2 where this is called
61 fr_rb_node_t node; //!< Node in tree of function calls.
63
64typedef struct {
67
71
72/*
73 * Define a structure for our module configuration.
74 *
75 * These variables do not need to be in a structure, but it's
76 * a lot cleaner to do so, and a pointer to the structure can
77 * be used as the instance handle.
78 */
79typedef struct {
80 /* Name of the perl module */
81 char const *module;
82
83 fr_rb_tree_t funcs; //!< Tree of function calls found by call_env parser.
84 bool funcs_init; //!< Has the tree been initialised.
85 char const *func_detach; //!< Function to run when mod_detach is run.
86 char const *perl_flags;
87 PerlInterpreter *perl;
89 HV *rad_perlconf_hv; //!< holds "config" items (perl %RAD_PERLCONF hash).
91
93
94typedef struct {
95 PerlInterpreter *perl; //!< Thread specific perl interpreter.
97
98/*
99 * C structure associated with tied hashes and arrays
100 */
103 fr_dict_attr_t const *da; //!< Dictionary attribute associated with hash / array.
104 fr_pair_t *vp; //!< Real pair associated with the hash / array, if it exists.
105 unsigned int idx; //!< Instance number.
106 fr_perl_pair_t *parent; //!< Parent attribute data.
107 fr_dcursor_t cursor; //!< Cursor used for iterating over the keys of a tied hash.
108};
109
110/*
111 * Dummy Magic Virtual Table used to ensure we retrieve the correct magic data
112 */
113static MGVTBL rlm_perl_vtbl = { 0, 0, 0, 0, 0, 0, 0, 0 };
114
115static void *perl_dlhandle; //!< To allow us to load perl's symbols into the global symbol table.
116
117/*
118 * A mapping of configuration file names to internal variables.
119 */
120static const conf_parser_t module_config[] = {
122
123 { FR_CONF_OFFSET("func_detach", rlm_perl_t, func_detach), .data = NULL, .dflt = "detach", .quote = T_INVALID },
124
125 { FR_CONF_OFFSET("perl_flags", rlm_perl_t, perl_flags) },
126
128};
129
130/** How to compare two Perl function calls
131 *
132 */
133static int8_t perl_func_def_cmp(void const *one, void const *two)
134{
135 perl_func_def_t const *a = one, *b = two;
136 int ret;
137
138 ret = strcmp(a->name1, b->name1);
139 if (ret != 0) return CMP(ret, 0);
140 if (!a->name2 && !b->name2) return 0;
141 if (!a->name2 || !b->name2) return a->name2 ? 1 : -1;
142 ret = strcmp(a->name2, b->name2);
143 return CMP(ret, 0);
144}
145
146/*
147 * man perlembed
148 */
149EXTERN_C void boot_DynaLoader(pTHX_ CV* cv);
150
151static _Thread_local request_t *rlm_perl_request;
152
153# define dl_librefs "DynaLoader::dl_librefs"
154# define dl_modules "DynaLoader::dl_modules"
155static void rlm_perl_clear_handles(pTHX)
156{
157 AV *librefs = get_av(dl_librefs, false);
158 if (librefs) {
159 av_clear(librefs);
160 }
161}
162
163static void **rlm_perl_get_handles(pTHX)
164{
165 I32 i;
166 AV *librefs = get_av(dl_librefs, false);
167 AV *modules = get_av(dl_modules, false);
168 void **handles;
169
170 if (!librefs) return NULL;
171
172 if (!(AvFILL(librefs) >= 0)) {
173 return NULL;
174 }
175
176 MEM(handles = talloc_array(NULL, void *, AvFILL(librefs) + 2));
177 for (i = 0; i <= AvFILL(librefs); i++) {
178 void *handle;
179 SV *handle_sv = *av_fetch(librefs, i, false);
180 if (!handle_sv) {
181 ERROR("Could not fetch $%s[%d]!", dl_librefs, (int)i);
182 continue;
183 }
184 handle = (void *)SvIV(handle_sv);
185
186 if (handle) handles[i] = handle;
187 }
188
189 av_clear(modules);
190 av_clear(librefs);
191
192 handles[i] = (void *)0;
193
194 return handles;
195}
196
197static void rlm_perl_close_handles(void **handles)
198{
199 int i;
200
201 if (!handles) {
202 return;
203 }
204
205 for (i = 0; handles[i]; i++) {
206 DEBUG("Close %p", handles[i]);
207 dlclose(handles[i]);
208 }
209
210 talloc_free(handles);
211}
212
213/*
214 * This is wrapper for fr_log
215 * Now users can call freeradius::log(level,msg) which is the same
216 * as calling fr_log from C code.
217 */
218static XS(XS_freeradius_log)
219{
220 dXSARGS;
221 if (items !=2)
222 croak("Usage: radiusd::log(level, message)");
223 {
224 int level;
225 char *msg;
226
227 level = (int) SvIV(ST(0));
228 msg = (char *) SvPV(ST(1), PL_na);
229
230 /*
231 * Because 'msg' is a 'char *', we don't want '%s', etc.
232 * in it to give us printf-style vulnerabilities.
233 */
234 fr_log(&default_log, level, __FILE__, __LINE__, "rlm_perl: %s", msg);
235 }
236 XSRETURN_NO;
237}
238
239/*
240 * This is a wrapper for xlat_aeval
241 * Now users are able to get data that is accessible only via xlat
242 * e.g. %request.client(...)
243 * Call syntax is freeradius::xlat(string), string will be handled as
244 * a double-quoted string in the configuration files.
245 */
246static XS(XS_freeradius_xlat)
247{
248 dXSARGS;
249 char *in_str;
250 char *expanded;
251 ssize_t slen;
252 request_t *request;
253
254 if (items != 1) croak("Usage: radiusd::xlat(string)");
255
256 request = rlm_perl_request;
257
258 in_str = (char *) SvPV(ST(0), PL_na);
259
260 slen = xlat_aeval(request, &expanded, request, in_str, NULL, NULL);
261 if (slen < 0) {
262 REDEBUG("Error parsing xlat '%s'", in_str);
263 XSRETURN_UNDEF;
264 }
265
266 XST_mPV(0, expanded);
267 talloc_free(expanded);
268 XSRETURN(1);
269}
270
271/** Helper function for turning hash keys into dictionary attributes
272 *
273 */
274static inline fr_dict_attr_t const *perl_attr_lookup(fr_perl_pair_t *pair_data, char const *attr)
275{
276 fr_dict_attr_t const *da = fr_dict_attr_by_name(NULL, pair_data->da, attr);
277
278 /*
279 * Allow fallback to internal attributes if the parent is a group or dictionary root.
280 */
281 if (!da && (fr_type_is_group(pair_data->da->type) || pair_data->da->flags.is_root)) {
283 }
284
285 if (!da) croak("Unknown or invalid attribute name \"%s\"", attr);
286
287 return da;
288}
289
290/** Convenience macro for fetching C data associated with tied hash / array and validating stack size
291 *
292 */
293#define GET_PAIR_MAGIC(count) MAGIC *mg = mg_findext(ST(0), PERL_MAGIC_ext, &rlm_perl_vtbl); \
294 fr_perl_pair_t *pair_data; \
295 if (unlikely(items < count)) { \
296 croak("Expected %d stack entries, got %d", count, items); \
297 XSRETURN_UNDEF; \
298 } \
299 if (!mg) { \
300 croak("Failed to find Perl magic value"); \
301 XSRETURN_UNDEF; \
302 } \
303 pair_data = (fr_perl_pair_t *)mg->mg_ptr;
304
305/** Functions to implement subroutines required for a tied hash
306 *
307 * All structural components of attributes are represented by tied hashes
308 */
309
310/** Called when fetching hash values
311 *
312 * The stack contains
313 * - the tied SV
314 * - the hash key being requested
315 *
316 * When a numeric key is requested, we treat that as in instruction to find
317 * a specific instance of the key of the parent.
318 *
319 * Whilst this is a bit odd, the alternative would be for every attribute to
320 * be returned as an array so you would end up with crazy syntax like
321 * p{'request'}{'Vendor-Specific'}[0]{'Cisco'}[0]{'AVPair}[0]
322 */
323static XS(XS_pairlist_FETCH)
324{
325 dXSARGS;
326 char *attr;
327 fr_dict_attr_t const *da;
328 fr_pair_t *vp = NULL;
329 STRLEN len, i = 0;
330 int idx = 0;
331
333
334 attr = (char *) SvPV(ST(1), len);
335
336 /*
337 * Check if our key is entirely numeric.
338 */
339 while (i < len) {
340 if (!isdigit(attr[i])) break;
341 i++;
342 }
343 if (i == len) {
344 idx = SvIV(ST(1));
345 da = pair_data->da;
346 if (pair_data->parent->vp) vp = fr_pair_find_by_da_idx(&pair_data->parent->vp->vp_group, da, idx);
347 } else {
348 da = perl_attr_lookup(pair_data, attr);
349 if (!da) XSRETURN_UNDEF;
350 if (pair_data->vp) vp = fr_pair_find_by_da(&pair_data->vp->vp_group, NULL, da);
351 }
352
353 switch(da->type) {
354 /*
355 * Leaf attributes are returned as an array with magic
356 */
357 case FR_TYPE_LEAF:
358 {
359 AV *pair_av;
360 SV *pair_tie;
361 HV *frpair_stash;
362 fr_perl_pair_t child_pair_data;
363
364 frpair_stash = gv_stashpv("freeradiuspairs", GV_ADD);
365 pair_av = newAV();
366 pair_tie = newRV_noinc((SV *)newAV());
367 sv_bless(pair_tie, frpair_stash);
368 sv_magic(MUTABLE_SV(pair_av), MUTABLE_SV((GV *)pair_tie), PERL_MAGIC_tied, NULL, 0);
369 SvREFCNT_dec(pair_tie);
370
371 child_pair_data = (fr_perl_pair_t) {
372 .vp = vp,
373 .da = da,
374 .parent = pair_data
375 };
376 sv_magicext((SV *)pair_tie, 0, PERL_MAGIC_ext, &rlm_perl_vtbl, (char *)&child_pair_data, sizeof(child_pair_data));
377 ST(0) = sv_2mortal(newRV((SV *)pair_av));
378 }
379 break;
380
381 /*
382 * Structural attributes are returned as a hash with magic
383 */
385 {
386 HV *struct_hv;
387 SV *struct_tie;
388 HV *frpair_stash;
389 fr_perl_pair_t child_pair_data;
390
391 frpair_stash = gv_stashpv("freeradiuspairlist", GV_ADD);
392 struct_hv = newHV();
393 struct_tie = newRV_noinc((SV *)newHV());
394 sv_bless(struct_tie, frpair_stash);
395 hv_magic(struct_hv, (GV *)struct_tie, PERL_MAGIC_tied);
396 SvREFCNT_dec(struct_tie);
397
398 child_pair_data = (fr_perl_pair_t) {
399 .vp = vp,
400 .da = da,
401 .parent = pair_data,
402 .idx = idx
403 };
404 sv_magicext((SV *)struct_tie, 0, PERL_MAGIC_ext, &rlm_perl_vtbl, (char *)&child_pair_data, sizeof(child_pair_data));
405 ST(0) = sv_2mortal(newRV((SV *)struct_hv));
406 }
407 break;
408
409 default:
410 fr_assert(0);
411 }
412
413 XSRETURN(1);
414}
415
416/** Called when a hash value is set / updated
417 *
418 * This is not allowed - only leaf node arrays can have values set
419 */
420static XS(XS_pairlist_STORE)
421{
422 dXSARGS;
423 char *attr;
424 fr_dict_attr_t const *da;
425
427
428 attr = (char *) SvPV(ST(1), PL_na);
429 da = perl_attr_lookup(pair_data, attr);
430 if (!da) XSRETURN(0);
431
432 if (fr_type_is_leaf(da->type)) {
433 croak("Cannot set value of array of \"%s\" values. Use array index to set a specific instance.", da->name);
434 } else {
435 croak("Cannot set values of structural object %s", da->name);
436 }
437 XSRETURN(0);
438}
439
440/** Called to test the existence of a key in a tied hash
441 *
442 * The stack contains
443 * - the tied SV
444 * - the key to check for
445 */
446static XS(XS_pairlist_EXISTS)
447{
448 dXSARGS;
449 char *attr;
450 fr_dict_attr_t const *da;
451 STRLEN len, i = 0;
452
454
455 attr = (char *) SvPV(ST(1), len);
456 while (i < len) {
457 if (!isdigit(attr[i])) break;
458 i++;
459 }
460
461 /*
462 * Numeric key - check for an instance of the attribute
463 */
464 if (i == len) {
465 unsigned int idx = SvIV(ST(1));
466 if (pair_data->parent->vp) {
467 if (fr_pair_find_by_da_idx(&pair_data->parent->vp->vp_group, pair_data->da, idx)) XSRETURN_YES;
468 }
469 XSRETURN_NO;
470 }
471
472 if (!pair_data->vp) XSRETURN_NO;
473
474 da = perl_attr_lookup(pair_data, attr);
475 if (!da) XSRETURN_NO;
476
477 if(fr_pair_find_by_da(&pair_data->vp->vp_group, NULL, da)) XSRETURN_YES;
478
479 XSRETURN_NO;
480}
481
482/** Called when functions like keys() want the first key in a tied hash
483 *
484 * The stack contains just the tied SV
485 */
486static XS(XS_pairlist_FIRSTKEY)
487{
488 dXSARGS;
489 fr_pair_t *vp;
490
492 if (!pair_data->vp) XSRETURN_EMPTY;
493
494 vp = fr_pair_dcursor_init(&pair_data->cursor, &pair_data->vp->vp_group);
495 ST(0) = sv_2mortal(newSVpv(vp->da->name, vp->da->name_len));
496 XSRETURN(1);
497}
498
499/** Called by functions like keys() which iterate over the keys in a tied hash
500 *
501 * The stack contains
502 * - the tied SV
503 * - the previous key
504 */
505static XS(XS_pairlist_NEXTKEY)
506{
507 dXSARGS;
508 fr_pair_t *vp;
509
511 if (!pair_data->vp) XSRETURN_EMPTY;
512
513 vp = fr_dcursor_next(&pair_data->cursor);
514 if (!vp) XSRETURN_EMPTY;
515
516 ST(0) = sv_2mortal(newSVpv(vp->da->name, vp->da->name_len));
517 XSRETURN(1);
518}
519
520/** Called to delete a key from a tied hash
521 *
522 * The stack contains
523 * - the tied SV
524 * - the key being deleted
525 */
526static XS(XS_pairlist_DELETE)
527{
528 dXSARGS;
529 char *attr;
530 fr_dict_attr_t const *da;
531 fr_pair_t *vp;
532
534 attr = SvPV(ST(1), PL_na);
535
536 da = perl_attr_lookup(pair_data, attr);
537 if (!da) XSRETURN(0);
538 if (!pair_data->vp) XSRETURN(0);
539
540 vp = fr_pair_find_by_da(&pair_data->vp->vp_group, NULL, da);
541
542 if (vp) fr_pair_delete(&pair_data->vp->vp_group, vp);
543
544 XSRETURN(0);
545}
546
547/** Functions to implement subroutines required for a tied array
548 *
549 * Leaf attributes are represented by tied arrays to allow multiple instances.
550 */
551
553{
554 switch(vp->vp_type) {
555 case FR_TYPE_STRING:
556 *value = sv_2mortal(newSVpvn(vp->vp_strvalue, vp->vp_length));
557 break;
558
559 case FR_TYPE_OCTETS:
560 *value = sv_2mortal(newSVpvn((char const *)vp->vp_octets, vp->vp_length));
561 break;
562
563#define PERLUINT(_size) case FR_TYPE_UINT ## _size: \
564 *value = sv_2mortal(newSVuv(vp->vp_uint ## _size)); \
565 break;
566 PERLUINT(8)
567 PERLUINT(16)
568 PERLUINT(32)
569 PERLUINT(64)
570
571#define PERLINT(_size) case FR_TYPE_INT ## _size: \
572 *value = sv_2mortal(newSViv(vp->vp_int ## _size)); \
573 break;
574 PERLINT(8)
575 PERLINT(16)
576 PERLINT(32)
577 PERLINT(64)
578
579
580 case FR_TYPE_SIZE:
581 *value = sv_2mortal(newSVuv(vp->vp_size));
582 break;
583
584 case FR_TYPE_BOOL:
585 *value = sv_2mortal(newSVuv(vp->vp_bool));
586 break;
587
588 case FR_TYPE_FLOAT32:
589 *value = sv_2mortal(newSVnv(vp->vp_float32));
590 break;
591
592 case FR_TYPE_FLOAT64:
593 *value = sv_2mortal(newSVnv(vp->vp_float64));
594 break;
595
596 case FR_TYPE_ETHERNET:
603 case FR_TYPE_IFID:
604 case FR_TYPE_DATE:
606 case FR_TYPE_ATTR:
607 {
608 char buff[128];
609 ssize_t slen;
610
612 if (slen < 0) {
613 croak("Cannot convert %s to Perl type, insufficient buffer space",
614 fr_type_to_str(vp->vp_type));
615 return -1;
616 }
617
618 *value = sv_2mortal(newSVpv(buff, slen));
619 }
620 break;
621
622 /* Only leaf nodes should be able to call this */
623 case FR_TYPE_NON_LEAF:
624 croak("Cannot convert %s to Perl type", fr_type_to_str(vp->vp_type));
625 return -1;
626 }
627
628 return 0;
629}
630
631/** Called to retrieve the value of an array entry
632 *
633 * In our case, retrieve the value of a specific instance of a leaf attribute
634 *
635 * The stack contains
636 * - the tied SV
637 * - the index to retrieve
638 *
639 * The magic data will hold the DA of the attribute.
640 */
641static XS(XS_pairs_FETCH)
642{
643 dXSARGS;
644 unsigned int idx = SvUV(ST(1));
645 fr_pair_t *vp = NULL;
647
649
650 parent = pair_data->parent;
651 if (!parent->vp) XSRETURN_UNDEF;
652
653 if (idx == 0) vp = pair_data->vp;
654 if (!vp) vp = fr_pair_find_by_da_idx(&parent->vp->vp_group, pair_data->da, idx);
655 if (!vp) XSRETURN_UNDEF;
656
657 if (perl_value_marshal(vp, &ST(0)) < 0) XSRETURN(0);
658 XSRETURN(1);
659}
660
661/** Build parent structural pairs needed when a leaf node is set
662 *
663 */
665{
666 fr_perl_pair_t *parent = pair_data->parent;
667 if (!parent->vp) {
668 /*
669 * When building parent with idx > 0, it's "parent" is the
670 * first instance of the attribute - so if that's not there
671 * we don't have any.
672 */
673 if (pair_data->idx > 0) {
674 none_exist:
675 croak("Attempt to set instance %d when none exist", pair_data->idx);
676 return -1;
677 }
678 if (fr_perl_pair_parent_build(parent) < 0) return -1;
679 }
680
681 if (pair_data->idx > 0) {
682 unsigned int count;
683
684 if (!parent->parent->vp) goto none_exist;
685 count = fr_pair_count_by_da(&parent->parent->vp->vp_group, pair_data->da);
686 if (count < pair_data->idx) {
687 croak("Attempt to set instance %d when only %d exist", pair_data->idx, count);
688 return -1;
689 }
690 parent = parent->parent;
691 }
692
693 if (fr_pair_append_by_da(parent->vp, &pair_data->vp, &parent->vp->vp_group, pair_data->da) < 0) return -1;
694 return 0;
695}
696
697/** Convert a Perl SV to a pair value.
698 *
699 */
701{
703
704 switch (SvTYPE(value)) {
705 case SVt_IV:
706 fr_value_box_init(&vb, FR_TYPE_INT64, NULL, true);
707 vb.vb_int64 = SvIV(value);
708 break;
709
710 case SVt_NV:
711 fr_value_box_init(&vb, FR_TYPE_FLOAT64, NULL, true);
712 vb.vb_float64 = SvNV(value);
713 break;
714
715 case SVt_PV:
716 case SVt_PVLV:
717 {
718 char *val;
719 STRLEN len;
720 fr_value_box_init(&vb, FR_TYPE_STRING, NULL, true);
721 val = SvPV(value, len);
722 fr_value_box_bstrndup_shallow(&vb, NULL, val, len, true);
723 }
724 break;
725
726 default:
727 croak("Unsupported Perl data type");
728 return -1;
729 }
730
732 if (fr_value_box_cast(vp, &vp->data, vp->vp_type, vp->da, &vb) < 0) {
733 croak("Failed casting Perl value to %s", fr_type_to_str(vp->vp_type));
734 return -1;
735 }
736
737 return 0;
738}
739
740/** Called when an array value is set / updated
741 *
742 * The stack contains
743 * - the tied SV
744 * - the index being updated
745 * - the value being assigned
746 */
747static XS(XS_pairs_STORE)
748{
749 dXSARGS;
750 unsigned int idx = SvUV(ST(1));
751 fr_pair_t *vp;
753
755
756 fr_assert(fr_type_is_leaf(pair_data->da->type));
757
758 parent = pair_data->parent;
759
760 if (!parent->vp) {
761 /*
762 * Trying to set something other than the first instance when
763 * the parent doesn't exist is invalid.
764 */
765 if (idx > 0) {
766 croak("Attempting to set instance %d when none exist", idx);
767 XSRETURN(0);
768 }
769
770 if(fr_perl_pair_parent_build(parent) < 0) XSRETURN(0);
771 }
772
773 vp = fr_pair_find_by_da_idx(&parent->vp->vp_group, pair_data->da, idx);
774 if (!vp) {
775 if (idx > 0) {
776 unsigned int count = fr_pair_count_by_da(&pair_data->parent->vp->vp_group, pair_data->da);
777 if (count < idx) {
778 croak("Attempt to set instance %d when only %d exist", idx, count);
779 XSRETURN(0);
780 }
781 }
782 fr_pair_append_by_da(parent->vp, &vp, &parent->vp->vp_group, pair_data->da);
783 }
784
785 perl_value_unmarshal(vp, ST(2));
786
787 XSRETURN(0);
788}
789
790/** Called when an array entry's existence is tested
791 *
792 */
793static XS(XS_pairs_EXISTS)
794{
795 dXSARGS;
796 unsigned int idx = SvUV(ST(1));
797 fr_pair_t *vp;
799
801
802 parent = pair_data->parent;
803 if (!parent->vp) XSRETURN_NO;
804
805 vp = fr_pair_find_by_da_idx(&parent->vp->vp_group, pair_data->da, idx);
806 if (vp) XSRETURN_YES;
807 XSRETURN_NO;
808}
809
810/** Called when an array entry is deleted
811 *
812 */
813static XS(XS_pairs_DELETE)
814{
815 dXSARGS;
816 unsigned int idx = SvUV(ST(1));
817 fr_pair_t *vp;
819
821
822 parent = pair_data->parent;
823 if (!parent->vp) XSRETURN(0);
824
825 vp = fr_pair_find_by_da_idx(&parent->vp->vp_group, pair_data->da, idx);
826 if (vp) fr_pair_delete(&parent->vp->vp_group, vp);
827 XSRETURN(0);
828}
829
830/** Called when Perl wants the size of a tied array
831 *
832 * The stack contains just the tied SV
833 */
834static XS(XS_pairs_FETCHSIZE)
835{
836 dXSARGS;
838
839 if (!pair_data->parent->vp) XSRETURN_UV(0);
840 XSRETURN_UV(fr_pair_count_by_da(&pair_data->parent->vp->vp_group, pair_data->da));
841}
842
843/** Called when attempting to set the size of an array
844 *
845 * We don't allow expanding the array this way, but will allow deleting pairs
846 *
847 * The stack contains
848 * - the tied SV
849 * - the requested size of the array
850 */
851static XS(XS_pairs_STORESIZE)
852{
853 dXSARGS;
854 unsigned int count, req_size = SvUV(ST(1));
855 fr_pair_t *vp, *prev;
858
859 parent = pair_data->parent;
860 if (!parent->vp) {
861 if (req_size > 0) {
862 croak("Unable to set attribute instance count");
863 }
864 XSRETURN(0);
865 }
866
867 count = fr_pair_count_by_da(&parent->vp->vp_group, pair_data->da);
868 if (req_size > count) {
869 croak("Increasing attribute instance count not supported");
870 XSRETURN(0);
871 }
872
873 /*
874 * As req_size is 1 based and the attribute instance count is
875 * 0 based, searching for instance `req_size` will give the first
876 * pair to delete.
877 */
878 vp = fr_pair_find_by_da_idx(&parent->vp->vp_group, pair_data->da, req_size);
879 while (vp) {
880 prev = fr_pair_list_prev(&parent->vp->vp_group, vp);
881 fr_pair_delete(&parent->vp->vp_group, vp);
882 vp = fr_pair_find_by_da(&parent->vp->vp_group, prev, pair_data->da);
883 }
884 XSRETURN(0);
885}
886
887/** Called when values are pushed on a tied array
888 *
889 * The stack contains
890 * - the tied SV
891 * - one or more values being pushed onto the array
892 */
893static XS(XS_pairs_PUSH)
894{
895 dXSARGS;
896 int i = 1;
897 fr_pair_t *vp;
899
901
902 fr_assert(fr_type_is_leaf(pair_data->da->type));
903
904 parent = pair_data->parent;
905 if (!parent->vp) {
906 if (fr_perl_pair_parent_build(parent) < 0) XSRETURN(0);
907 }
908
909 while (i < items) {
910 fr_pair_append_by_da(parent->vp, &vp, &parent->vp->vp_group, pair_data->da);
911 if (perl_value_unmarshal(vp, ST(i++)) < 0) break;
912 }
913
914 XSRETURN(0);
915}
916
917/** Called when values are popped off a tied array
918 *
919 * The stack contains just the tied SV
920 */
921static XS(XS_pairs_POP)
922{
923 dXSARGS;
924 fr_pair_t *vp;
926
928
929 fr_assert(fr_type_is_leaf(pair_data->da->type));
930
931 parent = pair_data->parent;
932 if (!parent->vp) XSRETURN(0);
933
934 vp = fr_pair_find_last_by_da(&parent->vp->vp_group, NULL, pair_data->da);
935 if (!vp) XSRETURN(0);
936
937 if (perl_value_marshal(vp, &ST(0)) < 0) XSRETURN(0);
938
939 fr_pair_remove(&parent->vp->vp_group, vp);
940 XSRETURN(1);
941}
942
943/** Called when values are "shifted" off a tied array
944 *
945 * The stack contains just the tied SV
946 */
947static XS(XS_pairs_SHIFT)
948{
949 dXSARGS;
950 fr_pair_t *vp;
952
954
955 fr_assert(fr_type_is_leaf(pair_data->da->type));
956
957 parent = pair_data->parent;
958 if (!parent->vp) XSRETURN(0);
959
960 vp = fr_pair_find_by_da(&parent->vp->vp_group, NULL, pair_data->da);
961 if (!vp) XSRETURN(0);
962
963 if (perl_value_marshal(vp, &ST(0)) < 0) XSRETURN(0);
964
965 fr_pair_remove(&parent->vp->vp_group, vp);
966 XSRETURN(1);
967}
968
969/** Called when values are "unshifted" onto a tied array
970 *
971 * The stack contains
972 * - the tied SV
973 * - one or more values being shifted onto the array
974 */
975static XS(XS_pairs_UNSHIFT)
976{
977 dXSARGS;
978 int i = 1;
979 fr_pair_t *vp;
981
983
984 fr_assert(fr_type_is_leaf(pair_data->da->type));
985
986 parent = pair_data->parent;
987 if (!parent->vp) {
988 if (fr_perl_pair_parent_build(parent) < 0) XSRETURN(0);
989 }
990
991 while (i < items) {
992 if (unlikely(fr_pair_prepend_by_da(parent->vp, &vp, &parent->vp->vp_group, pair_data->da) < 0)) {
993 croak("Failed adding attribute %s", pair_data->da->name);
994 break;
995 }
996 if (perl_value_unmarshal(vp, ST(i++)) < 0) break;
997 }
998
999 XSRETURN(0);
1000}
1001
1002static void xs_init(pTHX)
1003{
1004 char const *file = __FILE__;
1005
1006 /* DynaLoader is a special case */
1007 newXS("DynaLoader::boot_DynaLoader", boot_DynaLoader, file);
1008
1009 newXS("freeradius::log",XS_freeradius_log, "rlm_perl");
1010 newXS("freeradius::xlat",XS_freeradius_xlat, "rlm_perl");
1011
1012 /*
1013 * The freeradiuspairlist package implements functions required
1014 * for a tied hash handling structural attributes.
1015 */
1016 newXS("freeradiuspairlist::FETCH", XS_pairlist_FETCH, "rlm_perl");
1017 newXS("freeradiuspairlist::STORE", XS_pairlist_STORE, "rlm_perl");
1018 newXS("freeradiuspairlist::EXISTS", XS_pairlist_EXISTS, "rlm_perl");
1019 newXS("freeradiuspairlist::FIRSTKEY", XS_pairlist_FIRSTKEY, "rlm_perl");
1020 newXS("freeradiuspairlist::NEXTKEY", XS_pairlist_NEXTKEY, "rlm_perl");
1021 newXS("freeradiuspairlist::DELETE", XS_pairlist_DELETE, "rlm_perl");
1022
1023 /*
1024 * The freeradiuspairs package implements functions required
1025 * for a tied array handling leaf attributes.
1026 */
1027 newXS("freeradiuspairs::FETCH", XS_pairs_FETCH, "rlm_perl");
1028 newXS("freeradiuspairs::STORE", XS_pairs_STORE, "rlm_perl");
1029 newXS("freeradiuspairs::EXISTS", XS_pairs_EXISTS, "rlm_perl");
1030 newXS("freeradiuspairs::DELETE", XS_pairs_DELETE, "rlm_perl");
1031 newXS("freeradiuspairs::FETCHSIZE", XS_pairs_FETCHSIZE, "rlm_perl");
1032 newXS("freeradiuspairs::STORESIZE", XS_pairs_STORESIZE, "rlm_perl");
1033 newXS("freeradiuspairs::PUSH", XS_pairs_PUSH, "rlm_perl");
1034 newXS("freeradiuspairs::POP", XS_pairs_POP, "rlm_perl");
1035 newXS("freeradiuspairs::SHIFT", XS_pairs_SHIFT, "rlm_perl");
1036 newXS("freeradiuspairs::UNSHIFT", XS_pairs_UNSHIFT, "rlm_perl");
1037}
1038
1039/** Convert a list of value boxes to a Perl array for passing to subroutines
1040 *
1041 * The Perl array object should be created before calling this
1042 * to populate it.
1043 *
1044 * @param[in,out] av Perl array object to append values to.
1045 * @param[in] head of VB list.
1046 * @return
1047 * - 0 on success
1048 * - -1 on failure
1049 */
1050static int perl_vblist_to_av(AV *av, fr_value_box_list_t *head) {
1051 fr_value_box_t *vb = NULL;
1052 SV *sv;
1053
1054 while ((vb = fr_value_box_list_next(head, vb))) {
1055 switch (vb->type) {
1056 case FR_TYPE_STRING:
1057 sv = newSVpvn(vb->vb_strvalue, vb->vb_length);
1058 break;
1059
1060 case FR_TYPE_OCTETS:
1061 sv = newSVpvn((char const *)vb->vb_octets, vb->vb_length);
1062 break;
1063
1064 case FR_TYPE_GROUP:
1065 {
1066 AV *sub_av;
1067 sub_av = newAV();
1068 perl_vblist_to_av(sub_av, &vb->vb_group);
1069 sv = newRV_inc((SV *)sub_av);
1070 }
1071 break;
1072 default:
1073 {
1074 char buffer[1024];
1075 ssize_t slen;
1076
1077 slen = fr_value_box_print(&FR_SBUFF_OUT(buffer, sizeof(buffer)), vb, NULL);
1078 if (slen < 0) return -1;
1079 sv = newSVpvn(buffer, (size_t)slen);
1080 }
1081 break;
1082 }
1083 if (!sv) return -1;
1084 if (vb->tainted) SvTAINT(sv);
1085 av_push(av, sv);
1086 }
1087 return 0;
1088}
1089
1090/** Parse a Perl SV and create value boxes, appending to a list
1091 *
1092 * For parsing values passed back from a Perl subroutine
1093 *
1094 * When hashes are returned, first the key is added as a value box then the value
1095 *
1096 * @param[in] ctx to allocate boxes in.
1097 * @param[out] list to append value boxes to.
1098 * @param[in] request being handled - only used for debug messages
1099 * @param[in] sv to parse
1100 * @return
1101 * - 0 on success
1102 * - -1 on failure
1103 */
1104static int perl_sv_to_vblist(TALLOC_CTX *ctx, fr_value_box_list_t *list, request_t *request, SV *sv) {
1105 fr_value_box_t *vb = NULL;
1106 char *tmp;
1107 STRLEN len;
1108 AV *av;
1109 HV *hv;
1110 I32 sv_len, i;
1111 int type;
1112
1113 type = SvTYPE(sv);
1114
1115 switch (type) {
1116 case SVt_IV:
1117 /* Integer or Reference */
1118 if (SvROK(sv)) {
1119 RDEBUG3("Reference returned");
1120 if (perl_sv_to_vblist(ctx, list, request, SvRV(sv)) < 0) return -1;
1121 break;
1122 }
1123 RDEBUG3("Integer returned");
1124 MEM(vb = fr_value_box_alloc(ctx, FR_TYPE_INT32, NULL));
1125 vb->vb_int32 = SvIV(sv);
1126 break;
1127
1128 case SVt_NV:
1129 /* Float */
1130 RDEBUG3("Float returned");
1131 MEM(vb = fr_value_box_alloc(ctx, FR_TYPE_FLOAT64, NULL));
1132 vb->vb_float64 = SvNV(sv);
1133 break;
1134
1135 case SVt_PV:
1136 /* String */
1137 RDEBUG3("String returned");
1138 tmp = SvPVutf8(sv, len);
1139 MEM(vb = fr_value_box_alloc_null(ctx));
1140 if (fr_value_box_bstrndup(vb, vb, NULL, tmp, len, SvTAINTED(sv)) < 0) {
1141 talloc_free(vb);
1142 RPEDEBUG("Failed to allocate %ld for output", len);
1143 return -1;
1144 }
1145 break;
1146
1147 case SVt_PVAV:
1148 /* Array */
1149 {
1150 SV **av_sv;
1151 RDEBUG3("Array returned");
1152 av = (AV*)sv;
1153 sv_len = av_len(av);
1154 for (i = 0; i <= sv_len; i++) {
1155 av_sv = av_fetch(av, i, 0);
1156 if (SvOK(*av_sv)) {
1157 if (perl_sv_to_vblist(ctx, list, request, *av_sv) < 0) return -1;
1158 }
1159 }
1160 }
1161 break;
1162
1163 case SVt_PVHV:
1164 /* Hash */
1165 {
1166 SV *hv_sv;
1167 RDEBUG3("Hash returned");
1168 hv = (HV*)sv;
1169 for (i = hv_iterinit(hv); i > 0; i--) {
1170 hv_sv = hv_iternextsv(hv, &tmp, &sv_len);
1171 /*
1172 * Add key first
1173 */
1174 MEM(vb = fr_value_box_alloc_null(ctx));
1175 if (fr_value_box_bstrndup(vb, vb, NULL, tmp, sv_len, SvTAINTED(hv_sv)) < 0) {
1176 talloc_free(vb);
1177 RPEDEBUG("Failed to allocate %d for output", sv_len);
1178 return -1;
1179 }
1180 fr_value_box_list_insert_tail(list, vb);
1181
1182 /*
1183 * Now process value
1184 */
1185 if (perl_sv_to_vblist(ctx, list, request, hv_sv) < 0) return -1;
1186
1187 }
1188 /*
1189 * Box has already been added to list - return
1190 */
1191 return 0;
1192 }
1193
1194 case SVt_NULL:
1195 break;
1196
1197 default:
1198 RPEDEBUG("Perl returned unsupported data type %d", type);
1199 return -1;
1200
1201 }
1202
1203 if (vb) {
1204 vb->tainted = SvTAINTED(sv);
1205 fr_value_box_list_insert_tail(list, vb);
1206 }
1207
1208 return 0;
1209}
1210
1212 { .required = true, .single = true, .type = FR_TYPE_STRING },
1213 { .variadic = XLAT_ARG_VARIADIC_EMPTY_KEEP, .type = FR_TYPE_VOID },
1215};
1216
1217/** Call perl code using an xlat
1218 *
1219 * @ingroup xlat_functions
1220 */
1221static xlat_action_t perl_xlat(TALLOC_CTX *ctx, fr_dcursor_t *out,
1222 xlat_ctx_t const *xctx,
1223 request_t *request, fr_value_box_list_t *in)
1224{
1226 int count, i;
1228 STRLEN n_a;
1229 fr_value_box_t *func = fr_value_box_list_pop_head(in);
1230 fr_value_box_t *child;
1231 SV *sv;
1232 AV *av;
1233 fr_value_box_list_t list, sub_list;
1234 fr_value_box_t *vb = NULL;
1235
1236 fr_value_box_list_init(&list);
1237 fr_value_box_list_init(&sub_list);
1238
1239 {
1240 dTHXa(t->perl);
1241 PERL_SET_CONTEXT(t->perl);
1242 }
1243
1244 {
1245 ssize_t slen;
1246 fr_sbuff_t *sbuff;
1247
1248 dSP;
1249 ENTER;SAVETMPS;
1250
1251 PUSHMARK(SP);
1252
1253 FR_SBUFF_TALLOC_THREAD_LOCAL(&sbuff, 256, 16384);
1254
1256
1257 fr_assert(arg->type == FR_TYPE_GROUP);
1258 if (fr_value_box_list_empty(&arg->vb_group)) continue;
1259
1260 if (fr_value_box_list_num_elements(&arg->vb_group) == 1) {
1261 child = fr_value_box_list_head(&arg->vb_group);
1262
1263 switch (child->type) {
1264 case FR_TYPE_STRING:
1265 if (child->vb_length == 0) continue;
1266
1267 RDEBUG3("Passing single value %pV", child);
1268 sv = newSVpvn(child->vb_strvalue, child->vb_length);
1269 break;
1270
1271 case FR_TYPE_GROUP:
1272 RDEBUG3("Ignoring nested group");
1273 continue;
1274
1275 default:
1276 /*
1277 * @todo - turn over integers as strings.
1278 */
1279 slen = fr_value_box_print(sbuff, child, NULL);
1280 if (slen <= 0) {
1281 RPEDEBUG("Failed printing sbuff");
1282 continue;
1283 }
1284
1285 RDEBUG3("Passing single value %pV", child);
1286 sv = newSVpvn(fr_sbuff_start(sbuff), fr_sbuff_used(sbuff));
1287 fr_sbuff_set_to_start(sbuff);
1288 break;
1289 }
1290
1291 if (child->tainted) SvTAINT(sv);
1292 XPUSHs(sv_2mortal(sv));
1293 continue;
1294 }
1295
1296 /*
1297 * Multiple child values - create array and pass reference
1298 */
1299 av = newAV();
1300 perl_vblist_to_av(av, &arg->vb_group);
1301 RDEBUG3("Passing list as array %pM", &arg->vb_group);
1302 sv = newRV_inc((SV *)av);
1303 XPUSHs(sv_2mortal(sv));
1304 }
1305
1306 PUTBACK;
1307
1308 count = call_pv(func->vb_strvalue, G_ARRAY | G_EVAL);
1309
1310 SPAGAIN;
1311 if (SvTRUE(ERRSV)) {
1312 REDEBUG("Exit %s", SvPV(ERRSV,n_a));
1313 (void)POPs;
1314 goto cleanup;
1315 }
1316
1317 /*
1318 * As results are popped from a stack, they are in reverse
1319 * sequence. Add to a temporary list and then prepend to
1320 * main list.
1321 */
1322 for (i = 0; i < count; i++) {
1323 sv = POPs;
1324 if (perl_sv_to_vblist(ctx, &sub_list, request, sv) < 0) goto cleanup;
1325 fr_value_box_list_move_head(&list, &sub_list);
1326 }
1327 ret = XLAT_ACTION_DONE;
1328
1329 /*
1330 * Move the assembled list of boxes to the output
1331 */
1332 while ((vb = fr_value_box_list_pop_head(&list))) fr_dcursor_append(out, vb);
1333
1334 cleanup:
1335 PUTBACK;
1336 FREETMPS;
1337 LEAVE;
1338
1339 }
1340
1341 return ret;
1342}
1343
1344/*
1345 * Parse a configuration section, and populate a HV.
1346 * This function is recursively called (allows to have nested hashes.)
1347 */
1348static void perl_parse_config(CONF_SECTION *cs, int lvl, HV *rad_hv)
1349{
1350 int indent_section = (lvl + 1) * 4;
1351 int indent_item = (lvl + 2) * 4;
1352
1353 if (!cs || !rad_hv) return;
1354
1355 DEBUG("%*s%s {", indent_section, " ", cf_section_name1(cs));
1356
1357 for (CONF_ITEM *ci = NULL; (ci = cf_item_next(cs, ci)); ) {
1358 /*
1359 * This is a section.
1360 * Create a new HV, store it as a reference in current HV,
1361 * Then recursively call perl_parse_config with this section and the new HV.
1362 */
1363 if (cf_item_is_section(ci)) {
1364 CONF_SECTION *sub_cs = cf_item_to_section(ci);
1365 char const *key = cf_section_name1(sub_cs); /* hash key */
1366 HV *sub_hv;
1367 SV *ref;
1368
1369 if (!key) continue;
1370
1371 if (hv_exists(rad_hv, key, strlen(key))) {
1372 WARN("Ignoring duplicate config section '%s'", key);
1373 continue;
1374 }
1375
1376 sub_hv = newHV();
1377 ref = newRV_inc((SV*) sub_hv);
1378
1379 (void)hv_store(rad_hv, key, strlen(key), ref, 0);
1380
1381 perl_parse_config(sub_cs, lvl + 1, sub_hv);
1382 } else if (cf_item_is_pair(ci)){
1383 CONF_PAIR *cp = cf_item_to_pair(ci);
1384 char const *key = cf_pair_attr(cp); /* hash key */
1385 char const *value = cf_pair_value(cp); /* hash value */
1386
1387 if (!key || !value) continue;
1388
1389 /*
1390 * This is an item.
1391 * Store item attr / value in current HV.
1392 */
1393 if (hv_exists(rad_hv, key, strlen(key))) {
1394 WARN("Ignoring duplicate config item '%s'", key);
1395 continue;
1396 }
1397
1398 (void)hv_store(rad_hv, key, strlen(key), newSVpvn(value, strlen(value)), 0);
1399
1400 DEBUG("%*s%s = %s", indent_item, " ", key, value);
1401 }
1402 }
1403
1404 DEBUG("%*s}", indent_section, " ");
1405}
1406
1407/** Create a Perl tied hash representing a pair list
1408 *
1409 */
1410static void perl_pair_list_tie(HV *parent, HV *frpair_stash, char const *name, fr_pair_t *vp, fr_dict_attr_t const *da)
1411{
1412 HV *list_hv;
1413 SV *list_tie;
1414 fr_perl_pair_t pair_data;
1415
1416 list_hv = newHV();
1417 list_tie = newRV_noinc((SV *)newHV());
1418 sv_bless(list_tie, frpair_stash);
1419 hv_magic(list_hv, (GV *)list_tie, PERL_MAGIC_tied);
1420 SvREFCNT_dec(list_tie);
1421
1422 pair_data = (fr_perl_pair_t) {
1423 .vp = vp,
1424 .da = da
1425 };
1426
1427 sv_magicext((SV *)list_tie, 0, PERL_MAGIC_ext, &rlm_perl_vtbl, (char *)&pair_data, sizeof(pair_data));
1428
1429 (void)hv_store(parent, name, strlen(name), newRV_inc((SV *)list_hv), 0);
1430}
1431
1432/*
1433 * Call the function_name inside the module
1434 * Store all vps in hashes %RAD_CONFIG %RAD_REPLY %RAD_REQUEST
1435 *
1436 */
1437static unlang_action_t CC_HINT(nonnull) mod_perl(unlang_result_t *p_result, module_ctx_t const *mctx, request_t *request)
1438{
1439 rlm_perl_t *inst = talloc_get_type_abort(mctx->mi->data, rlm_perl_t);
1440 perl_call_env_t *func = talloc_get_type_abort(mctx->env_data, perl_call_env_t);
1441 PerlInterpreter *interp = ((rlm_perl_thread_t *)talloc_get_type_abort(mctx->thread, rlm_perl_thread_t))->perl;
1442 int ret=0, count;
1443 STRLEN n_a;
1444
1445 HV *frpair_stash;
1446 HV *fr_packet;
1447
1448 /*
1449 * call_env parsing will have established the function name to call.
1450 */
1452
1453 {
1454 dTHXa(interp);
1455 PERL_SET_CONTEXT(interp);
1456 }
1457
1458 {
1459 dSP;
1460
1461 ENTER;
1462 SAVETMPS;
1463
1464 /* Get the stash for the freeradiuspairlist package */
1465 frpair_stash = gv_stashpv("freeradiuspairlist", GV_ADD);
1466
1467 /* New hash to hold the pair list roots and pass to the Perl subroutine */
1468 fr_packet = newHV();
1469
1470 perl_pair_list_tie(fr_packet, frpair_stash, "request",
1471 fr_pair_list_parent(&request->request_pairs), fr_dict_root(request->proto_dict));
1472 perl_pair_list_tie(fr_packet, frpair_stash, "reply",
1473 fr_pair_list_parent(&request->reply_pairs), fr_dict_root(request->proto_dict));
1474 perl_pair_list_tie(fr_packet, frpair_stash, "control",
1475 fr_pair_list_parent(&request->control_pairs), fr_dict_root(request->proto_dict));
1476 perl_pair_list_tie(fr_packet, frpair_stash, "session-state",
1477 fr_pair_list_parent(&request->session_state_pairs), fr_dict_root(request->proto_dict));
1478
1479 /*
1480 * Store pointer to request structure globally so radiusd::xlat works
1481 */
1482 rlm_perl_request = request;
1483
1484 PUSHMARK(SP);
1485 XPUSHs( sv_2mortal(newRV((SV *)fr_packet)) );
1486 PUTBACK;
1487
1488 count = call_pv(func->func->function_name, G_SCALAR | G_EVAL );
1489
1490 rlm_perl_request = NULL;
1491
1492 SPAGAIN;
1493
1494 if (SvTRUE(ERRSV)) {
1495 REDEBUG("perl_embed:: module = %s , func = %s exit status= %s\n",
1496 inst->module, func->func->function_name, SvPV(ERRSV,n_a));
1497 (void)POPs;
1498 ret = RLM_MODULE_FAIL;
1499 } else if (count == 1) {
1500 ret = POPi;
1501 if (ret >= 100 || ret < 0) {
1502 ret = RLM_MODULE_FAIL;
1503 }
1504 }
1505
1506 PUTBACK;
1507 FREETMPS;
1508 LEAVE;
1509 }
1510
1512}
1513
1515DIAG_OFF(shadow)
1516static void rlm_perl_interp_free(PerlInterpreter *perl)
1517{
1518 void **handles;
1519
1520 {
1521 dTHXa(perl);
1522 PERL_SET_CONTEXT(perl);
1523 }
1524
1525 handles = rlm_perl_get_handles(aTHX);
1526 if (handles) rlm_perl_close_handles(handles);
1527
1528 PL_perl_destruct_level = 2;
1529
1530 PL_origenviron = environ;
1531
1532 /*
1533 * FIXME: This shouldn't happen
1534 *
1535 */
1536 while (PL_scopestack_ix > 1) LEAVE;
1537
1538 perl_destruct(perl);
1539 perl_free(perl);
1540}
1541DIAG_ON(shadow)
1543
1545{
1546 rlm_perl_t *inst = talloc_get_type_abort(mctx->mi->data, rlm_perl_t);
1547 rlm_perl_thread_t *t = talloc_get_type_abort(mctx->thread, rlm_perl_thread_t);
1548 PerlInterpreter *interp;
1549 UV clone_flags = 0;
1550
1551 PERL_SET_CONTEXT(inst->perl);
1552
1553 /*
1554 * Ensure only one thread is cloning an interpreter at a time
1555 * Whilst the documentation of perl_clone() does not say anything
1556 * about this, seg faults have been seen if multiple threads clone
1557 * the same inst->perl at the same time.
1558 */
1559 pthread_mutex_lock(&inst->mutable->mutex);
1560 interp = perl_clone(inst->perl, clone_flags);
1561 pthread_mutex_unlock(&inst->mutable->mutex);
1562 {
1563 dTHXa(interp); /* Sets the current thread's interpreter */
1564 }
1565# if PERL_REVISION >= 5 && PERL_VERSION <8
1566 call_pv("CLONE", 0);
1567# endif
1568 ptr_table_free(PL_ptr_table);
1569 PL_ptr_table = NULL;
1570
1571 PERL_SET_CONTEXT(aTHX);
1573
1574 t->perl = interp; /* Store perl interp for easy freeing later */
1575
1576 return 0;
1577}
1578
1580{
1581 rlm_perl_thread_t *t = talloc_get_type_abort(mctx->thread, rlm_perl_thread_t);
1582
1584
1585 return 0;
1586}
1587
1588/** Check if a given Perl subroutine exists
1589 *
1590 */
1591static bool perl_func_exists(char const *func)
1592{
1593 char *eval_str;
1594 SV *val;
1595
1596 /*
1597 * Perl's "can" method checks if the object contains a subroutine of the given name.
1598 * We expect referenced subroutines to be in the "main" namespace.
1599 */
1600 eval_str = talloc_asprintf(NULL, "(main->can('%s') ? 1 : 0)", func);
1601 val = eval_pv(eval_str, TRUE);
1602 talloc_free(eval_str);
1603 return SvIV(val) ? true : false;
1604}
1605
1606/*
1607 * Do any per-module initialization that is separate to each
1608 * configured instance of the module. e.g. set up connections
1609 * to external databases, read configuration files, set up
1610 * dictionary entries, etc.
1611 *
1612 * If configuration information is given in the config section
1613 * that must be referenced in later calls, store a handle to it
1614 * in *instance otherwise put a null pointer there.
1615 *
1616 * Setup a hashes which we will use later
1617 * parse a module and give it a chance to live
1618 *
1619 */
1620static int mod_instantiate(module_inst_ctx_t const *mctx)
1621{
1622 rlm_perl_t *inst = talloc_get_type_abort(mctx->mi->data, rlm_perl_t);
1623 perl_func_def_t *func = NULL;
1625 CONF_PAIR *cp;
1626 char *pair_name;
1627
1628 CONF_SECTION *conf = mctx->mi->conf;
1629 AV *end_AV;
1630
1631 char const **embed_c; /* Stupid Perl and lack of const consistency */
1632 char **embed;
1633 int ret = 0, argc = 0;
1634 char arg[] = "0";
1635
1636 CONF_SECTION *cs;
1637
1638 /*
1639 * Setup the argument array we pass to the perl interpreter
1640 */
1641 MEM(embed_c = talloc_zero_array(inst, char const *, 4));
1642 memcpy(&embed, &embed_c, sizeof(embed));
1643 embed_c[0] = NULL;
1644 if (inst->perl_flags) {
1645 embed_c[1] = inst->perl_flags;
1646 embed_c[2] = inst->module;
1647 embed_c[3] = arg;
1648 argc = 4;
1649 } else {
1650 embed_c[1] = inst->module;
1651 embed_c[2] = arg;
1652 argc = 3;
1653 }
1654
1655 /*
1656 * Allocate a new perl interpreter to do the parsing
1657 */
1658 if ((inst->perl = perl_alloc()) == NULL) {
1659 ERROR("No memory for allocating new perl interpreter!");
1660 return -1;
1661 }
1662 perl_construct(inst->perl); /* ...and initialise it */
1663
1664 PL_perl_destruct_level = 2;
1665 {
1666 dTHXa(inst->perl);
1667 }
1668 PERL_SET_CONTEXT(inst->perl);
1669
1670#if PERL_REVISION >= 5 && PERL_VERSION >=8
1671 PL_exit_flags |= PERL_EXIT_DESTRUCT_END;
1672#endif
1673
1674 ret = perl_parse(inst->perl, xs_init, argc, embed, NULL);
1675
1676 end_AV = PL_endav;
1677 PL_endav = (AV *)NULL;
1678
1679 if (ret) {
1680 ERROR("Perl_parse failed: %s not found or has syntax errors", inst->module);
1681 return -1;
1682 }
1683
1684 /* parse perl configuration sub-section */
1685 cs = cf_section_find(conf, "config", NULL);
1686 if (cs) {
1687 inst->rad_perlconf_hv = get_hv("RAD_PERLCONF", 1);
1688 perl_parse_config(cs, 0, inst->rad_perlconf_hv);
1689 }
1690
1691 inst->perl_parsed = true;
1692 perl_run(inst->perl);
1693
1694 /*
1695 * The call_env parser has found all the places the module is called
1696 * Check for config options which set the subroutine name, falling back to
1697 * automatic subroutine names based on section name.
1698 */
1699 if (!inst->funcs_init) fr_rb_inline_init(&inst->funcs, perl_func_def_t, node, perl_func_def_cmp, NULL);
1700 func = fr_rb_iter_init_inorder(&iter, &inst->funcs);
1701 while (func) {
1702 /*
1703 * Check for func_<name1>_<name2> or func_<name1> config pairs.
1704 */
1705 if (func->name2) {
1706 pair_name = talloc_asprintf(func, "func_%s_%s", func->name1, func->name2);
1707 cp = cf_pair_find(mctx->mi->conf, pair_name);
1708 talloc_free(pair_name);
1709 if (cp) goto found_func;
1710 }
1711 pair_name = talloc_asprintf(func, "func_%s", func->name1);
1712 cp = cf_pair_find(conf, pair_name);
1713 talloc_free(pair_name);
1714 found_func:
1715 if (cp){
1716 func->function_name = cf_pair_value(cp);
1717 if (!perl_func_exists(func->function_name)) {
1718 cf_log_err(cp, "Perl subroutine %s does not exist", func->function_name);
1719 return -1;
1720 }
1721 /*
1722 * If no pair was found, then use <name1>_<name2> or <name1> as the function to call.
1723 */
1724 } else if (func->name2) {
1725 func->function_name = talloc_asprintf(func, "%s_%s", func->name1, func->name2);
1726 if (!perl_func_exists(func->function_name)) {
1728 goto name1_only;
1729 }
1730 } else {
1731 name1_only:
1732 func->function_name = func->name1;
1733 if (!perl_func_exists(func->function_name)) {
1734 cf_log_err(cp, "Perl subroutine %s does not exist", func->function_name);
1735 return -1;
1736 }
1737 }
1738
1739 func = fr_rb_iter_next_inorder(&iter);
1740 }
1741
1742 PL_endav = end_AV;
1743
1744 inst->mutable = talloc(NULL, rlm_perl_mutable_t);
1745 pthread_mutex_init(&inst->mutable->mutex, NULL);
1746
1747 return 0;
1748}
1749
1750/*
1751 * Detach a instance give a chance to a module to make some internal setup ...
1752 */
1753DIAG_OFF(nested-externs)
1754static int mod_detach(module_detach_ctx_t const *mctx)
1755{
1756 rlm_perl_t *inst = talloc_get_type_abort(mctx->mi->data, rlm_perl_t);
1757 int ret = 0, count = 0;
1758
1759
1760 if (inst->perl_parsed) {
1761 dTHXa(inst->perl);
1762 PERL_SET_CONTEXT(inst->perl);
1763 if (inst->rad_perlconf_hv != NULL) hv_undef(inst->rad_perlconf_hv);
1764
1765 if (inst->func_detach) {
1766 dSP; ENTER; SAVETMPS;
1767 PUSHMARK(SP);
1768
1769 count = call_pv(inst->func_detach, G_SCALAR | G_EVAL );
1770 SPAGAIN;
1771
1772 if (count == 1) {
1773 ret = POPi;
1774 if (ret >= 100 || ret < 0) {
1775 ret = RLM_MODULE_FAIL;
1776 }
1777 }
1778 PUTBACK;
1779 FREETMPS;
1780 LEAVE;
1781 }
1782 }
1783
1785 talloc_free(inst->mutable);
1786
1787 return ret;
1788}
1789DIAG_ON(nested-externs)
1790
1791static int mod_bootstrap(module_inst_ctx_t const *mctx)
1792{
1793 xlat_t *xlat;
1794
1795 xlat = module_rlm_xlat_register(mctx->mi->boot, mctx, NULL, perl_xlat, FR_TYPE_VOID);
1797
1798 return 0;
1799}
1800
1801static int mod_load(void)
1802{
1803 char const **embed_c; /* Stupid Perl and lack of const consistency */
1804 char **embed;
1805 char **envp = NULL;
1806 int argc = 0;
1807
1808#define LOAD_INFO(_fmt, ...) fr_log(LOG_DST, L_INFO, __FILE__, __LINE__, "rlm_perl - " _fmt, ## __VA_ARGS__)
1809#define LOAD_WARN(_fmt, ...) fr_log_perror(LOG_DST, L_WARN, __FILE__, __LINE__, \
1810 &(fr_log_perror_format_t){ \
1811 .first_prefix = "rlm_perl - ", \
1812 .subsq_prefix = "rlm_perl - ", \
1813 }, \
1814 _fmt, ## __VA_ARGS__)
1815
1816 LOAD_INFO("Perl version: %s", PERL_API_VERSION_STRING);
1817 dependency_version_number_add(NULL, "perl", PERL_API_VERSION_STRING);
1818
1819 /*
1820 * Load perl using RTLD_GLOBAL and dlopen.
1821 * This fixes issues where Perl C extensions
1822 * can't find the symbols they need.
1823 */
1824 perl_dlhandle = dl_open_by_sym("perl_construct", RTLD_NOW | RTLD_GLOBAL);
1825 if (!perl_dlhandle) LOAD_WARN("Failed loading libperl symbols into global symbol table");
1826
1827 /*
1828 * Setup the argument array we pass to the perl interpreter
1829 */
1830 MEM(embed_c = talloc_zero_array(NULL, char const *, 1));
1831 memcpy(&embed, &embed_c, sizeof(embed));
1832 embed_c[0] = NULL;
1833 argc = 1;
1834
1835 PERL_SYS_INIT3(&argc, &embed, &envp);
1836
1837 talloc_free(embed_c);
1838
1839 return 0;
1840}
1841
1842static void mod_unload(void)
1843{
1844 if (perl_dlhandle) dlclose(perl_dlhandle);
1845 PERL_SYS_TERM();
1846}
1847
1848/*
1849 * Restrict automatic Perl function names to lowercase characters, numbers and underscore
1850 * meaning that a module call in `recv Access-Request` will look for `recv_access_request`
1851 */
1852static void perl_func_name_safe(char *name) {
1853 char *p;
1854 size_t i;
1855
1856 p = name;
1857 for (i = 0; i < talloc_array_length(name); i++) {
1858 *p = tolower(*p);
1859 if (!strchr("abcdefghijklmnopqrstuvwxyz1234567890", *p)) *p = '_';
1860 p++;
1861 }
1862}
1863
1864static int perl_func_parse(TALLOC_CTX *ctx, call_env_parsed_head_t *out, UNUSED tmpl_rules_t const *t_rules,
1865 UNUSED CONF_ITEM *ci, call_env_ctx_t const *cec, UNUSED call_env_parser_t const *rule)
1866{
1867 rlm_perl_t *inst = talloc_get_type_abort(cec->mi->data, rlm_perl_t);
1868 call_env_parsed_t *parsed;
1869 perl_func_def_t *func;
1870 void *found;
1871
1872 if (!inst->funcs_init) {
1874 inst->funcs_init = true;
1875 }
1876
1877 MEM(parsed = call_env_parsed_add(ctx, out,
1879 .name = "func",
1880 .flags = CALL_ENV_FLAG_PARSE_ONLY,
1881 .pair = {
1882 .parsed = {
1883 .offset = rule->pair.offset,
1885 }
1886 }
1887 }));
1888
1889 MEM(func = talloc_zero(inst, perl_func_def_t));
1890 func->name1 = talloc_strdup(func, cec->asked->name1);
1892 if (cec->asked->name2) {
1893 func->name2 = talloc_strdup(func, cec->asked->name2);
1895 }
1896 if (fr_rb_find_or_insert(&found, &inst->funcs, func) < 0) {
1897 talloc_free(func);
1898 return -1;
1899 }
1900
1901 /*
1902 * If the function call is already in the tree, use that entry.
1903 */
1904 if (found) {
1905 talloc_free(func);
1906 call_env_parsed_set_data(parsed, found);
1907 } else {
1908 call_env_parsed_set_data(parsed, func);
1909 }
1910 return 0;
1911}
1912
1920
1921/*
1922 * The module name should be the only globally exported symbol.
1923 * That is, everything else should be 'static'.
1924 *
1925 * If the module needs to temporarily modify it's instantiation
1926 * data, the type should be changed to MODULE_TYPE_THREAD_UNSAFE.
1927 * The server will then take care of ensuring that the module
1928 * is single-threaded.
1929 */
1930extern module_rlm_t rlm_perl;
1932 .common = {
1933 .magic = MODULE_MAGIC_INIT,
1934 .name = "perl",
1935 .inst_size = sizeof(rlm_perl_t),
1936
1938 .onload = mod_load,
1939 .unload = mod_unload,
1940 .bootstrap = mod_bootstrap,
1941 .instantiate = mod_instantiate,
1942 .detach = mod_detach,
1943
1944 .thread_inst_size = sizeof(rlm_perl_thread_t),
1945 .thread_instantiate = mod_thread_instantiate,
1946 .thread_detach = mod_thread_detach,
1947 },
1948 .method_group = {
1949 .bindings = (module_method_binding_t[]){
1950 { .section = SECTION_NAME(CF_IDENT_ANY, CF_IDENT_ANY), .method = mod_perl, .method_env = &perl_method_env },
1952 }
1953 }
1954};
unlang_action_t
Returned by unlang_op_t calls, determine the next action of the interpreter.
Definition action.h:35
static int const char char buffer[256]
Definition acutest.h:576
int const char * file
Definition acutest.h:702
log_entry msg
Definition acutest.h:794
#define RCSID(id)
Definition build.h:485
#define DIAG_UNKNOWN_PRAGMAS
Definition build.h:458
#define DIAG_ON(_x)
Definition build.h:460
#define CMP(_a, _b)
Same as CMP_PREFER_SMALLER use when you don't really care about ordering, you just want an ordering.
Definition build.h:112
#define unlikely(_x)
Definition build.h:383
#define UNUSED
Definition build.h:317
#define DIAG_OFF(_x)
Definition build.h:459
call_env_parsed_t * call_env_parsed_add(TALLOC_CTX *ctx, call_env_parsed_head_t *head, call_env_parser_t const *rule)
Allocate a new call_env_parsed_t structure and add it to the list of parsed call envs.
Definition call_env.c:688
void call_env_parsed_set_data(call_env_parsed_t *parsed, void const *data)
Assign data to a call_env_parsed_t.
Definition call_env.c:745
#define CALL_ENV_TERMINATOR
Definition call_env.h:236
#define FR_CALL_ENV_METHOD_OUT(_inst)
Helper macro for populating the size/type fields of a call_env_method_t from the output structure typ...
Definition call_env.h:240
call_env_parser_t const * env
Parsing rules for call method env.
Definition call_env.h:247
section_name_t const * asked
The actual name1/name2 that resolved to a module_method_binding_t.
Definition call_env.h:232
@ CALL_ENV_FLAG_PARSE_ONLY
The result of parsing will not be evaluated at runtime.
Definition call_env.h:85
@ CALL_ENV_FLAG_PARSE_MISSING
If this subsection is missing, still parse it.
Definition call_env.h:88
@ CALL_ENV_PARSE_TYPE_VOID
Output of the parsing phase is undefined (a custom structure).
Definition call_env.h:62
module_instance_t const * mi
Module instance that the callenv is registered to.
Definition call_env.h:229
#define FR_CALL_ENV_SUBSECTION_FUNC(_name, _name2, _flags, _func)
Specify a call_env_parser_t which parses a subsection using a callback function.
Definition call_env.h:412
Per method call config.
Definition call_env.h:180
#define CONF_PARSER_TERMINATOR
Definition cf_parse.h:662
void * data
Pointer to a static variable to write the parsed value to.
Definition cf_parse.h:613
#define FR_CONF_OFFSET(_name, _struct, _field)
conf_parser_t which parses a single CONF_PAIR, writing the result to a field in a struct
Definition cf_parse.h:284
#define FR_CONF_OFFSET_FLAGS(_name, _flags, _struct, _field)
conf_parser_t which parses a single CONF_PAIR, writing the result to a field in a struct
Definition cf_parse.h:272
@ CONF_FLAG_REQUIRED
Error out if no matching CONF_PAIR is found, and no dflt value is set.
Definition cf_parse.h:434
@ CONF_FLAG_FILE_READABLE
File matching value must exist, and must be readable.
Definition cf_parse.h:440
Defines a CONF_PAIR to C data type mapping.
Definition cf_parse.h:599
Common header for all CONF_* types.
Definition cf_priv.h:49
Configuration AVP similar to a fr_pair_t.
Definition cf_priv.h:70
A section grouping multiple CONF_PAIR.
Definition cf_priv.h:101
bool cf_item_is_pair(CONF_ITEM const *ci)
Determine if CONF_ITEM is a CONF_PAIR.
Definition cf_util.c:631
char const * cf_section_name1(CONF_SECTION const *cs)
Return the second identifier of a CONF_SECTION.
Definition cf_util.c:1170
CONF_SECTION * cf_section_find(CONF_SECTION const *cs, char const *name1, char const *name2)
Find a CONF_SECTION with name1 and optionally name2.
Definition cf_util.c:1027
CONF_SECTION * cf_item_to_section(CONF_ITEM const *ci)
Cast a CONF_ITEM to a CONF_SECTION.
Definition cf_util.c:683
CONF_PAIR * cf_pair_find(CONF_SECTION const *cs, char const *attr)
Search for a CONF_PAIR with a specific name.
Definition cf_util.c:1438
bool cf_item_is_section(CONF_ITEM const *ci)
Determine if CONF_ITEM is a CONF_SECTION.
Definition cf_util.c:617
CONF_PAIR * cf_item_to_pair(CONF_ITEM const *ci)
Cast a CONF_ITEM to a CONF_PAIR.
Definition cf_util.c:663
char const * cf_pair_value(CONF_PAIR const *pair)
Return the value of a CONF_PAIR.
Definition cf_util.c:1593
char const * cf_pair_attr(CONF_PAIR const *pair)
Return the attr of a CONF_PAIR.
Definition cf_util.c:1577
#define cf_log_err(_cf, _fmt,...)
Definition cf_util.h:289
#define cf_item_next(_parent, _curr)
Definition cf_util.h:92
#define CF_IDENT_ANY
Definition cf_util.h:78
static int split(char **input, char **output, bool syntax_string)
Definition command.c:393
static void * fr_dcursor_next(fr_dcursor_t *cursor)
Advanced the cursor to the next item.
Definition dcursor.h:290
static int fr_dcursor_append(fr_dcursor_t *cursor, void *v)
Insert a single item at the end of the list.
Definition dcursor.h:408
#define MEM(x)
Definition debug.h:36
int dependency_version_number_add(CONF_SECTION *cs, char const *name, char const *version)
Add a library/server version pair to the main configuration.
Definition dependency.c:152
#define ERROR(fmt,...)
Definition dhcpclient.c:41
#define DEBUG(fmt,...)
Definition dhcpclient.c:39
fr_dict_attr_t const * fr_dict_attr_by_name(fr_dict_attr_err_t *err, fr_dict_attr_t const *parent, char const *attr))
Locate a fr_dict_attr_t by its name.
Definition dict_util.c:3338
fr_dict_attr_t const * fr_dict_root(fr_dict_t const *dict)
Return the root attribute of a dictionary.
Definition dict_util.c:2475
fr_dict_t const * fr_dict_internal(void)
Definition dict_util.c:4728
static fr_slen_t in
Definition dict.h:848
Test enumeration values.
Definition dict_test.h:92
void * dl_open_by_sym(char const *sym_name, int flags)
Utility function to dlopen the library containing a particular symbol.
Definition dl.c:186
#define RTLD_NOW
Definition dl.c:44
#define MODULE_MAGIC_INIT
Stop people using different module/library/server versions together.
Definition dl_module.h:63
static xlat_action_t perl_xlat(TALLOC_CTX *ctx, fr_dcursor_t *out, xlat_ctx_t const *xctx, request_t *request, fr_value_box_list_t *in)
Call perl code using an xlat.
Definition rlm_perl.c:1221
#define RDEBUG3(fmt,...)
Definition log.h:343
#define RPEDEBUG(fmt,...)
Definition log.h:376
talloc_free(reap)
fr_log_t default_log
Definition log.c:288
void fr_log(fr_log_t const *log, fr_log_type_t type, char const *file, int line, char const *fmt,...)
Send a server log message to its destination.
Definition log.c:577
#define ENTER(_x)
Definition machine.h:93
@ FR_TYPE_TIME_DELTA
A period of time measured in nanoseconds.
@ FR_TYPE_FLOAT32
Single precision floating point.
@ FR_TYPE_IPV4_ADDR
32 Bit IPv4 Address.
@ FR_TYPE_ETHERNET
48 Bit Mac-Address.
@ FR_TYPE_IPV6_PREFIX
IPv6 Prefix.
@ FR_TYPE_STRING
String of printable characters.
@ FR_TYPE_INT64
64 Bit signed integer.
@ FR_TYPE_DATE
Unix time stamp, always has value >2^31.
@ FR_TYPE_COMBO_IP_PREFIX
IPv4 or IPv6 address prefix depending on length.
@ FR_TYPE_INT32
32 Bit signed integer.
@ FR_TYPE_IPV6_ADDR
128 Bit IPv6 Address.
@ FR_TYPE_IPV4_PREFIX
IPv4 Prefix.
@ FR_TYPE_VOID
User data.
@ FR_TYPE_BOOL
A truth value.
@ FR_TYPE_SIZE
Unsigned integer capable of representing any memory address on the local system.
@ FR_TYPE_COMBO_IP_ADDR
IPv4 or IPv6 address depending on length.
@ FR_TYPE_IFID
Interface ID.
@ FR_TYPE_OCTETS
Raw octets.
@ FR_TYPE_GROUP
A grouping of other attributes.
@ FR_TYPE_FLOAT64
Double precision floating point.
long int ssize_t
void * env_data
Per call environment data.
Definition module_ctx.h:44
module_instance_t const * mi
Instance of the module being instantiated.
Definition module_ctx.h:42
void * thread
Thread specific instance data.
Definition module_ctx.h:43
void * thread
Thread instance data.
Definition module_ctx.h:67
module_instance_t * mi
Instance of the module being instantiated.
Definition module_ctx.h:51
Temporary structure to hold arguments for module calls.
Definition module_ctx.h:41
Temporary structure to hold arguments for detach calls.
Definition module_ctx.h:56
Temporary structure to hold arguments for instantiation calls.
Definition module_ctx.h:50
Temporary structure to hold arguments for thread_instantiation calls.
Definition module_ctx.h:63
xlat_t * module_rlm_xlat_register(TALLOC_CTX *ctx, module_inst_ctx_t const *mctx, char const *name, xlat_func_t func, fr_type_t return_type)
Definition module_rlm.c:243
module_t common
Common fields presented by all modules.
Definition module_rlm.h:39
fr_pair_t * fr_pair_list_parent(fr_pair_list_t const *list)
Return a pointer to the parent pair which contains this list.
Definition pair.c:961
unsigned int fr_pair_count_by_da(fr_pair_list_t const *list, fr_dict_attr_t const *da)
Return the number of instances of a given da in the specified list.
Definition pair.c:675
int fr_pair_append_by_da(TALLOC_CTX *ctx, fr_pair_t **out, fr_pair_list_t *list, fr_dict_attr_t const *da)
Alloc a new fr_pair_t (and append)
Definition pair.c:1462
fr_pair_t * fr_pair_find_by_da(fr_pair_list_t const *list, fr_pair_t const *prev, fr_dict_attr_t const *da)
Find the first pair with a matching da.
Definition pair.c:698
fr_pair_t * fr_pair_find_by_da_idx(fr_pair_list_t const *list, fr_dict_attr_t const *da, unsigned int idx)
Find a pair with a matching da at a given index.
Definition pair.c:746
void fr_pair_value_clear(fr_pair_t *vp)
Free/zero out value (or children) of a given VP.
Definition pair.c:2536
int fr_pair_delete(fr_pair_list_t *list, fr_pair_t *vp)
Remove fr_pair_t from a list and free.
Definition pair.c:1822
int fr_pair_prepend_by_da(TALLOC_CTX *ctx, fr_pair_t **out, fr_pair_list_t *list, fr_dict_attr_t const *da)
Alloc a new fr_pair_t (and prepend)
Definition pair.c:1489
fr_pair_t * fr_pair_find_last_by_da(fr_pair_list_t const *list, fr_pair_t const *prev, fr_dict_attr_t const *da)
Find the last pair with a matching da.
Definition pair.c:722
static const conf_parser_t config[]
Definition base.c:186
#define fr_assert(_expr)
Definition rad_assert.h:38
#define REDEBUG(fmt,...)
Definition radclient.h:52
#define WARN(fmt,...)
Definition radclient.h:47
static bool cleanup
Definition radsniff.c:60
static rs_t * conf
Definition radsniff.c:53
void * fr_rb_iter_init_inorder(fr_rb_iter_inorder_t *iter, fr_rb_tree_t *tree)
Initialise an in-order iterator.
Definition rb.c:824
int fr_rb_find_or_insert(void **found, fr_rb_tree_t *tree, void const *data)
Attempt to find current data in the tree, if it does not exist insert it.
Definition rb.c:598
void * fr_rb_iter_next_inorder(fr_rb_iter_inorder_t *iter)
Return the next node.
Definition rb.c:850
#define fr_rb_inline_init(_tree, _type, _field, _data_cmp, _data_free)
Initialises a red black tree.
Definition rb.h:180
Iterator structure for in-order traversal of an rbtree.
Definition rb.h:321
The main red black tree structure.
Definition rb.h:73
#define RETURN_UNLANG_RCODE(_rcode)
Definition rcode.h:57
@ RLM_MODULE_FAIL
Module failed, don't reply.
Definition rcode.h:44
static int perl_sv_to_vblist(TALLOC_CTX *ctx, fr_value_box_list_t *list, request_t *request, SV *sv)
Parse a Perl SV and create value boxes, appending to a list.
Definition rlm_perl.c:1104
static fr_dict_attr_t const * perl_attr_lookup(fr_perl_pair_t *pair_data, char const *attr)
Helper function for turning hash keys into dictionary attributes.
Definition rlm_perl.c:274
fr_rb_node_t node
Node in tree of function calls.
Definition rlm_perl.c:61
static int mod_detach(module_detach_ctx_t const *mctx)
Definition rlm_perl.c:1754
static int mod_load(void)
Definition rlm_perl.c:1801
PerlInterpreter * perl
Thread specific perl interpreter.
Definition rlm_perl.c:95
static bool perl_func_exists(char const *func)
Check if a given Perl subroutine exists.
Definition rlm_perl.c:1591
HV * rad_perlconf_hv
holds "config" items (perl RAD_PERLCONF hash).
Definition rlm_perl.c:89
static XS(XS_freeradius_log)
Definition rlm_perl.c:218
static void perl_func_name_safe(char *name)
Definition rlm_perl.c:1852
static xlat_arg_parser_t const perl_xlat_args[]
Definition rlm_perl.c:1211
char const * func_detach
Function to run when mod_detach is run.
Definition rlm_perl.c:85
char const * function_name
Name of the function being called.
Definition rlm_perl.c:58
#define PERLINT(_size)
#define PERLUINT(_size)
static void ** rlm_perl_get_handles(pTHX)
Definition rlm_perl.c:163
bool perl_parsed
Definition rlm_perl.c:88
fr_perl_pair_t * parent
Parent attribute data.
Definition rlm_perl.c:106
static int perl_value_marshal(fr_pair_t *vp, SV **value)
Functions to implement subroutines required for a tied array.
Definition rlm_perl.c:552
EXTERN_C void boot_DynaLoader(pTHX_ CV *cv)
static void perl_parse_config(CONF_SECTION *cs, int lvl, HV *rad_hv)
Definition rlm_perl.c:1348
char const * perl_flags
Definition rlm_perl.c:86
static int mod_bootstrap(module_inst_ctx_t const *mctx)
Definition rlm_perl.c:1791
char * name1
Section name1 where this is called.
Definition rlm_perl.c:59
#define dl_modules
Definition rlm_perl.c:154
module_rlm_t rlm_perl
Definition rlm_perl.c:1931
static void rlm_perl_interp_free(PerlInterpreter *perl)
Definition rlm_perl.c:1516
static int perl_value_unmarshal(fr_pair_t *vp, SV *value)
Convert a Perl SV to a pair value.
Definition rlm_perl.c:700
char const *fr_rb_tree_t funcs
Tree of function calls found by call_env parser.
Definition rlm_perl.c:83
static MGVTBL rlm_perl_vtbl
Definition rlm_perl.c:113
static void mod_unload(void)
Definition rlm_perl.c:1842
static void xs_init(pTHX)
Definition rlm_perl.c:1002
fr_dict_attr_t const * da
Dictionary attribute associated with hash / array.
Definition rlm_perl.c:103
struct fr_perl_pair_s fr_perl_pair_t
Definition rlm_perl.c:101
static int8_t perl_func_def_cmp(void const *one, void const *two)
How to compare two Perl function calls.
Definition rlm_perl.c:133
#define LOAD_WARN(_fmt,...)
static void rlm_perl_close_handles(void **handles)
Definition rlm_perl.c:197
static int mod_thread_instantiate(module_thread_inst_ctx_t const *mctx)
Definition rlm_perl.c:1544
fr_dcursor_t cursor
Cursor used for iterating over the keys of a tied hash.
Definition rlm_perl.c:107
static void perl_pair_list_tie(HV *parent, HV *frpair_stash, char const *name, fr_pair_t *vp, fr_dict_attr_t const *da)
Create a Perl tied hash representing a pair list.
Definition rlm_perl.c:1410
#define GET_PAIR_MAGIC(count)
Convenience macro for fetching C data associated with tied hash / array and validating stack size.
Definition rlm_perl.c:293
unsigned int idx
Instance number.
Definition rlm_perl.c:105
PerlInterpreter * perl
Definition rlm_perl.c:87
static unlang_action_t mod_perl(unlang_result_t *p_result, module_ctx_t const *mctx, request_t *request)
Definition rlm_perl.c:1437
char * name2
Section name2 where this is called.
Definition rlm_perl.c:60
#define dl_librefs
Definition rlm_perl.c:153
static int perl_vblist_to_av(AV *av, fr_value_box_list_t *head)
Convert a list of value boxes to a Perl array for passing to subroutines.
Definition rlm_perl.c:1050
static void * perl_dlhandle
To allow us to load perl's symbols into the global symbol table.
Definition rlm_perl.c:115
#define LOAD_INFO(_fmt,...)
static const conf_parser_t module_config[]
Definition rlm_perl.c:120
static _Thread_local request_t * rlm_perl_request
Definition rlm_perl.c:151
static const call_env_method_t perl_method_env
Definition rlm_perl.c:1913
bool funcs_init
Has the tree been initialised.
Definition rlm_perl.c:84
pthread_mutex_t mutex
Definition rlm_perl.c:69
static int mod_thread_detach(module_thread_inst_ctx_t const *mctx)
Definition rlm_perl.c:1579
static int mod_instantiate(module_inst_ctx_t const *mctx)
Definition rlm_perl.c:1620
fr_pair_t * vp
Real pair associated with the hash / array, if it exists.
Definition rlm_perl.c:104
perl_func_def_t * func
Definition rlm_perl.c:65
static void rlm_perl_clear_handles(pTHX)
Definition rlm_perl.c:155
static int fr_perl_pair_parent_build(fr_perl_pair_t *pair_data)
Build parent structural pairs needed when a leaf node is set.
Definition rlm_perl.c:664
static int perl_func_parse(TALLOC_CTX *ctx, call_env_parsed_head_t *out, UNUSED tmpl_rules_t const *t_rules, UNUSED CONF_ITEM *ci, call_env_ctx_t const *cec, UNUSED call_env_parser_t const *rule)
Definition rlm_perl.c:1864
static char const * name
#define fr_sbuff_start(_sbuff_or_marker)
#define FR_SBUFF_OUT(_start, _len_or_end)
#define fr_sbuff_used(_sbuff_or_marker)
#define FR_SBUFF_TALLOC_THREAD_LOCAL(_out, _init, _max)
#define SECTION_NAME(_name1, _name2)
Define a section name consisting of a verb and a noun.
Definition section.h:40
char const * name2
Second section name. Usually a packet type like 'access-request', 'access-accept',...
Definition section.h:46
char const * name1
First section name. Usually a verb like 'recv', 'send', etc...
Definition section.h:45
CONF_SECTION * conf
Module's instance configuration.
Definition module.h:349
size_t inst_size
Size of the module's instance data.
Definition module.h:212
void * data
Module's instance data.
Definition module.h:291
#define MODULE_BINDING_TERMINATOR
Terminate a module binding list.
Definition module.h:152
Named methods exported by a module.
Definition module.h:174
Optional arguments passed to vp_tmpl functions.
Definition tmpl.h:332
static char buff[sizeof("18446744073709551615")+3]
Definition size_tests.c:41
return count
Definition module.c:155
eap_aka_sim_process_conf_t * inst
fr_aka_sim_id_type_t type
fr_pair_t * vp
Stores an attribute, a value and various bits of other data.
Definition pair.h:68
fr_dict_attr_t const *_CONST da
Dictionary attribute defines the attribute number, vendor and type of the pair.
Definition pair.h:69
#define talloc_get_type_abort_const
Definition talloc.h:287
static int talloc_const_free(void const *ptr)
Free const'd memory.
Definition talloc.h:229
@ T_INVALID
Definition token.h:39
@ T_BARE_WORD
Definition token.h:120
@ XLAT_ARG_VARIADIC_EMPTY_KEEP
Empty argument groups are left alone, and either passed through as empty groups or null boxes.
Definition xlat.h:137
static fr_slen_t head
Definition xlat.h:420
uint8_t required
Argument must be present, and non-empty.
Definition xlat.h:146
#define XLAT_ARG_PARSER_TERMINATOR
Definition xlat.h:170
xlat_action_t
Definition xlat.h:37
@ XLAT_ACTION_FAIL
An xlat function failed.
Definition xlat.h:44
@ XLAT_ACTION_DONE
We're done evaluating this level of nesting.
Definition xlat.h:43
ssize_t xlat_aeval(TALLOC_CTX *ctx, char **out, request_t *request, char const *fmt, xlat_escape_legacy_t escape, void const *escape_ctx))
Definition xlat_eval.c:1814
Definition for a single argument consumend by an xlat function.
Definition xlat.h:145
fr_pair_t * fr_pair_remove(fr_pair_list_t *list, fr_pair_t *vp)
Remove fr_pair_t from a list without freeing.
Definition pair_inline.c:93
ssize_t fr_pair_print_value_quoted(fr_sbuff_t *out, fr_pair_t const *vp, fr_token_t quote)
Print the value of an attribute to a string.
Definition pair_print.c:53
#define fr_pair_dcursor_init(_cursor, _list)
Initialises a special dcursor with callbacks that will maintain the attr sublists correctly.
Definition pair.h:589
fr_pair_t * fr_pair_list_prev(fr_pair_list_t const *list, fr_pair_t const *item))
Get the previous item in a valuepair list before a specific entry.
Definition pair_inline.c:82
static fr_slen_t parent
Definition pair.h:841
#define fr_type_is_group(_x)
Definition types.h:374
@ FR_TYPE_ATTR
A contains an attribute reference.
Definition types.h:83
#define FR_TYPE_NON_LEAF
Definition types.h:316
#define FR_TYPE_STRUCTURAL
Definition types.h:314
#define fr_type_is_leaf(_x)
Definition types.h:391
static char const * fr_type_to_str(fr_type_t type)
Return a static string containing the type name.
Definition types.h:452
#define FR_TYPE_LEAF
Definition types.h:315
ssize_t fr_value_box_print(fr_sbuff_t *out, fr_value_box_t const *data, fr_sbuff_escape_rules_t const *e_rules)
Print one boxed value to a string.
Definition value.c:5791
int fr_value_box_cast(TALLOC_CTX *ctx, fr_value_box_t *dst, fr_type_t dst_type, fr_dict_attr_t const *dst_enumv, fr_value_box_t const *src)
Convert one type of fr_value_box_t to another.
Definition value.c:3741
int fr_value_box_bstrndup(TALLOC_CTX *ctx, fr_value_box_t *dst, fr_dict_attr_t const *enumv, char const *src, size_t len, bool tainted)
Copy a string to to a fr_value_box_t.
Definition value.c:4596
void fr_value_box_bstrndup_shallow(fr_value_box_t *dst, fr_dict_attr_t const *enumv, char const *src, size_t len, bool tainted)
Assign a string to to a fr_value_box_t.
Definition value.c:4680
#define fr_value_box_alloc(_ctx, _type, _enumv)
Allocate a value box of a specific type.
Definition value.h:643
int nonnull(2, 5))
#define fr_value_box_alloc_null(_ctx)
Allocate a value box for later use with a value assignment function.
Definition value.h:654
#define fr_value_box_init(_vb, _type, _enumv, _tainted)
Initialise a fr_value_box_t.
Definition value.h:609
#define fr_value_box_list_foreach(_list_head, _iter)
Definition value.h:224
static size_t char ** out
Definition value.h:1023
module_ctx_t const * mctx
Synthesised module calling ctx.
Definition xlat_ctx.h:52
An xlat calling ctx.
Definition xlat_ctx.h:49
int xlat_func_args_set(xlat_t *x, xlat_arg_parser_t const args[])
Register the arguments of an xlat.
Definition xlat_func.c:363