Annotation of src/usr.bin/mail/strings.c, Revision 1.2
1.2 ! deraadt 1: /* $OpenBSD: strings.c,v 1.5 1996/06/08 19:48:40 christos Exp $ */
! 2: /* $NetBSD: strings.c,v 1.5 1996/06/08 19:48:40 christos Exp $ */
! 3:
1.1 deraadt 4: /*
5: * Copyright (c) 1980, 1993
6: * The Regents of the University of California. All rights reserved.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
11: * 1. Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * 2. Redistributions in binary form must reproduce the above copyright
14: * notice, this list of conditions and the following disclaimer in the
15: * documentation and/or other materials provided with the distribution.
16: * 3. All advertising materials mentioning features or use of this software
17: * must display the following acknowledgement:
18: * This product includes software developed by the University of
19: * California, Berkeley and its contributors.
20: * 4. Neither the name of the University nor the names of its contributors
21: * may be used to endorse or promote products derived from this software
22: * without specific prior written permission.
23: *
24: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34: * SUCH DAMAGE.
35: */
36:
37: #ifndef lint
1.2 ! deraadt 38: #if 0
! 39: static char sccsid[] = "@(#)strings.c 8.1 (Berkeley) 6/6/93";
! 40: #else
! 41: static char rcsid[] = "$OpenBSD: strings.c,v 1.5 1996/06/08 19:48:40 christos Exp $";
! 42: #endif
1.1 deraadt 43: #endif /* not lint */
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:
64: char *
65: salloc(size)
66: int size;
67: {
68: register char *t;
69: register int s;
70: register struct strings *sp;
71: int index;
72:
73: s = size;
74: s += (sizeof (char *) - 1);
75: s &= ~(sizeof (char *) - 1);
76: index = 0;
77: for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
78: if (sp->s_topFree == NOSTR && (STRINGSIZE << index) >= s)
79: break;
80: if (sp->s_nleft >= s)
81: break;
82: index++;
83: }
84: if (sp >= &stringdope[NSPACE])
85: panic("String too large");
86: if (sp->s_topFree == NOSTR) {
87: index = sp - &stringdope[0];
88: sp->s_topFree = malloc(STRINGSIZE << index);
89: if (sp->s_topFree == NOSTR) {
90: fprintf(stderr, "No room for space %d\n", index);
91: panic("Internal error");
92: }
93: sp->s_nextFree = sp->s_topFree;
94: sp->s_nleft = STRINGSIZE << index;
95: }
96: sp->s_nleft -= s;
97: t = sp->s_nextFree;
98: sp->s_nextFree += s;
99: return(t);
100: }
101:
102: /*
103: * Reset the string area to be empty.
104: * Called to free all strings allocated
105: * since last reset.
106: */
107: void
108: sreset()
109: {
110: register struct strings *sp;
111: register int index;
112:
113: if (noreset)
114: return;
115: index = 0;
116: for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
117: if (sp->s_topFree == NOSTR)
118: continue;
119: sp->s_nextFree = sp->s_topFree;
120: sp->s_nleft = STRINGSIZE << index;
121: index++;
122: }
123: }
124:
125: /*
126: * Make the string area permanent.
127: * Meant to be called in main, after initialization.
128: */
129: void
130: spreserve()
131: {
132: register struct strings *sp;
133:
134: for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
135: sp->s_topFree = NOSTR;
136: }