strings.c

   1 /*
   2  * Heirloom mailx - 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 #ifndef lint
  41 #ifdef  DOSCCS
  42 static char sccsid[] = "@(#)strings.c   2.6 (gritter) 3/4/06";
  43 #endif
  44 #endif /* not lint */
  45
  46 /*
  47  * Mail -- a mail program
  48  *
  49  * String allocation routines.
  50  * Strings handed out here are reclaimed at the top of the command
  51  * loop each time, so they need not be freed.
  52  */
  53
  54 #include "rcv.h"
  55 #include "extern.h"
  56
  57 /*
  58  * Allocate size more bytes of space and return the address of the
  59  * first byte to the caller.  An even number of bytes are always
  60  * allocated so that the space will always be on a word boundary.
  61  * The string spaces are of exponentially increasing size, to satisfy
  62  * the occasional user with enormous string size requests.
  63  */
  64
  65 void *
  66 salloc(size_t size)
  67 {
  68         char *t;
  69         unsigned int s;
  70         struct strings *sp;
  71         int string_index;
  72
  73         s = size;
  74         s += (sizeof (char *) - 1);
  75         s &= ~(sizeof (char *) - 1);
  76         string_index = 0;
  77         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
  78                 if (sp->s_topFree == NULL && (STRINGSIZE << string_index) >= s)
  79                         break;
  80                 if (sp->s_nleft >= s)
  81                         break;
  82                 string_index++;
  83         }
  84         if (sp >= &stringdope[NSPACE])
  85                 panic(catgets(catd, CATSET, 195, "String too large"));
  86         if (sp->s_topFree == NULL) {
  87                 string_index = sp - &stringdope[0];
  88                 sp->s_topFree = smalloc(STRINGSIZE << string_index);
  89                 sp->s_nextFree = sp->s_topFree;
  90                 sp->s_nleft = STRINGSIZE << string_index;
  91         }
  92         sp->s_nleft -= s;
  93         t = sp->s_nextFree;
  94         sp->s_nextFree += s;
  95         return(t);
  96 }
  97
  98 void *
  99 csalloc(size_t nmemb, size_t size)
 100 {
 101         void    *vp;
 102
 103         vp = salloc(nmemb * size);
 104         memset(vp, 0, nmemb * size);
 105         return vp;
 106 }
 107
 108 /*
 109  * Reset the string area to be empty.
 110  * Called to free all strings allocated
 111  * since last reset.
 112  */
 113 void
 114 sreset(void)
 115 {
 116         struct strings *sp;
 117         int string_index;
 118
 119         if (noreset)
 120                 return;
 121         string_index = 0;
 122         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
 123                 if (sp->s_topFree == NULL)
 124                         continue;
 125                 sp->s_nextFree = sp->s_topFree;
 126                 sp->s_nleft = STRINGSIZE << string_index;
 127                 string_index++;
 128         }
 129 }
 130
 131 /*
 132  * Make the string area permanent.
 133  * Meant to be called in main, after initialization.
 134  */
 135 void
 136 spreserve(void)
 137 {
 138         struct strings *sp;
 139
 140         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
 141                 sp->s_topFree = NULL;
 142 }