2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1991, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * Keith Muller of the University of California, San Diego and Lance
9 * Visser of Convex Computer Corporation.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 static char sccsid[] = "@(#)conv.c 8.3 (Berkeley) 4/2/94";
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
44 #include <sys/param.h>
55 * Copy input to output. Input is buffered until reaches obs, and then
56 * output until less than obs remains. Only a single buffer is used.
57 * Worst case buffer calculation is (ibs + obs - 1).
66 if ((t = ctab) != NULL)
67 for (inp = in.dbp - (cnt = in.dbrcnt); cnt--; ++inp)
70 /* Make the output buffer look right. */
74 if (in.dbcnt >= out.dbsz) {
75 /* If the output buffer is full, write it. */
79 * dd_out copies the leftover output to the beginning of
80 * the buffer and resets the output buffer. Reset the
81 * input buffer to match it.
91 /* Just update the count, everything is already in the buffer. */
97 * Copy variable length newline terminated records with a max size cbsz
98 * bytes to output. Records less than cbs are padded with spaces.
100 * max in buffer: MAX(ibs, cbsz)
101 * max out buffer: obs + cbsz
113 * Record truncation can cross block boundaries. If currently in a
114 * truncation state, keep tossing characters until reach a newline.
115 * Start at the beginning of the buffer, as the input buffer is always
119 for (inp = in.db, cnt = in.dbrcnt; cnt && *inp++ != '\n'; --cnt)
127 /* Adjust the input buffer numbers. */
129 in.dbp = inp + cnt - 1;
133 * Copy records (max cbsz size chunks) into the output buffer. The
134 * translation is done as we copy into the output buffer.
137 for (inp = in.dbp - in.dbcnt, outp = out.dbp; in.dbcnt;) {
138 maxlen = MIN(cbsz, (size_t)in.dbcnt);
139 if ((t = ctab) != NULL)
140 for (cnt = 0; cnt < maxlen && (ch = *inp++) != '\n';
144 for (cnt = 0; cnt < maxlen && (ch = *inp++) != '\n';
148 * Check for short record without a newline. Reassemble the
151 if (ch != '\n' && (size_t)in.dbcnt < cbsz) {
152 (void)memmove(in.db, in.dbp - in.dbcnt, in.dbcnt);
156 /* Adjust the input buffer numbers. */
161 /* Pad short records with spaces. */
163 (void)memset(outp, ctab ? ctab[' '] : ' ', cbsz - cnt);
166 * If the next character wouldn't have ended the
167 * block, it's a truncation.
169 if (!in.dbcnt || *inp != '\n')
172 /* Toss characters to a newline. */
173 for (; in.dbcnt && *inp++ != '\n'; --in.dbcnt)
181 /* Adjust output buffer numbers. */
183 if ((out.dbcnt += cbsz) >= out.dbsz)
187 in.dbp = in.db + in.dbcnt;
194 * Copy any remaining data into the output buffer and pad to a record.
195 * Don't worry about truncation or translation, the input buffer is
196 * always empty when truncating, and no characters have been added for
197 * translation. The bottom line is that anything left in the input
198 * buffer is a truncated record. Anything left in the output buffer
199 * just wasn't big enough.
203 (void)memmove(out.dbp, in.dbp - in.dbcnt, in.dbcnt);
204 (void)memset(out.dbp + in.dbcnt, ctab ? ctab[' '] : ' ',
211 * Convert fixed length (cbsz) records to variable length. Deletes any
212 * trailing blanks and appends a newline.
214 * max in buffer: MAX(ibs, cbsz) + cbsz
215 * max out buffer: obs + cbsz
224 /* Translation and case conversion. */
225 if ((t = ctab) != NULL)
226 for (inp = in.dbp - (cnt = in.dbrcnt); cnt--; ++inp)
229 * Copy records (max cbsz size chunks) into the output buffer. The
230 * translation has to already be done or we might not recognize the
233 for (inp = in.db; (size_t)in.dbcnt >= cbsz; inp += cbsz, in.dbcnt -= cbsz) {
234 for (t = inp + cbsz - 1; t >= inp && *t == ' '; --t)
238 (void)memmove(out.dbp, inp, cnt);
243 if (++out.dbcnt >= out.dbsz)
247 (void)memmove(in.db, in.dbp - in.dbcnt, in.dbcnt);
248 in.dbp = in.db + in.dbcnt;
258 warnx("%s: short input record", in.name);
259 for (t = in.db + in.dbcnt - 1; t >= in.db && *t == ' '; --t)
263 (void)memmove(out.dbp, in.db, cnt);