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