NetBSD/usr.bin/mail/strings.c

130 lines
3.7 KiB
C
Raw Normal View History

/* $NetBSD: strings.c,v 1.10 2003/08/07 11:14:41 agc Exp $ */
1993-03-21 12:45:37 +03:00
/*
1994-06-29 09:09:04 +04:00
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
1993-03-21 12:45:37 +03:00
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
#if 0
static char sccsid[] = "@(#)strings.c 8.1 (Berkeley) 6/6/93";
#else
__RCSID("$NetBSD: strings.c,v 1.10 2003/08/07 11:14:41 agc Exp $");
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
/*
* Mail -- a mail program
*
* String allocation routines.
* Strings handed out here are reclaimed at the top of the command
* loop each time, so they need not be freed.
*/
#include "rcv.h"
1994-06-29 09:09:04 +04:00
#include "extern.h"
1993-03-21 12:45:37 +03:00
/*
* Allocate size more bytes of space and return the address of the
* first byte to the caller. An even number of bytes are always
* allocated so that the space will always be on a word boundary.
* The string spaces are of exponentially increasing size, to satisfy
* the occasional user with enormous string size requests.
*/
char *
2002-03-02 17:59:35 +03:00
salloc(int size)
1993-03-21 12:45:37 +03:00
{
char *t;
int s;
struct strings *sp;
2002-03-02 18:27:51 +03:00
int idx;
1993-03-21 12:45:37 +03:00
s = size;
1995-04-24 11:39:42 +04:00
s += (sizeof (char *) - 1);
s &= ~(sizeof (char *) - 1);
2002-03-02 18:27:51 +03:00
idx = 0;
1993-03-21 12:45:37 +03:00
for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
if (sp->s_topFree == NULL && (STRINGSIZE << idx) >= s)
1993-03-21 12:45:37 +03:00
break;
if (sp->s_nleft >= s)
break;
2002-03-02 18:27:51 +03:00
idx++;
1993-03-21 12:45:37 +03:00
}
if (sp >= &stringdope[NSPACE])
errx(1, "String too large");
if (sp->s_topFree == NULL) {
2002-03-02 18:27:51 +03:00
idx = sp - &stringdope[0];
sp->s_topFree = malloc(STRINGSIZE << idx);
if (sp->s_topFree == NULL)
2002-03-02 18:27:51 +03:00
errx(1, "No room for space %d", idx);
1993-03-21 12:45:37 +03:00
sp->s_nextFree = sp->s_topFree;
2002-03-02 18:27:51 +03:00
sp->s_nleft = STRINGSIZE << idx;
1993-03-21 12:45:37 +03:00
}
sp->s_nleft -= s;
t = sp->s_nextFree;
sp->s_nextFree += s;
return(t);
}
/*
* Reset the string area to be empty.
* Called to free all strings allocated
* since last reset.
*/
1994-06-29 09:09:04 +04:00
void
2002-03-02 17:59:35 +03:00
sreset(void)
1993-03-21 12:45:37 +03:00
{
struct strings *sp;
2002-03-02 18:27:51 +03:00
int idx;
1993-03-21 12:45:37 +03:00
if (noreset)
return;
2002-03-02 18:27:51 +03:00
idx = 0;
1993-03-21 12:45:37 +03:00
for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
if (sp->s_topFree == NULL)
1993-03-21 12:45:37 +03:00
continue;
sp->s_nextFree = sp->s_topFree;
2002-03-02 18:27:51 +03:00
sp->s_nleft = STRINGSIZE << idx;
idx++;
1993-03-21 12:45:37 +03:00
}
}
/*
* Make the string area permanent.
* Meant to be called in main, after initialization.
*/
1994-06-29 09:09:04 +04:00
void
2002-03-02 17:59:35 +03:00
spreserve(void)
1993-03-21 12:45:37 +03:00
{
struct strings *sp;
1993-03-21 12:45:37 +03:00
for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
sp->s_topFree = NULL;
1993-03-21 12:45:37 +03:00
}