2 * valuepair.c Functions to handle VALUE_PAIRs
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library 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 GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
20 * Copyright 2000,2006 The FreeRADIUS server project
25 #include <freeradius-devel/libradius.h>
29 #ifdef HAVE_PCREPOSIX_H
31 # include <pcreposix.h>
32 #elif defined(HAVE_REGEX_H)
37 * For POSIX Regular expressions.
38 * (0) Means no extended regular expressions.
39 * REG_EXTENDED means use extended regular expressions.
42 # define REG_EXTENDED (0)
46 # define REG_NOSUB (0)
54 * @note Do not call directly, use talloc_free instead.
59 static int _pairfree(VALUE_PAIR *vp) {
61 * The lack of DA means something has gone wrong
64 fr_strerror_printf("VALUE_PAIR has NULL DICT_ATTR pointer (probably already freed)");
66 * Only free the DICT_ATTR if it was dynamically allocated
67 * and was marked for free when the VALUE_PAIR is freed.
69 * @fixme This is an awful hack and needs to be removed once DICT_ATTRs are allocated by talloc.
71 } else if (vp->da->flags.vp_free) {
72 dict_attr_free(&(vp->da));
76 vp->vp_integer = 0xf4eef4ee;
80 talloc_report_depth_cb(NULL, 0, -1, fr_talloc_verify_cb, NULL);
85 /** Dynamically allocate a new attribute
87 * Allocates a new attribute and a new dictionary attr if no DA is provided.
89 * @param[in] ctx for allocated memory, usually a pointer to a RADIUS_PACKET
90 * @param[in] da Specifies the dictionary attribute to build the VP from.
91 * @return a new value pair or NULL if an error occurred.
93 VALUE_PAIR *pairalloc(TALLOC_CTX *ctx, DICT_ATTR const *da)
98 * Caller must specify a da else we don't know what the attribute type is.
101 fr_strerror_printf("Invalid arguments");
105 vp = talloc_zero(ctx, VALUE_PAIR);
107 fr_strerror_printf("Out of memory");
116 vp->length = da->flags.length;
118 talloc_set_destructor(vp, _pairfree);
123 /** Create a new valuepair
125 * If attr and vendor match a dictionary entry then a VP with that DICT_ATTR
128 * If attr or vendor are uknown will call dict_attruknown to create a dynamic
129 * DICT_ATTR of PW_TYPE_OCTETS.
131 * Which type of DICT_ATTR the VALUE_PAIR was created with can be determined by
132 * checking @verbatim vp->da->flags.is_unknown @endverbatim.
134 * @param[in] ctx for allocated memory, usually a pointer to a RADIUS_PACKET
135 * @param[in] attr number.
136 * @param[in] vendor number.
137 * @return the new valuepair or NULL on error.
139 VALUE_PAIR *paircreate(TALLOC_CTX *ctx, unsigned int attr, unsigned int vendor)
143 da = dict_attrbyvalue(attr, vendor);
145 da = dict_attrunknown(attr, vendor, true);
151 return pairalloc(ctx, da);
154 /** Free memory used by a valuepair list.
156 * @todo TLV: needs to free all dependents of each VP freed.
158 void pairfree(VALUE_PAIR **vps)
167 for (vp = fr_cursor_init(&cursor, vps);
169 vp = fr_cursor_next(&cursor)) {
177 /** Mark malformed or unrecognised attributed as unknown
179 * @param vp to change DICT_ATTR of.
180 * @return 0 on success (or if already unknown) else -1 on error.
182 int pair2unknown(VALUE_PAIR *vp)
187 if (vp->da->flags.is_unknown) {
191 da = dict_attrunknown(vp->da->attr, vp->da->vendor, true);
201 /** Find the pair with the matching DAs
204 VALUE_PAIR *pairfind_da(VALUE_PAIR *vp, DICT_ATTR const *da, int8_t tag)
213 for (i = fr_cursor_init(&cursor, &vp);
215 i = fr_cursor_next(&cursor)) {
217 if ((i->da == da) && (!i->da->flags.has_tag || TAG_EQ(tag, i->tag))) {
226 /** Find the pair with the matching attribute
228 * @todo should take DAs and do a pointer comparison.
230 VALUE_PAIR *pairfind(VALUE_PAIR *vp, unsigned int attr, unsigned int vendor, int8_t tag)
235 /* List head may be NULL if it contains no VPs */
236 if (!vp) return NULL;
240 for (i = fr_cursor_init(&cursor, &vp);
242 i = fr_cursor_next(&cursor)) {
243 if ((i->da->attr == attr) && (i->da->vendor == vendor) && \
244 (!i->da->flags.has_tag || TAG_EQ(tag, i->tag))) {
252 /** Delete matching pairs
254 * Delete matching pairs from the attribute list.
256 * @param[in,out] first VP in list.
257 * @param[in] attr to match.
258 * @param[in] vendor to match.
259 * @param[in] tag to match. TAG_ANY matches any tag, TAG_NONE matches tagless VPs.
261 * @todo should take DAs and do a point comparison.
263 void pairdelete(VALUE_PAIR **first, unsigned int attr, unsigned int vendor,
266 VALUE_PAIR *i, *next;
267 VALUE_PAIR **last = first;
269 for(i = *first; i; i = next) {
272 if ((i->da->attr == attr) && (i->da->vendor == vendor) &&
273 (!i->da->flags.has_tag || TAG_EQ(tag, i->tag))) {
282 /** Add a VP to the end of the list.
284 * Locates the end of 'first', and links an additional VP 'add' at the end.
286 * @param[in] first VP in linked list. Will add new VP to the end of this list.
287 * @param[in] add VP to add to list.
289 void pairadd(VALUE_PAIR **first, VALUE_PAIR *add)
297 if (*first == NULL) {
301 for(i = *first; i->next; i = i->next)
306 /** Replace all matching VPs
308 * Walks over 'first', and replaces the first VP that matches 'replace'.
310 * @note Memory used by the VP being replaced will be freed.
311 * @note Will not work with unknown attributes.
313 * @param[in,out] first VP in linked list. Will search and replace in this list.
314 * @param[in] replace VP to replace.
316 void pairreplace(VALUE_PAIR **first, VALUE_PAIR *replace)
318 VALUE_PAIR *i, *next;
319 VALUE_PAIR **prev = first;
323 if (*first == NULL) {
329 * Not an empty list, so find item if it is there, and
330 * replace it. Note, we always replace the first one, and
331 * we ignore any others that might exist.
333 for(i = *first; i; i = next) {
338 * Found the first attribute, replace it,
341 if ((i->da == replace->da) && (!i->da->flags.has_tag || TAG_EQ(replace->tag, i->tag))) {
345 * Should really assert that replace->next == NULL
347 replace->next = next;
353 * Point to where the attribute should go.
359 * If we got here, we didn't find anything to replace, so
360 * stopped at the last item, which we just append to.
365 int8_t attrtagcmp(void const *a, void const *b)
367 VALUE_PAIR const *my_a = a;
368 VALUE_PAIR const *my_b = b;
375 cmp = fr_pointer_cmp(my_a->da, my_b->da);
377 if (cmp != 0) return cmp;
379 if (my_a->tag < my_b->tag) {
383 if (my_a->tag > my_b->tag) {
390 static void pairsort_split(VALUE_PAIR *source, VALUE_PAIR **front, VALUE_PAIR **back)
396 * Stopping condition - no more elements left to split
398 if (!source || !source->next) {
406 * Fast advances twice as fast as slow, so when it gets to the end,
407 * slow will point to the middle of the linked list.
425 static VALUE_PAIR *pairsort_merge(VALUE_PAIR *a, VALUE_PAIR *b, fr_cmp_t cmp)
427 VALUE_PAIR *result = NULL;
433 * Compare the DICT_ATTRs and tags
435 if (cmp(a, b) <= 0) {
437 result->next = pairsort_merge(a->next, b, cmp);
440 result->next = pairsort_merge(a, b->next, cmp);
446 /** Sort a linked list of VALUE_PAIRs using merge sort
448 * @param[in,out] vps List of VALUE_PAIRs to sort.
449 * @param[in] cmp to sort with
451 void pairsort(VALUE_PAIR **vps, fr_cmp_t cmp)
453 VALUE_PAIR *head = *vps;
458 * If there's 0-1 elements it must already be sorted.
460 if (!head || !head->next) {
464 pairsort_split(head, &a, &b); /* Split into sublists */
465 pairsort(&a, cmp); /* Traverse left */
466 pairsort(&b, cmp); /* Traverse right */
469 * merge the two sorted lists together
471 *vps = pairsort_merge(a, b, cmp);
474 /** Write an error to the library errorbuff detailing the mismatch
476 * Retrieve output with fr_strerror();
478 * @todo add thread specific talloc contexts.
480 * @param ctx a hack until we have thread specific talloc contexts.
481 * @param failed pair of attributes which didn't match.
483 void pairvalidate_debug(TALLOC_CTX *ctx, VALUE_PAIR const *failed[2])
485 VALUE_PAIR const *filter = failed[0];
486 VALUE_PAIR const *list = failed[1];
490 (void) fr_strerror(); /* Clear any existing messages */
492 if (!fr_assert(!(!filter && !list))) return;
496 fr_strerror_printf("Attribute \"%s\" not found in list", filter->da->name);
500 if (!filter || (filter->da != list->da)) {
501 fr_strerror_printf("Attribute \"%s\" not found in filter", list->da->name);
505 if (!TAG_EQ(filter->tag, list->tag)) {
506 fr_strerror_printf("Attribute \"%s\" tag \"%i\" didn't match filter tag \"%i\"",
507 list->da->name, list->tag, filter->tag);
511 pair = vp_aprint(ctx, filter);
512 value = vp_aprint_value(ctx, list);
514 fr_strerror_printf("Attribute value \"%s\" didn't match filter \"%s\"", value, pair);
522 /** Uses paircmp to verify all VALUE_PAIRs in list match the filter defined by check
524 * @note will sort both filter and list in place.
526 * @param failed pointer to an array to write the pointers of the filter/list attributes that didn't match.
528 * @param filter attributes to check list against.
529 * @param list attributes, probably a request or reply
531 bool pairvalidate(VALUE_PAIR const *failed[2], VALUE_PAIR *filter, VALUE_PAIR *list)
533 vp_cursor_t filter_cursor;
534 vp_cursor_t list_cursor;
536 VALUE_PAIR *check, *match;
538 if (!filter && !list) {
543 * This allows us to verify the sets of validate and reply are equal
544 * i.e. we have a validate rule which matches every reply attribute.
546 * @todo this should be removed one we have sets and lists
548 pairsort(&filter, attrtagcmp);
549 pairsort(&list, attrtagcmp);
551 check = fr_cursor_init(&filter_cursor, &filter);
552 match = fr_cursor_init(&list_cursor, &list);
553 while (match || check) {
555 * Lists are of different lengths
557 if ((!match && check) || (check && !match)) goto mismatch;
560 * The lists are sorted, so if the first
561 * attributes aren't of the same type, then we're
564 if (!ATTRIBUTE_EQ(check, match)) goto mismatch;
567 * They're of the same type, but don't have the
568 * same values. This is a problem.
570 * Note that the RFCs say that for attributes of
571 * the same type, order is important.
573 if (paircmp(check, match) != 1) goto mismatch;
575 check = fr_cursor_next(&filter_cursor);
576 match = fr_cursor_next(&list_cursor);
589 /** Uses paircmp to verify all VALUE_PAIRs in list match the filter defined by check
591 * @note will sort both filter and list in place.
593 * @param failed pointer to an array to write the pointers of the filter/list attributes that didn't match.
595 * @param filter attributes to check list against.
596 * @param list attributes, probably a request or reply
598 bool pairvalidate_relaxed(VALUE_PAIR const *failed[2], VALUE_PAIR *filter, VALUE_PAIR *list)
600 vp_cursor_t filter_cursor;
601 vp_cursor_t list_cursor;
603 VALUE_PAIR *check, *last_check = NULL, *match = NULL;
605 if (!filter && !list) {
610 * This allows us to verify the sets of validate and reply are equal
611 * i.e. we have a validate rule which matches every reply attribute.
613 * @todo this should be removed one we have sets and lists
615 pairsort(&filter, attrtagcmp);
616 pairsort(&list, attrtagcmp);
618 fr_cursor_init(&list_cursor, &list);
619 for (check = fr_cursor_init(&filter_cursor, &filter);
621 check = fr_cursor_next(&filter_cursor)) {
623 * Were processing check attributes of a new type.
625 if (!ATTRIBUTE_EQ(last_check, check)) {
627 * Record the start of the matching attributes in the pair list
628 * For every other operator we require the match to be present
630 match = fr_cursor_next_by_da(&list_cursor, check->da, check->tag);
632 if (check->op == T_OP_CMP_FALSE) continue;
636 fr_cursor_init(&list_cursor, &match);
641 * Now iterate over all attributes of the same type.
643 for (match = fr_cursor_first(&list_cursor);
644 ATTRIBUTE_EQ(match, check);
645 match = fr_cursor_next(&list_cursor)) {
647 * This attribute passed the filter
649 if (!paircmp(check, match)) goto mismatch;
663 /** Copy a single valuepair
665 * Allocate a new valuepair and copy the da from the old vp.
667 * @param[in] ctx for talloc
668 * @param[in] vp to copy.
669 * @return a copy of the input VP or NULL on error.
671 VALUE_PAIR *paircopyvp(TALLOC_CTX *ctx, VALUE_PAIR const *vp)
675 if (!vp) return NULL;
679 n = pairalloc(ctx, vp->da);
682 memcpy(n, vp, sizeof(*n));
687 if (vp->type == VT_XLAT) {
688 n->value.xlat = talloc_typed_strdup(n, n->value.xlat);
691 n->da = dict_attr_copy(vp->da, true);
699 switch (vp->da->type) {
702 n->vp_octets = NULL; /* else pairmemcpy will free vp's value */
703 pairmemcpy(n, vp->vp_octets, n->length);
707 n->vp_strvalue = NULL; /* else pairstrnpy will free vp's value */
708 pairstrncpy(n, vp->vp_strvalue, n->length);
720 * Copy all pairs from 'from' regardless of tag, attribute or vendor.
722 * @param[in] ctx for new VALUE_PAIRs to be allocated in.
723 * @param[in] from whence to copy VALUE_PAIRs.
724 * @return the head of the new VALUE_PAIR list or NULL on error.
726 VALUE_PAIR *paircopy(TALLOC_CTX *ctx, VALUE_PAIR *from)
728 vp_cursor_t src, dst;
730 VALUE_PAIR *out = NULL, *vp;
732 fr_cursor_init(&dst, &out);
733 for (vp = fr_cursor_init(&src, &from);
735 vp = fr_cursor_next(&src)) {
737 vp = paircopyvp(ctx, vp);
742 fr_cursor_insert(&dst, vp); /* paircopy sets next pointer to NULL */
748 /** Copy matching pairs
750 * Copy pairs of a matching attribute number, vendor number and tag from the
751 * the input list to a new list, and returns the head of this list.
753 * @param[in] ctx for talloc
754 * @param[in] from whence to copy VALUE_PAIRs.
755 * @param[in] attr to match, if 0 input list will not be filtered by attr.
756 * @param[in] vendor to match.
757 * @param[in] tag to match, TAG_ANY matches any tag, TAG_NONE matches tagless VPs.
758 * @return the head of the new VALUE_PAIR list or NULL on error.
760 VALUE_PAIR *paircopy2(TALLOC_CTX *ctx, VALUE_PAIR *from,
761 unsigned int attr, unsigned int vendor, int8_t tag)
763 vp_cursor_t src, dst;
765 VALUE_PAIR *out = NULL, *vp;
767 fr_cursor_init(&dst, &out);
768 for (vp = fr_cursor_init(&src, &from);
770 vp = fr_cursor_next(&src)) {
773 if ((vp->da->attr != attr) || (vp->da->vendor != vendor)) {
777 if (vp->da->flags.has_tag && TAG_EQ(tag, vp->tag)) {
781 vp = paircopyvp(ctx, vp);
786 fr_cursor_insert(&dst, vp);
792 /** Steal all members of a VALUE_PAIR list
794 * @param[in] ctx to move VALUE_PAIRs into
795 * @param[in] from VALUE_PAIRs to move into the new context.
797 VALUE_PAIR *pairsteal(TALLOC_CTX *ctx, VALUE_PAIR *from)
802 for (vp = fr_cursor_init(&cursor, &from);
804 vp = fr_cursor_next(&cursor)) {
805 (void) talloc_steal(ctx, vp);
811 /** Move pairs from source list to destination list respecting operator
813 * @note This function does some additional magic that's probably not needed
814 * in most places. Consider using radius_pairmove in server code.
816 * @note pairfree should be called on the head of the source list to free
817 * unmoved attributes (if they're no longer needed).
819 * @note Does not respect tags when matching.
821 * @param[in] ctx for talloc
822 * @param[in,out] to destination list.
823 * @param[in,out] from source list.
825 * @see radius_pairmove
827 void pairmove(TALLOC_CTX *ctx, VALUE_PAIR **to, VALUE_PAIR **from)
829 VALUE_PAIR *i, *found;
830 VALUE_PAIR *head_new, **tail_new;
831 VALUE_PAIR **tail_from;
833 if (!to || !from || !*from) return;
836 * We're editing the "to" list while we're adding new
837 * attributes to it. We don't want the new attributes to
838 * be edited, so we create an intermediate list to hold
839 * them during the editing process.
842 tail_new = &head_new;
845 * We're looping over the "from" list, moving some
846 * attributes out, but leaving others in place.
849 while ((i = *tail_from) != NULL) {
853 * We never move Fall-Through.
855 if (!i->da->vendor && i->da->attr == PW_FALL_THROUGH) {
856 tail_from = &(i->next);
861 * Unlike previous versions, we treat all other
862 * attributes as normal. i.e. there's no special
863 * treatment for passwords or Hint.
868 * Anything else are operators which
869 * shouldn't occur. We ignore them, and
870 * leave them in place.
873 tail_from = &(i->next);
877 * Add it to the "to" list, but only if
878 * it doesn't already exist.
881 found = pairfind(*to, i->da->attr, i->da->vendor, TAG_ANY);
882 if (!found) goto do_add;
884 tail_from = &(i->next);
888 * Add it to the "to" list, and delete any attribute
889 * of the same vendor/attr which already exists.
892 found = pairfind(*to, i->da->attr, i->da->vendor, TAG_ANY);
893 if (!found) goto do_add;
896 * Do NOT call pairdelete() here,
897 * due to issues with re-writing
898 * "request->username".
900 * Everybody calls pairmove, and
901 * expects it to work. We can't
902 * update request->username here,
903 * so instead we over-write the
904 * vp that it's pointing to.
906 switch (found->da->type) {
911 memcpy(found, i, sizeof(*found));
916 pairmemsteal(found, i->vp_tlv);
921 pairmemsteal(found, i->vp_octets);
926 pairstrsteal(found, i->vp_strvalue);
927 i->vp_strvalue = NULL;
933 * Delete *all* of the attributes
934 * of the same number.
936 pairdelete(&found->next,
938 found->da->vendor, TAG_ANY);
941 * Remove this attribute from the
944 *tail_from = i->next;
950 * Move it from the old list and add it
955 *tail_from = i->next;
957 *tail_new = talloc_steal(ctx, i);
958 tail_new = &(i->next);
961 } /* loop over the "from" list. */
964 * Take the "new" list, and append it to the "to" list.
966 pairadd(to, head_new);
969 /** Move matching pairs between VALUE_PAIR lists
971 * Move pairs of a matching attribute number, vendor number and tag from the
972 * the input list to the output list.
974 * @note pairs which are moved have their parent changed to ctx.
976 * @note pairfree should be called on the head of the old list to free unmoved
977 attributes (if they're no longer needed).
979 * @param[in] ctx for talloc
980 * @param[in,out] to destination list.
981 * @param[in,out] from source list.
982 * @param[in] attr to match. If attribute PW_VENDOR_SPECIFIC and vendor 0,
983 * will match (and therefore copy) only VSAs.
984 * If attribute 0 and vendor 0 will match (and therefore copy) all
986 * @param[in] vendor to match.
987 * @param[in] tag to match, TAG_ANY matches any tag, TAG_NONE matches tagless VPs.
989 void pairfilter(TALLOC_CTX *ctx, VALUE_PAIR **to, VALUE_PAIR **from, unsigned int attr, unsigned int vendor, int8_t tag)
991 VALUE_PAIR *to_tail, *i, *next;
992 VALUE_PAIR *iprev = NULL;
995 * Find the last pair in the "to" list and put it in "to_tail".
997 * @todo: replace the "if" with "VALUE_PAIR **tail"
1001 for(i = *to; i; i = i->next) {
1009 * Attr/vendor of 0 means "move them all".
1010 * It's better than "pairadd(foo,bar);bar=NULL"
1012 if ((vendor == 0) && (attr == 0)) {
1014 to_tail->next = *from;
1019 for (i = *from; i; i = i->next) {
1020 (void) talloc_steal(ctx, i);
1027 for(i = *from; i; i = next) {
1031 if (i->da->flags.has_tag && TAG_EQ(tag, i->tag)) {
1036 * vendor=0, attr = PW_VENDOR_SPECIFIC means
1037 * "match any vendor attribute".
1039 if ((vendor == 0) && (attr == PW_VENDOR_SPECIFIC)) {
1041 * It's a VSA: move it over.
1043 if (i->da->vendor != 0) goto move;
1046 * It's Vendor-Specific: move it over.
1048 if (i->da->attr == attr) goto move;
1051 * It's not a VSA: ignore it.
1058 * If it isn't an exact match, ignore it.
1060 if (!((i->da->vendor == vendor) && (i->da->attr == attr))) {
1067 * Remove the attribute from the "from" list.
1075 * Add the attribute to the "to" list.
1083 (void) talloc_steal(ctx, i);
1087 static char const hextab[] = "0123456789abcdef";
1089 /** Convert string value to native attribute value
1091 * @param vp to assign value to.
1092 * @param value string to convert. Binary safe for variable length values if len is provided.
1093 * @param inlen may be 0 in which case strlen(len) is used to determine length, else inline
1094 * should be the length of the string or sub string to parse.
1095 * @return true on success, else false.
1097 int pairparsevalue(VALUE_PAIR *vp, char const *value, size_t inlen)
1103 if (!value) return -1;
1107 * It's a comparison, not a real VALUE_PAIR, copy the string over verbatim
1109 if ((vp->op == T_OP_REG_EQ) || (vp->op == T_OP_REG_NE)) {
1110 pairstrcpy(vp, value); /* Icky hacky ewww */
1114 len = (inlen == 0) ? strlen(value) : inlen;
1117 * It's a variable length type so we just alloc a new buffer
1118 * of size len and copy.
1120 switch(vp->da->type) {
1121 case PW_TYPE_STRING:
1131 vp->vp_strvalue = p = talloc_memdup(vp, value, len + 1);
1133 talloc_set_type(p, char);
1140 if (c == '\\') switch (*cp) {
1170 c = '\\'; /* no cp++ */
1173 if ((cp[0] >= '0') &&
1179 (sscanf(cp, "%3o", &x) == 1)) {
1188 } /* else at EOL \ --> \ */
1194 vp->length = vp_len;
1198 /* raw octets: 0x01020304... */
1200 if (strcmp(value, "ANY") == 0) {
1203 } /* else it's hex */
1205 case PW_TYPE_OCTETS:
1210 * No 0x prefix, just copy verbatim.
1212 if ((len < 2) || (strncasecmp(value, "0x", 2) != 0)) {
1213 pairmemcpy(vp, (uint8_t const *) value, len);
1218 #ifdef WITH_ASCEND_BINARY
1226 if ((len & 0x01) != 0) {
1227 fr_strerror_printf("Length of Hex String is not even, got %zu bytes", vp->length);
1231 vp->length = len >> 1;
1232 p = talloc_array(vp, uint8_t, vp->length);
1233 if (fr_hex2bin(p, vp->length, value + 2, len) != vp->length) {
1235 fr_strerror_printf("Invalid hex data");
1243 case PW_TYPE_ABINARY:
1244 #ifdef WITH_ASCEND_BINARY
1245 if ((len > 1) && (strncasecmp(value, "0x", 2) == 0)) goto do_octets;
1247 if (ascend_parse_filter(vp, value, len) < 0 ) {
1248 /* Allow ascend_parse_filter's strerror to bubble up */
1254 * If Ascend binary is NOT defined,
1255 * then fall through to raw octets, so that
1256 * the user can at least make them by hand...
1261 /* don't use this! */
1266 if ((len < 2) || (len & 0x01) || (strncasecmp(value, "0x", 2) != 0)) {
1267 fr_strerror_printf("Invalid TLV specification");
1272 vp->length = len >> 1;
1273 p = talloc_array(vp, uint8_t, vp->length);
1275 fr_strerror_printf("No memory");
1278 if (fr_hex2bin(p, vp->length, value + 2, len) != vp->length) {
1279 fr_strerror_printf("Invalid hex data in TLV");
1287 case PW_TYPE_IPV4_ADDR:
1291 if (fr_pton4(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1294 * We allow v4 addresses to have a /32 suffix as some databases (PostgreSQL)
1295 * print them this way.
1297 if (addr.prefix != 32) {
1298 fr_strerror_printf("Invalid IPv4 mask length \"/%i\". Only \"/32\" permitted "
1299 "for non-prefix types", addr.prefix);
1303 vp->vp_ipaddr = addr.ipaddr.ip4addr.s_addr;
1304 vp->length = sizeof(vp->vp_ipaddr);
1308 case PW_TYPE_IPV4_PREFIX:
1312 if (fr_pton4(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1314 vp->vp_ipv4prefix[1] = addr.prefix;
1315 memcpy(vp->vp_ipv4prefix + 2, &addr.ipaddr.ip4addr.s_addr, sizeof(vp->vp_ipv4prefix) - 2);
1316 vp->length = sizeof(vp->vp_ipv4prefix);
1320 case PW_TYPE_IPV6_ADDR:
1324 if (fr_pton6(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1327 * We allow v6 addresses to have a /128 suffix as some databases (PostgreSQL)
1328 * print them this way.
1330 if (addr.prefix != 128) {
1331 fr_strerror_printf("Invalid IPv6 mask length \"/%i\". Only \"/128\" permitted "
1332 "for non-prefix types", addr.prefix);
1336 memcpy(&vp->vp_ipv6addr, &addr.ipaddr.ip6addr.s6_addr, sizeof(vp->vp_ipv6addr));
1337 vp->length = sizeof(vp->vp_ipv6addr);
1341 case PW_TYPE_IPV6_PREFIX:
1345 if (fr_pton6(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1347 vp->vp_ipv6prefix[1] = addr.prefix;
1348 memcpy(vp->vp_ipv6prefix + 2, &addr.ipaddr.ip6addr.s6_addr, sizeof(vp->vp_ipv6prefix) - 2);
1349 vp->length = sizeof(vp->vp_ipv6prefix);
1358 * It's a fixed size type, copy to a temporary buffer and
1359 * \0 terminate if insize >= 0.
1362 if (len >= sizeof(buffer)) {
1363 fr_strerror_printf("Temporary buffer too small");
1367 memcpy(buffer, value, inlen);
1368 buffer[inlen] = '\0';
1372 switch(vp->da->type) {
1379 * Note that ALL integers are unsigned!
1381 vp->vp_integer = fr_strtoul(value, &p);
1383 if (vp->vp_integer > 255) {
1384 fr_strerror_printf("Byte value \"%s\" is larger than 255", value);
1389 if (is_whitespace(p)) break;
1391 goto check_for_value;
1398 * Note that ALL integers are unsigned!
1400 vp->vp_integer = fr_strtoul(value, &p);
1403 if (vp->vp_integer > 65535) {
1404 fr_strerror_printf("Byte value \"%s\" is larger than 65535", value);
1409 if (is_whitespace(p)) break;
1411 goto check_for_value;
1413 case PW_TYPE_INTEGER:
1418 * Note that ALL integers are unsigned!
1420 vp->vp_integer = fr_strtoul(value, &p);
1423 if (is_whitespace(p)) break;
1427 * Look for the named value for the given
1430 if ((dval = dict_valbyname(vp->da->attr, vp->da->vendor, value)) == NULL) {
1431 fr_strerror_printf("Unknown value '%s' for attribute '%s'", value, vp->da->name);
1434 vp->vp_integer = dval->value;
1438 case PW_TYPE_INTEGER64:
1443 * Note that ALL integers are unsigned!
1445 if (sscanf(value, "%" PRIu64, &y) != 1) {
1446 fr_strerror_printf("Invalid value '%s' for attribute '%s'",
1447 value, vp->da->name);
1450 vp->vp_integer64 = y;
1458 * time_t may be 64 bits, whule vp_date
1459 * MUST be 32-bits. We need an
1460 * intermediary variable to handle
1465 if (fr_get_time(value, &date) < 0) {
1466 fr_strerror_printf("failed to parse time string "
1478 if (ifid_aton(value, (void *) &vp->vp_ifid) == NULL) {
1479 fr_strerror_printf("Failed to parse interface-id string \"%s\"", value);
1485 case PW_TYPE_ETHERNET:
1487 char const *c1, *c2, *cp;
1491 * Convert things which are obviously integers to Ethernet addresses
1493 * We assume the number is the bigendian representation of the
1496 if (is_integer(value)) {
1497 uint64_t integer = htonll(atoll(value));
1499 memcpy(&vp->vp_ether, &integer, sizeof(vp->vp_ether));
1507 c2 = memchr(hextab, tolower((int) cp[0]), 16);
1509 } else if ((cp[1] != '\0') && ((cp[2] == ':') || (cp[2] == '\0'))) {
1510 c1 = memchr(hextab, tolower((int) cp[0]), 16);
1511 c2 = memchr(hextab, tolower((int) cp[1]), 16);
1513 if (*cp == ':') cp++;
1517 if (!c1 || !c2 || (vp_len >= sizeof(vp->vp_ether))) {
1518 fr_strerror_printf("failed to parse Ethernet address \"%s\"", value);
1521 vp->vp_ether[vp_len] = ((c1-hextab)<<4) + (c2-hextab);
1530 * Crazy polymorphic (IPv4/IPv6) attribute type for WiMAX.
1532 * We try and make is saner by replacing the original
1533 * da, with either an IPv4 or IPv6 da type.
1535 * These are not dynamic da, and will have the same vendor
1536 * and attribute as the original.
1538 case PW_TYPE_IP_ADDR:
1540 DICT_ATTR const *da;
1542 if (inet_pton(AF_INET6, value, &vp->vp_ipv6addr) > 0) {
1543 da = dict_attrbytype(vp->da->attr, vp->da->vendor, PW_TYPE_IPV6_ADDR);
1545 fr_strerror_printf("Cannot find ipv6addr for %s", vp->da->name);
1549 vp->length = 16; /* length of IPv6 address */
1553 da = dict_attrbytype(vp->da->attr, vp->da->vendor,
1556 fr_strerror_printf("Cannot find ipaddr for %s", vp->da->name);
1560 if (ip_hton(&ipaddr, AF_INET, value, false) < 0) {
1561 fr_strerror_printf("Failed to find IPv4 address for %s", value);
1565 vp->vp_ipaddr = ipaddr.ipaddr.ip4addr.s_addr;
1573 case PW_TYPE_SIGNED:
1574 /* Damned code for 1 WiMAX attribute */
1575 vp->vp_signed = (int32_t) strtol(value, NULL, 10);
1583 fr_strerror_printf("unknown attribute type %d", vp->da->type);
1592 /** Use simple heuristics to create an VALUE_PAIR from an unknown address string
1594 * If a DICT_ATTR is not provided for the address type, parsing will fail with
1597 * @param ctx to allocate VP in.
1598 * @param value IPv4/IPv6 address/prefix string.
1599 * @param ipv4 dictionary attribute to use for an IPv4 address.
1600 * @param ipv6 dictionary attribute to use for an IPv6 address.
1601 * @param ipv4_prefix dictionary attribute to use for an IPv4 prefix.
1602 * @param ipv6_prefix dictionary attribute to use for an IPv6 prefix.
1603 * @return NULL on error, or new VALUE_PAIR.
1605 VALUE_PAIR *pairmake_ip(TALLOC_CTX *ctx, char const *value, DICT_ATTR *ipv4, DICT_ATTR *ipv6,
1606 DICT_ATTR *ipv4_prefix, DICT_ATTR *ipv6_prefix)
1609 DICT_ATTR *da = NULL;
1611 if (!fr_assert(ipv4 || ipv6 || ipv4_prefix || ipv6_prefix)) {
1615 /* No point in repeating the work of pairparsevalue */
1616 if (strchr(value, ':')) {
1617 if (strchr(value, '/')) {
1626 if (strchr(value, '/')) {
1636 fr_strerror_printf("Invalid IP value specified, allowed types are %s%s%s%s",
1637 ipv4 ? "ipaddr " : "", ipv6 ? "ipv6addr " : "",
1638 ipv4_prefix ? "ipv4prefix " : "", ipv6_prefix ? "ipv6prefix" : "");
1641 vp = pairalloc(ctx, da);
1642 if (!vp) return NULL;
1643 if (pairparsevalue(vp, value, 0) < 0) {
1652 /** Create a valuepair from an ASCII attribute and value
1654 * Where the attribute name is in the form:
1656 * - Attr-%d.%d.%d...
1657 * - Vendor-%d-Attr-%d
1658 * - VendorName-Attr-%d
1660 * @param ctx for talloc
1661 * @param attribute name to parse.
1662 * @param value to parse (must be a hex string).
1663 * @param op to assign to new valuepair.
1664 * @return new valuepair or NULL on error.
1666 static VALUE_PAIR *pairmake_any(TALLOC_CTX *ctx,
1667 char const *attribute, char const *value,
1671 DICT_ATTR const *da;
1676 da = dict_attrunknownbyname(attribute, true);
1677 if (!da) return NULL;
1680 * Unknown attributes MUST be of type 'octets'
1682 if (value && (strncasecmp(value, "0x", 2) != 0)) {
1683 fr_strerror_printf("Unknown attribute \"%s\" requires a hex "
1684 "string, not \"%s\"", attribute, value);
1686 dict_attr_free(&da);
1691 * We've now parsed the attribute properly, Let's create
1692 * it. This next stop also looks the attribute up in the
1693 * dictionary, and creates the appropriate type for it.
1695 vp = pairalloc(ctx, da);
1697 dict_attr_free(&da);
1701 vp->op = (op == 0) ? T_OP_EQ : op;
1703 if (!value) return vp;
1705 size = strlen(value + 2);
1706 vp->length = size >> 1;
1707 data = talloc_array(vp, uint8_t, vp->length);
1709 if (fr_hex2bin(data, vp->length, value + 2, size) != vp->length) {
1710 fr_strerror_printf("Invalid hex string");
1715 vp->vp_octets = data;
1721 /** Create a VALUE_PAIR from ASCII strings
1723 * Converts an attribute string identifier (with an optional tag qualifier)
1724 * and value string into a VALUE_PAIR.
1726 * The string value is parsed according to the type of VALUE_PAIR being created.
1728 * @param[in] ctx for talloc
1729 * @param[in] vps list where the attribute will be added (optional)
1730 * @param[in] attribute name.
1731 * @param[in] value attribute value (may be NULL if value will be set later).
1732 * @param[in] op to assign to new VALUE_PAIR.
1733 * @return a new VALUE_PAIR.
1735 VALUE_PAIR *pairmake(TALLOC_CTX *ctx, VALUE_PAIR **vps,
1736 char const *attribute, char const *value, FR_TOKEN op)
1738 DICT_ATTR const *da;
1744 char const *attrname = attribute;
1747 * Check for tags in 'Attribute:Tag' format.
1752 ts = strrchr(attribute, ':');
1754 fr_strerror_printf("Invalid tag for attribute %s", attribute);
1759 strlcpy(buffer, attribute, sizeof(buffer));
1761 ts = strrchr(attrname, ':');
1762 if (!ts) return NULL;
1764 /* Colon found with something behind it */
1765 if (ts[1] == '*' && ts[2] == 0) {
1766 /* Wildcard tag for check items */
1769 } else if ((ts[1] >= '0') && (ts[1] <= '9')) {
1770 /* It's not a wild card tag */
1771 tag = strtol(ts + 1, &tc, 0);
1772 if (tc && !*tc && TAG_VALID_ZERO(tag))
1776 fr_strerror_printf("Invalid tag for attribute %s", attribute);
1783 * It's not found in the dictionary, so we use
1784 * another method to create the attribute.
1786 da = dict_attrbyname(attrname);
1788 vp = pairmake_any(ctx, attrname, value, op);
1789 if (vp && vps) pairadd(vps, vp);
1793 /* Check for a tag in the 'Merit' format of:
1794 * :Tag:Value. Print an error if we already found
1795 * a tag in the Attribute.
1798 if (value && (*value == ':' && da->flags.has_tag)) {
1799 /* If we already found a tag, this is invalid */
1801 fr_strerror_printf("Duplicate tag %s for attribute %s",
1803 DEBUG("Duplicate tag %s for attribute %s\n",
1807 /* Colon found and attribute allows a tag */
1808 if (value[1] == '*' && value[2] == ':') {
1809 /* Wildcard tag for check items */
1814 tag = strtol(value + 1, &tc, 0);
1815 if (tc && *tc==':' && TAG_VALID_ZERO(tag))
1821 vp = pairalloc(ctx, da);
1822 if (!vp) return NULL;
1823 vp->op = (op == 0) ? T_OP_EQ : op;
1828 case T_OP_CMP_FALSE:
1829 vp->vp_strvalue = NULL;
1831 value = NULL; /* ignore it! */
1835 * Regular expression comparison of integer attributes
1836 * does a STRING comparison of the names of their
1837 * integer attributes.
1839 case T_OP_REG_EQ: /* =~ */
1840 case T_OP_REG_NE: /* !~ */
1846 fr_strerror_printf("Regular expressions are not supported");
1852 * Someone else will fill in the value.
1858 compare = regcomp(®, value, REG_EXTENDED);
1860 regerror(compare, ®, buffer, sizeof(buffer));
1861 fr_strerror_printf("Illegal regular expression in attribute: %s: %s",
1867 vp = pairmake(ctx, NULL, attribute, NULL, op);
1868 if (!vp) return NULL;
1870 if (pairmark_xlat(vp, value) < 0) {
1875 value = NULL; /* ignore it */
1884 * FIXME: if (strcasecmp(attribute, vp->da->name) != 0)
1885 * then the user MAY have typed in the attribute name
1886 * as Vendor-%d-Attr-%d, and the value MAY be octets.
1888 * We probably want to fix pairparsevalue to accept
1889 * octets as values for any attribute.
1891 if (value && (pairparsevalue(vp, value, 0) < 0)) {
1896 if (vps) pairadd(vps, vp);
1900 /** Mark a valuepair for xlat expansion
1902 * Copies xlat source (unprocessed) string to valuepair value,
1903 * and sets value type.
1905 * @param vp to mark for expansion.
1906 * @param value to expand.
1907 * @return 0 if marking succeeded or -1 if vp already had a value, or OOM.
1909 int pairmark_xlat(VALUE_PAIR *vp, char const *value)
1914 * valuepair should not already have a value.
1916 if (vp->type != VT_NONE) {
1920 raw = talloc_typed_strdup(vp, value);
1926 vp->value.xlat = raw;
1932 /** Read a single valuepair from a buffer, and advance the pointer
1934 * Sets *eol to T_EOL if end of line was encountered.
1936 * @param[in,out] ptr to read from and update.
1937 * @param[out] raw The struct to write the raw VALUE_PAIR to.
1938 * @return the last token read.
1940 FR_TOKEN pairread(char const **ptr, VALUE_PAIR_RAW *raw)
1944 FR_TOKEN ret = T_OP_INVALID, next, quote;
1947 if (!ptr || !*ptr || !raw) {
1948 fr_strerror_printf("Invalid arguments");
1949 return T_OP_INVALID;
1953 * Skip leading spaces
1956 while ((*p == ' ') || (*p == '\t')) p++;
1959 fr_strerror_printf("No token read where we expected "
1960 "an attribute name");
1961 return T_OP_INVALID;
1965 fr_strerror_printf("Read a comment instead of a token");
1971 * Try to get the attribute name.
1976 uint8_t const *t = (uint8_t const *) p;
1978 if (q >= (raw->l_opand + sizeof(raw->l_opand))) {
1980 fr_strerror_printf("Attribute name too long");
1981 return T_OP_INVALID;
1985 * Only ASCII is allowed, and only a subset of that.
1987 if ((*t < 32) || (*t >= 128)) {
1989 fr_strerror_printf("Invalid attribute name");
1990 return T_OP_INVALID;
1994 * This is arguably easier than trying to figure
1995 * out which operators come after the attribute
1996 * name. Yes, our "lexer" is bad.
1998 if (!dict_attr_allowed_chars[(int) *t]) {
2006 * ASCII, but not a valid attribute name.
2008 if (!*raw->l_opand) goto invalid;
2011 * Look for tag (:#). This is different from :=, which
2014 if ((*p == ':') && (isdigit((int) p[1]))) {
2015 if (q >= (raw->l_opand + sizeof(raw->l_opand))) {
2020 while (isdigit((int) *p)) {
2021 if (q >= (raw->l_opand + sizeof(raw->l_opand))) {
2031 /* Now we should have an operator here. */
2032 raw->op = gettoken(ptr, buf, sizeof(buf), false);
2033 if (raw->op < T_EQSTART || raw->op > T_EQEND) {
2034 fr_strerror_printf("Expecting operator");
2036 return T_OP_INVALID;
2040 * Read value. Note that empty string values are allowed
2042 quote = gettoken(ptr, raw->r_opand, sizeof(raw->r_opand), false);
2043 if (quote == T_EOL) {
2044 fr_strerror_printf("Failed to get value");
2046 return T_OP_INVALID;
2050 * Peek at the next token. Must be T_EOL, T_COMMA, or T_HASH
2054 next = gettoken(&p, buf, sizeof(buf), false);
2065 fr_strerror_printf("Expected end of line or comma");
2066 return T_OP_INVALID;
2074 case T_DOUBLE_QUOTED_STRING:
2076 * Only report as double quoted if it contained valid
2077 * a valid xlat expansion.
2079 p = strchr(raw->r_opand, '%');
2080 if (p && (p[1] == '{')) {
2083 raw->quote = T_SINGLE_QUOTED_STRING;
2096 /** Read one line of attribute/value pairs into a list.
2098 * The line may specify multiple attributes separated by commas.
2100 * @note If the function returns T_OP_INVALID, an error has occurred and
2101 * @note the valuepair list should probably be freed.
2103 * @param ctx for talloc
2104 * @param buffer to read valuepairs from.
2105 * @param list where the parsed VALUE_PAIRs will be appended.
2106 * @return the last token parsed, or T_OP_INVALID
2108 FR_TOKEN userparse(TALLOC_CTX *ctx, char const *buffer, VALUE_PAIR **list)
2110 VALUE_PAIR *vp, *head, **tail;
2112 FR_TOKEN last_token = T_OP_INVALID;
2113 FR_TOKEN previous_token;
2117 * We allow an empty line.
2119 if (buffer[0] == 0) {
2128 raw.l_opand[0] = '\0';
2129 raw.r_opand[0] = '\0';
2131 previous_token = last_token;
2133 last_token = pairread(&p, &raw);
2134 if (last_token == T_OP_INVALID) break;
2136 if (raw.quote == T_DOUBLE_QUOTED_STRING) {
2137 vp = pairmake(ctx, NULL, raw.l_opand, NULL, raw.op);
2139 last_token = T_OP_INVALID;
2142 if (pairmark_xlat(vp, raw.r_opand) < 0) {
2144 last_token = T_OP_INVALID;
2148 vp = pairmake(ctx, NULL, raw.l_opand, raw.r_opand, raw.op);
2150 last_token = T_OP_INVALID;
2156 tail = &((*tail)->next);
2157 } while (*p && (last_token == T_COMMA));
2160 * Don't tell the caller that there was a comment.
2162 if (last_token == T_HASH) {
2163 last_token = previous_token;
2166 if (last_token == T_OP_INVALID) {
2169 pairadd(list, head);
2173 * And return the last token which we read.
2179 * Read valuepairs from the fp up to End-Of-File.
2181 int readvp2(VALUE_PAIR **out, TALLOC_CTX *ctx, FILE *fp, bool *pfiledone)
2184 FR_TOKEN last_token = T_EOL;
2188 VALUE_PAIR *vp = NULL;
2190 fr_cursor_init(&cursor, out);
2192 while (fgets(buf, sizeof(buf), fp) != NULL) {
2194 * If we get a '\n' by itself, we assume that's
2195 * the end of that VP
2197 if (buf[0] == '\n') {
2203 * Comments get ignored
2205 if (buf[0] == '#') continue;
2208 * Read all of the attributes on the current line.
2211 last_token = userparse(ctx, buf, &vp);
2213 if (last_token != T_EOL) goto error;
2217 fr_cursor_insert(&cursor, vp);
2226 vp = fr_cursor_first(&cursor);
2227 if (vp) pairfree(&vp);
2232 /** Compare two attribute values
2234 * @param[in] one the first attribute.
2235 * @param[in] two the second attribute.
2236 * @return -1 if one is less than two, 0 if both are equal, 1 if one is more than two, < -1 on error.
2238 int8_t paircmp_value(VALUE_PAIR const *one, VALUE_PAIR const *two)
2240 int64_t compare = 0;
2245 if (one->da->type != two->da->type) {
2246 fr_strerror_printf("Can't compare attribute values of different types");
2251 * After doing the previous check for special comparisons,
2252 * do the per-type comparison here.
2254 switch (one->da->type) {
2255 case PW_TYPE_ABINARY:
2256 case PW_TYPE_OCTETS:
2260 if (one->length > two->length) {
2261 length = one->length;
2263 length = two->length;
2267 compare = memcmp(one->vp_octets, two->vp_octets, length);
2268 if (compare != 0) break;
2272 * Contents are the same. The return code
2273 * is therefore the difference in lengths.
2275 * i.e. "0x00" is smaller than "0x0000"
2277 compare = one->length - two->length;
2281 case PW_TYPE_STRING:
2282 fr_assert(one->vp_strvalue);
2283 fr_assert(two->vp_strvalue);
2284 compare = strcmp(one->vp_strvalue, two->vp_strvalue);
2287 case PW_TYPE_BOOLEAN:
2290 case PW_TYPE_INTEGER:
2292 compare = (int64_t) one->vp_integer - (int64_t) two->vp_integer;
2295 case PW_TYPE_SIGNED:
2296 compare = one->vp_signed - two->vp_signed;
2299 case PW_TYPE_INTEGER64:
2301 * Don't want integer overflow!
2303 if (one->vp_integer64 < two->vp_integer64) {
2305 } else if (one->vp_integer64 > two->vp_integer64) {
2310 case PW_TYPE_ETHERNET:
2311 compare = memcmp(&one->vp_ether, &two->vp_ether, sizeof(one->vp_ether));
2314 case PW_TYPE_IPV4_ADDR:
2315 compare = (int64_t) ntohl(one->vp_ipaddr) - (int64_t) ntohl(two->vp_ipaddr);
2318 case PW_TYPE_IPV6_ADDR:
2319 compare = memcmp(&one->vp_ipv6addr, &two->vp_ipv6addr, sizeof(one->vp_ipv6addr));
2322 case PW_TYPE_IPV6_PREFIX:
2323 compare = memcmp(&one->vp_ipv6prefix, &two->vp_ipv6prefix, sizeof(one->vp_ipv6prefix));
2326 case PW_TYPE_IPV4_PREFIX:
2327 compare = memcmp(&one->vp_ipv4prefix, &two->vp_ipv4prefix, sizeof(one->vp_ipv4prefix));
2331 compare = memcmp(&one->vp_ifid, &two->vp_ifid, sizeof(one->vp_ifid));
2335 * None of the types below should be in the REQUEST
2337 case PW_TYPE_INVALID: /* We should never see these */
2338 case PW_TYPE_IP_ADDR: /* This should of been converted into IPADDR/IPV6ADDR */
2339 case PW_TYPE_IP_PREFIX: /* This should of been converted into IPADDR/IPV6ADDR */
2341 case PW_TYPE_EXTENDED:
2342 case PW_TYPE_LONG_EXTENDED:
2345 case PW_TYPE_TIMEVAL:
2347 fr_assert(0); /* unknown type */
2351 * Do NOT add a default here, as new types are added
2352 * static analysis will warn us they're not handled
2358 } else if (compare < 0) {
2365 * We leverage the fact that IPv4 and IPv6 prefixes both
2366 * have the same format:
2368 * reserved, prefix-len, data...
2370 static int paircmp_op_cidr(FR_TOKEN op, int bytes,
2371 uint8_t one_net, uint8_t const *one,
2372 uint8_t two_net, uint8_t const *two)
2378 * Handle the case of netmasks being identical.
2380 if (one_net == two_net) {
2383 compare = memcmp(one, two, bytes);
2386 * If they're identical return true for
2389 if ((compare == 0) &&
2390 ((op == T_OP_CMP_EQ) ||
2397 * Everything else returns false.
2399 * 10/8 == 24/8 --> false
2400 * 10/8 <= 24/8 --> false
2401 * 10/8 >= 24/8 --> false
2407 * Netmasks are different. That limits the
2408 * possible results, based on the operator.
2418 case T_OP_LT: /* 192/8 < 192.168/16 --> false */
2419 if (one_net < two_net) {
2425 case T_OP_GT: /* 192/16 > 192.168/8 --> false */
2426 if (one_net > two_net) {
2435 if (one_net < two_net) {
2442 * Do the check byte by byte. If the bytes are
2443 * identical, it MAY be a match. If they're different,
2444 * it is NOT a match.
2449 * All leading bytes are identical.
2451 if (common == 0) return true;
2454 * Doing bitmasks takes more work.
2456 if (common < 8) break;
2458 if (one[i] != two[i]) return false;
2466 mask <<= (8 - common);
2470 if ((one[i] & mask) == ((two[i] & mask))) {
2477 /** Compare two attributes using an operator
2479 * @param[in] a the first attribute
2480 * @param[in] op the operator for comparison.
2481 * @param[in] b the second attribute
2482 * @return 1 if true, 0 if false, -1 on error.
2484 int8_t paircmp_op(VALUE_PAIR const *a, FR_TOKEN op, VALUE_PAIR const *b)
2488 if (!a || !b) return -1;
2490 switch (a->da->type) {
2491 case PW_TYPE_IPV4_ADDR:
2492 switch (b->da->type) {
2493 case PW_TYPE_IPV4_ADDR: /* IPv4 and IPv4 */
2496 case PW_TYPE_IPV4_PREFIX: /* IPv4 and IPv4 Prefix */
2497 return paircmp_op_cidr(op, 4, 32, (uint8_t const *) &a->vp_ipaddr,
2498 b->vp_ipv4prefix[1], (uint8_t const *) &b->vp_ipv4prefix + 2);
2501 fr_strerror_printf("Cannot compare IPv4 with IPv6 address");
2506 case PW_TYPE_IPV4_PREFIX: /* IPv4 and IPv4 Prefix */
2507 switch (b->da->type) {
2508 case PW_TYPE_IPV4_ADDR:
2509 return paircmp_op_cidr(op, 4, a->vp_ipv4prefix[1],
2510 (uint8_t const *) &a->vp_ipv4prefix + 2,
2511 32, (uint8_t const *) &b->vp_ipaddr);
2513 case PW_TYPE_IPV4_PREFIX: /* IPv4 Prefix and IPv4 Prefix */
2514 return paircmp_op_cidr(op, 4, a->vp_ipv4prefix[1],
2515 (uint8_t const *) &a->vp_ipv4prefix + 2,
2516 b->vp_ipv4prefix[1], (uint8_t const *) &b->vp_ipv4prefix + 2);
2519 fr_strerror_printf("Cannot compare IPv4 with IPv6 address");
2524 case PW_TYPE_IPV6_ADDR:
2525 switch (b->da->type) {
2526 case PW_TYPE_IPV6_ADDR: /* IPv6 and IPv6 */
2529 case PW_TYPE_IPV6_PREFIX: /* IPv6 and IPv6 Preifx */
2530 return paircmp_op_cidr(op, 16, 128, (uint8_t const *) &a->vp_ipv6addr,
2531 b->vp_ipv6prefix[1], (uint8_t const *) &b->vp_ipv6prefix + 2);
2535 fr_strerror_printf("Cannot compare IPv6 with IPv4 address");
2540 case PW_TYPE_IPV6_PREFIX:
2541 switch (b->da->type) {
2542 case PW_TYPE_IPV6_ADDR: /* IPv6 Prefix and IPv6 */
2543 return paircmp_op_cidr(op, 16, a->vp_ipv6prefix[1],
2544 (uint8_t const *) &a->vp_ipv6prefix + 2,
2545 128, (uint8_t const *) &b->vp_ipv6addr);
2547 case PW_TYPE_IPV6_PREFIX: /* IPv6 Prefix and IPv6 */
2548 return paircmp_op_cidr(op, 16, a->vp_ipv6prefix[1],
2549 (uint8_t const *) &a->vp_ipv6prefix + 2,
2550 b->vp_ipv6prefix[1], (uint8_t const *) &b->vp_ipv6prefix + 2);
2553 fr_strerror_printf("Cannot compare IPv6 with IPv4 address");
2560 compare = paircmp_value(a, b);
2561 if (compare < -1) { /* comparison error */
2567 * Now do the operator comparison.
2571 return (compare == 0);
2574 return (compare != 0);
2577 return (compare < 0);
2580 return (compare > 0);
2583 return (compare <= 0);
2586 return (compare >= 0);
2593 /** Compare two pairs, using the operator from "a"
2595 * i.e. given two attributes, it does:
2597 * (b->data) (a->operator) (a->data)
2599 * e.g. "foo" != "bar"
2601 * @param[in] a the first attribute
2602 * @param[in] b the second attribute
2603 * @return 1 if true, 0 if false, -1 on error.
2605 int8_t paircmp(VALUE_PAIR *a, VALUE_PAIR *b)
2610 if (b) VERIFY_VP(b);
2616 case T_OP_CMP_FALSE:
2620 * a is a regex, compile it, print b to a string,
2621 * and then do string comparisons.
2631 char buffer[MAX_STRING_LEN * 4 + 1];
2633 compare = regcomp(®, a->vp_strvalue, REG_EXTENDED);
2635 regerror(compare, ®, buffer, sizeof(buffer));
2636 fr_strerror_printf("Illegal regular expression in attribute: %s: %s",
2637 a->da->name, buffer);
2646 vp_prints_value(buffer, sizeof(buffer), b, 0);
2649 * Don't care about substring matches,
2652 compare = regexec(®, buffer, 0, NULL, 0);
2655 if (a->op == T_OP_REG_EQ) {
2656 return (compare == 0);
2659 return (compare != 0);
2663 default: /* we're OK */
2667 return paircmp_op(b, a->op, a);
2670 /** Determine equality of two lists
2672 * This is useful for comparing lists of attributes inserted into a binary tree.
2674 * @param a first list of VALUE_PAIRs.
2675 * @param b second list of VALUE_PAIRs.
2676 * @return -1 if a < b, 0 if the two lists are equal, 1 if a > b, -2 on error.
2678 int8_t pairlistcmp(VALUE_PAIR *a, VALUE_PAIR *b)
2680 vp_cursor_t a_cursor, b_cursor;
2681 VALUE_PAIR *a_p, *b_p;
2684 for (a_p = fr_cursor_init(&a_cursor, &a), b_p = fr_cursor_init(&b_cursor, &b);
2686 a_p = fr_cursor_next(&a_cursor), b_p = fr_cursor_next(&b_cursor)) {
2687 /* Same VP, no point doing expensive checks */
2692 if (a_p->da < b_p->da) {
2695 if (a_p->da > b_p->da) {
2699 if (a_p->tag < b_p->tag) {
2702 if (a_p->tag > b_p->tag) {
2706 ret = paircmp_value(a_p, b_p);
2708 fr_assert(ret >= -1); /* Comparison error */
2725 /** Set the type of the VALUE_PAIR value buffer to match it's DICT_ATTR
2727 * @param vp to fixup.
2729 static void pairtypeset(VALUE_PAIR *vp)
2731 if (!vp->data.ptr) return;
2733 switch(vp->da->type) {
2734 case PW_TYPE_OCTETS:
2736 talloc_set_type(vp->data.ptr, uint8_t);
2739 case PW_TYPE_STRING:
2740 talloc_set_type(vp->data.ptr, char);
2748 /** Copy data into an "octets" data type.
2750 * @param[in,out] vp to update
2751 * @param[in] src data to copy
2752 * @param[in] size of the data, may be 0 in which case previous value will be freed.
2754 void pairmemcpy(VALUE_PAIR *vp, uint8_t const *src, size_t size)
2756 uint8_t *p = NULL, *q;
2761 p = talloc_memdup(vp, src, size);
2763 talloc_set_type(p, uint8_t);
2766 memcpy(&q, &vp->vp_octets, sizeof(q));
2772 if (size > 0) pairtypeset(vp);
2775 /** Reparent an allocated octet buffer to a VALUE_PAIR
2777 * @param[in,out] vp to update
2778 * @param[in] src buffer to steal.
2780 void pairmemsteal(VALUE_PAIR *vp, uint8_t const *src)
2786 memcpy(&q, &vp->vp_octets, sizeof(q));
2789 vp->vp_octets = talloc_steal(vp, src);
2791 vp->length = talloc_array_length(vp->vp_strvalue);
2795 /** Reparent an allocated char buffer to a VALUE_PAIR
2797 * @param[in,out] vp to update
2798 * @param[in] src buffer to steal.
2800 void pairstrsteal(VALUE_PAIR *vp, char const *src)
2806 memcpy(&q, &vp->vp_octets, sizeof(q));
2809 vp->vp_strvalue = talloc_steal(vp, src);
2811 vp->length = talloc_array_length(vp->vp_strvalue) - 1;
2815 /** Copy data into an "string" data type.
2817 * @param[in,out] vp to update
2818 * @param[in] src data to copy
2820 void pairstrcpy(VALUE_PAIR *vp, char const *src)
2826 p = talloc_strdup(vp, src);
2830 memcpy(&q, &vp->vp_strvalue, sizeof(q));
2833 vp->vp_strvalue = p;
2835 vp->length = talloc_array_length(vp->vp_strvalue) - 1;
2839 /** Copy data into an "string" data type.
2841 * @param[in,out] vp to update.
2842 * @param[in] src data to copy.
2843 * @param[in] len of data to copy.
2845 void pairstrncpy(VALUE_PAIR *vp, char const *src, size_t len)
2851 p = talloc_array(vp, char, len + 1);
2854 memcpy(p, src, len); /* embdedded \0 safe */
2857 memcpy(&q, &vp->vp_strvalue, sizeof(q));
2860 vp->vp_strvalue = p;
2866 /** Copy data from one VP to another
2868 * Allocate a new pair using da, and copy over the value from the specified vp.
2870 * @todo Should be able to do type conversions.
2872 * @param[in,out] vp to update.
2873 * @param[in] da Type of data represented by data.
2874 * @param[in] data to copy.
2875 * @param[in] len of data to copy.
2877 int pairdatacpy(VALUE_PAIR *vp, DICT_ATTR const *da, value_data_t const *data, size_t len)
2883 * The da->types have to be identical, OR the "from" da->type has
2886 if (vp->da->type != da->type) {
2888 * Decode the octets buffer using the RADIUS decoder.
2890 if (da->type == PW_TYPE_OCTETS) {
2891 if (data2vp(vp, NULL, NULL, NULL, vp->da, data->octets, len, len, &vp) < 0) return -1;
2897 * Else if the destination da->type is octets
2899 if (vp->da->type == PW_TYPE_OCTETS) {
2902 VALUE_PAIR const *pvp = vp;
2904 buff = talloc_array(vp, uint8_t, dict_attr_sizes[da->type][1] + 2);
2906 ret = rad_vp2rfc(NULL, NULL, NULL, &pvp, buff, dict_attr_sizes[da->type][1]);
2907 if (ret < 0) return -1;
2909 pairmemcpy(vp, buff + 2, ret - 2);
2918 fr_strerror_printf("Data conversion not supported");
2923 * Clear existing value if there is one
2925 memcpy(&old, &vp->data.ptr, sizeof(old));
2928 switch (vp->da->type) {
2930 case PW_TYPE_OCTETS:
2931 pairmemcpy(vp, data->octets, len);
2934 case PW_TYPE_STRING:
2935 pairstrncpy(vp, data->strvalue, len);
2939 memcpy(&vp->data, data, sizeof(vp->data));
2947 /** Print data into an "string" data type.
2949 * @param[in,out] vp to update
2950 * @param[in] fmt the format string
2952 void pairsprintf(VALUE_PAIR *vp, char const *fmt, ...)
2960 p = talloc_vasprintf(vp, fmt, ap);
2965 memcpy(&q, &vp->vp_strvalue, sizeof(q));
2968 vp->vp_strvalue = p;
2971 vp->length = talloc_array_length(vp->vp_strvalue) - 1;