ca13337dfe
- Remove all longjmp(3) calls from signal handlers. Instead, we post to an internal signal queue and check that periodically. All signal related code is now in sig.c, except for the SIGCHLD handler which remains in popen.c as it is intimately tied to routines there. - Handle SIGPIPE in type1() regardless of mime support, or else the handler in execute() will prevent our error code from being returned resulting in 'sawcom' not being set on the first command as it should. This only affected the initial behavior of the "next" command without mime support. - Add the 'T' flag to many commands in cmdtab.c that should not look like the first command. E.g., start mail on a mailbox with multiple messages, run "set foo", then "next", and watch the second message get displayed rather than the first as is the case without the first "set" command. - Add file descriptor and file handle leak detection. Enabled by DEBUG_FILE_LEAK. This will likely disappear in the future. - Fix a long standing (since import in 1993) longjmp() bug in edstop(): the jmpbuf was invalid when quit() is called at the end of main. - Fix a long standing bug (since import in 1993) in snarf() where it didn't strip whitespace correctly if the line consisted only of whitespace. - Lint cleanup. - New Feature: "Header" command. This allows miscellaneous header fields to be added to the header, e.g., "X-Organization:" or "Reply-To:" fields. - New Feature: "page-also" variable. This allows the specification of additional commands to page. It is more flexible than "crt". - Document the "pager-off" variable: if set, it disables paging entirely.
156 lines
4.4 KiB
C
156 lines
4.4 KiB
C
/* $NetBSD: strings.c,v 1.17 2009/04/10 13:08:25 christos Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1980, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* 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
|
|
* 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>
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)strings.c 8.1 (Berkeley) 6/6/93";
|
|
#else
|
|
__RCSID("$NetBSD: strings.c,v 1.17 2009/04/10 13:08:25 christos Exp $");
|
|
#endif
|
|
#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"
|
|
#include "extern.h"
|
|
|
|
#define STRINGSIZE ((unsigned) 128)/* Dynamic allocation units */
|
|
|
|
/*
|
|
* The pointers for the string allocation routines,
|
|
* there are NSPACE independent areas.
|
|
* The first holds STRINGSIZE bytes, the next
|
|
* twice as much, and so on.
|
|
*/
|
|
#define NSPACE 25 /* Total number of string spaces */
|
|
static struct strings {
|
|
char *s_topFree; /* Beginning of this area */
|
|
char *s_nextFree; /* Next alloctable place here */
|
|
size_t s_nleft; /* Number of bytes left here */
|
|
} stringdope[NSPACE];
|
|
|
|
/*
|
|
* 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.
|
|
*/
|
|
PUBLIC void *
|
|
salloc(size_t size)
|
|
{
|
|
char *t;
|
|
size_t s;
|
|
struct strings *sp;
|
|
int idx;
|
|
|
|
s = size;
|
|
s += (sizeof(char *) - 1);
|
|
s &= ~(sizeof(char *) - 1);
|
|
idx = 0;
|
|
for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
|
|
if (sp->s_topFree == NULL && (STRINGSIZE << idx) >= s)
|
|
break;
|
|
if (sp->s_nleft >= s)
|
|
break;
|
|
idx++;
|
|
}
|
|
if (sp >= &stringdope[NSPACE])
|
|
errx(1, "String too large");
|
|
if (sp->s_topFree == NULL) {
|
|
idx = (int)(sp - &stringdope[0]);
|
|
sp->s_topFree = malloc(STRINGSIZE << idx);
|
|
if (sp->s_topFree == NULL)
|
|
errx(1, "No room for space %d", idx);
|
|
sp->s_nextFree = sp->s_topFree;
|
|
sp->s_nleft = STRINGSIZE << idx;
|
|
}
|
|
sp->s_nleft -= s;
|
|
t = sp->s_nextFree;
|
|
sp->s_nextFree += s;
|
|
return t;
|
|
}
|
|
|
|
/*
|
|
* Allocate zeroed space for 'number' elments of size 'size'.
|
|
*/
|
|
PUBLIC void *
|
|
csalloc(size_t number, size_t size)
|
|
{
|
|
void *p;
|
|
p = salloc(number * size);
|
|
(void)memset(p, 0, number * size);
|
|
return p;
|
|
}
|
|
|
|
/*
|
|
* Reset the string area to be empty.
|
|
* Called to free all strings allocated
|
|
* since last reset.
|
|
*/
|
|
PUBLIC void
|
|
sreset(void)
|
|
{
|
|
struct strings *sp;
|
|
int idx;
|
|
|
|
if (noreset)
|
|
return;
|
|
idx = 0;
|
|
for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) {
|
|
if (sp->s_topFree == NULL)
|
|
continue;
|
|
sp->s_nextFree = sp->s_topFree;
|
|
sp->s_nleft = STRINGSIZE << idx;
|
|
idx++;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Make the string area permanent.
|
|
* Meant to be called in main, after initialization.
|
|
*/
|
|
PUBLIC void
|
|
spreserve(void)
|
|
{
|
|
struct strings *sp;
|
|
|
|
for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++)
|
|
sp->s_topFree = NULL;
|
|
}
|