xref: /openbsd-src/usr.bin/mail/strings.c (revision cd9ca5b76593249d0a09a4be345ea62a81baa7ae)
1*cd9ca5b7Smmcc /*	$OpenBSD: strings.c,v 1.10 2015/10/16 17:56:07 mmcc Exp $	*/
27eb34045Sderaadt /*	$NetBSD: strings.c,v 1.5 1996/06/08 19:48:40 christos Exp $	*/
37eb34045Sderaadt 
4df930be7Sderaadt /*
5df930be7Sderaadt  * Copyright (c) 1980, 1993
6df930be7Sderaadt  *	The Regents of the University of California.  All rights reserved.
7df930be7Sderaadt  *
8df930be7Sderaadt  * Redistribution and use in source and binary forms, with or without
9df930be7Sderaadt  * modification, are permitted provided that the following conditions
10df930be7Sderaadt  * are met:
11df930be7Sderaadt  * 1. Redistributions of source code must retain the above copyright
12df930be7Sderaadt  *    notice, this list of conditions and the following disclaimer.
13df930be7Sderaadt  * 2. Redistributions in binary form must reproduce the above copyright
14df930be7Sderaadt  *    notice, this list of conditions and the following disclaimer in the
15df930be7Sderaadt  *    documentation and/or other materials provided with the distribution.
16f75387cbSmillert  * 3. Neither the name of the University nor the names of its contributors
17df930be7Sderaadt  *    may be used to endorse or promote products derived from this software
18df930be7Sderaadt  *    without specific prior written permission.
19df930be7Sderaadt  *
20df930be7Sderaadt  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21df930be7Sderaadt  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22df930be7Sderaadt  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23df930be7Sderaadt  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24df930be7Sderaadt  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25df930be7Sderaadt  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26df930be7Sderaadt  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27df930be7Sderaadt  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28df930be7Sderaadt  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29df930be7Sderaadt  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30df930be7Sderaadt  * SUCH DAMAGE.
31df930be7Sderaadt  */
32df930be7Sderaadt 
33df930be7Sderaadt /*
34df930be7Sderaadt  * Mail -- a mail program
35df930be7Sderaadt  *
36df930be7Sderaadt  * String allocation routines.
37df930be7Sderaadt  * Strings handed out here are reclaimed at the top of the command
38df930be7Sderaadt  * loop each time, so they need not be freed.
39df930be7Sderaadt  */
40df930be7Sderaadt 
41df930be7Sderaadt #include "rcv.h"
42df930be7Sderaadt #include "extern.h"
43df930be7Sderaadt 
44df930be7Sderaadt /*
45df930be7Sderaadt  * Allocate size more bytes of space and return the address of the
46df930be7Sderaadt  * first byte to the caller.  An even number of bytes are always
47df930be7Sderaadt  * allocated so that the space will always be on a word boundary.
48df930be7Sderaadt  * The string spaces are of exponentially increasing size, to satisfy
49df930be7Sderaadt  * the occasional user with enormous string size requests.
50df930be7Sderaadt  */
51df930be7Sderaadt char *
salloc(int size)524a9caef2Smillert salloc(int size)
53df930be7Sderaadt {
5436999bedSmillert 	char *t;
5536999bedSmillert 	int s;
5636999bedSmillert 	struct strings *sp;
57df930be7Sderaadt 	int index;
58df930be7Sderaadt 
59df930be7Sderaadt 	s = size;
60df930be7Sderaadt 	s += (sizeof(char *) - 1);
61df930be7Sderaadt 	s &= ~(sizeof(char *) - 1);
62df930be7Sderaadt 	index = 0;
63df930be7Sderaadt 	for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
64c318c72bSmillert 		if (sp->s_topFree == NULL && (STRINGSIZE << index) >= s)
65df930be7Sderaadt 			break;
66df930be7Sderaadt 		if (sp->s_nleft >= s)
67df930be7Sderaadt 			break;
68df930be7Sderaadt 		index++;
69df930be7Sderaadt 	}
70df930be7Sderaadt 	if (sp >= &stringdope[NSPACE])
7136999bedSmillert 		errx(1, "String too large");
72c318c72bSmillert 	if (sp->s_topFree == NULL) {
73df930be7Sderaadt 		index = sp - &stringdope[0];
74*cd9ca5b7Smmcc 		sp->s_topFree = malloc(STRINGSIZE << index);
7536999bedSmillert 		if (sp->s_topFree == NULL)
76*cd9ca5b7Smmcc 			err(1, "malloc");
77df930be7Sderaadt 		sp->s_nextFree = sp->s_topFree;
78df930be7Sderaadt 		sp->s_nleft = STRINGSIZE << index;
79df930be7Sderaadt 	}
80df930be7Sderaadt 	sp->s_nleft -= s;
81df930be7Sderaadt 	t = sp->s_nextFree;
82df930be7Sderaadt 	sp->s_nextFree += s;
83df930be7Sderaadt 	return(t);
84df930be7Sderaadt }
85df930be7Sderaadt 
86df930be7Sderaadt /*
87df930be7Sderaadt  * Reset the string area to be empty.
88df930be7Sderaadt  * Called to free all strings allocated
89df930be7Sderaadt  * since last reset.
90df930be7Sderaadt  */
91df930be7Sderaadt void
sreset(void)924a9caef2Smillert sreset(void)
93df930be7Sderaadt {
9436999bedSmillert 	struct strings *sp;
9536999bedSmillert 	int index;
96df930be7Sderaadt 
97df930be7Sderaadt 	if (noreset)
98df930be7Sderaadt 		return;
99df930be7Sderaadt 	index = 0;
100df930be7Sderaadt 	for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
101c318c72bSmillert 		if (sp->s_topFree == NULL)
102df930be7Sderaadt 			continue;
103df930be7Sderaadt 		sp->s_nextFree = sp->s_topFree;
104df930be7Sderaadt 		sp->s_nleft = STRINGSIZE << index;
105df930be7Sderaadt 		index++;
106df930be7Sderaadt 	}
107df930be7Sderaadt }
108df930be7Sderaadt 
109df930be7Sderaadt /*
110df930be7Sderaadt  * Make the string area permanent.
111df930be7Sderaadt  * Meant to be called in main, after initialization.
112df930be7Sderaadt  */
113df930be7Sderaadt void
spreserve(void)1144a9caef2Smillert spreserve(void)
115df930be7Sderaadt {
11636999bedSmillert 	struct strings *sp;
117df930be7Sderaadt 
118df930be7Sderaadt 	for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
119c318c72bSmillert 		sp->s_topFree = NULL;
120df930be7Sderaadt }
121