bf80c84843
Simplify logic for reading input records. Do a merge sort whenever we have 16 partial sorted blocks. The patient is breathing, but still carrying a lot of extra weight.
182 lines
6.0 KiB
C
182 lines
6.0 KiB
C
/* $NetBSD: append.c,v 1.19 2009/08/20 06:36:25 dsl Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 2000-2003 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Ben Harris and Jaromir Dolecek.
|
|
*
|
|
* 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.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
|
*/
|
|
|
|
/*-
|
|
* 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.
|
|
*/
|
|
|
|
#include "sort.h"
|
|
|
|
#ifndef lint
|
|
__RCSID("$NetBSD: append.c,v 1.19 2009/08/20 06:36:25 dsl Exp $");
|
|
__SCCSID("@(#)append.c 8.1 (Berkeley) 6/6/93");
|
|
#endif /* not lint */
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#define OUTPUT { \
|
|
if ((n = cpos - ppos) > 1) { \
|
|
ppos -= n; \
|
|
radix_sort(ppos, n, wts1, REC_D); \
|
|
for (; ppos < cpos; ppos++) { \
|
|
prec = (const RECHEADER *) (*ppos - REC_DATA_OFFSET);\
|
|
put(prec, fp); \
|
|
} \
|
|
} else put(prec, fp); \
|
|
}
|
|
|
|
/*
|
|
* copy sorted lines to output; check for uniqueness
|
|
*/
|
|
void
|
|
append(const u_char **keylist, int nelem, FILE *fp, put_func_t put,
|
|
struct field *ftbl)
|
|
{
|
|
u_char *wts, *wts1;
|
|
int n;
|
|
const u_char **cpos, **ppos, **lastkey;
|
|
const u_char *cend, *pend, *start;
|
|
const struct recheader *crec, *prec;
|
|
|
|
if (*keylist == '\0' && UNIQUE)
|
|
return;
|
|
|
|
wts1 = wts = ftbl[0].weights;
|
|
if ((!UNIQUE) && SINGL_FLD && ftbl[0].flags & F) {
|
|
/* Folding case */
|
|
if (ftbl[0].flags & R)
|
|
wts1 = Rascii;
|
|
else
|
|
wts1 = ascii;
|
|
}
|
|
|
|
lastkey = keylist + nelem;
|
|
if (SINGL_FLD && (UNIQUE || wts1 != wts)) {
|
|
ppos = keylist;
|
|
prec = (const RECHEADER *) (*ppos - REC_DATA_OFFSET);
|
|
if (UNIQUE)
|
|
put(prec, fp);
|
|
for (cpos = &keylist[1]; cpos < lastkey; cpos++) {
|
|
crec = (const RECHEADER *) (*cpos - REC_DATA_OFFSET);
|
|
if (crec->length == prec->length) {
|
|
/*
|
|
* Set pend and cend so that trailing NUL and
|
|
* record separator is ignored.
|
|
*/
|
|
pend = (const u_char *) &prec->data + prec->length - 2;
|
|
cend = (const 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 = (const RECHEADER *) (*ppos - REC_DATA_OFFSET);
|
|
put(prec, fp);
|
|
for (cpos = &keylist[1]; cpos < lastkey; cpos++) {
|
|
crec = (const RECHEADER *) (*cpos - REC_DATA_OFFSET);
|
|
if (crec->offset == prec->offset) {
|
|
/*
|
|
* Set pend and cend so that trailing NUL and
|
|
* record separator is ignored.
|
|
*/
|
|
pend = (const u_char *) &prec->data + prec->offset - 2;
|
|
cend = (const 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 = (const RECHEADER *) (*cpos - REC_DATA_OFFSET);
|
|
put(crec, fp);
|
|
}
|
|
}
|