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