1 /* $NetBSD: files.c,v 1.40 2009/10/07 21:03:29 dsl Exp $ */
4 * Copyright (c) 2000-2003 The NetBSD Foundation, Inc.
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Ben Harris and Jaromir Dolecek.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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.
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.
34 * The Regents of the University of California. All rights reserved.
36 * This code is derived from software contributed to Berkeley by
39 * Redistribution and use in source and binary forms, with or without
40 * modification, are permitted provided that the following conditions
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.
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
69 /* Align records in temporary files to avoid misaligned copies */
70 #define REC_ROUNDUP(n) (((n) + sizeof (long) - 1) & ~(sizeof (long) - 1))
72 static ssize_t seq(FILE *, u_char **);
75 * this is called when there is no special key. It's only called
76 * in the first fsort pass.
83 makeline_copydown(RECHEADER *recbuf)
85 memmove(recbuf->data, opos, osz);
89 makeline(FILE *fp, RECHEADER *recbuf, u_char *bufend,
90 struct field __attribute ((unused)) *dummy2)
98 * Buffer shortage is solved by either of two ways:
99 * o flush previous buffered data and start using the
101 * makeline_copydown() above must be called.
104 * This code has relied on realloc changing 'bufend',
105 * but that isn't necessarily true.
111 while (pos < bufend) {
114 if (pos == recbuf->data) {
118 /* Add terminator to partial line */
124 recbuf->length = pos - recbuf->data;
125 recbuf->keylen = recbuf->length - 1;
130 /* Ran out of buffer space... */
131 if (recbuf->data < bufend) {
132 /* Remember where the partial record is */
133 osz = pos - recbuf->data;
140 * This generates keys. It's only called in the first fsort pass
143 makekey(FILE *fp, RECHEADER *recbuf, u_char *bufend, struct field *ftbl)
145 static u_char *line_data;
146 static ssize_t line_size;
147 static int overflow = 0;
149 /* We get re-entered after returning BUFFEND - save old data */
151 overflow = enterkey(recbuf, bufend, line_data, line_size, ftbl);
152 return overflow ? BUFFEND : 0;
155 line_size = seq(fp, &line_data);
156 if (line_size == 0) {
161 if (line_size > bufend - recbuf->data) {
164 overflow = enterkey(recbuf, bufend, line_data, line_size, ftbl);
166 return overflow ? BUFFEND : 0;
170 * get a line of input from fp
173 seq(FILE *fp, u_char **line)
176 static size_t buf_size = DEFLLEN;
182 /* one-time initialization */
183 buf = malloc(buf_size);
185 err(2, "malloc of linebuf for %zu bytes failed",
189 end = buf + buf_size;
191 while ((c = getc(fp)) != EOF) {
198 /* Long line - double size of buffer */
199 /* XXX: Check here for stupidly long lines */
201 new_buf = realloc(buf, buf_size);
203 err(2, "realloc of linebuf to %zu bytes failed",
206 end = new_buf + buf_size;
207 pos = new_buf + (pos - buf);
213 /* EOF part way through line - add line terminator */
223 * write a key/line pair to a temporary file
226 putrec(const RECHEADER *rec, FILE *fp)
228 EWRITE(rec, 1, REC_ROUNDUP(offsetof(RECHEADER, data) + rec->length), fp);
232 * write a line to output
235 putline(const RECHEADER *rec, FILE *fp)
237 EWRITE(rec->data+rec->offset, 1, rec->length - rec->offset, fp);
241 * write dump of key to output (for -Dk)
244 putkeydump(const RECHEADER *rec, FILE *fp)
246 EWRITE(rec, 1, REC_ROUNDUP(offsetof(RECHEADER, data) + rec->offset), fp);
250 * get a record from a temporary file. (Used by merge sort.)
253 geteasy(FILE *fp, RECHEADER *rec, u_char *end,
254 struct field __attribute__ ((unused)) *dummy2)
259 (void)sizeof (char[offsetof(RECHEADER, length) == 0 ? 1 : -1]);
261 if ((u_char *)(rec + 1) > end)
263 if (!fread(&rec->length, 1, sizeof rec->length, fp)) {
267 file_len = REC_ROUNDUP(offsetof(RECHEADER, data) + rec->length);
268 if (end - rec->data < (ptrdiff_t)file_len) {
269 for (i = sizeof rec->length - 1; i >= 0; i--)
270 ungetc(*((char *) rec + i), fp);
274 fread(&rec->length + 1, file_len - sizeof rec->length, 1, fp);