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  */
   6 /*
   7  * Copyright (c) 1980, 1993
   8  *      The Regents of the University of California.  All rights reserved.
   9  *
  10  * Redistribution and use in source and binary forms, with or without
  11  * modification, are permitted provided that the following conditions
  12  * are met:
  13  * 1. Redistributions of source code must retain the above copyright
  14  *    notice, this list of conditions and the following disclaimer.
  15  * 2. Redistributions in binary form must reproduce the above copyright
  16  *    notice, this list of conditions and the following disclaimer in the
  17  *    documentation and/or other materials provided with the distribution.
  18  * 3. All advertising materials mentioning features or use of this software
  19  *    must display the following acknowledgement:
  20  *      This product includes software developed by the University of
  21  *      California, Berkeley and its contributors.
  22  * 4. Neither the name of the University nor the names of its contributors
  23  *    may be used to endorse or promote products derived from this software
  24  *    without specific prior written permission.
  25  *
  26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  36  * SUCH DAMAGE.
  37  */
  38
  39 #ifndef lint
  40 #ifdef  DOSCCS
  41 static char sccsid[] = "@(#)strings.c   2.6 (gritter) 3/4/06";
  42 #endif
  43 #endif /* not lint */
  44
  45 /*
  46  * Mail -- a mail program
  47  *
  48  * String allocation routines.
  49  * Strings handed out here are reclaimed at the top of the command
  50  * loop each time, so they need not be freed.
  51  */
  52
  53 #include "rcv.h"
  54 #include "extern.h"
  55
  56 /*
  57  * Allocate size more bytes of space and return the address of the
  58  * first byte to the caller.  An even number of bytes are always
  59  * allocated so that the space will always be on a word boundary.
  60  * The string spaces are of exponentially increasing size, to satisfy
  61  * the occasional user with enormous string size requests.
  62  */
  63
  64 void *
  65 salloc(size_t size)
  66 {
  67         char *t;
  68         int s;
  69         struct strings *sp;
  70         int string_index;
  71
  72         s = size;
  73         s += (sizeof (char *) - 1);
  74         s &= ~(sizeof (char *) - 1);
  75         string_index = 0;
  76         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
  77                 if (sp->s_topFree == NULL && (STRINGSIZE << string_index) >= s)
  78                         break;
  79                 if (sp->s_nleft >= s)
  80                         break;
  81                 string_index++;
  82         }
  83         if (sp >= &stringdope[NSPACE])
  84                 panic(catgets(catd, CATSET, 195, "String too large"));
  85         if (sp->s_topFree == NULL) {
  86                 string_index = sp - &stringdope[0];
  87                 sp->s_topFree = smalloc(STRINGSIZE << string_index);
  88                 sp->s_nextFree = sp->s_topFree;
  89                 sp->s_nleft = STRINGSIZE << string_index;
  90         }
  91         sp->s_nleft -= s;
  92         t = sp->s_nextFree;
  93         sp->s_nextFree += s;
  94         return(t);
  95 }
  96
  97 void *
  98 csalloc(size_t nmemb, size_t size)
  99 {
 100         void    *vp;
 101
 102         vp = salloc(nmemb * size);
 103         memset(vp, 0, nmemb * size);
 104         return vp;
 105 }
 106
 107 /*
 108  * Reset the string area to be empty.
 109  * Called to free all strings allocated
 110  * since last reset.
 111  */
 112 void
 113 sreset(void)
 114 {
 115         struct strings *sp;
 116         int string_index;
 117
 118         if (noreset)
 119                 return;
 120         string_index = 0;
 121         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
 122                 if (sp->s_topFree == NULL)
 123                         continue;
 124                 sp->s_nextFree = sp->s_topFree;
 125                 sp->s_nleft = STRINGSIZE << string_index;
 126                 string_index++;
 127         }
 128 }
 129
 130 /*
 131  * Make the string area permanent.
 132  * Meant to be called in main, after initialization.
 133  */
 134 void
 135 spreserve(void)
 136 {
 137         struct strings *sp;
 138
 139         for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
 140                 sp->s_topFree = NULL;
 141 }