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