1 /* join - join lines of two files on a common field
2 Copyright (C) 1991-2023 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <https://www.gnu.org/licenses/>.
17 Written by Mike Haertel, mike@gnu.ai.mit.edu. */
21 #include <sys/types.h>
28 #include "hard-locale.h"
29 #include "linebuffer.h"
30 #include "memcasecmp.h"
37 /* The official name of this program (e.g., no 'g' prefix). */
38 #define PROGRAM_NAME "join"
40 #define AUTHORS proper_name ("Mike Haertel")
42 #define join system_join
44 #define SWAPLINES(a, b) do { \
45 struct line *tmp = a; \
50 /* An element of the list identifying which fields to print for each
54 /* File number: 0, 1, or 2. 0 means use the join field.
55 1 means use the first file argument, 2 the second. */
58 /* Field index (zero-based), specified only when FILE is 1 or 2. */
64 /* A field of a line. */
67 char *beg
; /* First character in field. */
68 idx_t len
; /* The length of the field. */
71 /* A line read from an input file. */
74 struct linebuffer buf
; /* The line itself. */
75 idx_t nfields
; /* Number of elements in 'fields'. */
76 idx_t nfields_allocated
; /* Number of elements allocated for 'fields'. */
80 /* One or more consecutive lines read from a file that all have the
81 same join field value. */
84 idx_t count
; /* Elements used in 'lines'. */
85 idx_t alloc
; /* Elements allocated in 'lines'. */
89 /* The previous line read from each file. */
90 static struct line
*prevline
[2] = {nullptr, nullptr};
92 /* The number of lines read from each file. */
93 static uintmax_t line_no
[2] = {0, 0};
95 /* The input file names. */
96 static char *g_names
[2];
98 /* This provides an extra line buffer for each file. We need these if we
99 try to read two consecutive lines into the same buffer, since we don't
100 want to overwrite the previous buffer before we check order. */
101 static struct line
*spareline
[2] = {nullptr, nullptr};
103 /* True if the LC_COLLATE locale is hard. */
104 static bool hard_LC_COLLATE
;
106 /* If nonzero, print unpairable lines in file 1 or 2. */
107 static bool print_unpairables_1
, print_unpairables_2
;
109 /* If nonzero, print pairable lines. */
110 static bool print_pairables
;
112 /* If nonzero, we have seen at least one unpairable line. */
113 static bool seen_unpairable
;
115 /* If nonzero, we have warned about disorder in that file. */
116 static bool issued_disorder_warning
[2];
118 /* Empty output field filler. */
119 static char const *empty_filler
;
121 /* Whether to ensure the same number of fields are output from each line. */
122 static bool autoformat
;
123 /* The number of fields to output for each line.
124 Only significant when autoformat is true. */
125 static idx_t autocount_1
;
126 static idx_t autocount_2
;
128 /* Field to join on; -1 means they haven't been determined yet. */
129 static ptrdiff_t join_field_1
= -1;
130 static ptrdiff_t join_field_2
= -1;
132 /* List of fields to print. */
133 static struct outlist outlist_head
;
135 /* Last element in 'outlist', where a new element can be added. */
136 static struct outlist
*outlist_end
= &outlist_head
;
138 /* Tab character separating fields. If negative, fields are separated
139 by any nonempty string of blanks, otherwise by exactly one
140 tab character whose value (when cast to unsigned char) equals TAB. */
143 /* If nonzero, check that the input is correctly ordered. */
153 CHECK_ORDER_OPTION
= CHAR_MAX
+ 1,
154 NOCHECK_ORDER_OPTION
,
159 static struct option
const longopts
[] =
161 {"ignore-case", no_argument
, nullptr, 'i'},
162 {"check-order", no_argument
, nullptr, CHECK_ORDER_OPTION
},
163 {"nocheck-order", no_argument
, nullptr, NOCHECK_ORDER_OPTION
},
164 {"zero-terminated", no_argument
, nullptr, 'z'},
165 {"header", no_argument
, nullptr, HEADER_LINE_OPTION
},
166 {GETOPT_HELP_OPTION_DECL
},
167 {GETOPT_VERSION_OPTION_DECL
},
168 {nullptr, 0, nullptr, 0}
171 /* Used to print non-joining lines */
172 static struct line uni_blank
;
174 /* If nonzero, ignore case when comparing join fields. */
175 static bool ignore_case
;
177 /* If nonzero, treat the first line of each file as column headers --
178 join them without checking for ordering */
179 static bool join_header_lines
;
181 /* The character marking end of line. Default to \n. */
182 static char eolchar
= '\n';
187 if (status
!= EXIT_SUCCESS
)
192 Usage: %s [OPTION]... FILE1 FILE2\n\
196 For each pair of input lines with identical join fields, write a line to\n\
197 standard output. The default join field is the first, delimited by blanks.\
202 When FILE1 or FILE2 (not both) is -, read standard input.\n\
206 -a FILENUM also print unpairable lines from file FILENUM, where\n\
207 FILENUM is 1 or 2, corresponding to FILE1 or FILE2\n\
210 -e STRING replace missing (empty) input fields with STRING;\n\
211 I.e., missing fields specified with '-12jo' options\
215 -i, --ignore-case ignore differences in case when comparing fields\n\
216 -j FIELD equivalent to '-1 FIELD -2 FIELD'\n\
217 -o FORMAT obey FORMAT while constructing output line\n\
218 -t CHAR use CHAR as input and output field separator\n\
221 -v FILENUM like -a FILENUM, but suppress joined output lines\n\
222 -1 FIELD join on this FIELD of file 1\n\
223 -2 FIELD join on this FIELD of file 2\n\
224 --check-order check that the input is correctly sorted, even\n\
225 if all input lines are pairable\n\
226 --nocheck-order do not check that the input is correctly sorted\n\
227 --header treat the first line in each file as field headers,\n\
228 print them without trying to pair them\n\
231 -z, --zero-terminated line delimiter is NUL, not newline\n\
233 fputs (HELP_OPTION_DESCRIPTION
, stdout
);
234 fputs (VERSION_OPTION_DESCRIPTION
, stdout
);
237 Unless -t CHAR is given, leading blanks separate fields and are ignored,\n\
238 else fields are separated by CHAR. Any FIELD is a field number counted\n\
239 from 1. FORMAT is one or more comma or blank separated specifications,\n\
240 each being 'FILENUM.FIELD' or '0'. Default FORMAT outputs the join field,\n\
241 the remaining fields from FILE1, the remaining fields from FILE2, all\n\
242 separated by CHAR. If FORMAT is the keyword 'auto', then the first\n\
243 line of each file determines the number of fields output for each line.\n\
245 Important: FILE1 and FILE2 must be sorted on the join fields.\n\
246 E.g., use \"sort -k 1b,1\" if 'join' has no options,\n\
247 or use \"join -t ''\" if 'sort' has no options.\n\
248 Note, comparisons honor the rules specified by 'LC_COLLATE'.\n\
249 If the input is not sorted and some lines cannot be joined, a\n\
250 warning message will be given.\n\
252 emit_ancillary_info (PROGRAM_NAME
);
257 /* Record a field in LINE, with location FIELD and size LEN. */
260 extract_field (struct line
*line
, char *field
, idx_t len
)
262 if (line
->nfields
>= line
->nfields_allocated
)
263 line
->fields
= xpalloc (line
->fields
, &line
->nfields_allocated
, 1,
264 -1, sizeof *line
->fields
);
265 line
->fields
[line
->nfields
].beg
= field
;
266 line
->fields
[line
->nfields
].len
= len
;
270 /* Fill in the 'fields' structure in LINE. */
273 xfields (struct line
*line
)
275 char *ptr
= line
->buf
.buffer
;
276 char const *lim
= ptr
+ line
->buf
.length
- 1;
281 if (0 <= tab
&& tab
!= '\n')
284 for (; (sep
= memchr (ptr
, tab
, lim
- ptr
)) != nullptr; ptr
= sep
+ 1)
285 extract_field (line
, ptr
, sep
- ptr
);
289 /* Skip leading blanks before the first field. */
290 while (field_sep (*ptr
))
297 for (sep
= ptr
+ 1; sep
!= lim
&& ! field_sep (*sep
); sep
++)
299 extract_field (line
, ptr
, sep
- ptr
);
302 for (ptr
= sep
+ 1; ptr
!= lim
&& field_sep (*ptr
); ptr
++)
308 extract_field (line
, ptr
, lim
- ptr
);
312 freeline (struct line
*line
)
317 line
->fields
= nullptr;
318 free (line
->buf
.buffer
);
319 line
->buf
.buffer
= nullptr;
322 /* Return <0 if the join field in LINE1 compares less than the one in LINE2;
323 >0 if it compares greater; 0 if it compares equal.
324 Report an error and exit if the comparison fails.
325 Use join fields JF_1 and JF_2 respectively. */
328 keycmp (struct line
const *line1
, struct line
const *line2
,
329 idx_t jf_1
, idx_t jf_2
)
331 /* Start of field to compare in each file. */
336 idx_t len2
; /* Length of fields to compare. */
339 if (jf_1
< line1
->nfields
)
341 beg1
= line1
->fields
[jf_1
].beg
;
342 len1
= line1
->fields
[jf_1
].len
;
350 if (jf_2
< line2
->nfields
)
352 beg2
= line2
->fields
[jf_2
].beg
;
353 len2
= line2
->fields
[jf_2
].len
;
362 return len2
== 0 ? 0 : -1;
368 /* FIXME: ignore_case does not work with NLS (in particular,
369 with multibyte chars). */
370 diff
= memcasecmp (beg1
, beg2
, MIN (len1
, len2
));
375 return xmemcoll (beg1
, len1
, beg2
, len2
);
376 diff
= memcmp (beg1
, beg2
, MIN (len1
, len2
));
381 return (len1
> len2
) - (len1
< len2
);
384 /* Check that successive input lines PREV and CURRENT from input file
385 WHATFILE are presented in order, unless the user may be relying on
386 the GNU extension that input lines may be out of order if no input
387 lines are unpairable.
389 If the user specified --nocheck-order, the check is not made.
390 If the user specified --check-order, the problem is fatal.
391 Otherwise (the default), the message is simply a warning.
393 A message is printed at most once per input file. */
396 check_order (const struct line
*prev
,
397 const struct line
*current
,
400 if (check_input_order
!= CHECK_ORDER_DISABLED
401 && ((check_input_order
== CHECK_ORDER_ENABLED
) || seen_unpairable
))
403 if (!issued_disorder_warning
[whatfile
- 1])
405 idx_t join_field
= whatfile
== 1 ? join_field_1
: join_field_2
;
406 if (keycmp (prev
, current
, join_field
, join_field
) > 0)
408 /* Exclude any trailing newline. */
409 idx_t len
= current
->buf
.length
;
410 if (0 < len
&& current
->buf
.buffer
[len
- 1] == '\n')
413 /* If the offending line is longer than INT_MAX, output
414 only the first INT_MAX bytes in this diagnostic. */
415 len
= MIN (INT_MAX
, len
);
417 error ((check_input_order
== CHECK_ORDER_ENABLED
419 0, _("%s:%ju: is not sorted: %.*s"),
420 g_names
[whatfile
- 1], line_no
[whatfile
- 1],
421 (int) len
, current
->buf
.buffer
);
423 /* If we get to here, the message was merely a warning.
424 Arrange to issue it only once per file. */
425 issued_disorder_warning
[whatfile
- 1] = true;
432 reset_line (struct line
*line
)
438 init_linep (struct line
**linep
)
440 struct line
*line
= xzalloc (sizeof *line
);
445 /* Read a line from FP into LINE and split it into fields.
446 Return true if successful. */
449 get_line (FILE *fp
, struct line
**linep
, int which
)
451 struct line
*line
= *linep
;
453 if (line
== prevline
[which
- 1])
455 SWAPLINES (line
, spareline
[which
- 1]);
462 line
= init_linep (linep
);
464 if (! readlinebuffer_delim (&line
->buf
, fp
, eolchar
))
467 error (EXIT_FAILURE
, errno
, _("read error"));
471 ++line_no
[which
- 1];
475 if (prevline
[which
- 1])
476 check_order (prevline
[which
- 1], line
, which
);
478 prevline
[which
- 1] = line
;
483 free_spareline (void)
485 for (idx_t i
= 0; i
< ARRAY_CARDINALITY (spareline
); i
++)
489 freeline (spareline
[i
]);
496 initseq (struct seq
*seq
)
500 seq
->lines
= nullptr;
503 /* Read a line from FP and add it to SEQ. Return true if successful. */
506 getseq (FILE *fp
, struct seq
*seq
, int whichfile
)
508 if (seq
->count
== seq
->alloc
)
510 seq
->lines
= xpalloc (seq
->lines
, &seq
->alloc
, 1, -1, sizeof *seq
->lines
);
511 for (idx_t i
= seq
->count
; i
< seq
->alloc
; i
++)
512 seq
->lines
[i
] = nullptr;
515 if (get_line (fp
, &seq
->lines
[seq
->count
], whichfile
))
523 /* Read a line from FP and add it to SEQ, as the first item if FIRST is
524 true, else as the next. */
526 advance_seq (FILE *fp
, struct seq
*seq
, bool first
, int whichfile
)
531 return getseq (fp
, seq
, whichfile
);
535 delseq (struct seq
*seq
)
537 for (idx_t i
= 0; i
< seq
->alloc
; i
++)
539 freeline (seq
->lines
[i
]);
540 free (seq
->lines
[i
]);
546 /* Print field N of LINE if it exists and is nonempty, otherwise
547 'empty_filler' if it is nonempty. */
550 prfield (idx_t n
, struct line
const *line
)
552 if (n
< line
->nfields
)
554 idx_t len
= line
->fields
[n
].len
;
556 fwrite (line
->fields
[n
].beg
, 1, len
, stdout
);
557 else if (empty_filler
)
558 fputs (empty_filler
, stdout
);
560 else if (empty_filler
)
561 fputs (empty_filler
, stdout
);
564 /* Output all the fields in line, other than the join field. */
567 prfields (struct line
const *line
, idx_t join_field
, idx_t autocount
)
570 idx_t nfields
= autoformat
? autocount
: line
->nfields
;
571 char output_separator
= tab
< 0 ? ' ' : tab
;
573 for (i
= 0; i
< join_field
&& i
< nfields
; ++i
)
575 putchar (output_separator
);
578 for (i
= join_field
+ 1; i
< nfields
; ++i
)
580 putchar (output_separator
);
585 /* Print the join of LINE1 and LINE2. */
588 prjoin (struct line
const *line1
, struct line
const *line2
)
590 const struct outlist
*outlist
;
591 char output_separator
= tab
< 0 ? ' ' : tab
;
593 struct line
const *line
;
595 outlist
= outlist_head
.next
;
598 const struct outlist
*o
;
605 if (line1
== &uni_blank
)
608 field
= join_field_2
;
613 field
= join_field_1
;
618 line
= (o
->file
== 1 ? line1
: line2
);
621 prfield (field
, line
);
625 putchar (output_separator
);
631 if (line1
== &uni_blank
)
634 field
= join_field_2
;
639 field
= join_field_1
;
642 /* Output the join field. */
643 prfield (field
, line
);
645 /* Output other fields. */
646 prfields (line1
, join_field_1
, autocount_1
);
647 prfields (line2
, join_field_2
, autocount_2
);
656 /* Print the join of the files in FP1 and FP2. */
659 join (FILE *fp1
, FILE *fp2
)
661 struct seq seq1
, seq2
;
665 fadvise (fp1
, FADVISE_SEQUENTIAL
);
666 fadvise (fp2
, FADVISE_SEQUENTIAL
);
668 /* Read the first line of each file. */
670 getseq (fp1
, &seq1
, 1);
672 getseq (fp2
, &seq2
, 2);
676 autocount_1
= seq1
.count
? seq1
.lines
[0]->nfields
: 0;
677 autocount_2
= seq2
.count
? seq2
.lines
[0]->nfields
: 0;
680 if (join_header_lines
&& (seq1
.count
|| seq2
.count
))
682 struct line
const *hline1
= seq1
.count
? seq1
.lines
[0] : &uni_blank
;
683 struct line
const *hline2
= seq2
.count
? seq2
.lines
[0] : &uni_blank
;
684 prjoin (hline1
, hline2
);
685 prevline
[0] = nullptr;
686 prevline
[1] = nullptr;
688 advance_seq (fp1
, &seq1
, true, 1);
690 advance_seq (fp2
, &seq2
, true, 2);
693 while (seq1
.count
&& seq2
.count
)
695 diff
= keycmp (seq1
.lines
[0], seq2
.lines
[0],
696 join_field_1
, join_field_2
);
699 if (print_unpairables_1
)
700 prjoin (seq1
.lines
[0], &uni_blank
);
701 advance_seq (fp1
, &seq1
, true, 1);
702 seen_unpairable
= true;
707 if (print_unpairables_2
)
708 prjoin (&uni_blank
, seq2
.lines
[0]);
709 advance_seq (fp2
, &seq2
, true, 2);
710 seen_unpairable
= true;
714 /* Keep reading lines from file1 as long as they continue to
715 match the current line from file2. */
718 if (!advance_seq (fp1
, &seq1
, false, 1))
724 while (!keycmp (seq1
.lines
[seq1
.count
- 1], seq2
.lines
[0],
725 join_field_1
, join_field_2
));
727 /* Keep reading lines from file2 as long as they continue to
728 match the current line from file1. */
731 if (!advance_seq (fp2
, &seq2
, false, 2))
737 while (!keycmp (seq1
.lines
[0], seq2
.lines
[seq2
.count
- 1],
738 join_field_1
, join_field_2
));
742 for (idx_t i
= 0; i
< seq1
.count
- 1; ++i
)
745 for (j
= 0; j
< seq2
.count
- 1; ++j
)
746 prjoin (seq1
.lines
[i
], seq2
.lines
[j
]);
752 SWAPLINES (seq1
.lines
[0], seq1
.lines
[seq1
.count
- 1]);
760 SWAPLINES (seq2
.lines
[0], seq2
.lines
[seq2
.count
- 1]);
767 /* If the user did not specify --nocheck-order, then we read the
768 tail ends of both inputs to verify that they are in order. We
769 skip the rest of the tail once we have issued a warning for that
770 file, unless we actually need to print the unpairable lines. */
771 struct line
*line
= nullptr;
772 bool checktail
= false;
774 if (check_input_order
!= CHECK_ORDER_DISABLED
775 && !(issued_disorder_warning
[0] && issued_disorder_warning
[1]))
778 if ((print_unpairables_1
|| checktail
) && seq1
.count
)
780 if (print_unpairables_1
)
781 prjoin (seq1
.lines
[0], &uni_blank
);
783 seen_unpairable
= true;
784 while (get_line (fp1
, &line
, 1))
786 if (print_unpairables_1
)
787 prjoin (line
, &uni_blank
);
788 if (issued_disorder_warning
[0] && !print_unpairables_1
)
793 if ((print_unpairables_2
|| checktail
) && seq2
.count
)
795 if (print_unpairables_2
)
796 prjoin (&uni_blank
, seq2
.lines
[0]);
798 seen_unpairable
= true;
799 while (get_line (fp2
, &line
, 2))
801 if (print_unpairables_2
)
802 prjoin (&uni_blank
, line
);
803 if (issued_disorder_warning
[1] && !print_unpairables_2
)
815 /* Add a field spec for field FIELD of file FILE to 'outlist'. */
818 add_field (int file
, idx_t field
)
822 affirm (file
== 0 || file
== 1 || file
== 2);
823 affirm (file
!= 0 || field
== 0);
825 o
= xmalloc (sizeof *o
);
830 /* Add to the end of the list so the fields are in the right order. */
831 outlist_end
->next
= o
;
835 /* Convert a string of decimal digits, STR (the 1-based join field number),
836 to an integral value. Upon successful conversion, return one less
837 (the zero-based field number). Silently convert too-large values
838 to PTRDIFF_MAX. Otherwise, if a value cannot be converted, give a
839 diagnostic and exit. */
842 string_to_join_field (char const *str
)
846 strtol_error s_err
= xstrtoimax (str
, nullptr, 10, &val
, "");
847 if (s_err
== LONGINT_OVERFLOW
|| (s_err
== LONGINT_OK
&& PTRDIFF_MAX
< val
))
849 else if (s_err
!= LONGINT_OK
|| val
<= 0)
850 error (EXIT_FAILURE
, 0, _("invalid field number: %s"), quote (str
));
855 /* Convert a single field specifier string, S, to a *FILE_INDEX, *FIELD_INDEX
856 pair. In S, the field index string is 1-based; *FIELD_INDEX is zero-based.
857 If S is valid, return true. Otherwise, give a diagnostic and exit. */
860 decode_field_spec (char const *s
, int *file_index
, idx_t
*field_index
)
862 /* The first character must be 0, 1, or 2. */
868 /* '0' must be all alone -- no '.FIELD'. */
869 error (EXIT_FAILURE
, 0, _("invalid field specifier: %s"), quote (s
));
878 error (EXIT_FAILURE
, 0, _("invalid field specifier: %s"), quote (s
));
879 *file_index
= s
[0] - '0';
880 *field_index
= string_to_join_field (s
+ 2);
884 error (EXIT_FAILURE
, 0,
885 _("invalid file number in field spec: %s"), quote (s
));
889 /* Add the comma or blank separated field spec(s) in STR to 'outlist'. */
892 add_field_list (char *str
)
900 char const *spec_item
= p
;
902 p
= strpbrk (p
, ", \t");
905 decode_field_spec (spec_item
, &file_index
, &field_index
);
906 add_field (file_index
, field_index
);
911 /* Set the join field *VAR to VAL, but report an error if *VAR is set
912 more than once to incompatible values. */
915 set_join_field (ptrdiff_t *var
, idx_t val
)
917 if (0 <= *var
&& *var
!= val
)
918 error (EXIT_FAILURE
, 0,
919 _("incompatible join fields %td, %td"), *var
, val
);
923 /* Status of command-line arguments. */
927 /* This argument must be an operand, i.e., one of the files to be
931 /* This might be the argument of the preceding -j1 or -j2 option,
932 or it might be an operand. */
936 /* This might be the argument of the preceding -o option, or it might be
941 /* Add NAME to the array of input file NAMES with operand statuses
942 OPERAND_STATUS; currently there are NFILES names in the list. */
945 add_file_name (char *name
, char *names
[2],
946 int operand_status
[2], int joption_count
[2], int *nfiles
,
947 int *prev_optc_status
, int *optc_status
)
953 bool op0
= (operand_status
[0] == MUST_BE_OPERAND
);
954 char *arg
= names
[op0
];
955 switch (operand_status
[op0
])
957 case MUST_BE_OPERAND
:
958 error (0, 0, _("extra operand %s"), quoteaf (name
));
959 usage (EXIT_FAILURE
);
961 case MIGHT_BE_J1_ARG
:
963 set_join_field (&join_field_1
, string_to_join_field (arg
));
966 case MIGHT_BE_J2_ARG
:
968 set_join_field (&join_field_2
, string_to_join_field (arg
));
972 add_field_list (arg
);
977 operand_status
[0] = operand_status
[1];
983 operand_status
[n
] = *prev_optc_status
;
986 if (*prev_optc_status
== MIGHT_BE_O_ARG
)
987 *optc_status
= MIGHT_BE_O_ARG
;
991 main (int argc
, char **argv
)
994 int prev_optc_status
= MUST_BE_OPERAND
;
995 int operand_status
[2];
996 int joption_count
[2] = { 0, 0 };
1002 initialize_main (&argc
, &argv
);
1003 set_program_name (argv
[0]);
1004 setlocale (LC_ALL
, "");
1005 bindtextdomain (PACKAGE
, LOCALEDIR
);
1006 textdomain (PACKAGE
);
1007 hard_LC_COLLATE
= hard_locale (LC_COLLATE
);
1009 atexit (close_stdout
);
1010 atexit (free_spareline
);
1012 print_pairables
= true;
1013 seen_unpairable
= false;
1014 issued_disorder_warning
[0] = issued_disorder_warning
[1] = false;
1015 check_input_order
= CHECK_ORDER_DEFAULT
;
1017 while ((optc
= getopt_long (argc
, argv
, "-a:e:i1:2:j:o:t:v:z",
1021 optc_status
= MUST_BE_OPERAND
;
1026 print_pairables
= false;
1032 if (xstrtol (optarg
, nullptr, 10, &val
, "") != LONGINT_OK
1033 || (val
!= 1 && val
!= 2))
1034 error (EXIT_FAILURE
, 0,
1035 _("invalid field number: %s"), quote (optarg
));
1037 print_unpairables_1
= true;
1039 print_unpairables_2
= true;
1044 if (empty_filler
&& ! STREQ (empty_filler
, optarg
))
1045 error (EXIT_FAILURE
, 0,
1046 _("conflicting empty-field replacement strings"));
1047 empty_filler
= optarg
;
1055 set_join_field (&join_field_1
, string_to_join_field (optarg
));
1059 set_join_field (&join_field_2
, string_to_join_field (optarg
));
1063 if ((optarg
[0] == '1' || optarg
[0] == '2') && !optarg
[1]
1064 && optarg
== argv
[optind
- 1] + 2)
1066 /* The argument was either "-j1" or "-j2". */
1067 bool is_j2
= (optarg
[0] == '2');
1068 joption_count
[is_j2
]++;
1069 optc_status
= MIGHT_BE_J1_ARG
+ is_j2
;
1073 set_join_field (&join_field_1
, string_to_join_field (optarg
));
1074 set_join_field (&join_field_2
, join_field_1
);
1079 if (STREQ (optarg
, "auto"))
1083 add_field_list (optarg
);
1084 optc_status
= MIGHT_BE_O_ARG
;
1090 unsigned char newtab
= optarg
[0];
1092 newtab
= '\n'; /* '' => process the whole line. */
1095 if (STREQ (optarg
, "\\0"))
1098 error (EXIT_FAILURE
, 0, _("multi-character tab %s"),
1101 if (0 <= tab
&& tab
!= newtab
)
1102 error (EXIT_FAILURE
, 0, _("incompatible tabs"));
1111 case NOCHECK_ORDER_OPTION
:
1112 check_input_order
= CHECK_ORDER_DISABLED
;
1115 case CHECK_ORDER_OPTION
:
1116 check_input_order
= CHECK_ORDER_ENABLED
;
1119 case 1: /* Non-option argument. */
1120 add_file_name (optarg
, g_names
, operand_status
, joption_count
,
1121 &nfiles
, &prev_optc_status
, &optc_status
);
1124 case HEADER_LINE_OPTION
:
1125 join_header_lines
= true;
1128 case_GETOPT_HELP_CHAR
;
1130 case_GETOPT_VERSION_CHAR (PROGRAM_NAME
, AUTHORS
);
1133 usage (EXIT_FAILURE
);
1136 prev_optc_status
= optc_status
;
1139 /* Process any operands after "--". */
1140 prev_optc_status
= MUST_BE_OPERAND
;
1141 while (optind
< argc
)
1142 add_file_name (argv
[optind
++], g_names
, operand_status
, joption_count
,
1143 &nfiles
, &prev_optc_status
, &optc_status
);
1148 error (0, 0, _("missing operand"));
1150 error (0, 0, _("missing operand after %s"), quote (argv
[argc
- 1]));
1151 usage (EXIT_FAILURE
);
1154 /* If "-j1" was specified and it turns out not to have had an argument,
1155 treat it as "-j 1". Likewise for -j2. */
1156 for (i
= 0; i
< 2; i
++)
1157 if (joption_count
[i
] != 0)
1159 set_join_field (&join_field_1
, i
);
1160 set_join_field (&join_field_2
, i
);
1163 if (join_field_1
< 0)
1165 if (join_field_2
< 0)
1168 fp1
= STREQ (g_names
[0], "-") ? stdin
: fopen (g_names
[0], "r");
1170 error (EXIT_FAILURE
, errno
, "%s", quotef (g_names
[0]));
1171 fp2
= STREQ (g_names
[1], "-") ? stdin
: fopen (g_names
[1], "r");
1173 error (EXIT_FAILURE
, errno
, "%s", quotef (g_names
[1]));
1175 error (EXIT_FAILURE
, errno
, _("both files cannot be standard input"));
1178 if (fclose (fp1
) != 0)
1179 error (EXIT_FAILURE
, errno
, "%s", quotef (g_names
[0]));
1180 if (fclose (fp2
) != 0)
1181 error (EXIT_FAILURE
, errno
, "%s", quotef (g_names
[1]));
1183 if (issued_disorder_warning
[0] || issued_disorder_warning
[1])
1184 error (EXIT_FAILURE
, 0, _("input is not in sorted order"));
1186 return EXIT_SUCCESS
;