]>
git.cameronkatri.com Git - apple_cmds.git/blob - text_cmds/join/join.c
2 * Copyright (c) 1991, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Steve Hayman of the Computer Science Department, Indiana University,
7 * Michiro Hikida and David Goodenough.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 static const char copyright
[] =
40 "@(#) Copyright (c) 1991, 1993, 1994\n\
41 The Regents of the University of California. All rights reserved.\n";
46 static char sccsid
[] = "@(#)join.c 8.6 (Berkeley) 5/4/95";
49 #include <sys/cdefs.h>
50 __FBSDID("$FreeBSD: src/usr.bin/join/join.c,v 1.20 2004/08/26 06:28:05 maxim Exp $");
52 #include <sys/param.h>
66 #include "get_compat.h"
68 #define COMPAT_MODE(func, mode) 1
72 * There's a structure per input file which encapsulates the state of the
73 * file. We repeatedly read lines from each file until we've read in all
74 * the consecutive lines from the file with a common join field. Then we
75 * compare the set of lines with an equivalent set from the other file.
78 char *line
; /* line */
79 u_long linealloc
; /* line allocated count */
80 char **fields
; /* line field(s) */
81 u_long fieldcnt
; /* line field(s) count */
82 u_long fieldalloc
; /* line field(s) allocated count */
86 FILE *fp
; /* file descriptor */
87 u_long joinf
; /* join field (-1, -2, -j) */
88 int unpair
; /* output unpairable lines (-a) */
89 u_long number
; /* 1 for file 1, 2 for file 2 */
91 LINE
*set
; /* set of lines with same field */
92 int pushbool
; /* if pushback is set */
93 u_long pushback
; /* line on the stack */
94 u_long setcnt
; /* set count */
95 u_long setalloc
; /* set allocated count */
97 INPUT input1
= { NULL
, 0, 0, 1, NULL
, 0, 0, 0, 0 },
98 input2
= { NULL
, 0, 0, 2, NULL
, 0, 0, 0, 0 };
101 u_long filenum
; /* file number */
102 u_long fieldno
; /* field number */
104 OLIST
*olist
; /* output field list */
105 u_long olistcnt
; /* output field list count */
106 u_long olistalloc
; /* output field allocated count */
108 int joinout
= 1; /* show lines with matched join fields (-v) */
109 int needsep
; /* need separator character */
110 int spans
= 1; /* span multiple delimiters (-t) */
111 char *empty
; /* empty field replacement string (-e) */
112 static wchar_t default_tabchar
[] = L
" \t";
113 wchar_t *tabchar
= default_tabchar
;/* delimiter characters (-t) */
115 int cmp(LINE
*, u_long
, LINE
*, u_long
);
116 void fieldarg(char *);
117 void joinlines(INPUT
*, INPUT
*);
118 int mbscoll(const char *, const char *);
119 char *mbssep(char **, const wchar_t *);
120 void obsolete(char **);
121 void outfield(LINE
*, u_long
, int);
122 void outoneline(INPUT
*, LINE
*);
123 void outtwoline(INPUT
*, LINE
*, INPUT
*, LINE
*);
125 wchar_t *towcs(const char *);
129 main(int argc
, char *argv
[])
132 int aflag
, ch
, cval
, vflag
;
135 setlocale(LC_ALL
, "");
141 if (!COMPAT_MODE("bin/join", "Unix2003"))
143 while ((ch
= getopt(argc
, argv
, "\01a:e:j:1:2:o:t:v:")) != -1) {
145 case '\01': /* See comment in obsolete(). */
147 F1
->unpair
= F2
->unpair
= 1;
150 if ((F1
->joinf
= strtol(optarg
, &end
, 10)) < 1)
151 errx(1, "-1 option field number less than 1");
153 errx(1, "illegal field number -- %s", optarg
);
157 if ((F2
->joinf
= strtol(optarg
, &end
, 10)) < 1)
158 errx(1, "-2 option field number less than 1");
160 errx(1, "illegal field number -- %s", optarg
);
165 switch(strtol(optarg
, &end
, 10)) {
173 errx(1, "-a option file number not 1 or 2");
177 errx(1, "illegal file number -- %s", optarg
);
183 if ((F1
->joinf
= F2
->joinf
=
184 strtol(optarg
, &end
, 10)) < 1)
185 errx(1, "-j option field number less than 1");
187 errx(1, "illegal field number -- %s", optarg
);
196 if (mbrtowc(&tabchar
[0], optarg
, MB_LEN_MAX
, NULL
) !=
198 errx(1, "illegal tab character specification");
204 switch (strtol(optarg
, &end
, 10)) {
212 errx(1, "-v option file number not 1 or 2");
216 errx(1, "illegal file number -- %s", optarg
);
227 errx(1, "the -a and -v options are mutually exclusive");
229 if (argc
!= 2 || argv
[0]==NULL
|| argv
[1]==NULL
)
232 /* Open the files; "-" means stdin. */
233 if (!strcmp(*argv
, "-"))
235 else if ((F1
->fp
= fopen(*argv
, "r")) == NULL
)
238 if (!strcmp(*argv
, "-"))
240 else if ((F2
->fp
= fopen(*argv
, "r")) == NULL
)
242 if (F1
->fp
== stdin
&& F2
->fp
== stdin
)
243 errx(1, "only one input file may be stdin");
247 while (F1
->setcnt
&& F2
->setcnt
) {
248 cval
= cmp(F1
->set
, F1
->joinf
, F2
->set
, F2
->joinf
);
250 /* Oh joy, oh rapture, oh beauty divine! */
255 } else if (cval
< 0) {
256 /* File 1 takes the lead... */
261 /* File 2 takes the lead... */
269 * Now that one of the files is used up, optionally output any
270 * remaining lines from the other file.
288 LINE
*lp
, *lastlp
, tmp
;
294 * Read all of the lines from an input file that have the same
298 for (lastlp
= NULL
;; ++F
->setcnt
) {
300 * If we're out of space to hold line structures, allocate
301 * more. Initialize the structure so that we know that this
304 if (F
->setcnt
== F
->setalloc
) {
307 if ((F
->set
= realloc(F
->set
,
308 F
->setalloc
* sizeof(LINE
))) == NULL
)
310 memset(F
->set
+ cnt
, 0, 50 * sizeof(LINE
));
312 /* re-set lastlp in case it moved */
314 lastlp
= &F
->set
[F
->setcnt
- 1];
318 * Get any pushed back line, else get the next line. Allocate
319 * space as necessary. If taking the line from the stack swap
320 * the two structures so that we don't lose space allocated to
321 * either structure. This could be avoided by doing another
322 * level of indirection, but it's probably okay as is.
324 lp
= &F
->set
[F
->setcnt
];
326 lastlp
= &F
->set
[F
->setcnt
- 1];
328 tmp
= F
->set
[F
->setcnt
];
329 F
->set
[F
->setcnt
] = F
->set
[F
->pushback
];
330 F
->set
[F
->pushback
] = tmp
;
334 if ((bp
= fgetln(F
->fp
, &len
)) == NULL
) {
340 if (lp
->linealloc
<= len
+ 1) {
341 lp
->linealloc
+= MAX(100, len
+ 1 - lp
->linealloc
);
343 realloc(lp
->line
, lp
->linealloc
)) == NULL
)
346 memmove(lp
->line
, bp
, len
);
348 /* Replace trailing newline, if it exists. */
349 if (bp
[len
- 1] == '\n')
350 lp
->line
[len
- 1] = '\0';
352 lp
->line
[len
] = '\0';
355 /* Split the line into fields, allocate space as necessary. */
357 while ((fieldp
= mbssep(&bp
, tabchar
)) != NULL
) {
358 if (spans
&& *fieldp
== '\0')
360 if (lp
->fieldcnt
== lp
->fieldalloc
) {
361 lp
->fieldalloc
+= 50;
362 if ((lp
->fields
= realloc(lp
->fields
,
363 lp
->fieldalloc
* sizeof(char *))) == NULL
)
366 lp
->fields
[lp
->fieldcnt
++] = fieldp
;
369 /* See if the join field value has changed. */
370 if (lastlp
!= NULL
&& cmp(lp
, F
->joinf
, lastlp
, F
->joinf
)) {
372 F
->pushback
= F
->setcnt
;
379 mbssep(char **stringp
, const wchar_t *delim
)
382 const wchar_t *spanp
;
386 if ((s
= *stringp
) == NULL
)
389 n
= mbrtowc(&c
, s
, MB_LEN_MAX
, NULL
);
390 if (n
== (size_t)-1 || n
== (size_t)-2)
391 errc(1, EILSEQ
, NULL
); /* XXX */
395 if ((sc
= *spanp
++) == c
) {
408 cmp(LINE
*lp1
, u_long fieldno1
, LINE
*lp2
, u_long fieldno2
)
410 if (lp1
->fieldcnt
<= fieldno1
)
411 return (lp2
->fieldcnt
<= fieldno2
? 0 : 1);
412 if (lp2
->fieldcnt
<= fieldno2
)
414 return (mbscoll(lp1
->fields
[fieldno1
], lp2
->fields
[fieldno2
]));
418 mbscoll(const char *s1
, const char *s2
)
424 return (strcoll(s1
, s2
));
425 if ((w1
= towcs(s1
)) == NULL
|| (w2
= towcs(s2
)) == NULL
)
426 err(1, NULL
); /* XXX */
427 ret
= wcscoll(w1
, w2
);
439 if ((n
= mbsrtowcs(NULL
, &s
, 0, NULL
)) == (size_t)-1)
441 if ((wcs
= malloc((n
+ 1) * sizeof(*wcs
))) == NULL
)
443 mbsrtowcs(wcs
, &s
, n
+ 1, NULL
);
448 joinlines(INPUT
*F1
, INPUT
*F2
)
453 * Output the results of a join comparison. The output may be from
454 * either file 1 or file 2 (in which case the first argument is the
455 * file from which to output) or from both.
458 for (cnt1
= 0; cnt1
< F1
->setcnt
; ++cnt1
)
459 outoneline(F1
, &F1
->set
[cnt1
]);
462 for (cnt1
= 0; cnt1
< F1
->setcnt
; ++cnt1
)
463 for (cnt2
= 0; cnt2
< F2
->setcnt
; ++cnt2
)
464 outtwoline(F1
, &F1
->set
[cnt1
], F2
, &F2
->set
[cnt2
]);
468 outoneline(INPUT
*F
, LINE
*lp
)
473 * Output a single line from one of the files, according to the
474 * join rules. This happens when we are writing unmatched single
475 * lines. Output empty fields in the right places.
478 for (cnt
= 0; cnt
< olistcnt
; ++cnt
) {
479 if (olist
[cnt
].filenum
== (unsigned)F
->number
)
480 outfield(lp
, olist
[cnt
].fieldno
, 0);
481 else if (olist
[cnt
].filenum
== 0)
482 outfield(lp
, F
->joinf
, 0);
487 for (cnt
= 0; cnt
< lp
->fieldcnt
; ++cnt
)
488 outfield(lp
, cnt
, 0);
496 outtwoline(INPUT
*F1
, LINE
*lp1
, INPUT
*F2
, LINE
*lp2
)
500 /* Output a pair of lines according to the join list (if any). */
502 for (cnt
= 0; cnt
< olistcnt
; ++cnt
)
503 if (olist
[cnt
].filenum
== 0) {
504 if (lp1
->fieldcnt
>= F1
->joinf
)
505 outfield(lp1
, F1
->joinf
, 0);
507 outfield(lp2
, F2
->joinf
, 0);
508 } else if (olist
[cnt
].filenum
== 1)
509 outfield(lp1
, olist
[cnt
].fieldno
, 0);
510 else /* if (olist[cnt].filenum == 2) */
511 outfield(lp2
, olist
[cnt
].fieldno
, 0);
514 * Output the join field, then the remaining fields from F1
517 outfield(lp1
, F1
->joinf
, 0);
518 for (cnt
= 0; cnt
< lp1
->fieldcnt
; ++cnt
)
519 if (F1
->joinf
!= cnt
)
520 outfield(lp1
, cnt
, 0);
521 for (cnt
= 0; cnt
< lp2
->fieldcnt
; ++cnt
)
522 if (F2
->joinf
!= cnt
)
523 outfield(lp2
, cnt
, 0);
532 outfield(LINE
*lp
, u_long fieldno
, int out_empty
)
535 (void)printf("%lc", *tabchar
);
536 if (!ferror(stdout
)) {
537 if (lp
->fieldcnt
<= fieldno
|| out_empty
) {
539 (void)printf("%s", empty
);
541 if (*lp
->fields
[fieldno
] == '\0') {
542 if (COMPAT_MODE("bin/join", "Unix2003") && empty
!= NULL
)
543 (void)printf("%s", empty
);
547 (void)printf("%s", lp
->fields
[fieldno
]);
555 * Convert an output list argument "2.1, 1.3, 2.4" into an array of output
559 fieldarg(char *option
)
561 u_long fieldno
, filenum
;
564 while ((token
= strsep(&option
, ", \t")) != NULL
) {
568 filenum
= fieldno
= 0;
569 else if ((token
[0] == '1' || token
[0] == '2') &&
571 filenum
= token
[0] - '0';
572 fieldno
= strtol(token
+ 2, &end
, 10);
574 errx(1, "malformed -o option field");
576 errx(1, "field numbers are 1 based");
579 errx(1, "malformed -o option field");
580 if (olistcnt
== olistalloc
) {
582 if ((olist
= realloc(olist
,
583 olistalloc
* sizeof(OLIST
))) == NULL
)
586 olist
[olistcnt
].filenum
= filenum
;
587 olist
[olistcnt
].fieldno
= fieldno
;
593 obsolete(char **argv
)
598 while ((ap
= *++argv
) != NULL
) {
599 /* Return if "--". */
600 if (ap
[0] == '-' && ap
[1] == '-')
602 /* skip if not an option */
608 * The original join allowed "-a", which meant the
609 * same as -a1 plus -a2. POSIX 1003.2, Draft 11.2
610 * only specifies this as "-a 1" and "a -2", so we
611 * have to use another option flag, one that is
612 * unlikely to ever be used or accidentally entered
613 * on the command line. (Well, we could reallocate
614 * the argv array, but that hardly seems worthwhile.)
616 if (ap
[2] == '\0' && (argv
[1] == NULL
||
617 (strcmp(argv
[1], "1") != 0 &&
618 strcmp(argv
[1], "2") != 0))) {
620 warnx("-a option used without an argument; "
621 "reverting to historical behavior");
626 * The original join allowed "-j[12] arg" and "-j arg".
627 * Convert the former to "-[12] arg". Don't convert
628 * the latter since getopt(3) can handle it.
646 jbad
: errx(1, "illegal option -- %s", ap
);
652 * The original join allowed "-o arg arg".
653 * Convert to "-o arg -o arg".
657 for (p
= argv
+ 2; *p
; ++p
) {
658 if (p
[0][0] == '0' || ((p
[0][0] != '1' &&
659 p
[0][0] != '2') || p
[0][1] != '.'))
662 if (len
- 2 != strspn(*p
+ 2, "0123456789"))
664 if ((t
= malloc(len
+ 3)) == NULL
)
668 memmove(t
+ 2, *p
, len
+ 1);
680 (void)fprintf(stderr
, "%s %s\n%s\n",
681 "usage: join [-a fileno | -v fileno ] [-e string] [-1 field]",
683 " [-o list] [-t char] file1 file2");