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));
115 if (flags & SHAPEONLY) {
116 printf("%d %d\n", irows, icols);
129 register char **ep = 0;
130 int multisep = (flags & ONEISEPONLY ? 0 : 1);
131 int nullpad = flags & NULLPAD;
136 if (flags & SKIPPRINT)
140 if (flags & NOARGS && curlen < owidth)
142 if (flags & ONEPERLINE)
144 else /* count cols on first line */
145 for (p = curline, endp = curline + curlen; p < endp; p++) {
146 if (*p == isep && multisep)
149 while (*p && *p != isep)
155 if (flags & ONEPERLINE) {
162 for (p = curline, endp = curline + curlen; p < endp; p++) {
163 if (*p == isep && multisep)
164 continue; /* eat up column separators */
165 if (*p == isep) /* must be an empty column */
167 else /* store column entry */
169 while (p < endp && *p != isep)
170 p++; /* find end of entry */
171 *p = '\0'; /* mark end of entry */
172 if (maxlen < p - *ep) /* update maxlen */
174 ep++; /* prepare for next entry */
176 irows++; /* update row count */
177 if (nullpad) { /* pad missing entries */
178 padto = elem + irows * icols;
182 if (ep > endelem) /* if low on pointers */
183 ep = getptrs(ep); /* get some more */
184 } while (getline() != EOF);
185 *ep = 0; /* mark end of pointers */
193 register int i, j, k;
196 if (flags & TRANSPOSE)
197 for (i = 0; i < orows; i++) {
198 for (j = i; j < nelem; j += orows)
199 prints(ep[j], (j - i) / orows);
203 for (i = k = 0; i < orows; i++) {
204 for (j = 0; j < ocols; j++, k++)
217 register char *p = s;
221 n = (flags & ONEOSEPONLY ? 1 : colwidths[col] - (p - s));
222 if (flags & RIGHTADJUST)
235 "usage: rs [-[csCS][x][kKgGw][N]tTeEnyjhHmz] [rows [cols]]\n");
252 gutter += maxlen * propgutter / 100.0;
253 colw = maxlen + gutter;
254 if (flags & MTRANSPOSE) {
258 else if (orows == 0 && ocols == 0) { /* decide rows and cols */
259 ocols = owidth / colw;
261 warnx("display width %d is less than column width %d",
265 orows = nelem / ocols + (nelem % ocols ? 1 : 0);
267 else if (orows == 0) /* decide on rows */
268 orows = nelem / ocols + (nelem % ocols ? 1 : 0);
269 else if (ocols == 0) /* decide on cols */
270 ocols = nelem / orows + (nelem % orows ? 1 : 0);
271 lp = elem + orows * ocols;
272 while (lp > endelem) {
273 getptrs(elem + nelem);
274 lp = elem + orows * ocols;
276 if (flags & RECYCLE) {
277 for (ep = elem + nelem; ep < lp; ep++)
281 if (!(colwidths = (short *) malloc(ocols * sizeof(short))))
283 if (flags & SQUEEZE) {
284 if (flags & TRANSPOSE)
285 for (ep = elem, i = 0; i < ocols; i++) {
286 for (j = 0; j < orows; j++)
287 if ((n = strlen(*ep++)) > max)
289 colwidths[i] = max + gutter;
292 for (i = 0; i < ocols; i++) {
293 for (j = i; j < nelem; j += ocols)
294 if ((n = strlen(ep[j])) > max)
296 colwidths[i] = max + gutter;
299 /* for (i = 0; i < orows; i++) {
300 for (j = i; j < nelem; j += orows)
301 prints(ep[j], (j - i) / orows);
305 for (i = 0; i < orows; i++) {
306 for (j = 0; j < ocols; j++)
311 for (i = 0; i < ocols; i++)
313 if (!(flags & NOTRIMENDCOL)) {
314 if (flags & RIGHTADJUST)
315 colwidths[0] -= gutter;
317 colwidths[ocols - 1] = 0;
320 if (n > nelem && (flags & RECYCLE))
322 /*for (i = 0; i < ocols; i++)
323 warnx("%d is colwidths, nelem %d", colwidths[i], nelem);*/
327 char ibuf[BSIZE]; /* two screenfuls should do */
330 getline() /* get line; maintain curline, curlen; manage storage */
332 static int putlength;
333 static char *endblock = ibuf + BSIZE;
339 putlength = flags & DETAILSHAPE;
341 else if (skip <= 0) { /* don't waste storage */
342 curline += curlen + 1;
343 if (putlength) /* print length, recycle storage */
344 printf(" %d line %d\n", curlen, irows);
346 if (!putlength && endblock - curline < BUFSIZ) { /* need storage */
347 /*ww = endblock-curline; tt += ww;*/
348 /*printf("#wasted %d total %d\n",ww,tt);*/
349 if (!(curline = (char *) malloc(BSIZE)))
350 errx(1, "file too large");
351 endblock = curline + BSIZE;
352 /*printf("#endb %d curline %d\n",endblock,curline);*/
354 for (p = curline, i = 1; i < BUFSIZ; *p++ = c, i++)
355 if ((c = getchar()) == EOF || c == '\n')
366 register char **p, **ep;
369 allocsize += allocsize;
370 if (!(p = (char **) malloc(allocsize * sizeof(char *))))
372 if ((endelem = p + allocsize - icols) <= p) {
394 flags |= NOARGS | TRANSPOSE;
396 while (--ac && **++av == '-')
397 for (p = *av+1; *p; p++)
404 case 'c': /* input col. separator */
405 flags |= ONEISEPONLY;
406 case 's': /* one or more allowed */
410 isep = '\t'; /* default is ^I */
413 flags |= ONEOSEPONLY;
418 osep = '\t'; /* default is ^I */
420 case 'w': /* window width, default 80 */
421 p = getnum(&owidth, p, 0);
423 errx(1, "width must be a positive integer");
425 case 'K': /* skip N lines */
427 case 'k': /* skip, do not print */
428 p = getnum(&skip, p, 0);
433 flags |= NOTRIMENDCOL;
435 case 'g': /* gutter space */
436 p = getnum(&gutter, p, 0);
439 p = getnum(&propgutter, p, 0);
441 case 'e': /* each line is an entry */
447 case 'j': /* right adjust */
448 flags |= RIGHTADJUST;
450 case 'n': /* null padding for missing values */
456 case 'H': /* print shape only */
457 flags |= DETAILSHAPE;
461 case 'z': /* squeeze col width */
465 ipagespace = atoi(++p); (default is 1)
467 case 'o': /* col order */
468 p = getlist(&cord, p);
472 p = getlist(&icbd, p);
476 p = getlist(&ocbd, p);
485 opages = atoi(av[2]);*/
493 errx(1, "too many arguments");
502 register int count = 1;
505 for (t = p + 1; *t; t++) {
508 "option %.1s requires a list of unsigned numbers separated by commas", t);
510 while (*t && isdigit(*t))
515 if (!(*list = (short *) malloc(count * sizeof(short))))
516 errx(1, "no list space");
518 for (t = p + 1; *t; t++) {
519 (*list)[count++] = atoi(t);
520 printf("++ %d ", (*list)[count-1]);
522 while (*t && isdigit(*t))
532 getnum(num, p, strict) /* num = number p points to; if (strict) complain */
533 int *num, strict; /* returns pointer to end of num */
536 register char *t = p;
538 if (!isdigit(*++t)) {
539 if (strict || *t == '-' || *t == '+')
540 errx(1, "option %.1s requires an unsigned integer", p);