mirror of
https://github.com/moparisthebest/curl
synced 2024-12-21 23:58:49 -05:00
b17e32baa7
sets the required HAVE_xx defines for non-DOS/Win targets.
67 lines
1.8 KiB
C
67 lines
1.8 KiB
C
/* Copyright 1998 by the Massachusetts Institute of Technology.
|
|
*
|
|
* Permission to use, copy, modify, and distribute this
|
|
* software and its documentation for any purpose and without
|
|
* fee is hereby granted, provided that the above copyright
|
|
* notice appear in all copies and that both that copyright
|
|
* notice and this permission notice appear in supporting
|
|
* documentation, and that the name of M.I.T. not be used in
|
|
* advertising or publicity pertaining to distribution of the
|
|
* software without specific, written prior permission.
|
|
* M.I.T. makes no representations about the suitability of
|
|
* this software for any purpose. It is provided "as is"
|
|
* without express or implied warranty.
|
|
*/
|
|
|
|
#include "setup.h"
|
|
#include <sys/types.h>
|
|
|
|
#if defined(WIN32) && !defined(WATT32)
|
|
#include "nameser.h"
|
|
#else
|
|
#include <netinet/in.h>
|
|
#include <arpa/nameser.h>
|
|
#endif
|
|
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include "ares.h"
|
|
#include "ares_private.h" /* for the memdebug */
|
|
|
|
/* Simply decodes a length-encoded character string. The first byte of the
|
|
* input is the length of the string to be returned and the bytes thereafter
|
|
* are the characters of the string. The returned result will be NULL
|
|
* terminated.
|
|
*/
|
|
int ares_expand_string(const unsigned char *encoded,
|
|
const unsigned char *abuf,
|
|
int alen,
|
|
unsigned char **s,
|
|
long *enclen)
|
|
{
|
|
unsigned char *q;
|
|
long len;
|
|
if (encoded == abuf+alen)
|
|
return ARES_EBADSTR;
|
|
|
|
len = *encoded;
|
|
if (encoded+len+1 > abuf+alen)
|
|
return ARES_EBADSTR;
|
|
|
|
encoded++;
|
|
|
|
*s = malloc(len+1);
|
|
if (*s == NULL)
|
|
return ARES_ENOMEM;
|
|
q = *s;
|
|
strncpy((char *)q, (char *)encoded, len);
|
|
q[len] = '\0';
|
|
|
|
*s = q;
|
|
|
|
*enclen = len+1;
|
|
|
|
return ARES_SUCCESS;
|
|
}
|
|
|