freebsd-dev/bin/csh/str.c

473 lines
9.0 KiB
C
Raw Normal View History

1994-05-26 06:18:55 +00:00
/*-
* Copyright (c) 1991, 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
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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.
*/
#ifndef lint
#if 0
1994-05-26 06:18:55 +00:00
static char sccsid[] = "@(#)str.c 8.1 (Berkeley) 5/31/93";
#else
static const char rcsid[] =
"$Id: str.c,v 1.5 1997/02/22 14:02:09 peter Exp $";
#endif
1994-05-26 06:18:55 +00:00
#endif /* not lint */
#define MALLOC_INCR 128
/*
* tc.str.c: Short string package
* This has been a lesson of how to write buggy code!
*/
#include <sys/types.h>
#if __STDC__
# include <stdarg.h>
#else
# include <varargs.h>
#endif
#include <vis.h>
#include "csh.h"
#include "extern.h"
#ifdef SHORT_STRINGS
Char **
blk2short(src)
char **src;
1994-05-26 06:18:55 +00:00
{
size_t n;
Char **sdst, **dst;
1994-05-26 06:18:55 +00:00
/*
* Count
*/
for (n = 0; src[n] != NULL; n++)
continue;
sdst = dst = (Char **) xmalloc((size_t) ((n + 1) * sizeof(Char *)));
for (; *src != NULL; src++)
*dst++ = SAVE(*src);
*dst = NULL;
return (sdst);
}
char **
short2blk(src)
Char **src;
1994-05-26 06:18:55 +00:00
{
size_t n;
char **sdst, **dst;
1994-05-26 06:18:55 +00:00
/*
* Count
*/
for (n = 0; src[n] != NULL; n++)
continue;
sdst = dst = (char **) xmalloc((size_t) ((n + 1) * sizeof(char *)));
for (; *src != NULL; src++)
*dst++ = strsave(short2str(*src));
*dst = NULL;
return (sdst);
}
Char *
str2short(src)
char *src;
1994-05-26 06:18:55 +00:00
{
static Char *sdst;
static size_t dstsize = 0;
Char *dst, *edst;
1994-05-26 06:18:55 +00:00
if (src == NULL)
return (NULL);
if (sdst == (NULL)) {
dstsize = MALLOC_INCR;
sdst = (Char *) xmalloc((size_t) dstsize * sizeof(Char));
}
dst = sdst;
edst = &dst[dstsize];
while (*src) {
*dst++ = (Char) ((unsigned char) *src++);
if (dst == edst) {
dstsize += MALLOC_INCR;
sdst = (Char *) xrealloc((ptr_t) sdst,
(size_t) dstsize * sizeof(Char));
edst = &sdst[dstsize];
dst = &edst[-MALLOC_INCR];
}
}
*dst = 0;
return (sdst);
}
char *
short2str(src)
Char *src;
1994-05-26 06:18:55 +00:00
{
static char *sdst = NULL;
static size_t dstsize = 0;
char *dst, *edst;
1994-05-26 06:18:55 +00:00
if (src == NULL)
return (NULL);
if (sdst == NULL) {
dstsize = MALLOC_INCR;
sdst = (char *) xmalloc((size_t) dstsize * sizeof(char));
}
dst = sdst;
edst = &dst[dstsize];
while (*src) {
*dst++ = (char) *src++;
if (dst == edst) {
dstsize += MALLOC_INCR;
sdst = (char *) xrealloc((ptr_t) sdst,
(size_t) dstsize * sizeof(char));
edst = &sdst[dstsize];
dst = &edst[-MALLOC_INCR];
}
}
*dst = 0;
return (sdst);
}
Char *
s_strcpy(dst, src)
Char *dst, *src;
1994-05-26 06:18:55 +00:00
{
Char *sdst;
1994-05-26 06:18:55 +00:00
sdst = dst;
while ((*dst++ = *src++) != '\0')
continue;
return (sdst);
}
Char *
s_strncpy(dst, src, n)
Char *dst, *src;
size_t n;
1994-05-26 06:18:55 +00:00
{
Char *sdst;
1994-05-26 06:18:55 +00:00
if (n == 0)
return(dst);
sdst = dst;
do
if ((*dst++ = *src++) == '\0') {
while (--n != 0)
*dst++ = '\0';
return(sdst);
}
while (--n != 0);
return (sdst);
}
Char *
s_strcat(dst, src)
Char *dst, *src;
1994-05-26 06:18:55 +00:00
{
short *sdst;
1994-05-26 06:18:55 +00:00
sdst = dst;
while (*dst++)
continue;
--dst;
while ((*dst++ = *src++) != '\0')
continue;
return (sdst);
}
#ifdef NOTUSED
Char *
s_strncat(dst, src, n)
Char *dst, *src;
size_t n;
1994-05-26 06:18:55 +00:00
{
Char *sdst;
1994-05-26 06:18:55 +00:00
if (n == 0)
return (dst);
sdst = dst;
while (*dst++)
continue;
--dst;
do
if ((*dst++ = *src++) == '\0')
return(sdst);
while (--n != 0)
continue;
*dst = '\0';
return (sdst);
}
#endif
Char *
s_strchr(str, ch)
Char *str;
1994-05-26 06:18:55 +00:00
int ch;
{
do
if (*str == ch)
return (str);
while (*str++);
return (NULL);
}
Char *
s_strrchr(str, ch)
Char *str;
1994-05-26 06:18:55 +00:00
int ch;
{
Char *rstr;
1994-05-26 06:18:55 +00:00
rstr = NULL;
do
if (*str == ch)
rstr = str;
while (*str++);
return (rstr);
}
size_t
s_strlen(str)
Char *str;
1994-05-26 06:18:55 +00:00
{
size_t n;
1994-05-26 06:18:55 +00:00
for (n = 0; *str++; n++)
continue;
return (n);
}
int
s_strcmp(str1, str2)
Char *str1, *str2;
1994-05-26 06:18:55 +00:00
{
for (; *str1 && *str1 == *str2; str1++, str2++)
continue;
/*
* The following case analysis is necessary so that characters which look
* negative collate low against normal characters but high against the
* end-of-string NUL.
*/
if (*str1 == '\0' && *str2 == '\0')
return (0);
else if (*str1 == '\0')
return (-1);
else if (*str2 == '\0')
return (1);
else
return (*str1 - *str2);
}
int
s_strncmp(str1, str2, n)
Char *str1, *str2;
size_t n;
1994-05-26 06:18:55 +00:00
{
if (n == 0)
return (0);
do {
if (*str1 != *str2) {
/*
* The following case analysis is necessary so that characters
* which look negative collate low against normal characters
* but high against the end-of-string NUL.
*/
if (*str1 == '\0')
return (-1);
else if (*str2 == '\0')
return (1);
else
return (*str1 - *str2);
break;
}
if (*str1 == '\0')
return(0);
str1++, str2++;
} while (--n != 0);
return(0);
}
Char *
s_strsave(s)
Char *s;
1994-05-26 06:18:55 +00:00
{
Char *n;
Char *p;
1994-05-26 06:18:55 +00:00
if (s == 0)
s = STRNULL;
for (p = s; *p++;)
continue;
n = p = (Char *) xmalloc((size_t) ((p - s) * sizeof(Char)));
while ((*p++ = *s++) != '\0')
continue;
return (n);
}
Char *
s_strspl(cp, dp)
Char *cp, *dp;
{
Char *ep;
Char *p, *q;
1994-05-26 06:18:55 +00:00
if (!cp)
cp = STRNULL;
if (!dp)
dp = STRNULL;
for (p = cp; *p++;)
continue;
for (q = dp; *q++;)
continue;
ep = (Char *) xmalloc((size_t)
(((p - cp) + (q - dp) - 1) * sizeof(Char)));
for (p = ep, q = cp; (*p++ = *q++) != '\0';)
continue;
for (p--, q = dp; (*p++ = *q++) != '\0';)
continue;
return (ep);
}
Char *
s_strend(cp)
Char *cp;
1994-05-26 06:18:55 +00:00
{
if (!cp)
return (cp);
while (*cp)
cp++;
return (cp);
}
Char *
s_strstr(s, t)
Char *s, *t;
1994-05-26 06:18:55 +00:00
{
do {
Char *ss = s;
Char *tt = t;
1994-05-26 06:18:55 +00:00
do
if (*tt == '\0')
return (s);
while (*ss++ == *tt++);
} while (*s++ != '\0');
return (NULL);
}
#endif /* SHORT_STRINGS */
char *
short2qstr(src)
Char *src;
1994-05-26 06:18:55 +00:00
{
static char *sdst = NULL;
static size_t dstsize = 0;
char *dst, *edst;
1994-05-26 06:18:55 +00:00
if (src == NULL)
return (NULL);
if (sdst == NULL) {
dstsize = MALLOC_INCR;
sdst = (char *) xmalloc((size_t) dstsize * sizeof(char));
}
dst = sdst;
edst = &dst[dstsize];
while (*src) {
if (*src & QUOTE) {
*dst++ = '\\';
if (dst == edst) {
dstsize += MALLOC_INCR;
sdst = (char *) xrealloc((ptr_t) sdst,
(size_t) dstsize * sizeof(char));
edst = &sdst[dstsize];
dst = &edst[-MALLOC_INCR];
}
}
*dst++ = (char) *src++;
if (dst == edst) {
dstsize += MALLOC_INCR;
sdst = (char *) xrealloc((ptr_t) sdst,
(size_t) dstsize * sizeof(char));
edst = &sdst[dstsize];
dst = &edst[-MALLOC_INCR];
}
}
*dst = 0;
return (sdst);
}
/*
* XXX: Should we worry about QUOTE'd chars?
*/
char *
vis_str(cp)
Char *cp;
{
static char *sdst = NULL;
static size_t dstsize = 0;
size_t n;
Char *dp;
if (cp == NULL)
return (NULL);
1994-05-26 06:18:55 +00:00
for (dp = cp; *dp++;)
continue;
n = ((dp - cp) << 2) + 1; /* 4 times + NULL */
if (dstsize < n) {
sdst = (char *) (dstsize ?
1994-05-26 06:18:55 +00:00
xrealloc(sdst, (size_t) n * sizeof(char)) :
xmalloc((size_t) n * sizeof(char)));
dstsize = n;
}
/*
1994-05-26 06:18:55 +00:00
* XXX: When we are in AsciiOnly we want all characters >= 0200 to
* be encoded, but currently there is no way in vis to do that.
*/
(void) strvis(sdst, short2str(cp), VIS_NOSLASH);
return (sdst);
}