1 /*
2 * Copyright (c) 2013
3 * Inferno Nettverk A/S, Norway. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. The above copyright notice, this list of conditions and the following
9 * disclaimer must appear in all copies of the software, derivative works
10 * or modified versions, and any portions thereof, aswell as in all
11 * supporting documentation.
12 * 2. All advertising materials mentioning features or use of this software
13 * must display the following acknowledgement:
14 * This product includes software developed by
15 * Inferno Nettverk A/S, Norway.
16 * 3. The name of the author may not be used to endorse or promote products
17 * derived from this software without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 *
30 * Inferno Nettverk A/S requests users of this software to return to
31 *
32 * Software Distribution Coordinator or sdc@inet.no
33 * Inferno Nettverk A/S
34 * Oslo Research Park
35 * Gaustadall�en 21
36 * NO-0349 Oslo
37 * Norway
38 *
39 * any improvements or extensions that they make and grant Inferno Nettverk A/S
40 * the rights to redistribute these changes.
41 *
42 */
43
44 #include "common.h"
45 #include "errorsymbols.h"
46
47 static const char rcsid[] =
48 "$Id: errorsymbols.c,v 1.3 2013/10/25 12:55:00 karls Exp $";
49
50 static void
51 doscan(const char *symbol, size_t *valuec, int valuev[], const size_t tablec,
52 const errorsymboltable_t tablev[]);
53 /*
54 * Scans through "tablev", containing "tablec" elements, looking for
55 * symbols matching "symbol". For each match found, the corresponding
56 * numeric value is added to "valuev", which must be large enough to
57 * hold "valuec" elements. Upon return, "valuec" is updated to contain
58 * the number of values actually stored in "valuev", zero-terminated.
59 */
60
61 const int *
errnovalue(symbol)62 errnovalue(symbol)
63 const char *symbol;
64 {
65 static int valuev[MAX_ERRNO_VALUES_FOR_SYMBOL + 1];
66 size_t valuec;
67
68 valuec = ELEMENTS(valuev);
69 doscan(symbol, &valuec, valuev, ELEMENTS(errnosymbolv), errnosymbolv);
70
71 if (valuec == 0)
72 return NULL;
73 else
74 return valuev;
75 }
76
77 const int *
gaivalue(symbol)78 gaivalue(symbol)
79 const char *symbol;
80 {
81 static int valuev[MAX_GAIERR_VALUES_FOR_SYMBOL + 1];
82 size_t valuec;
83
84 valuec = ELEMENTS(valuev);
85 doscan(symbol, &valuec, valuev, ELEMENTS(gaierrsymbolv), gaierrsymbolv);
86
87 if (valuec == 0)
88 return NULL;
89 else
90 return valuev;
91 }
92
93
94 static void
doscan(symbol,valuec,valuev,tablec,tablev)95 doscan(symbol, valuec, valuev, tablec, tablev)
96 const char *symbol;
97 size_t *valuec;
98 int valuev[];
99 const size_t tablec;
100 const errorsymboltable_t tablev[];
101 {
102 const size_t maxvaluec = *valuec;
103 size_t i;
104
105 *valuec = 0;
106 for (i = 0; i < tablec; ++i) {
107 if (strcasecmp(tablev[i].name, symbol) == 0) {
108 valuev[(*valuec)++] = tablev[i].value;
109
110 /*
111 * don't break out of loop; same symbol can expand to multiple values.
112 */
113 }
114
115 SASSERTX(*valuec < maxvaluec);
116 }
117
118 if (*valuec > 0) {
119 SASSERTX(*valuec < maxvaluec);
120 valuev[(*valuec)++] = 0; /* zero-terminated. */
121 }
122
123 SASSERTX(*valuec <= maxvaluec);
124 }
125