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 {
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 },
99 * Create the hash of the name.
101 * We copy the hash function here because it's substantially faster.
103 #define FNV_MAGIC_INIT (0x811c9dc5)
104 #define FNV_MAGIC_PRIME (0x01000193)
106 static uint32_t dict_hashname(const char *name)
108 uint32_t hash = FNV_MAGIC_INIT;
111 for (p = name; *p != '\0'; p++) {
112 int c = *(const unsigned char *) p;
113 if (isalpha(c)) c = tolower(c);
115 hash *= FNV_MAGIC_PRIME;
116 hash ^= (uint32_t ) (c & 0xff);
124 * Hash callback functions.
126 static uint32_t dict_attr_name_hash(const void *data)
128 return dict_hashname(((const DICT_ATTR *)data)->name);
131 static int dict_attr_name_cmp(const void *one, const void *two)
133 const DICT_ATTR *a = one;
134 const DICT_ATTR *b = two;
136 return strcasecmp(a->name, b->name);
139 static uint32_t dict_attr_value_hash(const void *data)
141 return lrad_hash(&((const DICT_ATTR *)data)->attr,
142 sizeof(((const DICT_ATTR *)data)->attr));
145 static int dict_attr_value_cmp(const void *one, const void *two)
147 const DICT_ATTR *a = one;
148 const DICT_ATTR *b = two;
150 return a->attr - b->attr;
153 static uint32_t dict_vendor_name_hash(const void *data)
155 return dict_hashname(((const DICT_VENDOR *)data)->name);
158 static int dict_vendor_name_cmp(const void *one, const void *two)
160 const DICT_VENDOR *a = one;
161 const DICT_VENDOR *b = two;
163 return strcasecmp(a->name, b->name);
166 static uint32_t dict_vendor_value_hash(const void *data)
168 return lrad_hash(&(((const DICT_VENDOR *)data)->vendorpec),
169 sizeof(((const DICT_VENDOR *)data)->vendorpec));
172 static int dict_vendor_value_cmp(const void *one, const void *two)
174 const DICT_VENDOR *a = one;
175 const DICT_VENDOR *b = two;
177 return a->vendorpec - b->vendorpec;
180 static uint32_t dict_value_name_hash(const void *data)
183 const DICT_VALUE *dval = data;
185 hash = dict_hashname(dval->name);
186 return lrad_hash_update(&dval->attr, sizeof(dval->attr), hash);
189 static int dict_value_name_cmp(const void *one, const void *two)
192 const DICT_VALUE *a = one;
193 const DICT_VALUE *b = two;
195 rcode = a->attr - b->attr;
196 if (rcode != 0) return rcode;
198 return strcasecmp(a->name, b->name);
201 static uint32_t dict_value_value_hash(const void *data)
204 const DICT_VALUE *dval = data;
206 hash = lrad_hash(&dval->attr, sizeof(dval->attr));
207 return lrad_hash_update(&dval->value, sizeof(dval->value), hash);
210 static int dict_value_value_cmp(const void *one, const void *two)
213 const DICT_VALUE *a = one;
214 const DICT_VALUE *b = two;
216 rcode = a->attr - b->attr;
217 if (rcode != 0) return rcode;
219 return a->value - b->value;
224 * Free the list of stat buffers
226 static void dict_stat_free(void)
228 dict_stat_t *this, *next;
231 stat_root_dir = NULL;
232 free(stat_root_file);
233 stat_root_file = NULL;
240 for (this = stat_head; this != NULL; this = next) {
246 stat_head = stat_tail = NULL;
251 * Add an entry to the list of stat buffers.
253 static void dict_stat_add(const char *name, const struct stat *stat_buf)
257 this = malloc(sizeof(*this));
259 memset(this, 0, sizeof(*this));
261 this->name = strdup(name);
262 this->mtime = stat_buf->st_mtime;
265 stat_head = stat_tail = this;
267 stat_tail->next = this;
274 * See if any dictionaries have changed. If not, don't
277 static int dict_stat_check(const char *root_dir, const char *root_file)
282 if (!stat_root_dir) return 0;
283 if (!stat_root_file) return 0;
285 if (strcmp(root_dir, stat_root_dir) != 0) return 0;
286 if (strcmp(root_file, stat_root_file) != 0) return 0;
288 if (!stat_head) return 0; /* changed, reload */
290 for (this = stat_head; this != NULL; this = this->next) {
291 if (stat(this->name, &buf) < 0) return 0;
293 if (buf.st_mtime != this->mtime) return 0;
301 * Free the dictionary_attributes and dictionary_values lists.
308 lrad_hash_table_free(vendors_byname);
309 lrad_hash_table_free(vendors_byvalue);
310 vendors_byname = NULL;
311 vendors_byvalue = NULL;
313 lrad_hash_table_free(attributes_byname);
314 lrad_hash_table_free(attributes_byvalue);
315 attributes_byname = NULL;
316 attributes_byvalue = NULL;
318 lrad_hash_table_free(values_byname);
319 lrad_hash_table_free(values_byvalue);
320 values_byname = NULL;
321 values_byvalue = NULL;
328 * Add vendor to the list.
330 int dict_addvendor(const char *name, int value)
335 if (value >= (1 << 16)) {
336 librad_log("dict_addvendor: Cannot handle vendor ID larger than 65535");
340 if ((length = strlen(name)) >= DICT_VENDOR_MAX_NAME_LEN) {
341 librad_log("dict_addvendor: vendor name too long");
345 if ((dv = malloc(sizeof(*dv) + length)) == NULL) {
346 librad_log("dict_addvendor: out of memory");
350 strcpy(dv->name, name);
351 dv->vendorpec = value;
352 dv->type = dv->length = 1; /* defaults */
354 if (!lrad_hash_table_insert(vendors_byname, dv)) {
357 old_dv = lrad_hash_table_finddata(vendors_byname, dv);
359 librad_log("dict_addvendor: Failed inserting vendor name %s", name);
362 if (old_dv->vendorpec != dv->vendorpec) {
363 librad_log("dict_addvendor: Duplicate vendor name %s", name);
368 * Already inserted. Discard the duplicate entry.
375 * Insert the SAME pointer (not free'd when this table is
376 * deleted), into another table.
378 * We want this behaviour because we want OLD names for
379 * the attributes to be read from the configuration
380 * files, but when we're printing them, (and looking up
381 * by value) we want to use the NEW name.
383 if (!lrad_hash_table_replace(vendors_byvalue, dv)) {
384 librad_log("dict_addvendor: Failed inserting vendor %s",
393 * Add an attribute to the dictionary.
395 int dict_addattr(const char *name, int vendor, int type, int value,
398 static int max_attr = 0;
401 if (strlen(name) > (sizeof(attr->name) -1)) {
402 librad_log("dict_addattr: attribute name too long");
407 * If the value is '-1', that means use a pre-existing
408 * one (if it already exists). If one does NOT already exist,
409 * then create a new attribute, with a non-conflicting value,
413 if (dict_attrbyname(name)) {
414 return 0; /* exists, don't add it again */
419 } else if (vendor == 0) {
423 if (value > max_attr) {
429 librad_log("dict_addattr: ATTRIBUTE has invalid number (less than zero)");
433 if (value >= 65536) {
434 librad_log("dict_addattr: ATTRIBUTE has invalid number (larger than 65535).");
439 DICT_VENDOR *dv = dict_vendorbyvalue(vendor);
442 * If the vendor isn't defined, die/
445 librad_log("dict_addattr: Unknown vendor");
450 * With a few exceptions, attributes can only be
451 * 1..255. The check above catches the less than
454 if ((dv->type == 1) && (value >= 256)) {
455 librad_log("dict_addattr: ATTRIBUTE has invalid number (larger than 255).");
457 } /* else 256..65535 are allowed */
461 * Create a new attribute for the list
463 if ((attr = malloc(sizeof(*attr))) == NULL) {
464 librad_log("dict_addattr: out of memory");
468 strcpy(attr->name, name);
470 attr->attr |= (vendor << 16); /* FIXME: hack */
473 attr->vendor = vendor;
476 * Insert the attribute, only if it's not a duplicate.
478 if (!lrad_hash_table_insert(attributes_byname, attr)) {
482 * If the attribute has identical number, then
483 * ignore the duplicate.
485 a = lrad_hash_table_finddata(attributes_byname, attr);
486 if (a && (strcasecmp(a->name, attr->name) == 0)) {
487 if (a->attr != attr->attr) {
488 librad_log("dict_addattr: Duplicate attribute name %s", name);
494 * Same name, same vendor, same attr,
495 * maybe the flags and/or type is
496 * different. Let the new value
497 * over-ride the old one.
501 lrad_hash_table_delete(attributes_byvalue, a);
503 if (!lrad_hash_table_replace(attributes_byname, attr)) {
504 librad_log("dict_addattr: Internal error storing attribute %s", name);
511 * Insert the SAME pointer (not free'd when this entry is
512 * deleted), into another table.
514 * We want this behaviour because we want OLD names for
515 * the attributes to be read from the configuration
516 * files, but when we're printing them, (and looking up
517 * by value) we want to use the NEW name.
519 if (!lrad_hash_table_replace(attributes_byvalue, attr)) {
520 librad_log("dict_addattr: Failed inserting attribute name %s", name);
529 * Add a value for an attribute to the dictionary.
531 int dict_addvalue(const char *namestr, const char *attrstr, int value)
537 if ((length = strlen(namestr)) >= DICT_VALUE_MAX_NAME_LEN) {
538 librad_log("dict_addvalue: value name too long");
542 if ((dval = malloc(sizeof(*dval) + length)) == NULL) {
543 librad_log("dict_addvalue: out of memory");
546 memset(dval, 0, sizeof(*dval));
548 strcpy(dval->name, namestr);
552 * Remember which attribute is associated with this
553 * value, if possible.
555 dattr = dict_attrbyname(attrstr);
557 dval->attr = dattr->attr;
560 * Octets is allowed as a work-around for the
561 * fact that branch_1_1 doesn't have BYTE or SHORT
563 if ((dattr->type != PW_TYPE_INTEGER) &&
564 (dattr->type != PW_TYPE_OCTETS)) {
565 librad_log("dict_addvalue: VALUEs can only be defined for'integer' types");
570 value_fixup_t *fixup;
572 fixup = (value_fixup_t *) malloc(sizeof(*fixup));
574 librad_log("dict_addvalue: out of memory");
577 memset(fixup, 0, sizeof(*fixup));
579 strNcpy(fixup->attrstr, attrstr, sizeof(fixup->attrstr));
583 * Insert to the head of the list.
585 fixup->next = value_fixup;
592 * Add the value into the dictionary.
594 if (!lrad_hash_table_insert(values_byname, dval)) {
599 * Suppress duplicates with the same
600 * name and value. There are lots in
603 old = dict_valbyname(dattr->attr, namestr);
604 if (old && (old->value == dval->value)) {
610 librad_log("dict_addvalue: Duplicate value name %s for attribute %s", namestr, attrstr);
615 * There are multiple VALUE's, keyed by attribute, so we
616 * take care of that here.
618 if (!lrad_hash_table_replace(values_byvalue, dval)) {
619 librad_log("dict_addvalue: Failed inserting value %s",
628 * Process the ATTRIBUTE command
630 static int process_attribute(const char* fn, const int line,
631 const int block_vendor, char **argv,
640 if ((argc < 3) || (argc > 4)) {
641 librad_log("dict_init: %s[%d]: invalid ATTRIBUTE line",
647 * Validate all entries
649 if (!isdigit((int) argv[1][0])) {
650 librad_log("dict_init: %s[%d]: invalid value", fn, line);
653 sscanf(argv[1], "%i", &value);
656 * find the type of the attribute.
658 type = lrad_str2int(type_table, argv[2], -1);
660 librad_log("dict_init: %s[%d]: invalid type \"%s\"",
666 * Only look up the vendor if the string
669 memset(&flags, 0, sizeof(flags));
671 s = strtok(argv[3], ",");
673 if (strcmp(s, "has_tag") == 0 ||
674 strcmp(s, "has_tag=1") == 0) {
675 /* Boolean flag, means this is a
679 } else if (strncmp(s, "encrypt=", 8) == 0) {
680 /* Encryption method, defaults to 0 (none).
681 Currently valid is just type 2,
682 Tunnel-Password style, which can only
683 be applied to strings. */
684 flags.encrypt = strtol(s + 8, &c, 0);
686 librad_log( "dict_init: %s[%d] invalid option %s",
691 /* Must be a vendor 'flag'... */
692 if (strncmp(s, "vendor=", 7) == 0) {
697 vendor = dict_vendorbyname(s);
699 librad_log( "dict_init: %s[%d]: unknown vendor %s",
703 if (block_vendor && argv[3][0] &&
704 (block_vendor != vendor)) {
705 librad_log("dict_init: %s[%d]: mismatched vendor %s within BEGIN-VENDOR/END-VENDOR block",
710 s = strtok(NULL, ",");
714 if (block_vendor) vendor = block_vendor;
717 * Special checks for tags, they make our life much more
722 * Only string, octets, and integer can be tagged.
726 case PW_TYPE_INTEGER:
730 librad_log("dict_init: %s[%d]: Attributes of type %s cannot be tagged.",
732 lrad_int2str(type_table, type, "?Unknown?"));
741 if (dict_addattr(argv[0], vendor, type, value, flags) < 0) {
742 librad_log("dict_init: %s[%d]: %s",
743 fn, line, librad_errstr);
752 * Process the VALUE command
754 static int process_value(const char* fn, const int line, char **argv,
760 librad_log("dict_init: %s[%d]: invalid VALUE line",
765 * For Compatibility, skip "Server-Config"
767 if (strcasecmp(argv[0], "Server-Config") == 0)
771 * Validate all entries
773 if (!isdigit((int) argv[2][0])) {
774 librad_log("dict_init: %s[%d]: invalid value",
778 sscanf(argv[2], "%i", &value);
780 if (dict_addvalue(argv[1], argv[0], value) < 0) {
781 librad_log("dict_init: %s[%d]: %s",
782 fn, line, librad_errstr);
791 * Process the VENDOR command
793 static int process_vendor(const char* fn, const int line, char **argv,
797 const char *format = NULL;
799 if ((argc < 2) || (argc > 3)) {
800 librad_log( "dict_init: %s[%d] invalid VENDOR entry",
806 * Validate all entries
808 if (!isdigit((int) argv[1][0])) {
809 librad_log("dict_init: %s[%d]: invalid value",
813 value = atoi(argv[1]);
815 /* Create a new VENDOR entry for the list */
816 if (dict_addvendor(argv[0], value) < 0) {
817 librad_log("dict_init: %s[%d]: %s",
818 fn, line, librad_errstr);
823 * Look for a format statement
828 } else if (value == VENDORPEC_USR) { /* catch dictionary screw-ups */
829 format = "format=4,0";
831 } else if (value == VENDORPEC_LUCENT) {
832 format = "format=2,1";
834 } else if (value == VENDORPEC_STARENT) {
835 format = "format=2,2";
837 } /* else no fixups to do */
844 if (strncasecmp(format, "format=", 7) != 0) {
845 librad_log("dict_init: %s[%d]: Invalid format for VENDOR. Expected \"format=\", got \"%s\"",
851 if ((strlen(p) != 3) ||
852 !isdigit((int) p[0]) ||
854 !isdigit((int) p[2])) {
855 librad_log("dict_init: %s[%d]: Invalid format for VENDOR. Expected text like \"1,1\", got \"%s\"",
860 type = (int) (p[0] - '0');
861 length = (int) (p[2] - '0');
863 dv = dict_vendorbyvalue(value);
865 librad_log("dict_init: %s[%d]: Failed adding format for VENDOR",
870 if ((type != 1) && (type != 2) && (type != 4)) {
871 librad_log("dict_init: %s[%d]: invalid type value %d for VENDOR",
876 if ((length != 0) && (length != 1) && (length != 2)) {
877 librad_log("dict_init: %s[%d]: invalid length value %d for VENDOR",
890 * String split routine. Splits an input string IN PLACE
891 * into pieces, based on spaces.
893 static int str2argv(char *str, char **argv, int max_argc)
898 if (argc >= max_argc) return argc;
901 * Chop out comments early.
908 while ((*str == ' ') ||
911 (*str == '\n')) *(str++) = '\0';
913 if (!*str) return argc;
922 (*str != '\n')) str++;
928 #define MAX_ARGV (16)
931 * Initialize the dictionary.
933 static int my_dict_init(const char *dir, const char *fn,
934 const char *src_file, int src_line)
944 char *argv[MAX_ARGV];
947 if (strlen(fn) >= sizeof(dirtmp) / 2 ||
948 strlen(dir) >= sizeof(dirtmp) / 2) {
949 librad_log("dict_init: filename name too long");
954 * First see if fn is relative to dir. If so, create
955 * new filename. If not, remember the absolute dir.
957 if ((p = strrchr(fn, '/')) != NULL) {
961 } else if (dir && dir[0] && strcmp(dir, ".") != 0) {
962 snprintf(dirtmp, sizeof(dirtmp), "%s/%s", dir, fn);
966 if ((fp = fopen(fn, "r")) == NULL) {
968 librad_log("dict_init: Couldn't open dictionary \"%s\": %s",
969 fn, strerror(errno));
971 librad_log("dict_init: %s[%d]: Couldn't open dictionary \"%s\": %s",
972 src_file, src_line, fn, strerror(errno));
977 stat(fn, &statbuf); /* fopen() guarantees this will succeed */
978 if (!S_ISREG(statbuf.st_mode)) {
980 librad_log("dict_init: Dictionary \"%s\" is not a regular file",
986 * Globally writable dictionaries means that users can control
987 * the server configuration with little difficulty.
989 if ((statbuf.st_mode & S_IWOTH) != 0) {
991 librad_log("dict_init: Dictionary \"%s\" is globally writable. Refusing to start due to insecure configuration.",
996 dict_stat_add(fn, &statbuf);
999 * Seed the random pool with data.
1001 lrad_rand_seed(&statbuf, sizeof(statbuf));
1005 while (fgets(buf, sizeof(buf), fp) != NULL) {
1007 if (buf[0] == '#' || buf[0] == 0 ||
1008 buf[0] == '\n' || buf[0] == '\r')
1012 * Comment characters should NOT be appearing anywhere but
1013 * as start of a comment;
1015 p = strchr(buf, '#');
1018 argc = str2argv(buf, argv, MAX_ARGV);
1019 if (argc == 0) continue;
1022 librad_log( "dict_init: %s[%d] invalid entry",
1031 fprintf(stderr, "ARGC = %d\n",argc);
1032 for (i = 0; i < argc; i++) {
1033 fprintf(stderr, "\t%s\n", argv[i]);
1038 * See if we need to import another dictionary.
1040 if (strcasecmp(argv[0], "$INCLUDE") == 0) {
1041 if (my_dict_init(dir, argv[1], fn, line) < 0) {
1049 * Perhaps this is an attribute.
1051 if (strcasecmp(argv[0], "ATTRIBUTE") == 0) {
1052 if (process_attribute(fn, line, block_vendor,
1053 argv + 1, argc - 1) == -1) {
1061 * Process VALUE lines.
1063 if (strcasecmp(argv[0], "VALUE") == 0) {
1064 if (process_value(fn, line,
1065 argv + 1, argc - 1) == -1) {
1073 * Process VENDOR lines.
1075 if (strcasecmp(argv[0], "VENDOR") == 0) {
1076 if (process_vendor(fn, line,
1077 argv + 1, argc - 1) == -1) {
1084 if (strcasecmp(argv[0], "BEGIN-VENDOR") == 0) {
1087 "dict_init: %s[%d] invalid BEGIN-VENDOR entry",
1093 vendor = dict_vendorbyname(argv[1]);
1096 "dict_init: %s[%d]: unknown vendor %s",
1101 block_vendor = vendor;
1103 } /* BEGIN-VENDOR */
1105 if (strcasecmp(argv[0], "END-VENDOR") == 0) {
1108 "dict_init: %s[%d] invalid END-VENDOR entry",
1114 vendor = dict_vendorbyname(argv[1]);
1117 "dict_init: %s[%d]: unknown vendor %s",
1123 if (vendor != block_vendor) {
1125 "dict_init: %s[%d]: END-VENDOR %s does not match any previous BEGIN-VENDOR",
1135 * Any other string: We don't recognize it.
1138 "dict_init: %s[%d] invalid keyword \"%s\"",
1149 * Empty callback for hash table initialization.
1151 static int null_callback(void *ctx, void *data)
1153 ctx = ctx; /* -Wunused */
1154 data = data; /* -Wunused */
1161 * Initialize the directory, then fix the attr member of
1164 int dict_init(const char *dir, const char *fn)
1167 * Check if we need to change anything. If not, don't do
1170 if (dict_stat_check(dir, fn)) {
1175 * Free the dictionaries, and the stat cache.
1178 stat_root_dir = strdup(dir);
1179 stat_root_file = strdup(fn);
1182 * Create the table of vendor by name. There MAY NOT
1183 * be multiple vendors of the same name.
1185 * Each vendor is malloc'd, so the free function is free.
1187 vendors_byname = lrad_hash_table_create(dict_vendor_name_hash,
1188 dict_vendor_name_cmp,
1190 if (!vendors_byname) {
1195 * Create the table of vendors by value. There MAY
1196 * be vendors of the same value. If there are, we
1197 * pick the latest one.
1199 vendors_byvalue = lrad_hash_table_create(dict_vendor_value_hash,
1200 dict_vendor_value_cmp,
1202 if (!vendors_byvalue) {
1207 * Create the table of attributes by name. There MAY NOT
1208 * be multiple attributes of the same name.
1210 * Each attribute is malloc'd, so the free function is free.
1212 attributes_byname = lrad_hash_table_create(dict_attr_name_hash,
1215 if (!attributes_byname) {
1220 * Create the table of attributes by value. There MAY
1221 * be attributes of the same value. If there are, we
1222 * pick the latest one.
1224 attributes_byvalue = lrad_hash_table_create(dict_attr_value_hash,
1225 dict_attr_value_cmp,
1227 if (!attributes_byvalue) {
1231 values_byname = lrad_hash_table_create(dict_value_name_hash,
1232 dict_value_name_cmp,
1234 if (!values_byname) {
1238 values_byvalue = lrad_hash_table_create(dict_value_value_hash,
1239 dict_value_value_cmp,
1241 if (!values_byvalue) {
1245 value_fixup = NULL; /* just to be safe. */
1247 if (my_dict_init(dir, fn, NULL, 0) < 0)
1252 value_fixup_t *this, *next;
1254 for (this = value_fixup; this != NULL; this = next) {
1257 a = dict_attrbyname(this->attrstr);
1260 "dict_init: No ATTRIBUTE \"%s\" defined for VALUE \"%s\"",
1261 this->attrstr, this->dval->name);
1262 return -1; /* leak, but they should die... */
1265 this->dval->attr = a->attr;
1268 * Add the value into the dictionary.
1270 if (!lrad_hash_table_replace(values_byname,
1272 librad_log("dict_addvalue: Duplicate value name %s for attribute %s", this->dval->name, a->name);
1277 * Allow them to use the old name, but
1278 * prefer the new name when printing
1281 if (!lrad_hash_table_finddata(values_byvalue, this->dval)) {
1282 lrad_hash_table_replace(values_byvalue,
1288 * Just so we don't lose track of things.
1295 * Walk over all of the hash tables to ensure they're
1296 * initialized. We do this because the threads may perform
1297 * lookups, and we don't want multi-threaded re-ordering
1298 * of the table entries. That would be bad.
1300 lrad_hash_table_walk(vendors_byname, null_callback, NULL);
1301 lrad_hash_table_walk(vendors_byvalue, null_callback, NULL);
1303 lrad_hash_table_walk(attributes_byname, null_callback, NULL);
1304 lrad_hash_table_walk(attributes_byvalue, null_callback, NULL);
1306 lrad_hash_table_walk(values_byvalue, null_callback, NULL);
1307 lrad_hash_table_walk(values_byname, null_callback, NULL);
1313 * Get an attribute by its numerical value.
1315 DICT_ATTR *dict_attrbyvalue(int attr)
1321 return lrad_hash_table_finddata(attributes_byvalue, &dattr);
1325 * Get an attribute by its name.
1327 DICT_ATTR *dict_attrbyname(const char *name)
1331 if (!name) return NULL;
1333 strNcpy(dattr.name, name, sizeof(dattr.name));
1335 return lrad_hash_table_finddata(attributes_byname, &dattr);
1339 * Associate a value with an attribute and return it.
1341 DICT_VALUE *dict_valbyattr(int attr, int value)
1348 return lrad_hash_table_finddata(values_byvalue, &dval);
1352 * Get a value by its name, keyed off of an attribute.
1354 DICT_VALUE *dict_valbyname(int attr, const char *name)
1357 uint32_t buffer[(sizeof(*dv) + DICT_VALUE_MAX_NAME_LEN + 3)/4];
1359 if (!name) return NULL;
1361 dv = (DICT_VALUE *) buffer;
1363 strNcpy(dv->name, name, DICT_VALUE_MAX_NAME_LEN);
1365 return lrad_hash_table_finddata(values_byname, dv);
1369 * Get the vendor PEC based on the vendor name
1371 * This is efficient only for small numbers of vendors.
1373 int dict_vendorbyname(const char *name)
1376 uint32_t buffer[(sizeof(*dv) + DICT_VENDOR_MAX_NAME_LEN + 3)/4];
1378 if (!name) return 0;
1380 dv = (DICT_VENDOR *) buffer;
1381 strNcpy(dv->name, name, DICT_VENDOR_MAX_NAME_LEN);
1383 dv = lrad_hash_table_finddata(vendors_byname, dv);
1386 return dv->vendorpec;
1390 * Return the vendor struct based on the PEC.
1392 DICT_VENDOR *dict_vendorbyvalue(int vendorpec)
1396 dv.vendorpec = vendorpec;
1398 return lrad_hash_table_finddata(vendors_byvalue, &dv);