1*5d5fbe79SDavid van Moolenbroek /**
2*5d5fbe79SDavid van Moolenbroek * @file
3*5d5fbe79SDavid van Moolenbroek * Error Management module
4*5d5fbe79SDavid van Moolenbroek *
5*5d5fbe79SDavid van Moolenbroek */
6*5d5fbe79SDavid van Moolenbroek
7*5d5fbe79SDavid van Moolenbroek /*
8*5d5fbe79SDavid van Moolenbroek * Copyright (c) 2001-2004 Swedish Institute of Computer Science.
9*5d5fbe79SDavid van Moolenbroek * All rights reserved.
10*5d5fbe79SDavid van Moolenbroek *
11*5d5fbe79SDavid van Moolenbroek * Redistribution and use in source and binary forms, with or without modification,
12*5d5fbe79SDavid van Moolenbroek * are permitted provided that the following conditions are met:
13*5d5fbe79SDavid van Moolenbroek *
14*5d5fbe79SDavid van Moolenbroek * 1. Redistributions of source code must retain the above copyright notice,
15*5d5fbe79SDavid van Moolenbroek * this list of conditions and the following disclaimer.
16*5d5fbe79SDavid van Moolenbroek * 2. Redistributions in binary form must reproduce the above copyright notice,
17*5d5fbe79SDavid van Moolenbroek * this list of conditions and the following disclaimer in the documentation
18*5d5fbe79SDavid van Moolenbroek * and/or other materials provided with the distribution.
19*5d5fbe79SDavid van Moolenbroek * 3. The name of the author may not be used to endorse or promote products
20*5d5fbe79SDavid van Moolenbroek * derived from this software without specific prior written permission.
21*5d5fbe79SDavid van Moolenbroek *
22*5d5fbe79SDavid van Moolenbroek * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
23*5d5fbe79SDavid van Moolenbroek * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
24*5d5fbe79SDavid van Moolenbroek * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
25*5d5fbe79SDavid van Moolenbroek * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
26*5d5fbe79SDavid van Moolenbroek * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
27*5d5fbe79SDavid van Moolenbroek * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28*5d5fbe79SDavid van Moolenbroek * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29*5d5fbe79SDavid van Moolenbroek * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
30*5d5fbe79SDavid van Moolenbroek * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
31*5d5fbe79SDavid van Moolenbroek * OF SUCH DAMAGE.
32*5d5fbe79SDavid van Moolenbroek *
33*5d5fbe79SDavid van Moolenbroek * This file is part of the lwIP TCP/IP stack.
34*5d5fbe79SDavid van Moolenbroek *
35*5d5fbe79SDavid van Moolenbroek * Author: Adam Dunkels <adam@sics.se>
36*5d5fbe79SDavid van Moolenbroek *
37*5d5fbe79SDavid van Moolenbroek */
38*5d5fbe79SDavid van Moolenbroek
39*5d5fbe79SDavid van Moolenbroek #include "lwip/err.h"
40*5d5fbe79SDavid van Moolenbroek #include "lwip/def.h"
41*5d5fbe79SDavid van Moolenbroek #include "lwip/sys.h"
42*5d5fbe79SDavid van Moolenbroek
43*5d5fbe79SDavid van Moolenbroek #include "lwip/errno.h"
44*5d5fbe79SDavid van Moolenbroek
45*5d5fbe79SDavid van Moolenbroek #if !NO_SYS
46*5d5fbe79SDavid van Moolenbroek /** Table to quickly map an lwIP error (err_t) to a socket error
47*5d5fbe79SDavid van Moolenbroek * by using -err as an index */
48*5d5fbe79SDavid van Moolenbroek static const int err_to_errno_table[] = {
49*5d5fbe79SDavid van Moolenbroek 0, /* ERR_OK 0 No error, everything OK. */
50*5d5fbe79SDavid van Moolenbroek ENOMEM, /* ERR_MEM -1 Out of memory error. */
51*5d5fbe79SDavid van Moolenbroek ENOBUFS, /* ERR_BUF -2 Buffer error. */
52*5d5fbe79SDavid van Moolenbroek EWOULDBLOCK, /* ERR_TIMEOUT -3 Timeout */
53*5d5fbe79SDavid van Moolenbroek EHOSTUNREACH, /* ERR_RTE -4 Routing problem. */
54*5d5fbe79SDavid van Moolenbroek EINPROGRESS, /* ERR_INPROGRESS -5 Operation in progress */
55*5d5fbe79SDavid van Moolenbroek EINVAL, /* ERR_VAL -6 Illegal value. */
56*5d5fbe79SDavid van Moolenbroek EWOULDBLOCK, /* ERR_WOULDBLOCK -7 Operation would block. */
57*5d5fbe79SDavid van Moolenbroek EADDRINUSE, /* ERR_USE -8 Address in use. */
58*5d5fbe79SDavid van Moolenbroek EALREADY, /* ERR_ALREADY -9 Already connecting. */
59*5d5fbe79SDavid van Moolenbroek EISCONN, /* ERR_ISCONN -10 Conn already established.*/
60*5d5fbe79SDavid van Moolenbroek ENOTCONN, /* ERR_CONN -11 Not connected. */
61*5d5fbe79SDavid van Moolenbroek -1, /* ERR_IF -12 Low-level netif error */
62*5d5fbe79SDavid van Moolenbroek ECONNABORTED, /* ERR_ABRT -13 Connection aborted. */
63*5d5fbe79SDavid van Moolenbroek ECONNRESET, /* ERR_RST -14 Connection reset. */
64*5d5fbe79SDavid van Moolenbroek ENOTCONN, /* ERR_CLSD -15 Connection closed. */
65*5d5fbe79SDavid van Moolenbroek EIO /* ERR_ARG -16 Illegal argument. */
66*5d5fbe79SDavid van Moolenbroek };
67*5d5fbe79SDavid van Moolenbroek
68*5d5fbe79SDavid van Moolenbroek int
err_to_errno(err_t err)69*5d5fbe79SDavid van Moolenbroek err_to_errno(err_t err)
70*5d5fbe79SDavid van Moolenbroek {
71*5d5fbe79SDavid van Moolenbroek if ((err > 0) || (-err >= (err_t)LWIP_ARRAYSIZE(err_to_errno_table))) {
72*5d5fbe79SDavid van Moolenbroek return EIO;
73*5d5fbe79SDavid van Moolenbroek }
74*5d5fbe79SDavid van Moolenbroek return err_to_errno_table[-err];
75*5d5fbe79SDavid van Moolenbroek }
76*5d5fbe79SDavid van Moolenbroek #endif /* !NO_SYS */
77*5d5fbe79SDavid van Moolenbroek
78*5d5fbe79SDavid van Moolenbroek #ifdef LWIP_DEBUG
79*5d5fbe79SDavid van Moolenbroek
80*5d5fbe79SDavid van Moolenbroek static const char *err_strerr[] = {
81*5d5fbe79SDavid van Moolenbroek "Ok.", /* ERR_OK 0 */
82*5d5fbe79SDavid van Moolenbroek "Out of memory error.", /* ERR_MEM -1 */
83*5d5fbe79SDavid van Moolenbroek "Buffer error.", /* ERR_BUF -2 */
84*5d5fbe79SDavid van Moolenbroek "Timeout.", /* ERR_TIMEOUT -3 */
85*5d5fbe79SDavid van Moolenbroek "Routing problem.", /* ERR_RTE -4 */
86*5d5fbe79SDavid van Moolenbroek "Operation in progress.", /* ERR_INPROGRESS -5 */
87*5d5fbe79SDavid van Moolenbroek "Illegal value.", /* ERR_VAL -6 */
88*5d5fbe79SDavid van Moolenbroek "Operation would block.", /* ERR_WOULDBLOCK -7 */
89*5d5fbe79SDavid van Moolenbroek "Address in use.", /* ERR_USE -8 */
90*5d5fbe79SDavid van Moolenbroek "Already connecting.", /* ERR_ALREADY -9 */
91*5d5fbe79SDavid van Moolenbroek "Already connected.", /* ERR_ISCONN -10 */
92*5d5fbe79SDavid van Moolenbroek "Not connected.", /* ERR_CONN -11 */
93*5d5fbe79SDavid van Moolenbroek "Low-level netif error.", /* ERR_IF -12 */
94*5d5fbe79SDavid van Moolenbroek "Connection aborted.", /* ERR_ABRT -13 */
95*5d5fbe79SDavid van Moolenbroek "Connection reset.", /* ERR_RST -14 */
96*5d5fbe79SDavid van Moolenbroek "Connection closed.", /* ERR_CLSD -15 */
97*5d5fbe79SDavid van Moolenbroek "Illegal argument." /* ERR_ARG -16 */
98*5d5fbe79SDavid van Moolenbroek };
99*5d5fbe79SDavid van Moolenbroek
100*5d5fbe79SDavid van Moolenbroek /**
101*5d5fbe79SDavid van Moolenbroek * Convert an lwip internal error to a string representation.
102*5d5fbe79SDavid van Moolenbroek *
103*5d5fbe79SDavid van Moolenbroek * @param err an lwip internal err_t
104*5d5fbe79SDavid van Moolenbroek * @return a string representation for err
105*5d5fbe79SDavid van Moolenbroek */
106*5d5fbe79SDavid van Moolenbroek const char *
lwip_strerr(err_t err)107*5d5fbe79SDavid van Moolenbroek lwip_strerr(err_t err)
108*5d5fbe79SDavid van Moolenbroek {
109*5d5fbe79SDavid van Moolenbroek if ((err > 0) || (-err >= (err_t)LWIP_ARRAYSIZE(err_strerr))) {
110*5d5fbe79SDavid van Moolenbroek return "Unknown error.";
111*5d5fbe79SDavid van Moolenbroek }
112*5d5fbe79SDavid van Moolenbroek return err_strerr[-err];
113*5d5fbe79SDavid van Moolenbroek }
114*5d5fbe79SDavid van Moolenbroek
115*5d5fbe79SDavid van Moolenbroek #endif /* LWIP_DEBUG */
116