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 36static char sccsid[] = "@(#)strings.c 8.1 (Berkeley) 6/6/93"; 37#endif 38__attribute__((__used__)) 39static const char rcsid[] = 40 "$FreeBSD: src/usr.bin/mail/strings.c,v 1.5 2002/06/30 05:25:06 obrien Exp $"; 41#endif /* not lint */ 42 43#include <sys/cdefs.h> 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 64char * 65salloc(size) 66 int size; 67{ 68 char *t; 69 int s, index; 70 struct strings *sp; 71 72 s = size; 73 s += (sizeof(char *) - 1); 74 s &= ~(sizeof(char *) - 1); 75 index = 0; 76 for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) { 77 if (sp->s_topFree == NULL && (STRINGSIZE << index) >= s) 78 break; 79 if (sp->s_nleft >= s) 80 break; 81 index++; 82 } 83 if (sp >= &stringdope[NSPACE]) 84 errx(1, "String too large"); 85 if (sp->s_topFree == NULL) { 86 index = sp - &stringdope[0]; 87 if ((sp->s_topFree = malloc(STRINGSIZE << index)) == NULL) 88 err(1, "No room for space %d", index); 89 sp->s_nextFree = sp->s_topFree; 90 sp->s_nleft = STRINGSIZE << index; 91 } 92 sp->s_nleft -= s; 93 t = sp->s_nextFree; 94 sp->s_nextFree += s; 95 return (t); 96} 97 98/* 99 * Reset the string area to be empty. 100 * Called to free all strings allocated 101 * since last reset. 102 */ 103void 104sreset() 105{ 106 struct strings *sp; 107 int index; 108 109 if (noreset) 110 return; 111 index = 0; 112 for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) { 113 if (sp->s_topFree == NULL) 114 continue; 115 sp->s_nextFree = sp->s_topFree; 116 sp->s_nleft = STRINGSIZE << index; 117 index++; 118 } 119} 120 121/* 122 * Make the string area permanent. 123 * Meant to be called in main, after initialization. 124 */ 125void 126spreserve() 127{ 128 struct strings *sp; 129 130 for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) 131 sp->s_topFree = NULL; 132} 133