2 * dict.c Routines to read the dictionary file.
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 The FreeRADIUS server project
23 static const char rcsid[] = "$Id$";
25 #include <freeradius-devel/autoconf.h>
35 #ifdef HAVE_SYS_STAT_H
41 #include <freeradius-devel/missing.h>
42 #include <freeradius-devel/libradius.h>
44 #define DICT_VALUE_MAX_NAME_LEN (128)
45 #define DICT_VENDOR_MAX_NAME_LEN (128)
47 static lrad_hash_table_t *vendors_byname = NULL;
48 static lrad_hash_table_t *vendors_byvalue = NULL;
50 static lrad_hash_table_t *attributes_byname = NULL;
51 static lrad_hash_table_t *attributes_byvalue = NULL;
53 static lrad_hash_table_t *values_byvalue = NULL;
54 static lrad_hash_table_t *values_byname = NULL;
57 * For faster HUP's, we cache the stat information for
58 * files we've $INCLUDEd
60 typedef struct dict_stat_t {
61 struct dict_stat_t *next;
66 static char *stat_root_dir = NULL;
67 static char *stat_root_file = NULL;
69 static dict_stat_t *stat_head = NULL;
70 static dict_stat_t *stat_tail = NULL;
72 typedef struct value_fixup_t {
75 struct value_fixup_t *next;
80 * So VALUEs in the dictionary can have forward references.
82 static value_fixup_t *value_fixup = NULL;
84 static const LRAD_NAME_NUMBER type_table[] = {
85 { "string", PW_TYPE_STRING },
86 { "integer", PW_TYPE_INTEGER },
87 { "ipaddr", PW_TYPE_IPADDR },
88 { "date", PW_TYPE_DATE },
89 { "abinary", PW_TYPE_ABINARY },
90 { "octets", PW_TYPE_OCTETS },
91 { "ifid", PW_TYPE_IFID },
92 { "ipv6addr", PW_TYPE_IPV6ADDR },
93 { "ipv6prefix", PW_TYPE_IPV6PREFIX },
94 { "byte", PW_TYPE_BYTE },
95 { "short", PW_TYPE_SHORT },
101 * Create the hash of the name.
103 * We copy the hash function here because it's substantially faster.
105 #define FNV_MAGIC_INIT (0x811c9dc5)
106 #define FNV_MAGIC_PRIME (0x01000193)
108 static uint32_t dict_hashname(const char *name)
110 uint32_t hash = FNV_MAGIC_INIT;
113 for (p = name; *p != '\0'; p++) {
114 int c = *(const unsigned char *) p;
115 if (isalpha(c)) c = tolower(c);
117 hash *= FNV_MAGIC_PRIME;
118 hash ^= (uint32_t ) (c & 0xff);
126 * Hash callback functions.
128 static uint32_t dict_attr_name_hash(const void *data)
130 return dict_hashname(((const DICT_ATTR *)data)->name);
133 static int dict_attr_name_cmp(const void *one, const void *two)
135 const DICT_ATTR *a = one;
136 const DICT_ATTR *b = two;
138 return strcasecmp(a->name, b->name);
141 static uint32_t dict_attr_value_hash(const void *data)
144 const DICT_ATTR *attr = data;
146 hash = lrad_hash(&attr->vendor, sizeof(attr->vendor));
147 return lrad_hash_update(&attr->attr, sizeof(attr->attr), hash);
150 static int dict_attr_value_cmp(const void *one, const void *two)
152 const DICT_ATTR *a = one;
153 const DICT_ATTR *b = two;
155 if (a->vendor < b->vendor) return -1;
156 if (a->vendor > b->vendor) return +1;
158 return a->attr - b->attr;
161 static uint32_t dict_vendor_name_hash(const void *data)
163 return dict_hashname(((const DICT_VENDOR *)data)->name);
166 static int dict_vendor_name_cmp(const void *one, const void *two)
168 const DICT_VENDOR *a = one;
169 const DICT_VENDOR *b = two;
171 return strcasecmp(a->name, b->name);
174 static uint32_t dict_vendor_value_hash(const void *data)
176 return lrad_hash(&(((const DICT_VENDOR *)data)->vendorpec),
177 sizeof(((const DICT_VENDOR *)data)->vendorpec));
180 static int dict_vendor_value_cmp(const void *one, const void *two)
182 const DICT_VENDOR *a = one;
183 const DICT_VENDOR *b = two;
185 return a->vendorpec - b->vendorpec;
188 static uint32_t dict_value_name_hash(const void *data)
191 const DICT_VALUE *dval = data;
193 hash = dict_hashname(dval->name);
194 return lrad_hash_update(&dval->attr, sizeof(dval->attr), hash);
197 static int dict_value_name_cmp(const void *one, const void *two)
200 const DICT_VALUE *a = one;
201 const DICT_VALUE *b = two;
203 rcode = a->attr - b->attr;
204 if (rcode != 0) return rcode;
206 return strcasecmp(a->name, b->name);
209 static uint32_t dict_value_value_hash(const void *data)
212 const DICT_VALUE *dval = data;
214 hash = lrad_hash(&dval->attr, sizeof(dval->attr));
215 return lrad_hash_update(&dval->value, sizeof(dval->value), hash);
218 static int dict_value_value_cmp(const void *one, const void *two)
221 const DICT_VALUE *a = one;
222 const DICT_VALUE *b = two;
224 rcode = a->attr - b->attr;
225 if (rcode != 0) return rcode;
227 return a->value - b->value;
232 * Free the list of stat buffers
234 static void dict_stat_free(void)
236 dict_stat_t *this, *next;
239 stat_root_dir = NULL;
240 free(stat_root_file);
241 stat_root_file = NULL;
248 for (this = stat_head; this != NULL; this = next) {
254 stat_head = stat_tail = NULL;
259 * Add an entry to the list of stat buffers.
261 static void dict_stat_add(const char *name, const struct stat *stat_buf)
265 this = malloc(sizeof(*this));
266 memset(this, 0, sizeof(*this));
268 this->name = strdup(name);
269 this->mtime = stat_buf->st_mtime;
272 stat_head = stat_tail = this;
274 stat_tail->next = this;
281 * See if any dictionaries have changed. If not, don't
284 static int dict_stat_check(const char *root_dir, const char *root_file)
289 if (!stat_root_dir) return 0;
290 if (!stat_root_file) return 0;
292 if (strcmp(root_dir, stat_root_dir) != 0) return 0;
293 if (strcmp(root_file, stat_root_file) != 0) return 0;
295 if (!stat_head) return 0; /* changed, reload */
297 for (this = stat_head; this != NULL; this = this->next) {
298 if (stat(this->name, &buf) < 0) return 0;
300 if (buf.st_mtime != this->mtime) return 0;
308 * Free the dictionary_attributes and dictionary_values lists.
315 lrad_hash_table_free(vendors_byname);
316 lrad_hash_table_free(vendors_byvalue);
317 vendors_byname = NULL;
318 vendors_byvalue = NULL;
320 lrad_hash_table_free(attributes_byname);
321 lrad_hash_table_free(attributes_byvalue);
322 attributes_byname = NULL;
323 attributes_byvalue = NULL;
325 lrad_hash_table_free(values_byname);
326 lrad_hash_table_free(values_byvalue);
327 values_byname = NULL;
328 values_byvalue = NULL;
335 * Add vendor to the list.
337 int dict_addvendor(const char *name, int value)
342 if (value >= 32767) {
343 librad_log("dict_addvendor: Cannot handle vendor ID larger than 65535");
347 if ((length = strlen(name)) >= DICT_VENDOR_MAX_NAME_LEN) {
348 librad_log("dict_addvendor: vendor name too long");
352 if ((dv = malloc(sizeof(*dv) + length)) == NULL) {
353 librad_log("dict_addvendor: out of memory");
357 strcpy(dv->name, name);
358 dv->vendorpec = value;
359 dv->type = dv->length = 1; /* defaults */
361 if (!lrad_hash_table_insert(vendors_byname, dv)) {
364 old_dv = lrad_hash_table_finddata(vendors_byname, dv);
366 librad_log("dict_addvendor: Failed inserting vendor name %s", name);
369 if (old_dv->vendorpec != dv->vendorpec) {
370 librad_log("dict_addvendor: Duplicate vendor name %s", name);
375 * Already inserted. Discard the duplicate entry.
382 * Insert the SAME pointer (not free'd when this table is
383 * deleted), into another table.
385 * We want this behaviour because we want OLD names for
386 * the attributes to be read from the configuration
387 * files, but when we're printing them, (and looking up
388 * by value) we want to use the NEW name.
390 if (!lrad_hash_table_replace(vendors_byvalue, dv)) {
391 librad_log("dict_addvendor: Failed inserting vendor %s",
400 * Add an attribute to the dictionary.
402 int dict_addattr(const char *name, int vendor, int type, int value,
405 static int max_attr = 0;
408 if (strlen(name) > (sizeof(attr->name) -1)) {
409 librad_log("dict_addattr: attribute name too long");
414 * If the value is '-1', that means use a pre-existing
415 * one (if it already exists). If one does NOT already exist,
416 * then create a new attribute, with a non-conflicting value,
420 if (dict_attrbyname(name)) {
421 return 0; /* exists, don't add it again */
426 } else if (vendor == 0) {
430 if (value > max_attr) {
436 librad_log("dict_addattr: ATTRIBUTE has invalid number (less than zero)");
440 if (value >= 65536) {
441 librad_log("dict_addattr: ATTRIBUTE has invalid number (larger than 65535).");
446 DICT_VENDOR *dv = dict_vendorbyvalue(vendor);
449 * If the vendor isn't defined, die/
452 librad_log("dict_addattr: Unknown vendor");
457 * FIXME: Switch over dv->type, and limit things
460 if ((dv->type == 1) && (value >= 256)) {
461 librad_log("dict_addattr: ATTRIBUTE has invalid number (larger than 255).");
463 } /* else 256..65535 are allowed */
467 * Create a new attribute for the list
469 if ((attr = malloc(sizeof(*attr))) == NULL) {
470 librad_log("dict_addattr: out of memory");
474 strcpy(attr->name, name);
476 attr->attr |= (vendor << 16); /* FIXME: hack */
477 attr->vendor = vendor;
480 attr->vendor = vendor;
483 * Yet another hack for Diameter-encoded attributes:
485 if (attr->flags.diameter) attr->attr |= (1 << 31);
488 * Insert the attribute, only if it's not a duplicate.
490 if (!lrad_hash_table_insert(attributes_byname, attr)) {
494 * If the attribute has identical number, then
495 * ignore the duplicate.
497 a = lrad_hash_table_finddata(attributes_byname, attr);
498 if (a && (strcasecmp(a->name, attr->name) == 0)) {
499 if (a->attr != attr->attr) {
500 librad_log("dict_addattr: Duplicate attribute name %s", name);
505 * Same name, same vendor, same attr,
506 * maybe the flags and/or type is
507 * different. Let the new value
508 * over-ride the old one.
514 * Insert the SAME pointer (not free'd when this entry is
515 * deleted), into another table.
517 * We want this behaviour because we want OLD names for
518 * the attributes to be read from the configuration
519 * files, but when we're printing them, (and looking up
520 * by value) we want to use the NEW name.
522 if (!lrad_hash_table_replace(attributes_byvalue, attr)) {
523 librad_log("dict_addattr: Failed inserting attribute name %s", name);
532 * Add a value for an attribute to the dictionary.
534 int dict_addvalue(const char *namestr, const char *attrstr, int value)
541 librad_log("dict_addvalue: empty names are not permitted");
545 if ((length = strlen(namestr)) >= DICT_VALUE_MAX_NAME_LEN) {
546 librad_log("dict_addvalue: value name too long");
550 if ((dval = malloc(sizeof(*dval) + length)) == NULL) {
551 librad_log("dict_addvalue: out of memory");
554 memset(dval, 0, sizeof(*dval));
556 strcpy(dval->name, namestr);
560 * Remember which attribute is associated with this
561 * value, if possible.
563 dattr = dict_attrbyname(attrstr);
565 if (dattr->flags.has_value_alias) {
566 librad_log("dict_addvalue: Cannot add VALUE for ATTRIBUTE \"%s\": It already has a VALUE-ALIAS", attrstr);
570 dval->attr = dattr->attr;
573 * Enforce valid values
575 * Don't worry about fixups...
577 switch (dattr->type) {
580 librad_log("dict_addvalue: Value \"%d\" is larger than 255", value);
586 librad_log("dict_addvalue: Value \"%d\" is larger than 65535", value);
594 dattr->flags.has_value = 1;
596 value_fixup_t *fixup;
598 fixup = (value_fixup_t *) malloc(sizeof(*fixup));
600 librad_log("dict_addvalue: out of memory");
603 memset(fixup, 0, sizeof(*fixup));
605 strNcpy(fixup->attrstr, attrstr, sizeof(fixup->attrstr));
609 * Insert to the head of the list.
611 fixup->next = value_fixup;
618 * Add the value into the dictionary.
620 if (!lrad_hash_table_insert(values_byname, dval)) {
625 * Suppress duplicates with the same
626 * name and value. There are lots in
629 old = dict_valbyname(dattr->attr, namestr);
630 if (old && (old->value == dval->value)) {
636 librad_log("dict_addvalue: Duplicate value name %s for attribute %s", namestr, attrstr);
641 * There are multiple VALUE's, keyed by attribute, so we
642 * take care of that here.
644 if (!lrad_hash_table_replace(values_byvalue, dval)) {
645 librad_log("dict_addvalue: Failed inserting value %s",
654 * Process the ATTRIBUTE command
656 static int process_attribute(const char* fn, const int line,
657 const int block_vendor, char **argv,
666 if ((argc < 3) || (argc > 4)) {
667 librad_log("dict_init: %s[%d]: invalid ATTRIBUTE line",
673 * Validate all entries
675 if (!isdigit((int) argv[1][0])) {
676 librad_log("dict_init: %s[%d]: invalid value", fn, line);
679 sscanf(argv[1], "%i", &value);
682 * find the type of the attribute.
684 type = lrad_str2int(type_table, argv[2], -1);
686 librad_log("dict_init: %s[%d]: invalid type \"%s\"",
692 * Only look up the vendor if the string
695 memset(&flags, 0, sizeof(flags));
698 * FIXME: replace strtok with str2argv
700 s = strtok(argv[3], ",");
702 if (strcmp(s, "has_tag") == 0 ||
703 strcmp(s, "has_tag=1") == 0) {
704 /* Boolean flag, means this is a
708 } else if (strncmp(s, "encrypt=", 8) == 0) {
709 /* Encryption method, defaults to 0 (none).
710 Currently valid is just type 2,
711 Tunnel-Password style, which can only
712 be applied to strings. */
713 flags.encrypt = strtol(s + 8, &c, 0);
715 librad_log( "dict_init: %s[%d] invalid option %s",
720 } else if (strncmp(s, "diameter", 8) == 0) {
723 } else if (strncmp(s, "array", 8) == 0) {
730 case PW_TYPE_INTEGER:
735 librad_log( "dict_init: %s[%d] Only IP addresses can have the \"array\" flag set.",
740 } else if (block_vendor) {
741 librad_log( "dict_init: %s[%d]: unknown option \"%s\"",
746 /* Must be a vendor 'flag'... */
747 if (strncmp(s, "vendor=", 7) == 0) {
752 vendor = dict_vendorbyname(s);
754 librad_log( "dict_init: %s[%d]: unknown vendor \"%s\"",
758 if (block_vendor && argv[3][0] &&
759 (block_vendor != vendor)) {
760 librad_log("dict_init: %s[%d]: mismatched vendor %s within BEGIN-VENDOR/END-VENDOR block",
765 s = strtok(NULL, ",");
769 if (block_vendor) vendor = block_vendor;
772 * Special checks for tags, they make our life much more
777 * Only string, octets, and integer can be tagged.
781 case PW_TYPE_INTEGER:
785 librad_log("dict_init: %s[%d]: Attributes of type %s cannot be tagged.",
787 lrad_int2str(type_table, type, "?Unknown?"));
796 if (dict_addattr(argv[0], vendor, type, value, flags) < 0) {
797 librad_log("dict_init: %s[%d]: %s",
798 fn, line, librad_errstr);
807 * Process the VALUE command
809 static int process_value(const char* fn, const int line, char **argv,
815 librad_log("dict_init: %s[%d]: invalid VALUE line",
820 * For Compatibility, skip "Server-Config"
822 if (strcasecmp(argv[0], "Server-Config") == 0)
826 * Validate all entries
828 if (!isdigit((int) argv[2][0])) {
829 librad_log("dict_init: %s[%d]: invalid value",
833 sscanf(argv[2], "%i", &value);
835 if (dict_addvalue(argv[1], argv[0], value) < 0) {
836 librad_log("dict_init: %s[%d]: %s",
837 fn, line, librad_errstr);
846 * Process the VALUE-ALIAS command
848 * This allows VALUE mappings to be shared among multiple
851 static int process_value_alias(const char* fn, const int line, char **argv,
854 DICT_ATTR *my_da, *da;
858 librad_log("dict_init: %s[%d]: invalid VALUE-ALIAS line",
863 my_da = dict_attrbyname(argv[0]);
865 librad_log("dict_init: %s[%d]: ATTRIBUTE \"%s\" does not exist",
870 if (my_da->flags.has_value) {
871 librad_log("dict_init: %s[%d]: Cannot add VALUE-ALIAS to ATTRIBUTE \"%s\" with pre-existing VALUE",
876 if (my_da->flags.has_value_alias) {
877 librad_log("dict_init: %s[%d]: Cannot add VALUE-ALIAS to ATTRIBUTE \"%s\" with pre-existing VALUE-ALIAS",
882 da = dict_attrbyname(argv[1]);
884 librad_log("dict_init: %s[%d]: Cannot find ATTRIBUTE \"%s\" for alias",
889 if (!da->flags.has_value) {
890 librad_log("dict_init: %s[%d]: VALUE-ALIAS cannot refer to ATTRIBUTE %s: It has no values",
895 if (da->flags.has_value_alias) {
896 librad_log("dict_init: %s[%d]: Cannot add VALUE-ALIAS to ATTRIBUTE \"%s\" which itself has a VALUE-ALIAS",
901 if (my_da->type != da->type) {
902 librad_log("dict_init: %s[%d]: Cannot add VALUE-ALIAS between attributes of differing type",
907 if ((dval = malloc(sizeof(*dval))) == NULL) {
908 librad_log("dict_addvalue: out of memory");
911 memset(dval, 0, sizeof(*dval));
913 dval->name[0] = '\0'; /* empty name */
914 dval->attr = my_da->attr;
915 dval->value = da->attr;
917 if (!lrad_hash_table_insert(values_byname, dval)) {
918 librad_log("dict_init: %s[%d]: Error create alias",
929 * Process the VENDOR command
931 static int process_vendor(const char* fn, const int line, char **argv,
935 const char *format = NULL;
937 if ((argc < 2) || (argc > 3)) {
938 librad_log( "dict_init: %s[%d] invalid VENDOR entry",
944 * Validate all entries
946 if (!isdigit((int) argv[1][0])) {
947 librad_log("dict_init: %s[%d]: invalid value",
951 value = atoi(argv[1]);
953 /* Create a new VENDOR entry for the list */
954 if (dict_addvendor(argv[0], value) < 0) {
955 librad_log("dict_init: %s[%d]: %s",
956 fn, line, librad_errstr);
961 * Look for a format statement
966 } else if (value == VENDORPEC_USR) { /* catch dictionary screw-ups */
967 format = "format=4,0";
969 } else if (value == VENDORPEC_LUCENT) {
970 format = "format=2,1";
972 } else if (value == VENDORPEC_STARENT) {
973 format = "format=2,2";
975 } /* else no fixups to do */
982 if (strncasecmp(format, "format=", 7) != 0) {
983 librad_log("dict_init: %s[%d]: Invalid format for VENDOR. Expected \"format=\", got \"%s\"",
989 if ((strlen(p) != 3) ||
990 !isdigit((int) p[0]) ||
992 !isdigit((int) p[2])) {
993 librad_log("dict_init: %s[%d]: Invalid format for VENDOR. Expected text like \"1,1\", got \"%s\"",
998 type = (int) (p[0] - '0');
999 length = (int) (p[2] - '0');
1001 dv = dict_vendorbyvalue(value);
1003 librad_log("dict_init: %s[%d]: Failed adding format for VENDOR",
1008 if ((type != 1) && (type != 2) && (type != 4)) {
1009 librad_log("dict_init: %s[%d]: invalid type value %d for VENDOR",
1014 if ((length != 0) && (length != 1) && (length != 2)) {
1015 librad_log("dict_init: %s[%d]: invalid length value %d for VENDOR",
1021 dv->length = length;
1028 * String split routine. Splits an input string IN PLACE
1029 * into pieces, based on spaces.
1031 static int str2argv(char *str, char **argv, int max_argc)
1036 if (argc >= max_argc) return argc;
1039 * Chop out comments early.
1046 while ((*str == ' ') ||
1049 (*str == '\n')) *(str++) = '\0';
1051 if (!*str) return argc;
1060 (*str != '\n')) str++;
1066 #define MAX_ARGV (16)
1069 * Initialize the dictionary.
1071 static int my_dict_init(const char *dir, const char *fn,
1072 const char *src_file, int src_line)
1081 struct stat statbuf;
1082 char *argv[MAX_ARGV];
1085 if (strlen(fn) >= sizeof(dirtmp) / 2 ||
1086 strlen(dir) >= sizeof(dirtmp) / 2) {
1087 librad_log("dict_init: filename name too long");
1092 * First see if fn is relative to dir. If so, create
1093 * new filename. If not, remember the absolute dir.
1095 if ((p = strrchr(fn, '/')) != NULL) {
1099 } else if (dir && dir[0] && strcmp(dir, ".") != 0) {
1100 snprintf(dirtmp, sizeof(dirtmp), "%s/%s", dir, fn);
1104 if ((fp = fopen(fn, "r")) == NULL) {
1106 librad_log("dict_init: Couldn't open dictionary \"%s\": %s",
1107 fn, strerror(errno));
1109 librad_log("dict_init: %s[%d]: Couldn't open dictionary \"%s\": %s",
1110 src_file, src_line, fn, strerror(errno));
1115 stat(fn, &statbuf); /* fopen() guarantees this will succeed */
1116 if (!S_ISREG(statbuf.st_mode)) {
1118 librad_log("dict_init: Dictionary \"%s\" is not a regular file",
1122 dict_stat_add(fn, &statbuf);
1125 * Seed the random pool with data.
1127 lrad_rand_seed(&statbuf, sizeof(statbuf));
1131 while (fgets(buf, sizeof(buf), fp) != NULL) {
1133 if (buf[0] == '#' || buf[0] == 0 ||
1134 buf[0] == '\n' || buf[0] == '\r')
1138 * Comment characters should NOT be appearing anywhere but
1139 * as start of a comment;
1141 p = strchr(buf, '#');
1144 argc = str2argv(buf, argv, MAX_ARGV);
1145 if (argc == 0) continue;
1148 librad_log( "dict_init: %s[%d] invalid entry",
1157 fprintf(stderr, "ARGC = %d\n",argc);
1158 for (i = 0; i < argc; i++) {
1159 fprintf(stderr, "\t%s\n", argv[i]);
1164 * See if we need to import another dictionary.
1166 if (strcasecmp(argv[0], "$INCLUDE") == 0) {
1167 if (my_dict_init(dir, argv[1], fn, line) < 0) {
1175 * Perhaps this is an attribute.
1177 if (strcasecmp(argv[0], "ATTRIBUTE") == 0) {
1178 if (process_attribute(fn, line, block_vendor,
1179 argv + 1, argc - 1) == -1) {
1187 * Process VALUE lines.
1189 if (strcasecmp(argv[0], "VALUE") == 0) {
1190 if (process_value(fn, line,
1191 argv + 1, argc - 1) == -1) {
1198 if (strcasecmp(argv[0], "VALUE-ALIAS") == 0) {
1199 if (process_value_alias(fn, line,
1200 argv + 1, argc - 1) == -1) {
1208 * Process VENDOR lines.
1210 if (strcasecmp(argv[0], "VENDOR") == 0) {
1211 if (process_vendor(fn, line,
1212 argv + 1, argc - 1) == -1) {
1219 if (strcasecmp(argv[0], "BEGIN-VENDOR") == 0) {
1222 "dict_init: %s[%d] invalid BEGIN-VENDOR entry",
1228 vendor = dict_vendorbyname(argv[1]);
1231 "dict_init: %s[%d]: unknown vendor %s",
1236 block_vendor = vendor;
1238 } /* BEGIN-VENDOR */
1240 if (strcasecmp(argv[0], "END-VENDOR") == 0) {
1243 "dict_init: %s[%d] invalid END-VENDOR entry",
1249 vendor = dict_vendorbyname(argv[1]);
1252 "dict_init: %s[%d]: unknown vendor %s",
1258 if (vendor != block_vendor) {
1260 "dict_init: %s[%d]: END-VENDOR %s does not match any previous BEGIN-VENDOR",
1270 * Any other string: We don't recognize it.
1273 "dict_init: %s[%d] invalid keyword \"%s\"",
1283 * Initialize the directory, then fix the attr member of
1286 int dict_init(const char *dir, const char *fn)
1289 * Check if we need to change anything. If not, don't do
1292 if (dict_stat_check(dir, fn)) {
1297 * Free the dictionaries, and the stat cache.
1300 stat_root_dir = strdup(dir);
1301 stat_root_file = strdup(fn);
1304 * Create the table of vendor by name. There MAY NOT
1305 * be multiple vendors of the same name.
1307 * Each vendor is malloc'd, so the free function is free.
1309 vendors_byname = lrad_hash_table_create(dict_vendor_name_hash,
1310 dict_vendor_name_cmp,
1312 if (!vendors_byname) {
1317 * Create the table of vendors by value. There MAY
1318 * be vendors of the same value. If there are, we
1319 * pick the latest one.
1321 vendors_byvalue = lrad_hash_table_create(dict_vendor_value_hash,
1322 dict_vendor_value_cmp,
1324 if (!vendors_byvalue) {
1329 * Create the table of attributes by name. There MAY NOT
1330 * be multiple attributes of the same name.
1332 * Each attribute is malloc'd, so the free function is free.
1334 attributes_byname = lrad_hash_table_create(dict_attr_name_hash,
1337 if (!attributes_byname) {
1342 * Create the table of attributes by value. There MAY
1343 * be attributes of the same value. If there are, we
1344 * pick the latest one.
1346 attributes_byvalue = lrad_hash_table_create(dict_attr_value_hash,
1347 dict_attr_value_cmp,
1349 if (!attributes_byvalue) {
1353 values_byname = lrad_hash_table_create(dict_value_name_hash,
1354 dict_value_name_cmp,
1356 if (!values_byname) {
1360 values_byvalue = lrad_hash_table_create(dict_value_value_hash,
1361 dict_value_value_cmp,
1363 if (!values_byvalue) {
1367 value_fixup = NULL; /* just to be safe. */
1369 if (my_dict_init(dir, fn, NULL, 0) < 0)
1374 value_fixup_t *this, *next;
1376 for (this = value_fixup; this != NULL; this = next) {
1379 a = dict_attrbyname(this->attrstr);
1382 "dict_init: No ATTRIBUTE \"%s\" defined for VALUE \"%s\"",
1383 this->attrstr, this->dval->name);
1384 return -1; /* leak, but they should die... */
1387 this->dval->attr = a->attr;
1390 * Add the value into the dictionary.
1392 if (!lrad_hash_table_replace(values_byname,
1394 librad_log("dict_addvalue: Duplicate value name %s for attribute %s", this->dval->name, a->name);
1399 * Allow them to use the old name, but
1400 * prefer the new name when printing
1403 if (!lrad_hash_table_finddata(values_byvalue, this->dval)) {
1404 lrad_hash_table_replace(values_byvalue,
1410 * Just so we don't lose track of things.
1420 * Get an attribute by its numerical value.
1422 DICT_ATTR *dict_attrbyvalue(int attr)
1427 dattr.vendor = VENDOR(attr) & 0x7fff;
1429 return lrad_hash_table_finddata(attributes_byvalue, &dattr);
1433 * Get an attribute by its name.
1435 DICT_ATTR *dict_attrbyname(const char *name)
1439 if (!name) return NULL;
1441 strNcpy(dattr.name, name, sizeof(dattr.name));
1443 return lrad_hash_table_finddata(attributes_byname, &dattr);
1447 * Associate a value with an attribute and return it.
1449 DICT_VALUE *dict_valbyattr(int attr, int value)
1451 DICT_VALUE dval, *dv;
1454 * First, look up aliases.
1457 dval.name[0] = '\0';
1460 * Look up the attribute alias target, and use
1461 * the correct attribute number if found.
1463 dv = lrad_hash_table_finddata(values_byname, &dval);
1464 if (dv) dval.attr = dv->value;
1468 return lrad_hash_table_finddata(values_byvalue, &dval);
1472 * Get a value by its name, keyed off of an attribute.
1474 DICT_VALUE *dict_valbyname(int attr, const char *name)
1476 DICT_VALUE *my_dv, *dv;
1477 uint32_t buffer[(sizeof(*my_dv) + DICT_VALUE_MAX_NAME_LEN + 3)/4];
1479 if (!name) return NULL;
1481 my_dv = (DICT_VALUE *) buffer;
1483 my_dv->name[0] = '\0';
1486 * Look up the attribute alias target, and use
1487 * the correct attribute number if found.
1489 dv = lrad_hash_table_finddata(values_byname, my_dv);
1490 if (dv) my_dv->attr = dv->value;
1492 strNcpy(my_dv->name, name, DICT_VALUE_MAX_NAME_LEN);
1494 return lrad_hash_table_finddata(values_byname, my_dv);
1498 * Get the vendor PEC based on the vendor name
1500 * This is efficient only for small numbers of vendors.
1502 int dict_vendorbyname(const char *name)
1505 uint32_t buffer[(sizeof(*dv) + DICT_VENDOR_MAX_NAME_LEN + 3)/4];
1507 if (!name) return 0;
1509 dv = (DICT_VENDOR *) buffer;
1510 strNcpy(dv->name, name, DICT_VENDOR_MAX_NAME_LEN);
1512 dv = lrad_hash_table_finddata(vendors_byname, dv);
1515 return dv->vendorpec;
1519 * Return the vendor struct based on the PEC.
1521 DICT_VENDOR *dict_vendorbyvalue(int vendorpec)
1525 dv.vendorpec = vendorpec;
1527 return lrad_hash_table_finddata(vendors_byvalue, &dv);