3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 static const char copyright[] =
36 "@(#) Copyright (c) 1993\n\
37 The Regents of the University of California. All rights reserved.\n";
42 static char sccsid[] = "@(#)rs.c 8.1 (Berkeley) 6/6/93";
44 static const char rcsid[] =
49 * rs - reshape a data array
50 * Author: John Kunze, Office of Comp. Affairs, UCB
51 * BEWARE: lots of unfinished edges
61 #define TRANSPOSE 000001
62 #define MTRANSPOSE 000002
63 #define ONEPERLINE 000004
64 #define ONEISEPONLY 000010
65 #define ONEOSEPONLY 000020
66 #define NOTRIMENDCOL 000040
67 #define SQUEEZE 000100
68 #define SHAPEONLY 000200
69 #define DETAILSHAPE 000400
70 #define RIGHTADJUST 001000
71 #define NULLPAD 002000
72 #define RECYCLE 004000
73 #define SKIPPRINT 010000
74 #define ICOLBOUNDS 020000
75 #define OCOLBOUNDS 040000
76 #define ONEPERCHAR 0100000
77 #define NOARGS 0200000
87 int allocsize = BUFSIZ;
94 char isep = ' ', osep = ' ';
95 int owidth = 80, gutter = 2;
97 void getargs __P((int, char *[]));
98 void getfile __P((void));
99 int getline __P((void));
100 char *getlist __P((short **, char *));
101 char *getnum __P((int *, char *, int));
102 char **getptrs __P((char **));
103 void prepfile __P((void));
104 void prints __P((char *, int));
105 void putfile __P((void));
106 static void usage __P((void));
108 #define INCR(ep) do { \
109 if (++ep >= endelem) \
120 if (flags & SHAPEONLY) {
121 printf("%d %d\n", irows, icols);
135 int multisep = (flags & ONEISEPONLY ? 0 : 1);
136 int nullpad = flags & NULLPAD;
141 if (flags & SKIPPRINT)
145 if (flags & NOARGS && curlen < owidth)
147 if (flags & ONEPERLINE)
149 else /* count cols on first line */
150 for (p = curline, endp = curline + curlen; p < endp; p++) {
151 if (*p == isep && multisep)
154 while (*p && *p != isep)
160 if (flags & ONEPERLINE) {
162 INCR(ep); /* prepare for next entry */
168 for (p = curline, endp = curline + curlen; p < endp; p++) {
169 if (*p == isep && multisep)
170 continue; /* eat up column separators */
171 if (*p == isep) /* must be an empty column */
173 else /* store column entry */
175 while (p < endp && *p != isep)
176 p++; /* find end of entry */
177 *p = '\0'; /* mark end of entry */
178 if (maxlen < p - *ep) /* update maxlen */
180 INCR(ep); /* prepare for next entry */
182 irows++; /* update row count */
183 if (nullpad) { /* pad missing entries */
184 padto = elem + irows * icols;
190 } while (getline() != EOF);
191 *ep = 0; /* mark end of pointers */
199 register int i, j, k;
202 if (flags & TRANSPOSE)
203 for (i = 0; i < orows; i++) {
204 for (j = i; j < nelem; j += orows)
205 prints(ep[j], (j - i) / orows);
209 for (i = k = 0; i < orows; i++) {
210 for (j = 0; j < ocols; j++, k++)
223 register char *p = s;
227 n = (flags & ONEOSEPONLY ? 1 : colwidths[col] - (p - s));
228 if (flags & RIGHTADJUST)
241 "usage: rs [-[csCS][x][kKgGw][N]tTeEnyjhHmz] [rows [cols]]\n");
258 gutter += maxlen * propgutter / 100.0;
259 colw = maxlen + gutter;
260 if (flags & MTRANSPOSE) {
264 else if (orows == 0 && ocols == 0) { /* decide rows and cols */
265 ocols = owidth / colw;
267 warnx("display width %d is less than column width %d",
273 orows = nelem / ocols + (nelem % ocols ? 1 : 0);
275 else if (orows == 0) /* decide on rows */
276 orows = nelem / ocols + (nelem % ocols ? 1 : 0);
277 else if (ocols == 0) /* decide on cols */
278 ocols = nelem / orows + (nelem % orows ? 1 : 0);
279 lp = elem + orows * ocols;
280 while (lp > endelem) {
281 getptrs(elem + nelem);
282 lp = elem + orows * ocols;
284 if (flags & RECYCLE) {
285 for (ep = elem + nelem; ep < lp; ep++)
289 if (!(colwidths = (short *) malloc(ocols * sizeof(short))))
291 if (flags & SQUEEZE) {
293 if (flags & TRANSPOSE)
294 for (i = 0; i < ocols; i++) {
296 for (j = 0; *ep != NULL && j < orows; j++)
297 if ((n = strlen(*ep++)) > max)
299 colwidths[i] = max + gutter;
302 for (i = 0; i < ocols; i++) {
304 for (j = i; j < nelem; j += ocols)
305 if ((n = strlen(ep[j])) > max)
307 colwidths[i] = max + gutter;
310 /* for (i = 0; i < orows; i++) {
311 for (j = i; j < nelem; j += orows)
312 prints(ep[j], (j - i) / orows);
316 for (i = 0; i < orows; i++) {
317 for (j = 0; j < ocols; j++)
322 for (i = 0; i < ocols; i++)
324 if (!(flags & NOTRIMENDCOL)) {
325 if (flags & RIGHTADJUST)
326 colwidths[0] -= gutter;
328 colwidths[ocols - 1] = 0;
331 if (n > nelem && (flags & RECYCLE))
333 /*for (i = 0; i < ocols; i++)
334 warnx("%d is colwidths, nelem %d", colwidths[i], nelem);*/
338 char ibuf[BSIZE]; /* two screenfuls should do */
341 getline() /* get line; maintain curline, curlen; manage storage */
343 static int putlength;
344 static char *endblock = ibuf + BSIZE;
350 putlength = flags & DETAILSHAPE;
352 else if (skip <= 0) { /* don't waste storage */
353 curline += curlen + 1;
354 if (putlength) /* print length, recycle storage */
355 printf(" %d line %d\n", curlen, irows);
357 if (!putlength && endblock - curline < BUFSIZ) { /* need storage */
358 /*ww = endblock-curline; tt += ww;*/
359 /*printf("#wasted %d total %d\n",ww,tt);*/
360 if (!(curline = (char *) malloc(BSIZE)))
361 errx(1, "file too large");
362 endblock = curline + BSIZE;
363 /*printf("#endb %d curline %d\n",endblock,curline);*/
365 for (p = curline, i = 1; i < BUFSIZ; *p++ = c, i++)
366 if ((c = getchar()) == EOF || c == '\n')
379 allocsize += allocsize;
380 p = (char **)realloc(elem, allocsize * sizeof(char *));
385 endelem = (elem = p) + allocsize;
397 flags |= NOARGS | TRANSPOSE;
399 while (--ac && **++av == '-')
400 for (p = *av+1; *p; p++)
407 case 'c': /* input col. separator */
408 flags |= ONEISEPONLY;
409 case 's': /* one or more allowed */
413 isep = '\t'; /* default is ^I */
416 flags |= ONEOSEPONLY;
421 osep = '\t'; /* default is ^I */
423 case 'w': /* window width, default 80 */
424 p = getnum(&owidth, p, 0);
426 errx(1, "width must be a positive integer");
428 case 'K': /* skip N lines */
430 case 'k': /* skip, do not print */
431 p = getnum(&skip, p, 0);
436 flags |= NOTRIMENDCOL;
438 case 'g': /* gutter space */
439 p = getnum(&gutter, p, 0);
442 p = getnum(&propgutter, p, 0);
444 case 'e': /* each line is an entry */
450 case 'j': /* right adjust */
451 flags |= RIGHTADJUST;
453 case 'n': /* null padding for missing values */
459 case 'H': /* print shape only */
460 flags |= DETAILSHAPE;
464 case 'z': /* squeeze col width */
468 ipagespace = atoi(++p); (default is 1)
470 case 'o': /* col order */
471 p = getlist(&cord, p);
475 p = getlist(&icbd, p);
479 p = getlist(&ocbd, p);
488 opages = atoi(av[2]);*/
496 errx(1, "too many arguments");
505 register int count = 1;
508 for (t = p + 1; *t; t++) {
511 "option %.1s requires a list of unsigned numbers separated by commas", t);
513 while (*t && isdigit(*t))
518 if (!(*list = (short *) malloc(count * sizeof(short))))
519 errx(1, "no list space");
521 for (t = p + 1; *t; t++) {
522 (*list)[count++] = atoi(t);
523 printf("++ %d ", (*list)[count-1]);
525 while (*t && isdigit(*t))
535 getnum(num, p, strict) /* num = number p points to; if (strict) complain */
536 int *num, strict; /* returns pointer to end of num */
539 register char *t = p;
541 if (!isdigit(*++t)) {
542 if (strict || *t == '-' || *t == '+')
543 errx(1, "option %.1s requires an unsigned integer", p);