1b528cefcSMark Murray /*
2*ae771770SStanislav Sedov * Copyright (c) 1999 Kungliga Tekniska Högskolan
3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden).
4b528cefcSMark Murray * All rights reserved.
5b528cefcSMark Murray *
6b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without
7b528cefcSMark Murray * modification, are permitted provided that the following conditions
8b528cefcSMark Murray * are met:
9b528cefcSMark Murray *
10b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright
11b528cefcSMark Murray * notice, this list of conditions and the following disclaimer.
12b528cefcSMark Murray *
13b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright
14b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the
15b528cefcSMark Murray * documentation and/or other materials provided with the distribution.
16b528cefcSMark Murray *
17b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors
18b528cefcSMark Murray * may be used to endorse or promote products derived from this software
19b528cefcSMark Murray * without specific prior written permission.
20b528cefcSMark Murray *
21b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31b528cefcSMark Murray * SUCH DAMAGE.
32b528cefcSMark Murray */
33b528cefcSMark Murray
34b528cefcSMark Murray #include <config.h>
35b528cefcSMark Murray
36b528cefcSMark Murray #include "roken.h"
37b528cefcSMark Murray
38b528cefcSMark Murray /*
39b528cefcSMark Murray * return a malloced copy of `h'
40b528cefcSMark Murray */
41b528cefcSMark Murray
42*ae771770SStanislav Sedov ROKEN_LIB_FUNCTION struct hostent * ROKEN_LIB_CALL
copyhostent(const struct hostent * h)43b528cefcSMark Murray copyhostent (const struct hostent *h)
44b528cefcSMark Murray {
45b528cefcSMark Murray struct hostent *res;
46b528cefcSMark Murray char **p;
47b528cefcSMark Murray int i, n;
48b528cefcSMark Murray
49b528cefcSMark Murray res = malloc (sizeof (*res));
50b528cefcSMark Murray if (res == NULL)
51b528cefcSMark Murray return NULL;
52b528cefcSMark Murray res->h_name = NULL;
53b528cefcSMark Murray res->h_aliases = NULL;
54b528cefcSMark Murray res->h_addrtype = h->h_addrtype;
55b528cefcSMark Murray res->h_length = h->h_length;
56b528cefcSMark Murray res->h_addr_list = NULL;
57b528cefcSMark Murray res->h_name = strdup (h->h_name);
58b528cefcSMark Murray if (res->h_name == NULL) {
59b528cefcSMark Murray freehostent (res);
60b528cefcSMark Murray return NULL;
61b528cefcSMark Murray }
62b528cefcSMark Murray for (n = 0, p = h->h_aliases; *p != NULL; ++p)
63b528cefcSMark Murray ++n;
64b528cefcSMark Murray res->h_aliases = malloc ((n + 1) * sizeof(*res->h_aliases));
65b528cefcSMark Murray if (res->h_aliases == NULL) {
66b528cefcSMark Murray freehostent (res);
67b528cefcSMark Murray return NULL;
68b528cefcSMark Murray }
69b528cefcSMark Murray for (i = 0; i < n + 1; ++i)
70b528cefcSMark Murray res->h_aliases[i] = NULL;
71b528cefcSMark Murray for (i = 0; i < n; ++i) {
72b528cefcSMark Murray res->h_aliases[i] = strdup (h->h_aliases[i]);
73b528cefcSMark Murray if (res->h_aliases[i] == NULL) {
74b528cefcSMark Murray freehostent (res);
75b528cefcSMark Murray return NULL;
76b528cefcSMark Murray }
77b528cefcSMark Murray }
78b528cefcSMark Murray
79b528cefcSMark Murray for (n = 0, p = h->h_addr_list; *p != NULL; ++p)
80b528cefcSMark Murray ++n;
81b528cefcSMark Murray res->h_addr_list = malloc ((n + 1) * sizeof(*res->h_addr_list));
82b528cefcSMark Murray if (res->h_addr_list == NULL) {
83b528cefcSMark Murray freehostent (res);
84b528cefcSMark Murray return NULL;
85b528cefcSMark Murray }
86b528cefcSMark Murray for (i = 0; i < n + 1; ++i) {
87b528cefcSMark Murray res->h_addr_list[i] = NULL;
88b528cefcSMark Murray }
89b528cefcSMark Murray for (i = 0; i < n; ++i) {
90b528cefcSMark Murray res->h_addr_list[i] = malloc (h->h_length);
91b528cefcSMark Murray if (res->h_addr_list[i] == NULL) {
92b528cefcSMark Murray freehostent (res);
93b528cefcSMark Murray return NULL;
94b528cefcSMark Murray }
95b528cefcSMark Murray memcpy (res->h_addr_list[i], h->h_addr_list[i], h->h_length);
96b528cefcSMark Murray }
97b528cefcSMark Murray return res;
98b528cefcSMark Murray }
99b528cefcSMark Murray
100