strings.c

   1 /*
   2  * S-nail - a mail user agent derived from Berkeley Mail.
   3  *
   4  * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
   5  * Copyright (c) 2012 Steffen "Daode" Nurpmeso.
   6  */
   7 /*
   8  * Copyright (c) 1980, 1993
   9  *      The Regents of the University of California.  All rights reserved.
  10  *
  11  * Redistribution and use in source and binary forms, with or without
  12  * modification, are permitted provided that the following conditions
  13  * are met:
  14  * 1. Redistributions of source code must retain the above copyright
  15  *    notice, this list of conditions and the following disclaimer.
  16  * 2. Redistributions in binary form must reproduce the above copyright
  17  *    notice, this list of conditions and the following disclaimer in the
  18  *    documentation and/or other materials provided with the distribution.
  19  * 3. All advertising materials mentioning features or use of this software
  20  *    must display the following acknowledgement:
  21  *      This product includes software developed by the University of
  22  *      California, Berkeley and its contributors.
  23  * 4. Neither the name of the University nor the names of its contributors
  24  *    may be used to endorse or promote products derived from this software
  25  *    without specific prior written permission.
  26  *
  27  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  28  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  29  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  30  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  31  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  32  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  33  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  34  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  35  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  36  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  37  * SUCH DAMAGE.
  38  */
  39
  40 /*
  41  * Mail -- a mail program
  42  *
  43  * String allocation routines and support routines that build on top of them.
  44  * Strings handed out here are reclaimed at the top of the command
  45  * loop each time, so they need not be freed.
  46  */
  47
  48 #include "rcv.h"
  49 #include "extern.h"
  50
  51 #include <stdarg.h>
  52
  53 /*
  54  * Allocate size more bytes of space and return the address of the
  55  * first byte to the caller.  An even number of bytes are always
  56  * allocated so that the space will always be on a word boundary.
  57  * The string spaces are of exponentially increasing size, to satisfy
  58  * the occasional user with enormous string size requests.
  59  */
  60 void *
  61 salloc(size_t size)
  62 {
  63         char *t;
  64         unsigned int s;
  65         struct strings *sp;
  66         int string_index;
  67
  68         s = size;
  69         s += (sizeof (char *) - 1);
  70         s &= ~(sizeof (char *) - 1);
  71         string_index = 0;
  72         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
  73                 if (sp->s_topFree == NULL && (STRINGSIZE << string_index) >= s)
  74                         break;
  75                 if (sp->s_nleft >= s)
  76                         break;
  77                 string_index++;
  78         }
  79         if (sp >= &stringdope[NSPACE])
  80                 panic(tr(195, "String too large"));
  81         if (sp->s_topFree == NULL) {
  82                 string_index = sp - &stringdope[0];
  83                 sp->s_topFree = smalloc(STRINGSIZE << string_index);
  84                 sp->s_nextFree = sp->s_topFree;
  85                 sp->s_nleft = STRINGSIZE << string_index;
  86         }
  87         sp->s_nleft -= s;
  88         t = sp->s_nextFree;
  89         sp->s_nextFree += s;
  90         return(t);
  91 }
  92
  93 void *
  94 csalloc(size_t nmemb, size_t size)
  95 {
  96         void *vp;
  97
  98         vp = salloc(nmemb * size);
  99         memset(vp, 0, nmemb * size);
 100         return vp;
 101 }
 102
 103 /*
 104  * Reset the string area to be empty.
 105  * Called to free all strings allocated
 106  * since last reset.
 107  */
 108 void
 109 sreset(void)
 110 {
 111         struct strings *sp;
 112         int string_index;
 113
 114         if (noreset)
 115                 return;
 116         string_index = 0;
 117         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
 118                 if (sp->s_topFree == NULL)
 119                         continue;
 120                 sp->s_nextFree = sp->s_topFree;
 121                 sp->s_nleft = STRINGSIZE << string_index;
 122                 string_index++;
 123         }
 124 }
 125
 126 /*
 127  * Make the string area permanent.
 128  * Meant to be called in main, after initialization.
 129  */
 130 void
 131 spreserve(void)
 132 {
 133         struct strings *sp;
 134
 135         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
 136                 sp->s_topFree = NULL;
 137 }
 138
 139 /*
 140  * Return a pointer to a dynamic copy of the argument.
 141  */
 142 char *
 143 savestr(const char *str)
 144 {
 145         char *news;
 146         int size = strlen(str) + 1;
 147
 148         if ((news = salloc(size)) != NULL)
 149                 memcpy(news, str, size);
 150         return (news);
 151 }
 152
 153 /*
 154  * Return new string copy of a non-terminated argument.
 155  */
 156 char *
 157 savestrbuf(const char *sbuf, size_t sbuf_len)
 158 {
 159         char *news;
 160
 161         if ((news = salloc(sbuf_len + 1)) != NULL) {
 162                 memcpy(news, sbuf, sbuf_len);
 163                 news[sbuf_len] = 0;
 164         }
 165         return (news);
 166 }
 167
 168 /*
 169  * Make a copy of new argument incorporating old one.
 170  */
 171 char *
 172 save2str(const char *str, const char *old)
 173 {
 174         char *news;
 175         int newsize = strlen(str) + 1;
 176         int oldsize = old ? strlen(old) + 1 : 0;
 177
 178         if ((news = salloc(newsize + oldsize)) != NULL) {
 179                 if (oldsize) {
 180                         memcpy(news, old, oldsize);
 181                         news[oldsize - 1] = ' ';
 182                 }
 183                 memcpy(news + oldsize, str, newsize);
 184         }
 185         return (news);
 186 }
 187
 188 char *
 189 savecat(const char *s1, const char *s2)
 190 {
 191         const char *cp;
 192         char *ns, *np;
 193
 194         np = ns = salloc(strlen(s1) + strlen(s2) + 1);
 195         for (cp = s1; *cp; cp++)
 196                 *np++ = *cp;
 197         for (cp = s2; *cp; cp++)
 198                 *np++ = *cp;
 199         *np = '\0';
 200         return ns;
 201 }
 202
 203 struct str *
 204 str_concat_csvl(struct str *self, ...)
 205 {
 206         va_list vl;
 207         size_t l;
 208         char const*cs;
 209
 210         va_start(vl, self);
 211         for (l = 0; (cs = va_arg(vl, char const*)) != NULL;)
 212                 l += strlen(cs);
 213         va_end(vl);
 214
 215         self->l = l;
 216         self->s = salloc(l + 1);
 217
 218         va_start(vl, self);
 219         for (l = 0; (cs = va_arg(vl, char const*)) != NULL;) {
 220                 size_t i = strlen(cs);
 221                 memcpy(self->s + l, cs, i);
 222                 l += i;
 223         }
 224         self->s[l] = '\0';
 225         va_end(vl);
 226         return (self);
 227 }