1 d93c36af 2015-01-22 reyk /*	$OpenBSD: name2id.c,v 1.4 2015/01/22 17:42:09 reyk Exp $	*/
  2 cd2aab3b 2007-11-26 reyk 
  3 cd2aab3b 2007-11-26 reyk /*
  4 cd2aab3b 2007-11-26 reyk  * Copyright (c) 2004, 2005 Henning Brauer <henning@openbsd.org>
  5 cd2aab3b 2007-11-26 reyk  *
  6 cd2aab3b 2007-11-26 reyk  * Permission to use, copy, modify, and distribute this software for any
  7 cd2aab3b 2007-11-26 reyk  * purpose with or without fee is hereby granted, provided that the above
  8 cd2aab3b 2007-11-26 reyk  * copyright notice and this permission notice appear in all copies.
  9 cd2aab3b 2007-11-26 reyk  *
 10 cd2aab3b 2007-11-26 reyk  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 11 cd2aab3b 2007-11-26 reyk  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 12 cd2aab3b 2007-11-26 reyk  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 13 cd2aab3b 2007-11-26 reyk  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 14 cd2aab3b 2007-11-26 reyk  * WHATSOEVER RESULTING FROM LOSS OF MIND, USE, DATA OR PROFITS, WHETHER IN
 15 cd2aab3b 2007-11-26 reyk  * AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
 16 cd2aab3b 2007-11-26 reyk  * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 17 cd2aab3b 2007-11-26 reyk  */
 18 cd2aab3b 2007-11-26 reyk 
 19 69fde657 2014-07-09 reyk #include <sys/types.h>
 20 cd2aab3b 2007-11-26 reyk #include <sys/queue.h>
 21 cd2aab3b 2007-11-26 reyk 
 22 cd2aab3b 2007-11-26 reyk #include <stdlib.h>
 23 cd2aab3b 2007-11-26 reyk #include <string.h>
 24 d93c36af 2015-01-22 reyk #include <errno.h>
 25 cd2aab3b 2007-11-26 reyk 
 26 6d0767ae 2007-12-07 reyk #include "relayd.h"
 27 cd2aab3b 2007-11-26 reyk 
 28 cd2aab3b 2007-11-26 reyk #define	IDVAL_MAX	50000
 29 cd2aab3b 2007-11-26 reyk 
 30 cd2aab3b 2007-11-26 reyk struct n2id_label {
 31 cd2aab3b 2007-11-26 reyk 	TAILQ_ENTRY(n2id_label)	 entry;
 32 cd2aab3b 2007-11-26 reyk 	char			*name;
 33 cd2aab3b 2007-11-26 reyk 	u_int16_t		 id;
 34 cd2aab3b 2007-11-26 reyk 	int			 ref;
 35 cd2aab3b 2007-11-26 reyk };
 36 cd2aab3b 2007-11-26 reyk 
 37 cd2aab3b 2007-11-26 reyk TAILQ_HEAD(n2id_labels, n2id_label);
 38 cd2aab3b 2007-11-26 reyk 
 39 cd2aab3b 2007-11-26 reyk u_int16_t	 _name2id(struct n2id_labels *, const char *);
 40 cd2aab3b 2007-11-26 reyk const char	*_id2name(struct n2id_labels *, u_int16_t);
 41 cd2aab3b 2007-11-26 reyk void		 _unref(struct n2id_labels *, u_int16_t);
 42 cd2aab3b 2007-11-26 reyk void		 _ref(struct n2id_labels *, u_int16_t);
 43 cd2aab3b 2007-11-26 reyk 
 44 69fde657 2014-07-09 reyk struct n2id_labels	relay_labels = TAILQ_HEAD_INITIALIZER(relay_labels);
 45 69fde657 2014-07-09 reyk struct n2id_labels	relay_tags = TAILQ_HEAD_INITIALIZER(relay_tags);
 46 cd2aab3b 2007-11-26 reyk 
 47 cd2aab3b 2007-11-26 reyk u_int16_t
 48 69fde657 2014-07-09 reyk tag_name2id(const char *name)
 49 cd2aab3b 2007-11-26 reyk {
 50 69fde657 2014-07-09 reyk 	return (_name2id(&relay_tags, name));
 51 cd2aab3b 2007-11-26 reyk }
 52 cd2aab3b 2007-11-26 reyk 
 53 cd2aab3b 2007-11-26 reyk const char *
 54 69fde657 2014-07-09 reyk tag_id2name(u_int16_t id)
 55 cd2aab3b 2007-11-26 reyk {
 56 69fde657 2014-07-09 reyk 	return (_id2name(&relay_tags, id));
 57 cd2aab3b 2007-11-26 reyk }
 58 cd2aab3b 2007-11-26 reyk 
 59 cd2aab3b 2007-11-26 reyk void
 60 69fde657 2014-07-09 reyk tag_unref(u_int16_t id)
 61 cd2aab3b 2007-11-26 reyk {
 62 69fde657 2014-07-09 reyk 	_unref(&relay_tags, id);
 63 cd2aab3b 2007-11-26 reyk }
 64 cd2aab3b 2007-11-26 reyk 
 65 cd2aab3b 2007-11-26 reyk void
 66 69fde657 2014-07-09 reyk tag_ref(u_int16_t id)
 67 cd2aab3b 2007-11-26 reyk {
 68 69fde657 2014-07-09 reyk 	_ref(&relay_tags, id);
 69 cd2aab3b 2007-11-26 reyk }
 70 cd2aab3b 2007-11-26 reyk 
 71 cd2aab3b 2007-11-26 reyk u_int16_t
 72 69fde657 2014-07-09 reyk label_name2id(const char *name)
 73 69fde657 2014-07-09 reyk {
 74 69fde657 2014-07-09 reyk 	return (_name2id(&relay_labels, name));
 75 69fde657 2014-07-09 reyk }
 76 69fde657 2014-07-09 reyk 
 77 69fde657 2014-07-09 reyk const char *
 78 69fde657 2014-07-09 reyk label_id2name(u_int16_t id)
 79 69fde657 2014-07-09 reyk {
 80 69fde657 2014-07-09 reyk 	return (_id2name(&relay_labels, id));
 81 69fde657 2014-07-09 reyk }
 82 69fde657 2014-07-09 reyk 
 83 69fde657 2014-07-09 reyk void
 84 69fde657 2014-07-09 reyk label_unref(u_int16_t id)
 85 69fde657 2014-07-09 reyk {
 86 69fde657 2014-07-09 reyk 	_unref(&relay_labels, id);
 87 69fde657 2014-07-09 reyk }
 88 69fde657 2014-07-09 reyk 
 89 69fde657 2014-07-09 reyk void
 90 69fde657 2014-07-09 reyk label_ref(u_int16_t id)
 91 69fde657 2014-07-09 reyk {
 92 69fde657 2014-07-09 reyk 	_ref(&relay_labels, id);
 93 69fde657 2014-07-09 reyk }
 94 69fde657 2014-07-09 reyk 
 95 69fde657 2014-07-09 reyk u_int16_t
 96 cd2aab3b 2007-11-26 reyk _name2id(struct n2id_labels *head, const char *name)
 97 cd2aab3b 2007-11-26 reyk {
 98 cd2aab3b 2007-11-26 reyk 	struct n2id_label	*label, *p = NULL;
 99 cd2aab3b 2007-11-26 reyk 	u_int16_t		 new_id = 1;
100 cd2aab3b 2007-11-26 reyk 
101 cd2aab3b 2007-11-26 reyk 	if (!name[0]) {
102 cd2aab3b 2007-11-26 reyk 		errno = EINVAL;
103 cd2aab3b 2007-11-26 reyk 		return (0);
104 cd2aab3b 2007-11-26 reyk 	}
105 cd2aab3b 2007-11-26 reyk 
106 cd2aab3b 2007-11-26 reyk 	TAILQ_FOREACH(label, head, entry)
107 cd2aab3b 2007-11-26 reyk 		if (strcmp(name, label->name) == 0) {
108 cd2aab3b 2007-11-26 reyk 			label->ref++;
109 cd2aab3b 2007-11-26 reyk 			return (label->id);
110 cd2aab3b 2007-11-26 reyk 		}
111 cd2aab3b 2007-11-26 reyk 
112 cd2aab3b 2007-11-26 reyk 	/*
113 cd2aab3b 2007-11-26 reyk 	 * to avoid fragmentation, we do a linear search from the beginning
114 cd2aab3b 2007-11-26 reyk 	 * and take the first free slot we find. if there is none or the list
115 cd2aab3b 2007-11-26 reyk 	 * is empty, append a new entry at the end.
116 cd2aab3b 2007-11-26 reyk 	 */
117 cd2aab3b 2007-11-26 reyk 
118 cd2aab3b 2007-11-26 reyk 	if (!TAILQ_EMPTY(head))
119 cd2aab3b 2007-11-26 reyk 		for (p = TAILQ_FIRST(head); p != NULL &&
120 cd2aab3b 2007-11-26 reyk 		    p->id == new_id; p = TAILQ_NEXT(p, entry))
121 cd2aab3b 2007-11-26 reyk 			new_id = p->id + 1;
122 cd2aab3b 2007-11-26 reyk 
123 cd2aab3b 2007-11-26 reyk 	if (new_id > IDVAL_MAX) {
124 cd2aab3b 2007-11-26 reyk 		errno = ERANGE;
125 cd2aab3b 2007-11-26 reyk 		return (0);
126 cd2aab3b 2007-11-26 reyk 	}
127 cd2aab3b 2007-11-26 reyk 
128 cd2aab3b 2007-11-26 reyk 	if ((label = calloc(1, sizeof(struct n2id_label))) == NULL)
129 cd2aab3b 2007-11-26 reyk 		return (0);
130 cd2aab3b 2007-11-26 reyk 	if ((label->name = strdup(name)) == NULL) {
131 cd2aab3b 2007-11-26 reyk 		free(label);
132 cd2aab3b 2007-11-26 reyk 		return (0);
133 cd2aab3b 2007-11-26 reyk 	}
134 cd2aab3b 2007-11-26 reyk 	label->id = new_id;
135 cd2aab3b 2007-11-26 reyk 	label->ref++;
136 cd2aab3b 2007-11-26 reyk 
137 cd2aab3b 2007-11-26 reyk 	if (p != NULL)	/* insert new entry before p */
138 cd2aab3b 2007-11-26 reyk 		TAILQ_INSERT_BEFORE(p, label, entry);
139 cd2aab3b 2007-11-26 reyk 	else		/* either list empty or no free slot in between */
140 cd2aab3b 2007-11-26 reyk 		TAILQ_INSERT_TAIL(head, label, entry);
141 cd2aab3b 2007-11-26 reyk 
142 cd2aab3b 2007-11-26 reyk 	return (label->id);
143 cd2aab3b 2007-11-26 reyk }
144 cd2aab3b 2007-11-26 reyk 
145 cd2aab3b 2007-11-26 reyk const char *
146 cd2aab3b 2007-11-26 reyk _id2name(struct n2id_labels *head, u_int16_t id)
147 cd2aab3b 2007-11-26 reyk {
148 cd2aab3b 2007-11-26 reyk 	struct n2id_label	*label;
149 cd2aab3b 2007-11-26 reyk 
150 cd2aab3b 2007-11-26 reyk 	if (id == 0)
151 cd2aab3b 2007-11-26 reyk 		return ("");
152 cd2aab3b 2007-11-26 reyk 
153 cd2aab3b 2007-11-26 reyk 	TAILQ_FOREACH(label, head, entry)
154 cd2aab3b 2007-11-26 reyk 		if (label->id == id)
155 cd2aab3b 2007-11-26 reyk 			return (label->name);
156 cd2aab3b 2007-11-26 reyk 
157 cd2aab3b 2007-11-26 reyk 	return ("");
158 cd2aab3b 2007-11-26 reyk }
159 cd2aab3b 2007-11-26 reyk 
160 cd2aab3b 2007-11-26 reyk void
161 cd2aab3b 2007-11-26 reyk _unref(struct n2id_labels *head, u_int16_t id)
162 cd2aab3b 2007-11-26 reyk {
163 cd2aab3b 2007-11-26 reyk 	struct n2id_label	*p, *next;
164 cd2aab3b 2007-11-26 reyk 
165 cd2aab3b 2007-11-26 reyk 	if (id == 0)
166 cd2aab3b 2007-11-26 reyk 		return;
167 cd2aab3b 2007-11-26 reyk 
168 cd2aab3b 2007-11-26 reyk 	for (p = TAILQ_FIRST(head); p != NULL; p = next) {
169 cd2aab3b 2007-11-26 reyk 		next = TAILQ_NEXT(p, entry);
170 cd2aab3b 2007-11-26 reyk 		if (id == p->id) {
171 cd2aab3b 2007-11-26 reyk 			if (--p->ref == 0) {
172 cd2aab3b 2007-11-26 reyk 				TAILQ_REMOVE(head, p, entry);
173 cd2aab3b 2007-11-26 reyk 				free(p->name);
174 cd2aab3b 2007-11-26 reyk 				free(p);
175 cd2aab3b 2007-11-26 reyk 			}
176 cd2aab3b 2007-11-26 reyk 			break;
177 cd2aab3b 2007-11-26 reyk 		}
178 cd2aab3b 2007-11-26 reyk 	}
179 cd2aab3b 2007-11-26 reyk }
180 cd2aab3b 2007-11-26 reyk 
181 cd2aab3b 2007-11-26 reyk void
182 cd2aab3b 2007-11-26 reyk _ref(struct n2id_labels *head, u_int16_t id)
183 cd2aab3b 2007-11-26 reyk {
184 cd2aab3b 2007-11-26 reyk 	struct n2id_label	*label;
185 cd2aab3b 2007-11-26 reyk 
186 cd2aab3b 2007-11-26 reyk 	if (id == 0)
187 cd2aab3b 2007-11-26 reyk 		return;
188 cd2aab3b 2007-11-26 reyk 
189 cd2aab3b 2007-11-26 reyk 	TAILQ_FOREACH(label, head, entry)
190 cd2aab3b 2007-11-26 reyk 		if (label->id == id) {
191 cd2aab3b 2007-11-26 reyk 			++label->ref;
192 cd2aab3b 2007-11-26 reyk 			break;
193 cd2aab3b 2007-11-26 reyk 		}
194 cd2aab3b 2007-11-26 reyk }