2 * Heirloom mailx - a mail user agent derived from Berkeley Mail.
4 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
7 * Copyright (c) 1980, 1993
8 * The Regents of the University of California. All rights reserved.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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.
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
41 static char sccsid
[] = "@(#)strings.c 2.6 (gritter) 3/4/06";
46 * Mail -- a mail program
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.
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.
73 s
+= (sizeof (char *) - 1);
74 s
&= ~(sizeof (char *) - 1);
76 for (sp
= &stringdope
[0]; sp
< &stringdope
[NSPACE
]; sp
++) {
77 if (sp
->s_topFree
== NULL
&& (STRINGSIZE
<< string_index
) >= s
)
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
;
98 csalloc(size_t nmemb
, size_t size
)
102 vp
= salloc(nmemb
* size
);
103 memset(vp
, 0, nmemb
* size
);
108 * Reset the string area to be empty.
109 * Called to free all strings allocated
121 for (sp
= &stringdope
[0]; sp
< &stringdope
[NSPACE
]; sp
++) {
122 if (sp
->s_topFree
== NULL
)
124 sp
->s_nextFree
= sp
->s_topFree
;
125 sp
->s_nleft
= STRINGSIZE
<< string_index
;
131 * Make the string area permanent.
132 * Meant to be called in main, after initialization.
139 for (sp
= &stringdope
[0]; sp
< &stringdope
[NSPACE
]; sp
++)
140 sp
->s_topFree
= NULL
;