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$";
35 #ifdef HAVE_SYS_STAT_H
42 #include "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 {
76 struct value_fixup_t *next;
81 * So VALUEs in the dictionary can have forward references.
83 static value_fixup_t *value_fixup = NULL;
85 static const LRAD_NAME_NUMBER type_table[] = {
86 { "string", PW_TYPE_STRING },
87 { "integer", PW_TYPE_INTEGER },
88 { "ipaddr", PW_TYPE_IPADDR },
89 { "date", PW_TYPE_DATE },
90 { "abinary", PW_TYPE_ABINARY },
91 { "octets", PW_TYPE_OCTETS },
92 { "ifid", PW_TYPE_IFID },
93 { "ipv6addr", PW_TYPE_IPV6ADDR },
94 { "ipv6prefix", PW_TYPE_IPV6PREFIX },
99 * Create the hash of the name.
101 static uint32_t dict_hashname(const char *name)
110 while (*p && (len < sizeof(buffer))) {
112 *(q++) = tolower((int) *(p++));
118 return lrad_hash(buffer, len);
123 * Free the list of stat buffers
125 static void dict_stat_free(void)
127 dict_stat_t *this, *next;
130 stat_root_dir = NULL;
131 free(stat_root_file);
132 stat_root_file = NULL;
139 for (this = stat_head; this != NULL; this = next) {
145 stat_head = stat_tail = NULL;
150 * Add an entry to the list of stat buffers.
152 static void dict_stat_add(const char *name, const struct stat *stat_buf)
156 this = malloc(sizeof(*this));
157 memset(this, 0, sizeof(*this));
159 this->name = strdup(name);
160 this->mtime = stat_buf->st_mtime;
163 stat_head = stat_tail = this;
165 stat_tail->next = this;
172 * See if any dictionaries have changed. If not, don't
175 static int dict_stat_check(const char *root_dir, const char *root_file)
180 if (!stat_root_dir) return 0;
181 if (!stat_root_file) return 0;
183 if (strcmp(root_dir, stat_root_dir) != 0) return 0;
184 if (strcmp(root_file, stat_root_file) != 0) return 0;
186 if (!stat_head) return 0; /* changed, reload */
188 for (this = stat_head; this != NULL; this = this->next) {
189 if (stat(this->name, &buf) < 0) return 0;
191 if (buf.st_mtime != this->mtime) return 0;
199 * Free the dictionary_attributes and dictionary_values lists.
206 lrad_hash_table_free(vendors_byname);
207 lrad_hash_table_free(vendors_byvalue);
208 vendors_byname = NULL;
209 vendors_byvalue = NULL;
211 lrad_hash_table_free(attributes_byname);
212 lrad_hash_table_free(attributes_byvalue);
213 attributes_byname = NULL;
214 attributes_byvalue = NULL;
216 lrad_hash_table_free(values_byname);
217 lrad_hash_table_free(values_byvalue);
218 values_byname = NULL;
219 values_byvalue = NULL;
226 * Add vendor to the list.
228 int dict_addvendor(const char *name, int value)
234 if (value >= (1 << 16)) {
235 librad_log("dict_addvendor: Cannot handle vendor ID larger than 65535");
239 if ((length = strlen(name)) >= DICT_VENDOR_MAX_NAME_LEN) {
240 librad_log("dict_addvendor: vendor name too long");
244 if ((dv = malloc(sizeof(*dv) + length)) == NULL) {
245 librad_log("dict_addvendor: out of memory");
249 hash = dict_hashname(name);
250 strcpy(dv->name, name);
251 dv->vendorpec = value;
252 dv->type = dv->length = 1; /* defaults */
254 if (lrad_hash_table_insert(vendors_byname, hash, dv) == 0) {
257 old_dv = lrad_hash_table_finddata(vendors_byname, hash);
259 librad_log("dict_addvendor: Failed inserting vendor name %s", name);
262 if (old_dv->vendorpec != dv->vendorpec) {
263 librad_log("dict_addvendor: Duplicate vendor name %s", name);
268 * Already inserted. Discard the duplicate entry.
275 * Insert the SAME pointer (not free'd when this tree is
276 * deleted), into another tree.
278 * If the newly inserted entry is a duplicate of an existing
279 * entry, then the old entry is tossed, and the new one
280 * replaces it. This behaviour is configured in the
281 * lrad_hash_table_create() function.
283 * We want this behaviour because we want OLD names for
284 * the attributes to be read from the configuration
285 * files, but when we're printing them, (and looking up
286 * by value) we want to use the NEW name.
288 lrad_hash_table_insert(vendors_byvalue, dv->vendorpec, dv);
294 * Add an attribute to the dictionary.
296 int dict_addattr(const char *name, int vendor, int type, int value,
299 static int max_attr = 0;
303 if (strlen(name) > (sizeof(attr->name) -1)) {
304 librad_log("dict_addattr: attribute name too long");
309 * If the value is '-1', that means use a pre-existing
310 * one (if it already exists). If one does NOT already exist,
311 * then create a new attribute, with a non-conflicting value,
315 if (dict_attrbyname(name)) {
316 return 0; /* exists, don't add it again */
321 } else if (vendor == 0) {
325 if (value > max_attr) {
331 librad_log("dict_addattr: ATTRIBUTE has invalid number (less than zero)");
335 if (value >= 65536) {
336 librad_log("dict_addattr: ATTRIBUTE has invalid number (larger than 65535).");
341 DICT_VENDOR *dv = dict_vendorbyvalue(vendor);
344 * If the vendor isn't defined, die/
347 librad_log("dict_addattr: Unknown vendor");
352 * With a few exceptions, attributes can only be
353 * 1..255. The check above catches the less than
356 if ((dv->type == 1) && (value >= 256)) {
357 librad_log("dict_addattr: ATTRIBUTE has invalid number (larger than 255).");
359 } /* else 256..65535 are allowed */
363 * Create a new attribute for the list
365 if ((attr = malloc(sizeof(*attr))) == NULL) {
366 librad_log("dict_addattr: out of memory");
370 hash = dict_hashname(name);
371 strcpy(attr->name, name);
373 attr->attr |= (vendor << 16); /* FIXME: hack */
376 attr->vendor = vendor;
380 * Insert the attribute, only if it's not a duplicate.
382 if (lrad_hash_table_insert(attributes_byname, hash, attr) == 0) {
386 * If the attribute has identical number, then
387 * ignore the duplicate.
389 a = lrad_hash_table_finddata(attributes_byname, hash);
390 if (a && (strcasecmp(a->name, attr->name) == 0)) {
391 if (a->attr != attr->attr) {
392 librad_log("dict_addattr: Duplicate attribute name %s", name);
397 * Same name, same vendor, same attr,
398 * maybe the flags and/or type is
399 * different. Let the new value
400 * over-ride the old one.
406 * Insert the SAME pointer (not free'd when this tree is
407 * deleted), into another tree.
409 * If the newly inserted entry is a duplicate of an existing
410 * entry, then the old entry is tossed, and the new one
411 * replaces it. This behaviour is configured in the
412 * lrad_hash_table_create() function.
414 * We want this behaviour because we want OLD names for
415 * the attributes to be read from the configuration
416 * files, but when we're printing them, (and looking up
417 * by value) we want to use the NEW name.
419 lrad_hash_table_insert(attributes_byvalue, (uint32_t) attr->attr, attr);
426 * Add a value for an attribute to the dictionary.
428 int dict_addvalue(const char *namestr, const char *attrstr, int value)
435 if ((length = strlen(namestr)) >= DICT_VALUE_MAX_NAME_LEN) {
436 librad_log("dict_addvalue: value name too long");
440 if ((dval = malloc(sizeof(*dval) + length)) == NULL) {
441 librad_log("dict_addvalue: out of memory");
444 memset(dval, 0, sizeof(*dval));
446 hash = dict_hashname(namestr);
447 strcpy(dval->name, namestr);
451 * Remember which attribute is associated with this
452 * value, if possible.
454 dattr = dict_attrbyname(attrstr);
456 dval->attr = dattr->attr;
457 hash = lrad_hash_update(&dval->attr, sizeof(dval->attr), hash);
459 value_fixup_t *fixup;
461 fixup = (value_fixup_t *) malloc(sizeof(*fixup));
463 librad_log("dict_addvalue: out of memory");
466 memset(fixup, 0, sizeof(*fixup));
468 strNcpy(fixup->attrstr, attrstr, sizeof(fixup->attrstr));
473 * Insert to the head of the list.
475 fixup->next = value_fixup;
482 * Add the value into the dictionary.
484 if (lrad_hash_table_insert(values_byname, hash, dval) == 0) {
489 * Suppress duplicates with the same
490 * name and value. There are lots in
493 old = dict_valbyname(dattr->attr, namestr);
494 if (old && (old->value == dval->value)) {
500 librad_log("dict_addvalue: Duplicate value name %s for attribute %s", namestr, attrstr);
505 * There are multiple VALUE's, keyed by attribute, so we
506 * take care of that here.
509 hash = lrad_hash_update(&dval->value, sizeof(dval->value), hash);
510 lrad_hash_table_insert(values_byvalue, hash, dval);
516 * Process the ATTRIBUTE command
518 static int process_attribute(const char* fn, const int line,
519 const int block_vendor, char **argv,
528 if ((argc < 3) || (argc > 4)) {
529 librad_log("dict_init: %s[%d]: invalid ATTRIBUTE line",
535 * Validate all entries
537 if (!isdigit((int) argv[1][0])) {
538 librad_log("dict_init: %s[%d]: invalid value", fn, line);
541 sscanf(argv[1], "%i", &value);
544 * find the type of the attribute.
546 type = lrad_str2int(type_table, argv[2], -1);
548 librad_log("dict_init: %s[%d]: invalid type \"%s\"",
554 * Only look up the vendor if the string
557 memset(&flags, 0, sizeof(flags));
559 s = strtok(argv[3], ",");
561 if (strcmp(s, "has_tag") == 0 ||
562 strcmp(s, "has_tag=1") == 0) {
563 /* Boolean flag, means this is a
567 } else if (strncmp(s, "encrypt=", 8) == 0) {
568 /* Encryption method, defaults to 0 (none).
569 Currently valid is just type 2,
570 Tunnel-Password style, which can only
571 be applied to strings. */
572 flags.encrypt = strtol(s + 8, &c, 0);
574 librad_log( "dict_init: %s[%d] invalid option %s",
579 /* Must be a vendor 'flag'... */
580 if (strncmp(s, "vendor=", 7) == 0) {
585 vendor = dict_vendorbyname(s);
587 librad_log( "dict_init: %s[%d]: unknown vendor %s",
591 if (block_vendor && argv[3][0] &&
592 (block_vendor != vendor)) {
593 librad_log("dict_init: %s[%d]: mismatched vendor %s within BEGIN-VENDOR/END-VENDOR block",
598 s = strtok(NULL, ",");
602 if (block_vendor) vendor = block_vendor;
605 * Special checks for tags, they make our life much more
610 * VSA's can't be tagged.
613 librad_log("dict_init: %s[%d]: Vendor attributes cannot be tagged.",
619 * Only string, octets, and integer can be tagged.
623 case PW_TYPE_INTEGER:
627 librad_log("dict_init: %s[%d]: Attributes of type %s cannot be tagged.",
629 lrad_int2str(type_table, type, "?Unknown?"));
638 if (dict_addattr(argv[0], vendor, type, value, flags) < 0) {
639 librad_log("dict_init: %s[%d]: %s",
640 fn, line, librad_errstr);
649 * Process the VALUE command
651 static int process_value(const char* fn, const int line, char **argv,
657 librad_log("dict_init: %s[%d]: invalid VALUE line",
662 * For Compatibility, skip "Server-Config"
664 if (strcasecmp(argv[0], "Server-Config") == 0)
668 * Validate all entries
670 if (!isdigit((int) argv[2][0])) {
671 librad_log("dict_init: %s[%d]: invalid value",
675 sscanf(argv[2], "%i", &value);
678 * valuepair.c will get excited when creating attributes,
679 * if it sees values which look like integers, so we can't
682 if (isdigit(argv[1][0])) {
683 librad_log("dict_init: %s[%d]: Names for VALUEs cannot start with a digit.",
687 if (dict_addvalue(argv[1], argv[0], value) < 0) {
688 librad_log("dict_init: %s[%d]: %s",
689 fn, line, librad_errstr);
698 * Process the VENDOR command
700 static int process_vendor(const char* fn, const int line, char **argv,
704 const char *format = NULL;
706 if ((argc < 2) || (argc > 3)) {
707 librad_log( "dict_init: %s[%d] invalid VENDOR entry",
713 * Validate all entries
715 if (!isdigit((int) argv[1][0])) {
716 librad_log("dict_init: %s[%d]: invalid value",
720 value = atoi(argv[1]);
722 /* Create a new VENDOR entry for the list */
723 if (dict_addvendor(argv[0], value) < 0) {
724 librad_log("dict_init: %s[%d]: %s",
725 fn, line, librad_errstr);
730 * Look for a format statement
735 } else if (value == VENDORPEC_USR) { /* catch dictionary screw-ups */
736 format = "format=4,0";
738 } else if (value == VENDORPEC_LUCENT) {
739 format = "format=2,1";
741 } else if (value == VENDORPEC_STARENT) {
742 format = "format=2,2";
744 } /* else no fixups to do */
751 if (strncasecmp(format, "format=", 7) != 0) {
752 librad_log("dict_init: %s[%d]: Invalid format for VENDOR. Expected \"format=\", got \"%s\"",
758 if ((strlen(p) != 3) ||
759 !isdigit((int) p[0]) ||
761 !isdigit((int) p[2])) {
762 librad_log("dict_init: %s[%d]: Invalid format for VENDOR. Expected text like \"1,1\", got \"%s\"",
767 type = (int) (p[0] - '0');
768 length = (int) (p[2] - '0');
770 dv = dict_vendorbyvalue(value);
772 librad_log("dict_init: %s[%d]: Failed adding format for VENDOR",
777 if ((type != 1) && (type != 2) && (type != 4)) {
778 librad_log("dict_init: %s[%d]: invalid type value %d for VENDOR",
783 if ((length != 0) && (length != 1) && (length != 2)) {
784 librad_log("dict_init: %s[%d]: invalid length value %d for VENDOR",
797 * String split routine. Splits an input string IN PLACE
798 * into pieces, based on spaces.
800 static int str2argv(char *str, char **argv, int max_argc)
805 if (argc >= max_argc) return argc;
808 * Chop out comments early.
815 while ((*str == ' ') ||
818 (*str == '\n')) *(str++) = '\0';
820 if (!*str) return argc;
829 (*str != '\n')) str++;
835 #define MAX_ARGV (16)
838 * Initialize the dictionary.
840 static int my_dict_init(const char *dir, const char *fn,
841 const char *src_file, int src_line)
851 char *argv[MAX_ARGV];
854 if (strlen(fn) >= sizeof(dirtmp) / 2 ||
855 strlen(dir) >= sizeof(dirtmp) / 2) {
856 librad_log("dict_init: filename name too long");
861 * First see if fn is relative to dir. If so, create
862 * new filename. If not, remember the absolute dir.
864 if ((p = strrchr(fn, '/')) != NULL) {
868 } else if (dir && dir[0] && strcmp(dir, ".") != 0) {
869 snprintf(dirtmp, sizeof(dirtmp), "%s/%s", dir, fn);
873 if ((fp = fopen(fn, "r")) == NULL) {
875 librad_log("dict_init: Couldn't open dictionary \"%s\": %s",
876 fn, strerror(errno));
878 librad_log("dict_init: %s[%d]: Couldn't open dictionary \"%s\": %s",
879 src_file, src_line, fn, strerror(errno));
884 stat(fn, &statbuf); /* fopen() guarantees this will succeed */
885 if (!S_ISREG(statbuf.st_mode)) {
887 librad_log("dict_init: Dictionary \"%s\" is not a regular file",
891 dict_stat_add(fn, &statbuf);
894 * Seed the random pool with data.
896 lrad_rand_seed(&statbuf, sizeof(statbuf));
900 while (fgets(buf, sizeof(buf), fp) != NULL) {
902 if (buf[0] == '#' || buf[0] == 0 ||
903 buf[0] == '\n' || buf[0] == '\r')
907 * Comment characters should NOT be appearing anywhere but
908 * as start of a comment;
910 p = strchr(buf, '#');
913 argc = str2argv(buf, argv, MAX_ARGV);
914 if (argc == 0) continue;
917 librad_log( "dict_init: %s[%d] invalid entry",
926 fprintf(stderr, "ARGC = %d\n",argc);
927 for (i = 0; i < argc; i++) {
928 fprintf(stderr, "\t%s\n", argv[i]);
933 * See if we need to import another dictionary.
935 if (strcasecmp(argv[0], "$INCLUDE") == 0) {
936 if (my_dict_init(dir, argv[1], fn, line) < 0) {
944 * Perhaps this is an attribute.
946 if (strcasecmp(argv[0], "ATTRIBUTE") == 0) {
947 if (process_attribute(fn, line, block_vendor,
948 argv + 1, argc - 1) == -1) {
956 * Process VALUE lines.
958 if (strcasecmp(argv[0], "VALUE") == 0) {
959 if (process_value(fn, line,
960 argv + 1, argc - 1) == -1) {
968 * Process VENDOR lines.
970 if (strcasecmp(argv[0], "VENDOR") == 0) {
971 if (process_vendor(fn, line,
972 argv + 1, argc - 1) == -1) {
979 if (strcasecmp(argv[0], "BEGIN-VENDOR") == 0) {
982 "dict_init: %s[%d] invalid BEGIN-VENDOR entry",
988 vendor = dict_vendorbyname(argv[1]);
991 "dict_init: %s[%d]: unknown vendor %s",
996 block_vendor = vendor;
1000 if (strcasecmp(argv[0], "END-VENDOR") == 0) {
1003 "dict_init: %s[%d] invalid END-VENDOR entry",
1009 vendor = dict_vendorbyname(argv[1]);
1012 "dict_init: %s[%d]: unknown vendor %s",
1018 if (vendor != block_vendor) {
1020 "dict_init: %s[%d]: END-VENDOR %s does not match any previous BEGIN-VENDOR",
1030 * Any other string: We don't recognize it.
1033 "dict_init: %s[%d] invalid keyword \"%s\"",
1043 * Initialize the directory, then fix the attr member of
1046 int dict_init(const char *dir, const char *fn)
1049 * Check if we need to change anything. If not, don't do
1052 if (dict_stat_check(dir, fn)) {
1057 * Free the dictionaries, and the stat cache.
1060 stat_root_dir = strdup(dir);
1061 stat_root_file = strdup(fn);
1064 * Create the tree of vendor by name. There MAY NOT
1065 * be multiple vendors of the same name.
1067 * Each vendor is malloc'd, so the free function is free.
1069 vendors_byname = lrad_hash_table_create(8, free, 0);
1070 if (!vendors_byname) {
1075 * Create the tree of vendors by value. There MAY
1076 * be vendors of the same value. If there are, we
1077 * pick the latest one.
1079 vendors_byvalue = lrad_hash_table_create(8, NULL, 1);
1080 if (!vendors_byvalue) {
1085 * Create the tree of attributes by name. There MAY NOT
1086 * be multiple attributes of the same name.
1088 * Each attribute is malloc'd, so the free function is free.
1090 attributes_byname = lrad_hash_table_create(11, free, 0);
1091 if (!attributes_byname) {
1096 * Create the tree of attributes by value. There MAY
1097 * be attributes of the same value. If there are, we
1098 * pick the latest one.
1100 attributes_byvalue = lrad_hash_table_create(11, NULL, 1);
1101 if (!attributes_byvalue) {
1105 values_byname = lrad_hash_table_create(11, free, 0);
1106 if (!values_byname) {
1110 values_byvalue = lrad_hash_table_create(11, NULL, 1);
1111 if (!values_byvalue) {
1115 value_fixup = NULL; /* just to be safe. */
1117 if (my_dict_init(dir, fn, NULL, 0) < 0)
1123 value_fixup_t *this, *next;
1125 for (this = value_fixup; this != NULL; this = next) {
1128 a = dict_attrbyname(this->attrstr);
1131 "dict_init: No ATTRIBUTE \"%s\" defined for VALUE \"%s\"",
1132 this->attrstr, this->dval->name);
1133 return -1; /* leak, but they should die... */
1136 this->dval->attr = a->attr;
1139 * Add the value into the dictionary.
1141 hash = lrad_hash_update(&this->dval->attr,
1142 sizeof(this->dval->attr),
1144 if (lrad_hash_table_insert(values_byname,
1145 hash, this->dval) == 0) {
1146 librad_log("dict_addvalue: Duplicate value name %s for attribute %s", this->dval->name, a->name);
1151 * Allow them to use the old name, but
1152 * prefer the new name when printing
1155 hash = (uint32_t) this->dval->attr;
1156 hash = lrad_hash_update(&this->dval->value,
1157 sizeof(this->dval->value),
1159 if (!lrad_hash_table_finddata(values_byvalue, hash)) {
1160 lrad_hash_table_insert(values_byvalue,
1166 * Just so we don't lose track of things.
1176 * Get an attribute by its numerical value.
1178 DICT_ATTR *dict_attrbyvalue(int val)
1180 return lrad_hash_table_finddata(attributes_byvalue, (uint32_t) val);
1184 * Get an attribute by its name.
1186 DICT_ATTR *dict_attrbyname(const char *name)
1188 if (!name) return NULL;
1190 return lrad_hash_table_finddata(attributes_byname,
1191 dict_hashname(name));
1195 * Associate a value with an attribute and return it.
1197 DICT_VALUE *dict_valbyattr(int attr, int val)
1199 uint32_t hash = attr;
1201 hash = lrad_hash_update(&val, sizeof(val), hash);
1203 return lrad_hash_table_finddata(values_byvalue, hash);
1207 * Get a value by its name, keyed off of an attribute.
1209 DICT_VALUE *dict_valbyname(int attr, const char *name)
1213 if (!name) return NULL;
1215 hash = dict_hashname(name);
1216 hash = lrad_hash_update(&attr, sizeof(attr), hash);
1218 return lrad_hash_table_finddata(values_byname, hash);
1222 * Get the vendor PEC based on the vendor name
1224 * This is efficient only for small numbers of vendors.
1226 int dict_vendorbyname(const char *name)
1231 if (!name) return 0;
1233 hash = dict_hashname(name);
1235 dv = lrad_hash_table_finddata(vendors_byname, hash);
1238 return dv->vendorpec;
1242 * Return the vendor struct based on the PEC.
1244 DICT_VENDOR *dict_vendorbyvalue(int vendor)
1246 return lrad_hash_table_finddata(vendors_byvalue, (uint32_t) vendor);