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 /*
  52  * Allocate size more bytes of space and return the address of the
  53  * first byte to the caller.  An even number of bytes are always
  54  * allocated so that the space will always be on a word boundary.
  55  * The string spaces are of exponentially increasing size, to satisfy
  56  * the occasional user with enormous string size requests.
  57  */
  58 void *
  59 salloc(size_t size)
  60 {
  61         char *t;
  62         unsigned int s;
  63         struct strings *sp;
  64         int string_index;
  65
  66         s = size;
  67         s += (sizeof (char *) - 1);
  68         s &= ~(sizeof (char *) - 1);
  69         string_index = 0;
  70         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
  71                 if (sp->s_topFree == NULL && (STRINGSIZE << string_index) >= s)
  72                         break;
  73                 if (sp->s_nleft >= s)
  74                         break;
  75                 string_index++;
  76         }
  77         if (sp >= &stringdope[NSPACE])
  78                 panic(tr(195, "String too large"));
  79         if (sp->s_topFree == NULL) {
  80                 string_index = sp - &stringdope[0];
  81                 sp->s_topFree = smalloc(STRINGSIZE << string_index);
  82                 sp->s_nextFree = sp->s_topFree;
  83                 sp->s_nleft = STRINGSIZE << string_index;
  84         }
  85         sp->s_nleft -= s;
  86         t = sp->s_nextFree;
  87         sp->s_nextFree += s;
  88         return(t);
  89 }
  90
  91 void *
  92 csalloc(size_t nmemb, size_t size)
  93 {
  94         void *vp;
  95
  96         vp = salloc(nmemb * size);
  97         memset(vp, 0, nmemb * size);
  98         return vp;
  99 }
 100
 101 /*
 102  * Reset the string area to be empty.
 103  * Called to free all strings allocated
 104  * since last reset.
 105  */
 106 void
 107 sreset(void)
 108 {
 109         struct strings *sp;
 110         int string_index;
 111
 112         if (noreset)
 113                 return;
 114         string_index = 0;
 115         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
 116                 if (sp->s_topFree == NULL)
 117                         continue;
 118                 sp->s_nextFree = sp->s_topFree;
 119                 sp->s_nleft = STRINGSIZE << string_index;
 120                 string_index++;
 121         }
 122 }
 123
 124 /*
 125  * Make the string area permanent.
 126  * Meant to be called in main, after initialization.
 127  */
 128 void
 129 spreserve(void)
 130 {
 131         struct strings *sp;
 132
 133         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
 134                 sp->s_topFree = NULL;
 135 }
 136
 137 /*
 138  * Return a pointer to a dynamic copy of the argument.
 139  */
 140 char *
 141 savestr(const char *str)
 142 {
 143         char *news;
 144         int size = strlen(str) + 1;
 145
 146         if ((news = salloc(size)) != NULL)
 147                 memcpy(news, str, size);
 148         return (news);
 149 }
 150
 151 /*
 152  * Return new string copy of a non-terminated argument.
 153  */
 154 char *
 155 savestrbuf(const char *sbuf, size_t sbuf_len)
 156 {
 157         char *news;
 158
 159         if ((news = salloc(sbuf_len + 1)) != NULL) {
 160                 memcpy(news, sbuf, sbuf_len);
 161                 news[sbuf_len] = 0;
 162         }
 163         return (news);
 164 }
 165
 166 /*
 167  * Make a copy of new argument incorporating old one.
 168  */
 169 char *
 170 save2str(const char *str, const char *old)
 171 {
 172         char *news;
 173         int newsize = strlen(str) + 1;
 174         int oldsize = old ? strlen(old) + 1 : 0;
 175
 176         if ((news = salloc(newsize + oldsize)) != NULL) {
 177                 if (oldsize) {
 178                         memcpy(news, old, oldsize);
 179                         news[oldsize - 1] = ' ';
 180                 }
 181                 memcpy(news + oldsize, str, newsize);
 182         }
 183         return (news);
 184 }
 185
 186 char *
 187 savecat(const char *s1, const char *s2)
 188 {
 189         const char *cp;
 190         char *ns, *np;
 191
 192         np = ns = salloc(strlen(s1) + strlen(s2) + 1);
 193         for (cp = s1; *cp; cp++)
 194                 *np++ = *cp;
 195         for (cp = s2; *cp; cp++)
 196                 *np++ = *cp;
 197         *np = '\0';
 198         return ns;
 199 }