1 | /*
|
---|
2 | * Copyright (c) 2010 Martin Decky
|
---|
3 | * Copyright (c) 2017 CZ.NIC, z.s.p.o.
|
---|
4 | * All rights reserved.
|
---|
5 | *
|
---|
6 | * Redistribution and use in source and binary forms, with or without
|
---|
7 | * modification, are permitted provided that the following conditions
|
---|
8 | * are met:
|
---|
9 | *
|
---|
10 | * - Redistributions of source code must retain the above copyright
|
---|
11 | * notice, this list of conditions and the following disclaimer.
|
---|
12 | * - Redistributions in binary form must reproduce the above copyright
|
---|
13 | * notice, this list of conditions and the following disclaimer in the
|
---|
14 | * documentation and/or other materials provided with the distribution.
|
---|
15 | * - The name of the author may not be used to endorse or promote products
|
---|
16 | * derived from this software without specific prior written permission.
|
---|
17 | *
|
---|
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
28 | */
|
---|
29 |
|
---|
30 | #include <errno.h>
|
---|
31 | #include <str.h>
|
---|
32 |
|
---|
33 | /*
|
---|
34 | * The arrays below are automatically generated from the same file that
|
---|
35 | * errno.h constants are generated from. Triple-include of the same list
|
---|
36 | * with redefinitions of __errno() macro are used to ensure that the
|
---|
37 | * information cannot get out of synch. This is inpired by musl libc.
|
---|
38 | */
|
---|
39 |
|
---|
40 | #undef __errno_entry
|
---|
41 | #define __errno_entry(name, num, desc) name,
|
---|
42 |
|
---|
43 | static const errno_t err_num[] = {
|
---|
44 | #include <abi/errno.in>
|
---|
45 | };
|
---|
46 |
|
---|
47 | #undef __errno_entry
|
---|
48 | #define __errno_entry(name, num, desc) #name,
|
---|
49 |
|
---|
50 | static const char *err_name[] = {
|
---|
51 | #include <abi/errno.in>
|
---|
52 | };
|
---|
53 |
|
---|
54 | #undef __errno_entry
|
---|
55 | #define __errno_entry(name, num, desc) "[" #name "] " desc,
|
---|
56 |
|
---|
57 | static const char *err_desc[] = {
|
---|
58 | #include <abi/errno.in>
|
---|
59 | };
|
---|
60 |
|
---|
61 | /* Returns index corresponding to the given errno, or -1 if not found. */
|
---|
62 | static int find_errno(errno_t e)
|
---|
63 | {
|
---|
64 | /*
|
---|
65 | * Just a dumb linear search.
|
---|
66 | * There too few entries to warrant anything smarter.
|
---|
67 | */
|
---|
68 |
|
---|
69 | int len = sizeof(err_num) / sizeof(errno_t);
|
---|
70 |
|
---|
71 | for (int i = 0; i < len; i++) {
|
---|
72 | if (err_num[i] == e) {
|
---|
73 | return i;
|
---|
74 | }
|
---|
75 | }
|
---|
76 |
|
---|
77 | return -1;
|
---|
78 | }
|
---|
79 |
|
---|
80 | const char *str_error_name(errno_t e)
|
---|
81 | {
|
---|
82 | int i = find_errno(e);
|
---|
83 |
|
---|
84 | if (i >= 0) {
|
---|
85 | return err_name[i];
|
---|
86 | }
|
---|
87 |
|
---|
88 | return "(unknown)";
|
---|
89 | }
|
---|
90 |
|
---|
91 | const char *str_error(errno_t e)
|
---|
92 | {
|
---|
93 | int i = find_errno(e);
|
---|
94 |
|
---|
95 | if (i >= 0) {
|
---|
96 | return err_desc[i];
|
---|
97 | }
|
---|
98 |
|
---|
99 | return "Unknown error code";
|
---|
100 | }
|
---|