19b50d902SRodney W. Grimes /* 29b50d902SRodney W. Grimes * Copyright (c) 1980, 1993 39b50d902SRodney W. Grimes * The Regents of the University of California. All rights reserved. 49b50d902SRodney W. Grimes * 59b50d902SRodney W. Grimes * Redistribution and use in source and binary forms, with or without 69b50d902SRodney W. Grimes * modification, are permitted provided that the following conditions 79b50d902SRodney W. Grimes * are met: 89b50d902SRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 99b50d902SRodney W. Grimes * notice, this list of conditions and the following disclaimer. 109b50d902SRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 119b50d902SRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 129b50d902SRodney W. Grimes * documentation and/or other materials provided with the distribution. 13*fbbd9655SWarner Losh * 3. Neither the name of the University nor the names of its contributors 149b50d902SRodney W. Grimes * may be used to endorse or promote products derived from this software 159b50d902SRodney W. Grimes * without specific prior written permission. 169b50d902SRodney W. Grimes * 179b50d902SRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 189b50d902SRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 199b50d902SRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 209b50d902SRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 219b50d902SRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 229b50d902SRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 239b50d902SRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 249b50d902SRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 259b50d902SRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 269b50d902SRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 279b50d902SRodney W. Grimes * SUCH DAMAGE. 289b50d902SRodney W. Grimes */ 299b50d902SRodney W. Grimes 309b50d902SRodney W. Grimes #ifndef lint 310c3a8314SMike Heffner #if 0 329b50d902SRodney W. Grimes static char sccsid[] = "@(#)strings.c 8.1 (Berkeley) 6/6/93"; 330c3a8314SMike Heffner #endif 349b50d902SRodney W. Grimes #endif /* not lint */ 35e026a48cSDavid E. O'Brien #include <sys/cdefs.h> 36e026a48cSDavid E. O'Brien __FBSDID("$FreeBSD$"); 379b50d902SRodney W. Grimes 389b50d902SRodney W. Grimes /* 399b50d902SRodney W. Grimes * Mail -- a mail program 409b50d902SRodney W. Grimes * 419b50d902SRodney W. Grimes * String allocation routines. 429b50d902SRodney W. Grimes * Strings handed out here are reclaimed at the top of the command 439b50d902SRodney W. Grimes * loop each time, so they need not be freed. 449b50d902SRodney W. Grimes */ 459b50d902SRodney W. Grimes 469b50d902SRodney W. Grimes #include "rcv.h" 479b50d902SRodney W. Grimes #include "extern.h" 489b50d902SRodney W. Grimes 499b50d902SRodney W. Grimes /* 509b50d902SRodney W. Grimes * Allocate size more bytes of space and return the address of the 519b50d902SRodney W. Grimes * first byte to the caller. An even number of bytes are always 529b50d902SRodney W. Grimes * allocated so that the space will always be on a word boundary. 539b50d902SRodney W. Grimes * The string spaces are of exponentially increasing size, to satisfy 549b50d902SRodney W. Grimes * the occasional user with enormous string size requests. 559b50d902SRodney W. Grimes */ 569b50d902SRodney W. Grimes 579b50d902SRodney W. Grimes char * 586d8484b0SPhilippe Charnier salloc(int size) 599b50d902SRodney W. Grimes { 609ce73e90SMike Heffner char *t; 619ce73e90SMike Heffner int s, index; 629ce73e90SMike Heffner struct strings *sp; 639b50d902SRodney W. Grimes 649b50d902SRodney W. Grimes s = size; 650b919713SHidetoshi Shimokawa s += (sizeof(char *) - 1); 660b919713SHidetoshi Shimokawa s &= ~(sizeof(char *) - 1); 679b50d902SRodney W. Grimes index = 0; 689b50d902SRodney W. Grimes for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) { 699ce73e90SMike Heffner if (sp->s_topFree == NULL && (STRINGSIZE << index) >= s) 709b50d902SRodney W. Grimes break; 719b50d902SRodney W. Grimes if (sp->s_nleft >= s) 729b50d902SRodney W. Grimes break; 739b50d902SRodney W. Grimes index++; 749b50d902SRodney W. Grimes } 759b50d902SRodney W. Grimes if (sp >= &stringdope[NSPACE]) 760c3a8314SMike Heffner errx(1, "String too large"); 779ce73e90SMike Heffner if (sp->s_topFree == NULL) { 789b50d902SRodney W. Grimes index = sp - &stringdope[0]; 799ce73e90SMike Heffner if ((sp->s_topFree = malloc(STRINGSIZE << index)) == NULL) 800c3a8314SMike Heffner err(1, "No room for space %d", index); 819b50d902SRodney W. Grimes sp->s_nextFree = sp->s_topFree; 829b50d902SRodney W. Grimes sp->s_nleft = STRINGSIZE << index; 839b50d902SRodney W. Grimes } 849b50d902SRodney W. Grimes sp->s_nleft -= s; 859b50d902SRodney W. Grimes t = sp->s_nextFree; 869b50d902SRodney W. Grimes sp->s_nextFree += s; 879b50d902SRodney W. Grimes return (t); 889b50d902SRodney W. Grimes } 899b50d902SRodney W. Grimes 909b50d902SRodney W. Grimes /* 919b50d902SRodney W. Grimes * Reset the string area to be empty. 929b50d902SRodney W. Grimes * Called to free all strings allocated 939b50d902SRodney W. Grimes * since last reset. 949b50d902SRodney W. Grimes */ 959b50d902SRodney W. Grimes void 966d8484b0SPhilippe Charnier sreset(void) 979b50d902SRodney W. Grimes { 989ce73e90SMike Heffner struct strings *sp; 999ce73e90SMike Heffner int index; 1009b50d902SRodney W. Grimes 1019b50d902SRodney W. Grimes if (noreset) 1029b50d902SRodney W. Grimes return; 1039b50d902SRodney W. Grimes index = 0; 1049b50d902SRodney W. Grimes for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) { 1059ce73e90SMike Heffner if (sp->s_topFree == NULL) 1069b50d902SRodney W. Grimes continue; 1079b50d902SRodney W. Grimes sp->s_nextFree = sp->s_topFree; 1089b50d902SRodney W. Grimes sp->s_nleft = STRINGSIZE << index; 1099b50d902SRodney W. Grimes index++; 1109b50d902SRodney W. Grimes } 1119b50d902SRodney W. Grimes } 1129b50d902SRodney W. Grimes 1139b50d902SRodney W. Grimes /* 1149b50d902SRodney W. Grimes * Make the string area permanent. 1159b50d902SRodney W. Grimes * Meant to be called in main, after initialization. 1169b50d902SRodney W. Grimes */ 1179b50d902SRodney W. Grimes void 1186d8484b0SPhilippe Charnier spreserve(void) 1199b50d902SRodney W. Grimes { 1209ce73e90SMike Heffner struct strings *sp; 1219b50d902SRodney W. Grimes 1229b50d902SRodney W. Grimes for (sp = &stringdope[0]; sp < &stringdope[NSPACE]; sp++) 1239ce73e90SMike Heffner sp->s_topFree = NULL; 1249b50d902SRodney W. Grimes } 125