1 /* $NetBSD: append.c,v 1.20 2009/08/22 10:53:28 dsl Exp $ */ 2 3 /*- 4 * Copyright (c) 2000-2003 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Ben Harris and Jaromir Dolecek. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 * POSSIBILITY OF SUCH DAMAGE. 30 */ 31 32 /*- 33 * Copyright (c) 1993 34 * The Regents of the University of California. All rights reserved. 35 * 36 * This code is derived from software contributed to Berkeley by 37 * Peter McIlroy. 38 * 39 * Redistribution and use in source and binary forms, with or without 40 * modification, are permitted provided that the following conditions 41 * are met: 42 * 1. Redistributions of source code must retain the above copyright 43 * notice, this list of conditions and the following disclaimer. 44 * 2. Redistributions in binary form must reproduce the above copyright 45 * notice, this list of conditions and the following disclaimer in the 46 * documentation and/or other materials provided with the distribution. 47 * 3. Neither the name of the University nor the names of its contributors 48 * may be used to endorse or promote products derived from this software 49 * without specific prior written permission. 50 * 51 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 52 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 53 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 54 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 55 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 56 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 57 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 58 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 59 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 60 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 61 * SUCH DAMAGE. 62 */ 63 64 #include "sort.h" 65 66 #ifndef lint 67 __RCSID("$NetBSD: append.c,v 1.20 2009/08/22 10:53:28 dsl Exp $"); 68 __SCCSID("@(#)append.c 8.1 (Berkeley) 6/6/93"); 69 #endif /* not lint */ 70 71 #include <stdlib.h> 72 #include <string.h> 73 74 static int 75 wt_cmp(const u_char *a, const u_char *b, size_t len, u_char *wts) 76 { 77 size_t i; 78 79 for (i = 0; i < len; i++) { 80 if (wts[*a++] != wts[*b++]) 81 return 1; 82 } 83 84 return 0; 85 } 86 87 /* 88 * copy sorted lines to output; check for uniqueness 89 */ 90 void 91 append(const u_char **keylist, int nelem, FILE *fp, put_func_t put, u_char *wts) 92 { 93 const u_char **cpos, **lastkey; 94 const struct recheader *crec, *prec; 95 size_t plen; 96 97 lastkey = keylist + nelem; 98 if (!UNIQUE || wts == NULL) { 99 for (cpos = keylist; cpos < lastkey; cpos++) 100 put((const RECHEADER *)(*cpos - REC_DATA_OFFSET), fp); 101 return; 102 } 103 104 if (nelem == 0) 105 return; 106 107 cpos = keylist; 108 prec = (const RECHEADER *) (*cpos - REC_DATA_OFFSET); 109 110 if (!SINGL_FLD) { 111 /* Key for each line is already in adjacent bytes */ 112 plen = prec->offset; 113 for (cpos = &keylist[1]; cpos < lastkey; cpos++) { 114 crec = (const RECHEADER *) (*cpos - REC_DATA_OFFSET); 115 if (crec->offset == plen 116 && memcmp(crec->data, prec->data, plen) == 0) { 117 /* Duplicate key */ 118 continue; 119 } 120 put(prec, fp); 121 prec = crec; 122 plen = prec->offset; 123 } 124 put(prec, fp); 125 return; 126 } 127 128 /* We have to compare the raw data - which means applying weight */ 129 130 /* Key for each line is already in adjacent bytes */ 131 plen = prec->length; 132 for (cpos = &keylist[1]; cpos < lastkey; cpos++) { 133 crec = (const RECHEADER *) (*cpos - REC_DATA_OFFSET); 134 if (crec->length == plen 135 && wt_cmp(crec->data, prec->data, plen, wts) == 0) { 136 /* Duplicate key */ 137 continue; 138 } 139 put(prec, fp); 140 prec = crec; 141 plen = prec->length; 142 } 143 put(prec, fp); 144 return; 145 } 146