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