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