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)
237 for (i = fr_cursor_init(&cursor, &vp);
239 i = fr_cursor_next(&cursor)) {
240 if ((i->da->attr == attr) && (i->da->vendor == vendor) && \
241 (!i->da->flags.has_tag || TAG_EQ(tag, i->tag))) {
249 /** Delete matching pairs
251 * Delete matching pairs from the attribute list.
253 * @param[in,out] first VP in list.
254 * @param[in] attr to match.
255 * @param[in] vendor to match.
256 * @param[in] tag to match. TAG_ANY matches any tag, TAG_NONE matches tagless VPs.
258 * @todo should take DAs and do a point comparison.
260 void pairdelete(VALUE_PAIR **first, unsigned int attr, unsigned int vendor,
263 VALUE_PAIR *i, *next;
264 VALUE_PAIR **last = first;
266 for(i = *first; i; i = next) {
269 if ((i->da->attr == attr) && (i->da->vendor == vendor) &&
270 (!i->da->flags.has_tag || TAG_EQ(tag, i->tag))) {
279 /** Add a VP to the end of the list.
281 * Locates the end of 'first', and links an additional VP 'add' at the end.
283 * @param[in] first VP in linked list. Will add new VP to the end of this list.
284 * @param[in] add VP to add to list.
286 void pairadd(VALUE_PAIR **first, VALUE_PAIR *add)
294 if (*first == NULL) {
298 for(i = *first; i->next; i = i->next)
303 /** Replace all matching VPs
305 * Walks over 'first', and replaces the first VP that matches 'replace'.
307 * @note Memory used by the VP being replaced will be freed.
308 * @note Will not work with unknown attributes.
310 * @param[in,out] first VP in linked list. Will search and replace in this list.
311 * @param[in] replace VP to replace.
313 void pairreplace(VALUE_PAIR **first, VALUE_PAIR *replace)
315 VALUE_PAIR *i, *next;
316 VALUE_PAIR **prev = first;
320 if (*first == NULL) {
326 * Not an empty list, so find item if it is there, and
327 * replace it. Note, we always replace the first one, and
328 * we ignore any others that might exist.
330 for(i = *first; i; i = next) {
335 * Found the first attribute, replace it,
338 if ((i->da == replace->da) && (!i->da->flags.has_tag || TAG_EQ(replace->tag, i->tag))) {
342 * Should really assert that replace->next == NULL
344 replace->next = next;
350 * Point to where the attribute should go.
356 * If we got here, we didn't find anything to replace, so
357 * stopped at the last item, which we just append to.
362 int8_t attrtagcmp(void const *a, void const *b)
364 VALUE_PAIR const *my_a = a;
365 VALUE_PAIR const *my_b = b;
372 cmp = fr_pointer_cmp(my_a->da, my_b->da);
374 if (cmp != 0) return cmp;
376 if (my_a->tag < my_b->tag) {
380 if (my_a->tag > my_b->tag) {
387 static void pairsort_split(VALUE_PAIR *source, VALUE_PAIR **front, VALUE_PAIR **back)
393 * Stopping condition - no more elements left to split
395 if (!source || !source->next) {
403 * Fast advances twice as fast as slow, so when it gets to the end,
404 * slow will point to the middle of the linked list.
422 static VALUE_PAIR *pairsort_merge(VALUE_PAIR *a, VALUE_PAIR *b, fr_cmp_t cmp)
424 VALUE_PAIR *result = NULL;
430 * Compare the DICT_ATTRs and tags
432 if (cmp(a, b) <= 0) {
434 result->next = pairsort_merge(a->next, b, cmp);
437 result->next = pairsort_merge(a, b->next, cmp);
443 /** Sort a linked list of VALUE_PAIRs using merge sort
445 * @param[in,out] vps List of VALUE_PAIRs to sort.
446 * @param[in] cmp to sort with
448 void pairsort(VALUE_PAIR **vps, fr_cmp_t cmp)
450 VALUE_PAIR *head = *vps;
455 * If there's 0-1 elements it must already be sorted.
457 if (!head || !head->next) {
461 pairsort_split(head, &a, &b); /* Split into sublists */
462 pairsort(&a, cmp); /* Traverse left */
463 pairsort(&b, cmp); /* Traverse right */
466 * merge the two sorted lists together
468 *vps = pairsort_merge(a, b, cmp);
471 /** Write an error to the library errorbuff detailing the mismatch
473 * Retrieve output with fr_strerror();
475 * @todo add thread specific talloc contexts.
477 * @param ctx a hack until we have thread specific talloc contexts.
478 * @param failed pair of attributes which didn't match.
480 void pairvalidate_debug(TALLOC_CTX *ctx, VALUE_PAIR const *failed[2])
482 VALUE_PAIR const *filter = failed[0];
483 VALUE_PAIR const *list = failed[1];
487 (void) fr_strerror(); /* Clear any existing messages */
489 if (!fr_assert(!(!filter && !list))) return;
493 fr_strerror_printf("Attribute \"%s\" not found in list", filter->da->name);
497 if (!filter || (filter->da != list->da)) {
498 fr_strerror_printf("Attribute \"%s\" not found in filter", list->da->name);
502 if (!TAG_EQ(filter->tag, list->tag)) {
503 fr_strerror_printf("Attribute \"%s\" tag \"%i\" didn't match filter tag \"%i\"",
504 list->da->name, list->tag, filter->tag);
508 pair = vp_aprint(ctx, filter);
509 value = vp_aprint_value(ctx, list);
511 fr_strerror_printf("Attribute value \"%s\" didn't match filter \"%s\"", value, pair);
519 /** Uses paircmp to verify all VALUE_PAIRs in list match the filter defined by check
521 * @note will sort both filter and list in place.
523 * @param failed pointer to an array to write the pointers of the filter/list attributes that didn't match.
525 * @param filter attributes to check list against.
526 * @param list attributes, probably a request or reply
528 bool pairvalidate(VALUE_PAIR const *failed[2], VALUE_PAIR *filter, VALUE_PAIR *list)
530 vp_cursor_t filter_cursor;
531 vp_cursor_t list_cursor;
533 VALUE_PAIR *check, *match;
535 if (!filter && !list) {
540 * This allows us to verify the sets of validate and reply are equal
541 * i.e. we have a validate rule which matches every reply attribute.
543 * @todo this should be removed one we have sets and lists
545 pairsort(&filter, attrtagcmp);
546 pairsort(&list, attrtagcmp);
548 check = fr_cursor_init(&filter_cursor, &filter);
549 match = fr_cursor_init(&list_cursor, &list);
550 while (match || check) {
552 * Lists are of different lengths
554 if ((!match && check) || (check && !match)) goto mismatch;
557 * The lists are sorted, so if the first
558 * attributes aren't of the same type, then we're
561 if (!ATTRIBUTE_EQ(check, match)) goto mismatch;
564 * They're of the same type, but don't have the
565 * same values. This is a problem.
567 * Note that the RFCs say that for attributes of
568 * the same type, order is important.
570 if (paircmp(check, match) != 1) goto mismatch;
572 check = fr_cursor_next(&filter_cursor);
573 match = fr_cursor_next(&list_cursor);
586 /** Uses paircmp to verify all VALUE_PAIRs in list match the filter defined by check
588 * @note will sort both filter and list in place.
590 * @param failed pointer to an array to write the pointers of the filter/list attributes that didn't match.
592 * @param filter attributes to check list against.
593 * @param list attributes, probably a request or reply
595 bool pairvalidate_relaxed(VALUE_PAIR const *failed[2], VALUE_PAIR *filter, VALUE_PAIR *list)
597 vp_cursor_t filter_cursor;
598 vp_cursor_t list_cursor;
600 VALUE_PAIR *check, *last_check = NULL, *match = NULL;
602 if (!filter && !list) {
607 * This allows us to verify the sets of validate and reply are equal
608 * i.e. we have a validate rule which matches every reply attribute.
610 * @todo this should be removed one we have sets and lists
612 pairsort(&filter, attrtagcmp);
613 pairsort(&list, attrtagcmp);
615 fr_cursor_init(&list_cursor, &list);
616 for (check = fr_cursor_init(&filter_cursor, &filter);
618 check = fr_cursor_next(&filter_cursor)) {
620 * Were processing check attributes of a new type.
622 if (!ATTRIBUTE_EQ(last_check, check)) {
624 * Record the start of the matching attributes in the pair list
625 * For every other operator we require the match to be present
627 match = fr_cursor_next_by_da(&list_cursor, check->da, check->tag);
629 if (check->op == T_OP_CMP_FALSE) continue;
633 fr_cursor_init(&list_cursor, &match);
638 * Now iterate over all attributes of the same type.
640 for (match = fr_cursor_first(&list_cursor);
641 ATTRIBUTE_EQ(match, check);
642 match = fr_cursor_next(&list_cursor)) {
644 * This attribute passed the filter
646 if (!paircmp(check, match)) goto mismatch;
660 /** Copy a single valuepair
662 * Allocate a new valuepair and copy the da from the old vp.
664 * @param[in] ctx for talloc
665 * @param[in] vp to copy.
666 * @return a copy of the input VP or NULL on error.
668 VALUE_PAIR *paircopyvp(TALLOC_CTX *ctx, VALUE_PAIR const *vp)
672 if (!vp) return NULL;
676 n = pairalloc(ctx, vp->da);
679 memcpy(n, vp, sizeof(*n));
684 if (vp->type == VT_XLAT) {
685 n->value.xlat = talloc_typed_strdup(n, n->value.xlat);
688 n->da = dict_attr_copy(vp->da, true);
696 switch (vp->da->type) {
699 n->vp_octets = NULL; /* else pairmemcpy will free vp's value */
700 pairmemcpy(n, vp->vp_octets, n->length);
704 n->vp_strvalue = NULL; /* else pairstrnpy will free vp's value */
705 pairstrncpy(n, vp->vp_strvalue, n->length);
717 * Copy all pairs from 'from' regardless of tag, attribute or vendor.
719 * @param[in] ctx for new VALUE_PAIRs to be allocated in.
720 * @param[in] from whence to copy VALUE_PAIRs.
721 * @return the head of the new VALUE_PAIR list or NULL on error.
723 VALUE_PAIR *paircopy(TALLOC_CTX *ctx, VALUE_PAIR *from)
725 vp_cursor_t src, dst;
727 VALUE_PAIR *out = NULL, *vp;
729 fr_cursor_init(&dst, &out);
730 for (vp = fr_cursor_init(&src, &from);
732 vp = fr_cursor_next(&src)) {
734 vp = paircopyvp(ctx, vp);
739 fr_cursor_insert(&dst, vp); /* paircopy sets next pointer to NULL */
745 /** Copy matching pairs
747 * Copy pairs of a matching attribute number, vendor number and tag from the
748 * the input list to a new list, and returns the head of this list.
750 * @param[in] ctx for talloc
751 * @param[in] from whence to copy VALUE_PAIRs.
752 * @param[in] attr to match, if 0 input list will not be filtered by attr.
753 * @param[in] vendor to match.
754 * @param[in] tag to match, TAG_ANY matches any tag, TAG_NONE matches tagless VPs.
755 * @return the head of the new VALUE_PAIR list or NULL on error.
757 VALUE_PAIR *paircopy2(TALLOC_CTX *ctx, VALUE_PAIR *from,
758 unsigned int attr, unsigned int vendor, int8_t tag)
760 vp_cursor_t src, dst;
762 VALUE_PAIR *out = NULL, *vp;
764 fr_cursor_init(&dst, &out);
765 for (vp = fr_cursor_init(&src, &from);
767 vp = fr_cursor_next(&src)) {
770 if ((vp->da->attr != attr) || (vp->da->vendor != vendor)) {
774 if (vp->da->flags.has_tag && TAG_EQ(tag, vp->tag)) {
778 vp = paircopyvp(ctx, vp);
783 fr_cursor_insert(&dst, vp);
789 /** Steal all members of a VALUE_PAIR list
791 * @param[in] ctx to move VALUE_PAIRs into
792 * @param[in] from VALUE_PAIRs to move into the new context.
794 VALUE_PAIR *pairsteal(TALLOC_CTX *ctx, VALUE_PAIR *from)
799 for (vp = fr_cursor_init(&cursor, &from);
801 vp = fr_cursor_next(&cursor)) {
802 (void) talloc_steal(ctx, vp);
808 /** Move pairs from source list to destination list respecting operator
810 * @note This function does some additional magic that's probably not needed
811 * in most places. Consider using radius_pairmove in server code.
813 * @note pairfree should be called on the head of the source list to free
814 * unmoved attributes (if they're no longer needed).
816 * @note Does not respect tags when matching.
818 * @param[in] ctx for talloc
819 * @param[in,out] to destination list.
820 * @param[in,out] from source list.
822 * @see radius_pairmove
824 void pairmove(TALLOC_CTX *ctx, VALUE_PAIR **to, VALUE_PAIR **from)
826 VALUE_PAIR *i, *found;
827 VALUE_PAIR *head_new, **tail_new;
828 VALUE_PAIR **tail_from;
830 if (!to || !from || !*from) return;
833 * We're editing the "to" list while we're adding new
834 * attributes to it. We don't want the new attributes to
835 * be edited, so we create an intermediate list to hold
836 * them during the editing process.
839 tail_new = &head_new;
842 * We're looping over the "from" list, moving some
843 * attributes out, but leaving others in place.
846 while ((i = *tail_from) != NULL) {
850 * We never move Fall-Through.
852 if (!i->da->vendor && i->da->attr == PW_FALL_THROUGH) {
853 tail_from = &(i->next);
858 * Unlike previous versions, we treat all other
859 * attributes as normal. i.e. there's no special
860 * treatment for passwords or Hint.
865 * Anything else are operators which
866 * shouldn't occur. We ignore them, and
867 * leave them in place.
870 tail_from = &(i->next);
874 * Add it to the "to" list, but only if
875 * it doesn't already exist.
878 found = pairfind(*to, i->da->attr, i->da->vendor, TAG_ANY);
879 if (!found) goto do_add;
881 tail_from = &(i->next);
885 * Add it to the "to" list, and delete any attribute
886 * of the same vendor/attr which already exists.
889 found = pairfind(*to, i->da->attr, i->da->vendor, TAG_ANY);
890 if (!found) goto do_add;
893 * Do NOT call pairdelete() here,
894 * due to issues with re-writing
895 * "request->username".
897 * Everybody calls pairmove, and
898 * expects it to work. We can't
899 * update request->username here,
900 * so instead we over-write the
901 * vp that it's pointing to.
903 switch (found->da->type) {
908 memcpy(found, i, sizeof(*found));
913 pairmemsteal(found, i->vp_tlv);
918 pairmemsteal(found, i->vp_octets);
923 pairstrsteal(found, i->vp_strvalue);
924 i->vp_strvalue = NULL;
930 * Delete *all* of the attributes
931 * of the same number.
933 pairdelete(&found->next,
935 found->da->vendor, TAG_ANY);
938 * Remove this attribute from the
941 *tail_from = i->next;
947 * Move it from the old list and add it
952 *tail_from = i->next;
954 *tail_new = talloc_steal(ctx, i);
955 tail_new = &(i->next);
958 } /* loop over the "from" list. */
961 * Take the "new" list, and append it to the "to" list.
963 pairadd(to, head_new);
966 /** Move matching pairs between VALUE_PAIR lists
968 * Move pairs of a matching attribute number, vendor number and tag from the
969 * the input list to the output list.
971 * @note pairs which are moved have their parent changed to ctx.
973 * @note pairfree should be called on the head of the old list to free unmoved
974 attributes (if they're no longer needed).
976 * @param[in] ctx for talloc
977 * @param[in,out] to destination list.
978 * @param[in,out] from source list.
979 * @param[in] attr to match. If attribute PW_VENDOR_SPECIFIC and vendor 0,
980 * will match (and therefore copy) only VSAs.
981 * If attribute 0 and vendor 0 will match (and therefore copy) all
983 * @param[in] vendor to match.
984 * @param[in] tag to match, TAG_ANY matches any tag, TAG_NONE matches tagless VPs.
986 void pairfilter(TALLOC_CTX *ctx, VALUE_PAIR **to, VALUE_PAIR **from, unsigned int attr, unsigned int vendor, int8_t tag)
988 VALUE_PAIR *to_tail, *i, *next;
989 VALUE_PAIR *iprev = NULL;
992 * Find the last pair in the "to" list and put it in "to_tail".
994 * @todo: replace the "if" with "VALUE_PAIR **tail"
998 for(i = *to; i; i = i->next) {
1006 * Attr/vendor of 0 means "move them all".
1007 * It's better than "pairadd(foo,bar);bar=NULL"
1009 if ((vendor == 0) && (attr == 0)) {
1011 to_tail->next = *from;
1016 for (i = *from; i; i = i->next) {
1017 (void) talloc_steal(ctx, i);
1024 for(i = *from; i; i = next) {
1028 if (i->da->flags.has_tag && TAG_EQ(tag, i->tag)) {
1033 * vendor=0, attr = PW_VENDOR_SPECIFIC means
1034 * "match any vendor attribute".
1036 if ((vendor == 0) && (attr == PW_VENDOR_SPECIFIC)) {
1038 * It's a VSA: move it over.
1040 if (i->da->vendor != 0) goto move;
1043 * It's Vendor-Specific: move it over.
1045 if (i->da->attr == attr) goto move;
1048 * It's not a VSA: ignore it.
1055 * If it isn't an exact match, ignore it.
1057 if (!((i->da->vendor == vendor) && (i->da->attr == attr))) {
1064 * Remove the attribute from the "from" list.
1072 * Add the attribute to the "to" list.
1080 (void) talloc_steal(ctx, i);
1084 static char const hextab[] = "0123456789abcdef";
1086 /** Convert string value to native attribute value
1088 * @param vp to assign value to.
1089 * @param value string to convert. Binary safe for variable length values if len is provided.
1090 * @param inlen may be 0 in which case strlen(len) is used to determine length, else inline
1091 * should be the length of the string or sub string to parse.
1092 * @return true on success, else false.
1094 int pairparsevalue(VALUE_PAIR *vp, char const *value, size_t inlen)
1100 if (!value) return -1;
1104 * It's a comparison, not a real VALUE_PAIR, copy the string over verbatim
1106 if ((vp->op == T_OP_REG_EQ) || (vp->op == T_OP_REG_NE)) {
1107 pairstrcpy(vp, value); /* Icky hacky ewww */
1111 len = (inlen == 0) ? strlen(value) : inlen;
1114 * It's a variable length type so we just alloc a new buffer
1115 * of size len and copy.
1117 switch(vp->da->type) {
1118 case PW_TYPE_STRING:
1128 vp->vp_strvalue = p = talloc_memdup(vp, value, len + 1);
1130 talloc_set_type(p, char);
1137 if (c == '\\') switch (*cp) {
1167 c = '\\'; /* no cp++ */
1170 if ((cp[0] >= '0') &&
1176 (sscanf(cp, "%3o", &x) == 1)) {
1185 } /* else at EOL \ --> \ */
1191 vp->length = vp_len;
1195 /* raw octets: 0x01020304... */
1197 if (strcmp(value, "ANY") == 0) {
1200 } /* else it's hex */
1202 case PW_TYPE_OCTETS:
1207 * No 0x prefix, just copy verbatim.
1209 if ((len < 2) || (strncasecmp(value, "0x", 2) != 0)) {
1210 pairmemcpy(vp, (uint8_t const *) value, len);
1215 #ifdef WITH_ASCEND_BINARY
1223 if ((len & 0x01) != 0) {
1224 fr_strerror_printf("Length of Hex String is not even, got %zu bytes", vp->length);
1228 vp->length = len >> 1;
1229 p = talloc_array(vp, uint8_t, vp->length);
1230 if (fr_hex2bin(p, vp->length, value + 2, len) != vp->length) {
1232 fr_strerror_printf("Invalid hex data");
1240 case PW_TYPE_ABINARY:
1241 #ifdef WITH_ASCEND_BINARY
1242 if ((len > 1) && (strncasecmp(value, "0x", 2) == 0)) goto do_octets;
1244 if (ascend_parse_filter(vp, value, len) < 0 ) {
1245 /* Allow ascend_parse_filter's strerror to bubble up */
1251 * If Ascend binary is NOT defined,
1252 * then fall through to raw octets, so that
1253 * the user can at least make them by hand...
1258 /* don't use this! */
1263 if ((len < 2) || (len & 0x01) || (strncasecmp(value, "0x", 2) != 0)) {
1264 fr_strerror_printf("Invalid TLV specification");
1269 vp->length = len >> 1;
1270 p = talloc_array(vp, uint8_t, vp->length);
1272 fr_strerror_printf("No memory");
1275 if (fr_hex2bin(p, vp->length, value + 2, len) != vp->length) {
1276 fr_strerror_printf("Invalid hex data in TLV");
1284 case PW_TYPE_IPV4_ADDR:
1288 if (fr_pton4(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1291 * We allow v4 addresses to have a /32 suffix as some databases (PostgreSQL)
1292 * print them this way.
1294 if (addr.prefix != 32) {
1295 fr_strerror_printf("Invalid IPv4 mask length \"/%i\". Only \"/32\" permitted "
1296 "for non-prefix types", addr.prefix);
1300 vp->vp_ipaddr = addr.ipaddr.ip4addr.s_addr;
1301 vp->length = sizeof(vp->vp_ipaddr);
1305 case PW_TYPE_IPV4_PREFIX:
1309 if (fr_pton4(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1311 vp->vp_ipv4prefix[1] = addr.prefix;
1312 memcpy(vp->vp_ipv4prefix + 2, &addr.ipaddr.ip4addr.s_addr, sizeof(vp->vp_ipv4prefix) - 2);
1313 vp->length = sizeof(vp->vp_ipv4prefix);
1317 case PW_TYPE_IPV6_ADDR:
1321 if (fr_pton6(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1324 * We allow v6 addresses to have a /128 suffix as some databases (PostgreSQL)
1325 * print them this way.
1327 if (addr.prefix != 128) {
1328 fr_strerror_printf("Invalid IPv6 mask length \"/%i\". Only \"/128\" permitted "
1329 "for non-prefix types", addr.prefix);
1333 memcpy(&vp->vp_ipv6addr, &addr.ipaddr.ip6addr.s6_addr, sizeof(vp->vp_ipv6addr));
1334 vp->length = sizeof(vp->vp_ipv6addr);
1338 case PW_TYPE_IPV6_PREFIX:
1342 if (fr_pton6(&addr, value, inlen, fr_hostname_lookups, false) < 0) return -1;
1344 vp->vp_ipv6prefix[1] = addr.prefix;
1345 memcpy(vp->vp_ipv6prefix + 2, &addr.ipaddr.ip6addr.s6_addr, sizeof(vp->vp_ipv6prefix) - 2);
1346 vp->length = sizeof(vp->vp_ipv6prefix);
1355 * It's a fixed size type, copy to a temporary buffer and
1356 * \0 terminate if insize >= 0.
1359 if (len >= sizeof(buffer)) {
1360 fr_strerror_printf("Temporary buffer too small");
1364 memcpy(buffer, value, inlen);
1365 buffer[inlen] = '\0';
1369 switch(vp->da->type) {
1376 * Note that ALL integers are unsigned!
1378 vp->vp_integer = fr_strtoul(value, &p);
1380 if (vp->vp_integer > 255) {
1381 fr_strerror_printf("Byte value \"%s\" is larger than 255", value);
1386 if (is_whitespace(p)) break;
1388 goto check_for_value;
1395 * Note that ALL integers are unsigned!
1397 vp->vp_integer = fr_strtoul(value, &p);
1400 if (vp->vp_integer > 65535) {
1401 fr_strerror_printf("Byte value \"%s\" is larger than 65535", value);
1406 if (is_whitespace(p)) break;
1408 goto check_for_value;
1410 case PW_TYPE_INTEGER:
1415 * Note that ALL integers are unsigned!
1417 vp->vp_integer = fr_strtoul(value, &p);
1420 if (is_whitespace(p)) break;
1424 * Look for the named value for the given
1427 if ((dval = dict_valbyname(vp->da->attr, vp->da->vendor, value)) == NULL) {
1428 fr_strerror_printf("Unknown value '%s' for attribute '%s'", value, vp->da->name);
1431 vp->vp_integer = dval->value;
1435 case PW_TYPE_INTEGER64:
1440 * Note that ALL integers are unsigned!
1442 if (sscanf(value, "%" PRIu64, &y) != 1) {
1443 fr_strerror_printf("Invalid value '%s' for attribute '%s'",
1444 value, vp->da->name);
1447 vp->vp_integer64 = y;
1455 * time_t may be 64 bits, whule vp_date
1456 * MUST be 32-bits. We need an
1457 * intermediary variable to handle
1462 if (fr_get_time(value, &date) < 0) {
1463 fr_strerror_printf("failed to parse time string "
1475 if (ifid_aton(value, (void *) &vp->vp_ifid) == NULL) {
1476 fr_strerror_printf("Failed to parse interface-id string \"%s\"", value);
1482 case PW_TYPE_ETHERNET:
1484 char const *c1, *c2, *cp;
1488 * Convert things which are obviously integers to Ethernet addresses
1490 * We assume the number is the bigendian representation of the
1493 if (is_integer(value)) {
1494 uint64_t integer = htonll(atoll(value));
1496 memcpy(&vp->vp_ether, &integer, sizeof(vp->vp_ether));
1504 c2 = memchr(hextab, tolower((int) cp[0]), 16);
1506 } else if ((cp[1] != '\0') && ((cp[2] == ':') || (cp[2] == '\0'))) {
1507 c1 = memchr(hextab, tolower((int) cp[0]), 16);
1508 c2 = memchr(hextab, tolower((int) cp[1]), 16);
1510 if (*cp == ':') cp++;
1514 if (!c1 || !c2 || (vp_len >= sizeof(vp->vp_ether))) {
1515 fr_strerror_printf("failed to parse Ethernet address \"%s\"", value);
1518 vp->vp_ether[vp_len] = ((c1-hextab)<<4) + (c2-hextab);
1527 * Crazy polymorphic (IPv4/IPv6) attribute type for WiMAX.
1529 * We try and make is saner by replacing the original
1530 * da, with either an IPv4 or IPv6 da type.
1532 * These are not dynamic da, and will have the same vendor
1533 * and attribute as the original.
1535 case PW_TYPE_IP_ADDR:
1537 DICT_ATTR const *da;
1539 if (inet_pton(AF_INET6, value, &vp->vp_ipv6addr) > 0) {
1540 da = dict_attrbytype(vp->da->attr, vp->da->vendor, PW_TYPE_IPV6_ADDR);
1542 fr_strerror_printf("Cannot find ipv6addr for %s", vp->da->name);
1546 vp->length = 16; /* length of IPv6 address */
1550 da = dict_attrbytype(vp->da->attr, vp->da->vendor,
1553 fr_strerror_printf("Cannot find ipaddr for %s", vp->da->name);
1557 if (ip_hton(&ipaddr, AF_INET, value, false) < 0) {
1558 fr_strerror_printf("Failed to find IPv4 address for %s", value);
1562 vp->vp_ipaddr = ipaddr.ipaddr.ip4addr.s_addr;
1570 case PW_TYPE_SIGNED:
1571 /* Damned code for 1 WiMAX attribute */
1572 vp->vp_signed = (int32_t) strtol(value, NULL, 10);
1580 fr_strerror_printf("unknown attribute type %d", vp->da->type);
1589 /** Use simple heuristics to create an VALUE_PAIR from an unknown address string
1591 * If a DICT_ATTR is not provided for the address type, parsing will fail with
1594 * @param ctx to allocate VP in.
1595 * @param value IPv4/IPv6 address/prefix string.
1596 * @param ipv4 dictionary attribute to use for an IPv4 address.
1597 * @param ipv6 dictionary attribute to use for an IPv6 address.
1598 * @param ipv4_prefix dictionary attribute to use for an IPv4 prefix.
1599 * @param ipv6_prefix dictionary attribute to use for an IPv6 prefix.
1600 * @return NULL on error, or new VALUE_PAIR.
1602 VALUE_PAIR *pairmake_ip(TALLOC_CTX *ctx, char const *value, DICT_ATTR *ipv4, DICT_ATTR *ipv6,
1603 DICT_ATTR *ipv4_prefix, DICT_ATTR *ipv6_prefix)
1606 DICT_ATTR *da = NULL;
1608 if (!fr_assert(ipv4 || ipv6 || ipv4_prefix || ipv6_prefix)) {
1612 /* No point in repeating the work of pairparsevalue */
1613 if (strchr(value, ':')) {
1614 if (strchr(value, '/')) {
1623 if (strchr(value, '/')) {
1633 fr_strerror_printf("Invalid IP value specified, allowed types are %s%s%s%s",
1634 ipv4 ? "ipaddr " : "", ipv6 ? "ipv6addr " : "",
1635 ipv4_prefix ? "ipv4prefix " : "", ipv6_prefix ? "ipv6prefix" : "");
1638 vp = pairalloc(ctx, da);
1639 if (!vp) return NULL;
1640 if (pairparsevalue(vp, value, 0) < 0) {
1649 /** Create a valuepair from an ASCII attribute and value
1651 * Where the attribute name is in the form:
1653 * - Attr-%d.%d.%d...
1654 * - Vendor-%d-Attr-%d
1655 * - VendorName-Attr-%d
1657 * @param ctx for talloc
1658 * @param attribute name to parse.
1659 * @param value to parse (must be a hex string).
1660 * @param op to assign to new valuepair.
1661 * @return new valuepair or NULL on error.
1663 static VALUE_PAIR *pairmake_any(TALLOC_CTX *ctx,
1664 char const *attribute, char const *value,
1668 DICT_ATTR const *da;
1673 da = dict_attrunknownbyname(attribute, true);
1674 if (!da) return NULL;
1677 * Unknown attributes MUST be of type 'octets'
1679 if (value && (strncasecmp(value, "0x", 2) != 0)) {
1680 fr_strerror_printf("Unknown attribute \"%s\" requires a hex "
1681 "string, not \"%s\"", attribute, value);
1683 dict_attr_free(&da);
1688 * We've now parsed the attribute properly, Let's create
1689 * it. This next stop also looks the attribute up in the
1690 * dictionary, and creates the appropriate type for it.
1692 vp = pairalloc(ctx, da);
1694 dict_attr_free(&da);
1698 vp->op = (op == 0) ? T_OP_EQ : op;
1700 if (!value) return vp;
1702 size = strlen(value + 2);
1703 vp->length = size >> 1;
1704 data = talloc_array(vp, uint8_t, vp->length);
1706 if (fr_hex2bin(data, vp->length, value + 2, size) != vp->length) {
1707 fr_strerror_printf("Invalid hex string");
1712 vp->vp_octets = data;
1718 /** Create a VALUE_PAIR from ASCII strings
1720 * Converts an attribute string identifier (with an optional tag qualifier)
1721 * and value string into a VALUE_PAIR.
1723 * The string value is parsed according to the type of VALUE_PAIR being created.
1725 * @param[in] ctx for talloc
1726 * @param[in] vps list where the attribute will be added (optional)
1727 * @param[in] attribute name.
1728 * @param[in] value attribute value (may be NULL if value will be set later).
1729 * @param[in] op to assign to new VALUE_PAIR.
1730 * @return a new VALUE_PAIR.
1732 VALUE_PAIR *pairmake(TALLOC_CTX *ctx, VALUE_PAIR **vps,
1733 char const *attribute, char const *value, FR_TOKEN op)
1735 DICT_ATTR const *da;
1741 char const *attrname = attribute;
1744 * Check for tags in 'Attribute:Tag' format.
1749 ts = strrchr(attribute, ':');
1751 fr_strerror_printf("Invalid tag for attribute %s", attribute);
1756 strlcpy(buffer, attribute, sizeof(buffer));
1758 ts = strrchr(attrname, ':');
1759 if (!ts) return NULL;
1761 /* Colon found with something behind it */
1762 if (ts[1] == '*' && ts[2] == 0) {
1763 /* Wildcard tag for check items */
1766 } else if ((ts[1] >= '0') && (ts[1] <= '9')) {
1767 /* It's not a wild card tag */
1768 tag = strtol(ts + 1, &tc, 0);
1769 if (tc && !*tc && TAG_VALID_ZERO(tag))
1773 fr_strerror_printf("Invalid tag for attribute %s", attribute);
1780 * It's not found in the dictionary, so we use
1781 * another method to create the attribute.
1783 da = dict_attrbyname(attrname);
1785 vp = pairmake_any(ctx, attrname, value, op);
1786 if (vp && vps) pairadd(vps, vp);
1790 /* Check for a tag in the 'Merit' format of:
1791 * :Tag:Value. Print an error if we already found
1792 * a tag in the Attribute.
1795 if (value && (*value == ':' && da->flags.has_tag)) {
1796 /* If we already found a tag, this is invalid */
1798 fr_strerror_printf("Duplicate tag %s for attribute %s",
1800 DEBUG("Duplicate tag %s for attribute %s\n",
1804 /* Colon found and attribute allows a tag */
1805 if (value[1] == '*' && value[2] == ':') {
1806 /* Wildcard tag for check items */
1811 tag = strtol(value + 1, &tc, 0);
1812 if (tc && *tc==':' && TAG_VALID_ZERO(tag))
1818 vp = pairalloc(ctx, da);
1819 if (!vp) return NULL;
1820 vp->op = (op == 0) ? T_OP_EQ : op;
1825 case T_OP_CMP_FALSE:
1826 vp->vp_strvalue = NULL;
1828 value = NULL; /* ignore it! */
1832 * Regular expression comparison of integer attributes
1833 * does a STRING comparison of the names of their
1834 * integer attributes.
1836 case T_OP_REG_EQ: /* =~ */
1837 case T_OP_REG_NE: /* !~ */
1843 fr_strerror_printf("Regular expressions are not supported");
1849 * Someone else will fill in the value.
1855 compare = regcomp(®, value, REG_EXTENDED);
1857 regerror(compare, ®, buffer, sizeof(buffer));
1858 fr_strerror_printf("Illegal regular expression in attribute: %s: %s",
1864 vp = pairmake(ctx, NULL, attribute, NULL, op);
1865 if (!vp) return NULL;
1867 if (pairmark_xlat(vp, value) < 0) {
1872 value = NULL; /* ignore it */
1881 * FIXME: if (strcasecmp(attribute, vp->da->name) != 0)
1882 * then the user MAY have typed in the attribute name
1883 * as Vendor-%d-Attr-%d, and the value MAY be octets.
1885 * We probably want to fix pairparsevalue to accept
1886 * octets as values for any attribute.
1888 if (value && (pairparsevalue(vp, value, 0) < 0)) {
1893 if (vps) pairadd(vps, vp);
1897 /** Mark a valuepair for xlat expansion
1899 * Copies xlat source (unprocessed) string to valuepair value,
1900 * and sets value type.
1902 * @param vp to mark for expansion.
1903 * @param value to expand.
1904 * @return 0 if marking succeeded or -1 if vp already had a value, or OOM.
1906 int pairmark_xlat(VALUE_PAIR *vp, char const *value)
1911 * valuepair should not already have a value.
1913 if (vp->type != VT_NONE) {
1917 raw = talloc_typed_strdup(vp, value);
1923 vp->value.xlat = raw;
1929 /** Read a single valuepair from a buffer, and advance the pointer
1931 * Sets *eol to T_EOL if end of line was encountered.
1933 * @param[in,out] ptr to read from and update.
1934 * @param[out] raw The struct to write the raw VALUE_PAIR to.
1935 * @return the last token read.
1937 FR_TOKEN pairread(char const **ptr, VALUE_PAIR_RAW *raw)
1941 FR_TOKEN ret = T_OP_INVALID, next, quote;
1944 if (!ptr || !*ptr || !raw) {
1945 fr_strerror_printf("Invalid arguments");
1946 return T_OP_INVALID;
1950 * Skip leading spaces
1953 while ((*p == ' ') || (*p == '\t')) p++;
1956 fr_strerror_printf("No token read where we expected "
1957 "an attribute name");
1958 return T_OP_INVALID;
1962 fr_strerror_printf("Read a comment instead of a token");
1968 * Try to get the attribute name.
1973 uint8_t const *t = (uint8_t const *) p;
1975 if (q >= (raw->l_opand + sizeof(raw->l_opand))) {
1977 fr_strerror_printf("Attribute name too long");
1978 return T_OP_INVALID;
1982 * Only ASCII is allowed, and only a subset of that.
1984 if ((*t < 32) || (*t >= 128)) {
1986 fr_strerror_printf("Invalid attribute name");
1987 return T_OP_INVALID;
1991 * This is arguably easier than trying to figure
1992 * out which operators come after the attribute
1993 * name. Yes, our "lexer" is bad.
1995 if (!dict_attr_allowed_chars[(int) *t]) {
2003 * ASCII, but not a valid attribute name.
2005 if (!*raw->l_opand) goto invalid;
2008 * Look for tag (:#). This is different from :=, which
2011 if ((*p == ':') && (isdigit((int) p[1]))) {
2012 if (q >= (raw->l_opand + sizeof(raw->l_opand))) {
2017 while (isdigit((int) *p)) {
2018 if (q >= (raw->l_opand + sizeof(raw->l_opand))) {
2028 /* Now we should have an operator here. */
2029 raw->op = gettoken(ptr, buf, sizeof(buf), false);
2030 if (raw->op < T_EQSTART || raw->op > T_EQEND) {
2031 fr_strerror_printf("Expecting operator");
2033 return T_OP_INVALID;
2037 * Read value. Note that empty string values are allowed
2039 quote = gettoken(ptr, raw->r_opand, sizeof(raw->r_opand), false);
2040 if (quote == T_EOL) {
2041 fr_strerror_printf("Failed to get value");
2043 return T_OP_INVALID;
2047 * Peek at the next token. Must be T_EOL, T_COMMA, or T_HASH
2051 next = gettoken(&p, buf, sizeof(buf), false);
2062 fr_strerror_printf("Expected end of line or comma");
2063 return T_OP_INVALID;
2071 case T_DOUBLE_QUOTED_STRING:
2073 * Only report as double quoted if it contained valid
2074 * a valid xlat expansion.
2076 p = strchr(raw->r_opand, '%');
2077 if (p && (p[1] == '{')) {
2080 raw->quote = T_SINGLE_QUOTED_STRING;
2093 /** Read one line of attribute/value pairs into a list.
2095 * The line may specify multiple attributes separated by commas.
2097 * @note If the function returns T_OP_INVALID, an error has occurred and
2098 * @note the valuepair list should probably be freed.
2100 * @param ctx for talloc
2101 * @param buffer to read valuepairs from.
2102 * @param list where the parsed VALUE_PAIRs will be appended.
2103 * @return the last token parsed, or T_OP_INVALID
2105 FR_TOKEN userparse(TALLOC_CTX *ctx, char const *buffer, VALUE_PAIR **list)
2107 VALUE_PAIR *vp, *head, **tail;
2109 FR_TOKEN last_token = T_OP_INVALID;
2110 FR_TOKEN previous_token;
2114 * We allow an empty line.
2116 if (buffer[0] == 0) {
2125 raw.l_opand[0] = '\0';
2126 raw.r_opand[0] = '\0';
2128 previous_token = last_token;
2130 last_token = pairread(&p, &raw);
2131 if (last_token == T_OP_INVALID) break;
2133 if (raw.quote == T_DOUBLE_QUOTED_STRING) {
2134 vp = pairmake(ctx, NULL, raw.l_opand, NULL, raw.op);
2136 last_token = T_OP_INVALID;
2139 if (pairmark_xlat(vp, raw.r_opand) < 0) {
2141 last_token = T_OP_INVALID;
2145 vp = pairmake(ctx, NULL, raw.l_opand, raw.r_opand, raw.op);
2147 last_token = T_OP_INVALID;
2153 tail = &((*tail)->next);
2154 } while (*p && (last_token == T_COMMA));
2157 * Don't tell the caller that there was a comment.
2159 if (last_token == T_HASH) {
2160 last_token = previous_token;
2163 if (last_token == T_OP_INVALID) {
2166 pairadd(list, head);
2170 * And return the last token which we read.
2176 * Read valuepairs from the fp up to End-Of-File.
2178 int readvp2(VALUE_PAIR **out, TALLOC_CTX *ctx, FILE *fp, bool *pfiledone)
2181 FR_TOKEN last_token = T_EOL;
2185 VALUE_PAIR *vp = NULL;
2187 fr_cursor_init(&cursor, out);
2189 while (fgets(buf, sizeof(buf), fp) != NULL) {
2191 * If we get a '\n' by itself, we assume that's
2192 * the end of that VP
2194 if (buf[0] == '\n') {
2200 * Comments get ignored
2202 if (buf[0] == '#') continue;
2205 * Read all of the attributes on the current line.
2208 last_token = userparse(ctx, buf, &vp);
2210 if (last_token != T_EOL) goto error;
2214 fr_cursor_insert(&cursor, vp);
2223 vp = fr_cursor_first(&cursor);
2224 if (vp) pairfree(&vp);
2229 /** Compare two attribute values
2231 * @param[in] one the first attribute.
2232 * @param[in] two the second attribute.
2233 * @return -1 if one is less than two, 0 if both are equal, 1 if one is more than two, < -1 on error.
2235 int8_t paircmp_value(VALUE_PAIR const *one, VALUE_PAIR const *two)
2237 int64_t compare = 0;
2242 if (one->da->type != two->da->type) {
2243 fr_strerror_printf("Can't compare attribute values of different types");
2248 * After doing the previous check for special comparisons,
2249 * do the per-type comparison here.
2251 switch (one->da->type) {
2252 case PW_TYPE_ABINARY:
2253 case PW_TYPE_OCTETS:
2257 if (one->length > two->length) {
2258 length = one->length;
2260 length = two->length;
2264 compare = memcmp(one->vp_octets, two->vp_octets, length);
2265 if (compare != 0) break;
2269 * Contents are the same. The return code
2270 * is therefore the difference in lengths.
2272 * i.e. "0x00" is smaller than "0x0000"
2274 compare = one->length - two->length;
2278 case PW_TYPE_STRING:
2279 fr_assert(one->vp_strvalue);
2280 fr_assert(two->vp_strvalue);
2281 compare = strcmp(one->vp_strvalue, two->vp_strvalue);
2284 case PW_TYPE_BOOLEAN:
2287 case PW_TYPE_INTEGER:
2289 compare = (int64_t) one->vp_integer - (int64_t) two->vp_integer;
2292 case PW_TYPE_SIGNED:
2293 compare = one->vp_signed - two->vp_signed;
2296 case PW_TYPE_INTEGER64:
2298 * Don't want integer overflow!
2300 if (one->vp_integer64 < two->vp_integer64) {
2302 } else if (one->vp_integer64 > two->vp_integer64) {
2307 case PW_TYPE_ETHERNET:
2308 compare = memcmp(&one->vp_ether, &two->vp_ether, sizeof(one->vp_ether));
2311 case PW_TYPE_IPV4_ADDR:
2312 compare = (int64_t) ntohl(one->vp_ipaddr) - (int64_t) ntohl(two->vp_ipaddr);
2315 case PW_TYPE_IPV6_ADDR:
2316 compare = memcmp(&one->vp_ipv6addr, &two->vp_ipv6addr, sizeof(one->vp_ipv6addr));
2319 case PW_TYPE_IPV6_PREFIX:
2320 compare = memcmp(&one->vp_ipv6prefix, &two->vp_ipv6prefix, sizeof(one->vp_ipv6prefix));
2323 case PW_TYPE_IPV4_PREFIX:
2324 compare = memcmp(&one->vp_ipv4prefix, &two->vp_ipv4prefix, sizeof(one->vp_ipv4prefix));
2328 compare = memcmp(&one->vp_ifid, &two->vp_ifid, sizeof(one->vp_ifid));
2332 * None of the types below should be in the REQUEST
2334 case PW_TYPE_INVALID: /* We should never see these */
2335 case PW_TYPE_IP_ADDR: /* This should of been converted into IPADDR/IPV6ADDR */
2336 case PW_TYPE_IP_PREFIX: /* This should of been converted into IPADDR/IPV6ADDR */
2338 case PW_TYPE_EXTENDED:
2339 case PW_TYPE_LONG_EXTENDED:
2342 case PW_TYPE_TIMEVAL:
2344 fr_assert(0); /* unknown type */
2348 * Do NOT add a default here, as new types are added
2349 * static analysis will warn us they're not handled
2355 } else if (compare < 0) {
2362 * We leverage the fact that IPv4 and IPv6 prefixes both
2363 * have the same format:
2365 * reserved, prefix-len, data...
2367 static int paircmp_op_cidr(FR_TOKEN op, int bytes,
2368 uint8_t one_net, uint8_t const *one,
2369 uint8_t two_net, uint8_t const *two)
2375 * Handle the case of netmasks being identical.
2377 if (one_net == two_net) {
2380 compare = memcmp(one, two, bytes);
2383 * If they're identical return true for
2386 if ((compare == 0) &&
2387 ((op == T_OP_CMP_EQ) ||
2394 * Everything else returns false.
2396 * 10/8 == 24/8 --> false
2397 * 10/8 <= 24/8 --> false
2398 * 10/8 >= 24/8 --> false
2404 * Netmasks are different. That limits the
2405 * possible results, based on the operator.
2415 case T_OP_LT: /* 192/8 < 192.168/16 --> false */
2416 if (one_net < two_net) {
2422 case T_OP_GT: /* 192/16 > 192.168/8 --> false */
2423 if (one_net > two_net) {
2432 if (one_net < two_net) {
2439 * Do the check byte by byte. If the bytes are
2440 * identical, it MAY be a match. If they're different,
2441 * it is NOT a match.
2446 * All leading bytes are identical.
2448 if (common == 0) return true;
2451 * Doing bitmasks takes more work.
2453 if (common < 8) break;
2455 if (one[i] != two[i]) return false;
2463 mask <<= (8 - common);
2467 if ((one[i] & mask) == ((two[i] & mask))) {
2474 /** Compare two attributes using an operator
2476 * @param[in] a the first attribute
2477 * @param[in] op the operator for comparison.
2478 * @param[in] b the second attribute
2479 * @return 1 if true, 0 if false, -1 on error.
2481 int8_t paircmp_op(VALUE_PAIR const *a, FR_TOKEN op, VALUE_PAIR const *b)
2485 if (!a || !b) return -1;
2487 switch (a->da->type) {
2488 case PW_TYPE_IPV4_ADDR:
2489 switch (b->da->type) {
2490 case PW_TYPE_IPV4_ADDR: /* IPv4 and IPv4 */
2493 case PW_TYPE_IPV4_PREFIX: /* IPv4 and IPv4 Prefix */
2494 return paircmp_op_cidr(op, 4, 32, (uint8_t const *) &a->vp_ipaddr,
2495 b->vp_ipv4prefix[1], (uint8_t const *) &b->vp_ipv4prefix + 2);
2498 fr_strerror_printf("Cannot compare IPv4 with IPv6 address");
2503 case PW_TYPE_IPV4_PREFIX: /* IPv4 and IPv4 Prefix */
2504 switch (b->da->type) {
2505 case PW_TYPE_IPV4_ADDR:
2506 return paircmp_op_cidr(op, 4, a->vp_ipv4prefix[1],
2507 (uint8_t const *) &a->vp_ipv4prefix + 2,
2508 32, (uint8_t const *) &b->vp_ipaddr);
2510 case PW_TYPE_IPV4_PREFIX: /* IPv4 Prefix and IPv4 Prefix */
2511 return paircmp_op_cidr(op, 4, a->vp_ipv4prefix[1],
2512 (uint8_t const *) &a->vp_ipv4prefix + 2,
2513 b->vp_ipv4prefix[1], (uint8_t const *) &b->vp_ipv4prefix + 2);
2516 fr_strerror_printf("Cannot compare IPv4 with IPv6 address");
2521 case PW_TYPE_IPV6_ADDR:
2522 switch (b->da->type) {
2523 case PW_TYPE_IPV6_ADDR: /* IPv6 and IPv6 */
2526 case PW_TYPE_IPV6_PREFIX: /* IPv6 and IPv6 Preifx */
2527 return paircmp_op_cidr(op, 16, 128, (uint8_t const *) &a->vp_ipv6addr,
2528 b->vp_ipv6prefix[1], (uint8_t const *) &b->vp_ipv6prefix + 2);
2532 fr_strerror_printf("Cannot compare IPv6 with IPv4 address");
2537 case PW_TYPE_IPV6_PREFIX:
2538 switch (b->da->type) {
2539 case PW_TYPE_IPV6_ADDR: /* IPv6 Prefix and IPv6 */
2540 return paircmp_op_cidr(op, 16, a->vp_ipv6prefix[1],
2541 (uint8_t const *) &a->vp_ipv6prefix + 2,
2542 128, (uint8_t const *) &b->vp_ipv6addr);
2544 case PW_TYPE_IPV6_PREFIX: /* IPv6 Prefix and IPv6 */
2545 return paircmp_op_cidr(op, 16, a->vp_ipv6prefix[1],
2546 (uint8_t const *) &a->vp_ipv6prefix + 2,
2547 b->vp_ipv6prefix[1], (uint8_t const *) &b->vp_ipv6prefix + 2);
2550 fr_strerror_printf("Cannot compare IPv6 with IPv4 address");
2557 compare = paircmp_value(a, b);
2558 if (compare < -1) { /* comparison error */
2564 * Now do the operator comparison.
2568 return (compare == 0);
2571 return (compare != 0);
2574 return (compare < 0);
2577 return (compare > 0);
2580 return (compare <= 0);
2583 return (compare >= 0);
2590 /** Compare two pairs, using the operator from "a"
2592 * i.e. given two attributes, it does:
2594 * (b->data) (a->operator) (a->data)
2596 * e.g. "foo" != "bar"
2598 * @param[in] a the first attribute
2599 * @param[in] b the second attribute
2600 * @return 1 if true, 0 if false, -1 on error.
2602 int8_t paircmp(VALUE_PAIR *a, VALUE_PAIR *b)
2607 if (b) VERIFY_VP(b);
2613 case T_OP_CMP_FALSE:
2617 * a is a regex, compile it, print b to a string,
2618 * and then do string comparisons.
2628 char buffer[MAX_STRING_LEN * 4 + 1];
2630 compare = regcomp(®, a->vp_strvalue, REG_EXTENDED);
2632 regerror(compare, ®, buffer, sizeof(buffer));
2633 fr_strerror_printf("Illegal regular expression in attribute: %s: %s",
2634 a->da->name, buffer);
2643 vp_prints_value(buffer, sizeof(buffer), b, 0);
2646 * Don't care about substring matches,
2649 compare = regexec(®, buffer, 0, NULL, 0);
2652 if (a->op == T_OP_REG_EQ) {
2653 return (compare == 0);
2656 return (compare != 0);
2660 default: /* we're OK */
2664 return paircmp_op(b, a->op, a);
2667 /** Determine equality of two lists
2669 * This is useful for comparing lists of attributes inserted into a binary tree.
2671 * @param a first list of VALUE_PAIRs.
2672 * @param b second list of VALUE_PAIRs.
2673 * @return -1 if a < b, 0 if the two lists are equal, 1 if a > b, -2 on error.
2675 int8_t pairlistcmp(VALUE_PAIR *a, VALUE_PAIR *b)
2677 vp_cursor_t a_cursor, b_cursor;
2678 VALUE_PAIR *a_p, *b_p;
2681 for (a_p = fr_cursor_init(&a_cursor, &a), b_p = fr_cursor_init(&b_cursor, &b);
2683 a_p = fr_cursor_next(&a_cursor), b_p = fr_cursor_next(&b_cursor)) {
2684 /* Same VP, no point doing expensive checks */
2689 if (a_p->da < b_p->da) {
2692 if (a_p->da > b_p->da) {
2696 if (a_p->tag < b_p->tag) {
2699 if (a_p->tag > b_p->tag) {
2703 ret = paircmp_value(a_p, b_p);
2705 fr_assert(ret >= -1); /* Comparison error */
2722 /** Set the type of the VALUE_PAIR value buffer to match it's DICT_ATTR
2724 * @param vp to fixup.
2726 static void pairtypeset(VALUE_PAIR *vp)
2728 if (!vp->data.ptr) return;
2730 switch(vp->da->type) {
2731 case PW_TYPE_OCTETS:
2733 talloc_set_type(vp->data.ptr, uint8_t);
2736 case PW_TYPE_STRING:
2737 talloc_set_type(vp->data.ptr, char);
2745 /** Copy data into an "octets" data type.
2747 * @param[in,out] vp to update
2748 * @param[in] src data to copy
2749 * @param[in] size of the data, may be 0 in which case previous value will be freed.
2751 void pairmemcpy(VALUE_PAIR *vp, uint8_t const *src, size_t size)
2753 uint8_t *p = NULL, *q;
2758 p = talloc_memdup(vp, src, size);
2760 talloc_set_type(p, uint8_t);
2763 memcpy(&q, &vp->vp_octets, sizeof(q));
2769 if (size > 0) pairtypeset(vp);
2772 /** Reparent an allocated octet buffer to a VALUE_PAIR
2774 * @param[in,out] vp to update
2775 * @param[in] src buffer to steal.
2777 void pairmemsteal(VALUE_PAIR *vp, uint8_t const *src)
2783 memcpy(&q, &vp->vp_octets, sizeof(q));
2786 vp->vp_octets = talloc_steal(vp, src);
2788 vp->length = talloc_array_length(vp->vp_strvalue);
2792 /** Reparent an allocated char buffer to a VALUE_PAIR
2794 * @param[in,out] vp to update
2795 * @param[in] src buffer to steal.
2797 void pairstrsteal(VALUE_PAIR *vp, char const *src)
2803 memcpy(&q, &vp->vp_octets, sizeof(q));
2806 vp->vp_strvalue = talloc_steal(vp, src);
2808 vp->length = talloc_array_length(vp->vp_strvalue) - 1;
2812 /** Copy data into an "string" data type.
2814 * @param[in,out] vp to update
2815 * @param[in] src data to copy
2817 void pairstrcpy(VALUE_PAIR *vp, char const *src)
2823 p = talloc_strdup(vp, src);
2827 memcpy(&q, &vp->vp_strvalue, sizeof(q));
2830 vp->vp_strvalue = p;
2832 vp->length = talloc_array_length(vp->vp_strvalue) - 1;
2836 /** Copy data into an "string" data type.
2838 * @param[in,out] vp to update.
2839 * @param[in] src data to copy.
2840 * @param[in] len of data to copy.
2842 void pairstrncpy(VALUE_PAIR *vp, char const *src, size_t len)
2848 p = talloc_array(vp, char, len + 1);
2851 memcpy(p, src, len); /* embdedded \0 safe */
2854 memcpy(&q, &vp->vp_strvalue, sizeof(q));
2857 vp->vp_strvalue = p;
2863 /** Copy data from one VP to another
2865 * Allocate a new pair using da, and copy over the value from the specified vp.
2867 * @todo Should be able to do type conversions.
2869 * @param[in,out] vp to update.
2870 * @param[in] da Type of data represented by data.
2871 * @param[in] data to copy.
2872 * @param[in] len of data to copy.
2874 int pairdatacpy(VALUE_PAIR *vp, DICT_ATTR const *da, value_data_t const *data, size_t len)
2880 * The da->types have to be identical, OR the "from" da->type has
2883 if (vp->da->type != da->type) {
2885 * Decode the octets buffer using the RADIUS decoder.
2887 if (da->type == PW_TYPE_OCTETS) {
2888 if (data2vp(vp, NULL, NULL, NULL, vp->da, data->octets, len, len, &vp) < 0) return -1;
2894 * Else if the destination da->type is octets
2896 if (vp->da->type == PW_TYPE_OCTETS) {
2899 VALUE_PAIR const *pvp = vp;
2901 buff = talloc_array(vp, uint8_t, dict_attr_sizes[da->type][1] + 2);
2903 ret = rad_vp2rfc(NULL, NULL, NULL, &pvp, buff, dict_attr_sizes[da->type][1]);
2904 if (ret < 0) return -1;
2906 pairmemcpy(vp, buff + 2, ret - 2);
2915 fr_strerror_printf("Data conversion not supported");
2920 * Clear existing value if there is one
2922 memcpy(&old, &vp->data.ptr, sizeof(old));
2925 switch (vp->da->type) {
2927 case PW_TYPE_OCTETS:
2928 pairmemcpy(vp, data->octets, len);
2931 case PW_TYPE_STRING:
2932 pairstrncpy(vp, data->strvalue, len);
2936 memcpy(&vp->data, data, sizeof(vp->data));
2944 /** Print data into an "string" data type.
2946 * @param[in,out] vp to update
2947 * @param[in] fmt the format string
2949 void pairsprintf(VALUE_PAIR *vp, char const *fmt, ...)
2957 p = talloc_vasprintf(vp, fmt, ap);
2962 memcpy(&q, &vp->vp_strvalue, sizeof(q));
2965 vp->vp_strvalue = p;
2968 vp->length = talloc_array_length(vp->vp_strvalue) - 1;