usr.bin/window/string.c

   1 /*
   2  * Copyright (c) 1983, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Edward Wang at The University of California, Berkeley.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    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.
  16  * 3. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  *
  36  * @(#)string.c 8.1 (Berkeley) 6/6/93
  37  * $FreeBSD: src/usr.bin/window/string.c,v 1.2.6.2 2001/05/17 09:45:00 obrien Exp $
  38  * $DragonFly: src/usr.bin/window/string.c,v 1.3 2005/02/28 13:57:05 joerg Exp $
  39  */
  40
  41 #include <stdio.h>
  42 #include <stdlib.h>
  43 #include <string.h> /* System string definitions. */
  44
  45 #include "mystring.h" /* Local string definitions. */
  46
  47 char *
  48 str_cpy(s)
  49 register char *s;
  50 {
  51         char *str;
  52         register char *p;
  53
  54         str = p = str_alloc(strlen(s) + 1);
  55         if (p == 0)
  56                 return 0;
  57         while (*p++ = *s++)
  58                 ;
  59         return str;
  60 }
  61
  62 char *
  63 str_ncpy(s, n)
  64 register char *s;
  65 register n;
  66 {
  67         int l = strlen(s);
  68         char *str;
  69         register char *p;
  70
  71         if (n > l)
  72                 n = l;
  73         str = p = str_alloc(n + 1);
  74         if (p == 0)
  75                 return 0;
  76         while (--n >= 0)
  77                 *p++ = *s++;
  78         *p = 0;
  79         return str;
  80 }
  81
  82 char *
  83 str_itoa(i)
  84 int i;
  85 {
  86         char buf[30];
  87
  88         (void) sprintf(buf, "%d", i);
  89         return str_cpy(buf);
  90 }
  91
  92 char *
  93 str_cat(s1, s2)
  94 char *s1, *s2;
  95 {
  96         char *str;
  97         register char *p, *q;
  98
  99         str = p = str_alloc(strlen(s1) + strlen(s2) + 1);
 100         if (p == 0)
 101                 return 0;
 102         for (q = s1; *p++ = *q++;)
 103                 ;
 104         for (q = s2, p--; *p++ = *q++;)
 105                 ;
 106         return str;
 107 }
 108
 109 /*
 110  * match s against p.
 111  * s can be a prefix of p with at least min characters.
 112  */
 113 str_match(s, p, min)
 114 register char *s, *p;
 115 register min;
 116 {
 117         for (; *s && *p && *s == *p; s++, p++, min--)
 118                 ;
 119         return *s == *p || *s == 0 && min <= 0;
 120 }
 121
 122 #ifdef STR_DEBUG
 123 char *
 124 str_alloc(l)
 125 int l;
 126 {
 127         register struct mystring *s;
 128
 129         s = (struct mystring *) malloc((unsigned)l + str_offset);
 130         if (s == 0)
 131                 return 0;
 132         if (str_head.s_forw == 0)
 133                 str_head.s_forw = str_head.s_back = &str_head;
 134         s->s_forw = str_head.s_forw;
 135         s->s_back = &str_head;
 136         str_head.s_forw = s;
 137         s->s_forw->s_back = s;
 138         return s->s_data;
 139 }
 140
 141 str_free(str)
 142 char *str;
 143 {
 144         register struct mystring *s;
 145
 146         for (s = str_head.s_forw; s != &str_head && s->s_data != str;
 147              s = s->s_forw)
 148                 ;
 149         if (s == &str_head)
 150                 abort();
 151         s->s_back->s_forw = s->s_forw;
 152         s->s_forw->s_back = s->s_back;
 153         free((char *)s);
 154 }
 155 #endif