1 /* comm -- compare two sorted files line by line.
2 Copyright (C) 1986-2015 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 <http://www.gnu.org/licenses/>. */
17 /* Written by Richard Stallman and David MacKenzie. */
22 #include <sys/types.h>
24 #include "linebuffer.h"
27 #include "hard-locale.h"
33 /* The official name of this program (e.g., no 'g' prefix). */
34 #define PROGRAM_NAME "comm"
37 proper_name ("Richard M. Stallman"), \
38 proper_name ("David MacKenzie")
40 /* Undefine, to avoid warning about redefinition on some systems. */
42 #define min(x, y) ((x) < (y) ? (x) : (y))
44 /* True if the LC_COLLATE locale is hard. */
45 static bool hard_LC_COLLATE
;
47 /* If true, print lines that are found only in file 1. */
48 static bool only_file_1
;
50 /* If true, print lines that are found only in file 2. */
51 static bool only_file_2
;
53 /* If true, print lines that are found in both files. */
56 /* If nonzero, we have seen at least one unpairable line. */
57 static bool seen_unpairable
;
59 /* If nonzero, we have warned about disorder in that file. */
60 static bool issued_disorder_warning
[2];
62 /* If nonzero, check that the input is correctly ordered. */
70 /* Output columns will be delimited with this string, which may be set
71 on the command-line with --output-delimiter=STR. The default is a
72 single TAB character. */
73 static char const *delimiter
;
75 /* For long options that have no equivalent short option, use a
76 non-character as a pseudo short option, starting with CHAR_MAX + 1. */
79 CHECK_ORDER_OPTION
= CHAR_MAX
+ 1,
81 OUTPUT_DELIMITER_OPTION
84 static struct option
const long_options
[] =
86 {"check-order", no_argument
, NULL
, CHECK_ORDER_OPTION
},
87 {"nocheck-order", no_argument
, NULL
, NOCHECK_ORDER_OPTION
},
88 {"output-delimiter", required_argument
, NULL
, OUTPUT_DELIMITER_OPTION
},
89 {GETOPT_HELP_OPTION_DECL
},
90 {GETOPT_VERSION_OPTION_DECL
},
99 if (status
!= EXIT_SUCCESS
)
104 Usage: %s [OPTION]... FILE1 FILE2\n\
108 Compare sorted files FILE1 and FILE2 line by line.\n\
112 When FILE1 or FILE2 (not both) is -, read standard input.\n\
116 With no options, produce three-column output. Column one contains\n\
117 lines unique to FILE1, column two contains lines unique to FILE2,\n\
118 and column three contains lines common to both files.\n\
122 -1 suppress column 1 (lines unique to FILE1)\n\
123 -2 suppress column 2 (lines unique to FILE2)\n\
124 -3 suppress column 3 (lines that appear in both files)\n\
128 --check-order check that the input is correctly sorted, even\n\
129 if all input lines are pairable\n\
130 --nocheck-order do not check that the input is correctly sorted\n\
133 --output-delimiter=STR separate columns with STR\n\
135 fputs (HELP_OPTION_DESCRIPTION
, stdout
);
136 fputs (VERSION_OPTION_DESCRIPTION
, stdout
);
139 Note, comparisons honor the rules specified by 'LC_COLLATE'.\n\
144 %s -12 file1 file2 Print only lines present in both file1 and file2.\n\
145 %s -3 file1 file2 Print lines in file1 not in file2, and vice versa.\n\
147 program_name
, program_name
);
148 emit_ancillary_info (PROGRAM_NAME
);
153 /* Output the line in linebuffer LINE to stream STREAM
154 provided the switches say it should be output.
155 CLASS is 1 for a line found only in file 1,
156 2 for a line only in file 2, 3 for a line in both. */
159 writeline (struct linebuffer
const *line
, FILE *stream
, int class)
171 /* Print a delimiter if we are printing lines from file 1. */
173 fputs (delimiter
, stream
);
179 /* Print a delimiter if we are printing lines from file 1. */
181 fputs (delimiter
, stream
);
182 /* Print a delimiter if we are printing lines from file 2. */
184 fputs (delimiter
, stream
);
188 fwrite (line
->buffer
, sizeof (char), line
->length
, stream
);
191 /* Check that successive input lines PREV and CURRENT from input file
192 WHATFILE are presented in order.
194 If the user specified --nocheck-order, the check is not made.
195 If the user specified --check-order, the problem is fatal.
196 Otherwise (the default), the message is simply a warning.
198 A message is printed at most once per input file.
200 This function was copied (nearly) verbatim from 'src/join.c'. */
203 check_order (struct linebuffer
const *prev
,
204 struct linebuffer
const *current
,
208 if (check_input_order
!= CHECK_ORDER_DISABLED
209 && ((check_input_order
== CHECK_ORDER_ENABLED
) || seen_unpairable
))
211 if (!issued_disorder_warning
[whatfile
- 1])
216 order
= xmemcoll (prev
->buffer
, prev
->length
- 1,
217 current
->buffer
, current
->length
- 1);
219 order
= memcmp2 (prev
->buffer
, prev
->length
- 1,
220 current
->buffer
, current
->length
- 1);
224 error ((check_input_order
== CHECK_ORDER_ENABLED
226 0, _("file %d is not in sorted order"), whatfile
);
228 /* If we get to here, the message was just a warning, but we
229 want only to issue it once. */
230 issued_disorder_warning
[whatfile
- 1] = true;
236 /* Compare INFILES[0] and INFILES[1].
237 If either is "-", use the standard input for that file.
238 Assume that each input file is sorted;
239 merge them and output the result. */
242 compare_files (char **infiles
)
244 /* For each file, we have four linebuffers in lba. */
245 struct linebuffer lba
[2][4];
247 /* thisline[i] points to the linebuffer holding the next available line
248 in file i, or is NULL if there are no lines left in that file. */
249 struct linebuffer
*thisline
[2];
251 /* all_line[i][alt[i][0]] also points to the linebuffer holding the
252 current line in file i. We keep two buffers of history around so we
253 can look two lines back when we get to the end of a file. */
254 struct linebuffer
*all_line
[2][4];
256 /* This is used to rotate through the buffers for each input file. */
259 /* streams[i] holds the input stream for file i. */
264 /* Initialize the storage. */
265 for (i
= 0; i
< 2; i
++)
267 for (j
= 0; j
< 4; j
++)
269 initbuffer (&lba
[i
][j
]);
270 all_line
[i
][j
] = &lba
[i
][j
];
275 streams
[i
] = (STREQ (infiles
[i
], "-") ? stdin
: fopen (infiles
[i
], "r"));
277 error (EXIT_FAILURE
, errno
, "%s", infiles
[i
]);
279 fadvise (streams
[i
], FADVISE_SEQUENTIAL
);
281 thisline
[i
] = readlinebuffer (all_line
[i
][alt
[i
][0]], streams
[i
]);
282 if (ferror (streams
[i
]))
283 error (EXIT_FAILURE
, errno
, "%s", infiles
[i
]);
286 while (thisline
[0] || thisline
[1])
289 bool fill_up
[2] = { false, false };
291 /* Compare the next available lines of the two files. */
295 else if (!thisline
[1])
300 order
= xmemcoll (thisline
[0]->buffer
, thisline
[0]->length
- 1,
301 thisline
[1]->buffer
, thisline
[1]->length
- 1);
304 size_t len
= min (thisline
[0]->length
, thisline
[1]->length
) - 1;
305 order
= memcmp (thisline
[0]->buffer
, thisline
[1]->buffer
, len
);
307 order
= (thisline
[0]->length
< thisline
[1]->length
309 : thisline
[0]->length
!= thisline
[1]->length
);
313 /* Output the line that is lesser. */
315 writeline (thisline
[1], stdout
, 3);
318 seen_unpairable
= true;
320 writeline (thisline
[0], stdout
, 1);
322 writeline (thisline
[1], stdout
, 2);
325 /* Step the file the line came from.
326 If the files match, step both files. */
332 for (i
= 0; i
< 2; i
++)
335 /* Rotate the buffers for this file. */
336 alt
[i
][2] = alt
[i
][1];
337 alt
[i
][1] = alt
[i
][0];
338 alt
[i
][0] = (alt
[i
][0] + 1) & 0x03;
340 thisline
[i
] = readlinebuffer (all_line
[i
][alt
[i
][0]], streams
[i
]);
343 check_order (all_line
[i
][alt
[i
][1]], thisline
[i
], i
+ 1);
345 /* If this is the end of the file we may need to re-check
346 the order of the previous two lines, since we might have
347 discovered an unpairable match since we checked before. */
348 else if (all_line
[i
][alt
[i
][2]]->buffer
)
349 check_order (all_line
[i
][alt
[i
][2]],
350 all_line
[i
][alt
[i
][1]], i
+ 1);
352 if (ferror (streams
[i
]))
353 error (EXIT_FAILURE
, errno
, "%s", infiles
[i
]);
359 for (i
= 0; i
< 2; i
++)
360 if (fclose (streams
[i
]) != 0)
361 error (EXIT_FAILURE
, errno
, "%s", infiles
[i
]);
365 main (int argc
, char **argv
)
369 initialize_main (&argc
, &argv
);
370 set_program_name (argv
[0]);
371 setlocale (LC_ALL
, "");
372 bindtextdomain (PACKAGE
, LOCALEDIR
);
373 textdomain (PACKAGE
);
374 hard_LC_COLLATE
= hard_locale (LC_COLLATE
);
376 atexit (close_stdout
);
382 seen_unpairable
= false;
383 issued_disorder_warning
[0] = issued_disorder_warning
[1] = false;
384 check_input_order
= CHECK_ORDER_DEFAULT
;
386 while ((c
= getopt_long (argc
, argv
, "123", long_options
, NULL
)) != -1)
401 case NOCHECK_ORDER_OPTION
:
402 check_input_order
= CHECK_ORDER_DISABLED
;
405 case CHECK_ORDER_OPTION
:
406 check_input_order
= CHECK_ORDER_ENABLED
;
409 case OUTPUT_DELIMITER_OPTION
:
410 if (delimiter
&& !STREQ (delimiter
, optarg
))
411 error (EXIT_FAILURE
, 0, _("multiple delimiters specified"));
415 error (EXIT_FAILURE
, 0, _("empty %s not allowed"),
416 quote ("--output-delimiter"));
420 case_GETOPT_HELP_CHAR
;
422 case_GETOPT_VERSION_CHAR (PROGRAM_NAME
, AUTHORS
);
425 usage (EXIT_FAILURE
);
428 if (argc
- optind
< 2)
431 error (0, 0, _("missing operand"));
433 error (0, 0, _("missing operand after %s"), quote (argv
[argc
- 1]));
434 usage (EXIT_FAILURE
);
437 if (2 < argc
- optind
)
439 error (0, 0, _("extra operand %s"), quote (argv
[optind
+ 2]));
440 usage (EXIT_FAILURE
);
443 /* The default delimiter is a TAB. */
447 compare_files (argv
+ optind
);
449 if (issued_disorder_warning
[0] || issued_disorder_warning
[1])