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