/*
* Copyright (C) 1999-2001, 2003-2007, 2011, 2012, 2014-2016 Internet Systems Consortium, Inc. ("ISC")
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
/*
* Copyright (c) 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*! \file */
#include <config.h>
#include <ctype.h>
char *s = source;
const char *o;
char c;
return (0);
}
s++;
if (*s == '+' /* || *s == '-' */)
s++;
if (base == 0) {
if (*s == '0' && (*(s+1) == 'X' || *(s+1) == 'x')) {
s += 2;
base = 16;
} else if (*s == '0')
base = 8;
else
base = 10;
}
if (*s == 0) {
return (0);
}
overflow = ~0;
tmp = 0;
while ((c = *s) != 0) {
c = tolower(c&0xff);
/* end ? */
*end = s;
return (tmp);
}
/* end ? */
*end = s;
return (tmp);
}
/* overflow ? */
return (0);
}
/* overflow ? */
return (0);
}
s++;
}
*end = s;
return (tmp);
}
return (ISC_R_NOSPACE);
}
return (ISC_R_SUCCESS);
}
void
}
return (ISC_R_NOSPACE);
}
return (ISC_R_SUCCESS);
}
void
}
size_t n;
if (n >= size) {
return (ISC_R_NOSPACE);
}
return (ISC_R_SUCCESS);
}
void
{
/* check return code? */
}
char *
char *target;
}
return (target);
}
char *
char *s;
const char *d;
return (NULL);
*s++ = '\0';
*stringp = s;
return (string);
}
return (string);
}
{
char *d = dst;
const char *s = src;
/* Copy as many bytes as will fit */
if (n != 0U && --n != 0U) {
do {
if ((*d++ = *s++) == 0)
break;
} while (--n != 0U);
}
/* Not enough room in dst, add NUL and traverse rest of src */
if (n == 0U) {
if (size != 0U)
*d = '\0'; /* NUL-terminate dst */
while (*s++)
;
}
}
{
char *d = dst;
const char *s = src;
/* Find the end of dst and adjust bytes left but don't go past end */
while (n-- != 0U && *d != '\0')
d++;
if (n == 0U)
while (*s != '\0') {
if (n != 1U) {
*d++ = *s;
n--;
}
s++;
}
*d = '\0';
}
char *
char c, sc, *s;
if ((c = *search++) != 0) {
c = tolower((unsigned char) c);
do {
do {
return (NULL);
str--;
}
return (s);
}