/*	$OpenBSD: append.c,v 1.9 2004/07/20 03:50:27 deraadt Exp $	*//*- * Copyright (c) 1993 *	The Regents of the University of California.  All rights reserved. * * This code is derived from software contributed to Berkeley by * Peter McIlroy. * * 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. */#ifndef lint#if 0static char sccsid[] = "@(#)append.c	8.1 (Berkeley) 6/6/93";#elsestatic char rcsid[] = "$OpenBSD: append.c,v 1.9 2004/07/20 03:50:27 deraadt Exp $";#endif#endif /* not lint */#include "sort.h"#include <stdlib.h>#include <string.h>#define OUTPUT {							\	if ((n = cpos - ppos) > 1) {					\		for (; ppos < cpos; ++ppos)				\			*ppos -= odepth;				\		ppos -= n;						\		radixsort((const u_char **)ppos, n, wts1, REC_D);	\		for (; ppos < cpos; ppos++) {				\			prec = (RECHEADER *) (*ppos - sizeof(TRECHEADER));\			put(prec, fp);					\		}							\	} else 								\		put(prec, fp);						\}/* * copy sorted lines to output; check for uniqueness */voidappend(u_char **keylist, int nelem, int depth, FILE *fp,    void (*put)(RECHEADER *, FILE *), struct field *ftbl){	u_char *wts, *wts1;	int n, odepth;	u_char **cpos, **ppos, **lastkey;	u_char *cend, *pend, *start;	RECHEADER *crec, *prec;	if (*keylist == NULL)		return;	wts1 = wts = ftbl[0].weights;	if ((!UNIQUE) && SINGL_FLD) {		if (ftbl[0].flags & F && ftbl[0].flags & R)			wts1 = Rascii;		else if (ftbl[0].flags & F)			wts1 = ascii;		odepth = depth;	}	lastkey = keylist + nelem;	depth += sizeof(TRECHEADER);	if (SINGL_FLD && (UNIQUE || wts1 != wts)) {		ppos = keylist;		prec = (RECHEADER *) (*ppos - depth);		if (UNIQUE)			put(prec, fp);		for (cpos = &keylist[1]; cpos < lastkey; cpos++) {			crec = (RECHEADER *) (*cpos - depth);			if (crec->length  == prec->length) {				/* 				 * Set pend and cend so that trailing NUL and				 * record separator is ignored.				 */				pend = (u_char *)&prec->data + prec->length - 2;				cend = (u_char *)&crec->data + crec->length - 2;				for (start = *cpos; cend >= start; cend--) {					if (wts[*cend] != wts[*pend])						break;					pend--;				}				if (pend + 1 != *ppos) {					if (!UNIQUE)						OUTPUT					else						put(crec, fp);					ppos = cpos;					prec = crec;				}			} else {				if (!UNIQUE)					OUTPUT				else					put(crec, fp);				ppos = cpos;				prec = crec;			}		}		if (!UNIQUE)			OUTPUT	} else if (UNIQUE) {		ppos = keylist;		prec = (RECHEADER *) (*ppos - depth);		put(prec, fp);		for (cpos = &keylist[1]; cpos < lastkey; cpos++) {			crec = (RECHEADER *) (*cpos - depth);			if (crec->offset == prec->offset) {				/* 				 * Set pend and cend so that trailing NUL and				 * record separator is ignored.				 */				pend = (u_char *)&prec->data + prec->offset - 2;				cend = (u_char *)&crec->data + crec->offset - 2;				for (start = *cpos; cend >= start; cend--) {					if (wts[*cend] != wts[*pend])						break;					pend--;				}				if (pend + 1 != *ppos) {					ppos = cpos;					prec = crec;					put(prec, fp);				}			} else {				ppos = cpos;				prec = crec;				put(prec, fp);			}		}	} else for (cpos = keylist; cpos < lastkey; cpos++) {		crec = (RECHEADER *) (*cpos - depth);		put(crec, fp);	}}/* * output the already sorted eol bin. */voidrd_append(int binno, union f_handle infl0, int nfiles, FILE *outfp,    u_char *buffer, u_char *bufend){	RECHEADER *rec;	rec = (RECHEADER *) buffer;	if (!getnext(binno, infl0, nfiles, (RECHEADER *) buffer, bufend, 0)) {		putline(rec, outfp);		while (getnext(binno, infl0, nfiles, (RECHEADER *) buffer,			bufend, 0) == 0) {			if (!UNIQUE)				putline(rec, outfp);		}	}}/* * append plain text--used after sorting the biggest bin. */voidconcat(FILE *a, FILE *b){        int nread;        char buffer[4096];	rewind(b);        while ((nread = fread(buffer, 1, 4096, b)) > 0)                EWRITE(buffer, 1, nread, a);}