2 * Copyright (c) 1999 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * return a malloced copy of `h'
42 ROKEN_LIB_FUNCTION
struct hostent
* ROKEN_LIB_CALL
43 copyhostent (const struct hostent
*h
)
49 res
= malloc (sizeof (*res
));
53 res
->h_aliases
= NULL
;
54 res
->h_addrtype
= h
->h_addrtype
;
55 res
->h_length
= h
->h_length
;
56 res
->h_addr_list
= NULL
;
57 res
->h_name
= strdup (h
->h_name
);
58 if (res
->h_name
== NULL
) {
62 for (n
= 0, p
= h
->h_aliases
; *p
!= NULL
; ++p
)
64 res
->h_aliases
= malloc ((n
+ 1) * sizeof(*res
->h_aliases
));
65 if (res
->h_aliases
== NULL
) {
69 for (i
= 0; i
< n
+ 1; ++i
)
70 res
->h_aliases
[i
] = NULL
;
71 for (i
= 0; i
< n
; ++i
) {
72 res
->h_aliases
[i
] = strdup (h
->h_aliases
[i
]);
73 if (res
->h_aliases
[i
] == NULL
) {
79 for (n
= 0, p
= h
->h_addr_list
; *p
!= NULL
; ++p
)
81 res
->h_addr_list
= malloc ((n
+ 1) * sizeof(*res
->h_addr_list
));
82 if (res
->h_addr_list
== NULL
) {
86 for (i
= 0; i
< n
+ 1; ++i
) {
87 res
->h_addr_list
[i
] = NULL
;
89 for (i
= 0; i
< n
; ++i
) {
90 res
->h_addr_list
[i
] = malloc (h
->h_length
);
91 if (res
->h_addr_list
[i
] == NULL
) {
95 memcpy (res
->h_addr_list
[i
], h
->h_addr_list
[i
], h
->h_length
);