/* $OpenBSD: msort.c,v 1.3 1997/01/22 06:53:15 millert 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. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. 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 0 static char sccsid[] = "@(#)msort.c 8.1 (Berkeley) 6/6/93"; #else static char rcsid[] = "$OpenBSD: msort.c,v 1.3 1997/01/22 06:53:15 millert Exp $"; #endif #endif /* not lint */ #include "sort.h" #include "fsort.h" #include #include #include /* Subroutines using comparisons: merge sort and check order */ #define DELETE (1) #define LALIGN(n) ((n+3) & ~3) typedef struct mfile { u_char *end; short flno; struct recheader rec[1]; } MFILE; typedef struct tmfile { u_char *end; short flno; struct trecheader rec[1]; } TMFILE; u_char *wts, *wts1 = 0; struct mfile *cfilebuf; static int cmp __P((struct recheader *, struct recheader *)); static int insert __P((struct mfile **, struct mfile **, int, int)); void fmerge(binno, files, nfiles, get, outfp, fput, ftbl) union f_handle files; int binno, nfiles; int (*get)(); FILE *outfp; void (*fput)(); struct field *ftbl; { FILE *tout; int i, j, last; void (*put)(struct recheader *, FILE *); extern int geteasy(); struct tempfile *l_fstack; wts = ftbl->weights; if (!UNIQUE && SINGL_FLD && ftbl->flags & F) wts1 = (ftbl->flags & R) ? Rascii : ascii; if (!cfilebuf) cfilebuf = malloc(MAXLLEN + sizeof(TMFILE)); i = min(16, nfiles) * LALIGN(MAXLLEN+sizeof(TMFILE)); if (!buffer || i > BUFSIZE) { buffer = buffer ? realloc(buffer, i) : malloc(i); if (!buffer) err(2, NULL); if (!SINGL_FLD) linebuf = malloc(MAXLLEN); } if (binno >= 0) l_fstack = fstack + files.top; else l_fstack = fstack; while (nfiles) { put = putrec; for (j = 0; j < nfiles; j += 16) { if (nfiles <= 16) { tout = outfp; put = fput; } else tout = ftmp(); last = min(16, nfiles - j); if (binno < 0) { for (i = 0; i < last; i++) if (!(l_fstack[i+MAXFCT-1-16].fp = fopen(files.names[j + i], "r"))) err(2, files.names[j+i]); merge(MAXFCT-1-16, last, get, tout, put, ftbl); } else { for (i = 0; i< last; i++) rewind(l_fstack[i+j].fp); merge(files.top+j, last, get, tout, put, ftbl); } if (nfiles > 16) l_fstack[j/16].fp = tout; } nfiles = (nfiles + 15) / 16; if (nfiles == 1) nfiles = 0; if (binno < 0) { binno = 0; get = geteasy; files.top = 0; } } } void merge(infl0, nfiles, get, outfp, put, ftbl) int infl0, nfiles; int (*get)(); void (*put)(struct recheader *, FILE *); FILE *outfp; struct field *ftbl; { int c, i, j; union f_handle dummy = {0}; struct mfile *flist[16], *cfile; for (i = j = 0; i < nfiles; i++) { cfile = (MFILE *) (buffer + i * LALIGN(MAXLLEN + sizeof(TMFILE))); cfile->flno = j + infl0; cfile->end = cfile->rec->data + MAXLLEN; for (c = 1; c == 1;) { if (EOF == (c = get(j+infl0, dummy, nfiles, cfile->rec, cfile->end, ftbl))) { --i; --nfiles; break; } if (i) c = insert(flist, &cfile, i, !DELETE); else flist[0] = cfile; } j++; } if (nfiles > 0) { cfile = cfilebuf; cfile->flno = flist[0]->flno; cfile->end = cfile->rec->data + MAXLLEN; while (nfiles) { for (c = 1; c == 1;) { if (EOF == (c = get(cfile->flno, dummy, nfiles, cfile->rec, cfile->end, ftbl))) { put(flist[0]->rec, outfp); memmove(flist, flist + 1, sizeof(MFILE *) * (--nfiles)); cfile->flno = flist[0]->flno; break; } if (!(c = insert(flist, &cfile, nfiles, DELETE))) put(cfile->rec, outfp); } } } } /* * if delete: inserts *rec in flist, deletes flist[0], and leaves it in *rec; * otherwise just inserts *rec in flist. */ static int insert(flist, rec, ttop, delete) struct mfile **flist, **rec; int delete, ttop; /* delete = 0 or 1 */ { register struct mfile *tmprec; register int top, mid, bot = 0, cmpv = 1; tmprec = *rec; top = ttop; for (mid = top/2; bot +1 != top; mid = (bot+top)/2) { cmpv = cmp(tmprec->rec, flist[mid]->rec); if (cmpv < 0) top = mid; else if (cmpv > 0) bot = mid; else { if (!UNIQUE) bot = mid - 1; break; } } if (delete) { if (UNIQUE) { if (!bot && cmpv) cmpv = cmp(tmprec->rec, flist[0]->rec); if (!cmpv) return(1); } tmprec = flist[0]; if (bot) memmove(flist, flist+1, bot * sizeof(MFILE **)); flist[bot] = *rec; *rec = tmprec; (*rec)->flno = (*flist)->flno; return (0); } else { if (!bot && !(UNIQUE && !cmpv)) { cmpv = cmp(tmprec->rec, flist[0]->rec); if (cmpv < 0) bot = -1; } if (UNIQUE && !cmpv) return (1); bot++; memmove(flist + bot+1, flist + bot, (ttop - bot) * sizeof(MFILE **)); flist[bot] = *rec; return (0); } } /* * check order on one file */ void order(infile, get, ftbl) union f_handle infile; int (*get)(); struct field *ftbl; { u_char *end; int c; struct recheader *crec, *prec, *trec; if (!SINGL_FLD) linebuf = malloc(MAXLLEN); buffer = malloc(2 * (MAXLLEN + sizeof(TRECHEADER))); end = buffer + 2 * (MAXLLEN + sizeof(TRECHEADER)); crec = (RECHEADER *) buffer; prec = (RECHEADER *) (buffer + MAXLLEN + sizeof(TRECHEADER)); wts = ftbl->weights; if (SINGL_FLD && ftbl->flags & F) wts1 = ftbl->flags & R ? Rascii : ascii; else wts1 = 0; if (0 == get(-1, infile, 1, prec, end, ftbl)) while (0 == get(-1, infile, 1, crec, end, ftbl)) { if (0 < (c = cmp(prec, crec))) { crec->data[crec->length-1] = 0; errx(1, "found disorder: %s", crec->data+crec->offset); } if (UNIQUE && !c) { crec->data[crec->length-1] = 0; errx(1, "found non-uniqueness: %s", crec->data+crec->offset); } trec = prec; prec = crec; crec = trec; } exit(0); } static int cmp(rec1, rec2) struct recheader *rec1, *rec2; { register r; register u_char *pos1, *pos2, *end; register u_char *cwts; for (cwts = wts; cwts; cwts = (cwts == wts1 ? 0 : wts1)) { pos1 = rec1->data; pos2 = rec2->data; if (!SINGL_FLD && UNIQUE) end = pos1 + min(rec1->offset, rec2->offset); else end = pos1 + min(rec1->length, rec2->length); for (; pos1 < end; ) { if ((r = cwts[*pos1++] - cwts[*pos2++])) return (r); } } return (0); }