1 574ed2c3 2017-11-29 stsp /* $OpenBSD: diffreg.c,v 1.91 2016/03/01 20:57:35 natano Exp $ */
4 574ed2c3 2017-11-29 stsp * Copyright (C) Caldera International Inc. 2001-2002.
5 574ed2c3 2017-11-29 stsp * All rights reserved.
7 574ed2c3 2017-11-29 stsp * Redistribution and use in source and binary forms, with or without
8 574ed2c3 2017-11-29 stsp * modification, are permitted provided that the following conditions
10 574ed2c3 2017-11-29 stsp * 1. Redistributions of source code and documentation must retain the above
11 574ed2c3 2017-11-29 stsp * copyright notice, this list of conditions and the following disclaimer.
12 574ed2c3 2017-11-29 stsp * 2. Redistributions in binary form must reproduce the above copyright
13 574ed2c3 2017-11-29 stsp * notice, this list of conditions and the following disclaimer in the
14 574ed2c3 2017-11-29 stsp * documentation and/or other materials provided with the distribution.
15 574ed2c3 2017-11-29 stsp * 3. All advertising materials mentioning features or use of this software
16 574ed2c3 2017-11-29 stsp * must display the following acknowledgement:
17 574ed2c3 2017-11-29 stsp * This product includes software developed or owned by Caldera
18 574ed2c3 2017-11-29 stsp * International, Inc.
19 574ed2c3 2017-11-29 stsp * 4. Neither the name of Caldera International, Inc. nor the names of other
20 574ed2c3 2017-11-29 stsp * contributors may be used to endorse or promote products derived from
21 574ed2c3 2017-11-29 stsp * this software without specific prior written permission.
23 574ed2c3 2017-11-29 stsp * USE OF THE SOFTWARE PROVIDED FOR UNDER THIS LICENSE BY CALDERA
24 574ed2c3 2017-11-29 stsp * INTERNATIONAL, INC. AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
25 574ed2c3 2017-11-29 stsp * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
26 574ed2c3 2017-11-29 stsp * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
27 574ed2c3 2017-11-29 stsp * IN NO EVENT SHALL CALDERA INTERNATIONAL, INC. BE LIABLE FOR ANY DIRECT,
28 574ed2c3 2017-11-29 stsp * INDIRECT INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
29 574ed2c3 2017-11-29 stsp * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
30 574ed2c3 2017-11-29 stsp * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 574ed2c3 2017-11-29 stsp * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
32 574ed2c3 2017-11-29 stsp * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
33 574ed2c3 2017-11-29 stsp * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 574ed2c3 2017-11-29 stsp * POSSIBILITY OF SUCH DAMAGE.
37 574ed2c3 2017-11-29 stsp * Copyright (c) 1991, 1993
38 574ed2c3 2017-11-29 stsp * The Regents of the University of California. All rights reserved.
40 574ed2c3 2017-11-29 stsp * Redistribution and use in source and binary forms, with or without
41 574ed2c3 2017-11-29 stsp * modification, are permitted provided that the following conditions
43 574ed2c3 2017-11-29 stsp * 1. Redistributions of source code must retain the above copyright
44 574ed2c3 2017-11-29 stsp * notice, this list of conditions and the following disclaimer.
45 574ed2c3 2017-11-29 stsp * 2. Redistributions in binary form must reproduce the above copyright
46 574ed2c3 2017-11-29 stsp * notice, this list of conditions and the following disclaimer in the
47 574ed2c3 2017-11-29 stsp * documentation and/or other materials provided with the distribution.
48 574ed2c3 2017-11-29 stsp * 3. Neither the name of the University nor the names of its contributors
49 574ed2c3 2017-11-29 stsp * may be used to endorse or promote products derived from this software
50 574ed2c3 2017-11-29 stsp * without specific prior written permission.
52 574ed2c3 2017-11-29 stsp * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 574ed2c3 2017-11-29 stsp * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 574ed2c3 2017-11-29 stsp * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 574ed2c3 2017-11-29 stsp * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 574ed2c3 2017-11-29 stsp * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 574ed2c3 2017-11-29 stsp * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 574ed2c3 2017-11-29 stsp * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 574ed2c3 2017-11-29 stsp * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 574ed2c3 2017-11-29 stsp * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 574ed2c3 2017-11-29 stsp * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 574ed2c3 2017-11-29 stsp * SUCH DAMAGE.
64 574ed2c3 2017-11-29 stsp * @(#)diffreg.c 8.1 (Berkeley) 6/6/93
67 574ed2c3 2017-11-29 stsp #include <sys/stat.h>
68 574ed2c3 2017-11-29 stsp #include <sys/wait.h>
69 7d283eee 2017-11-29 stsp #include <sys/queue.h>
71 574ed2c3 2017-11-29 stsp #include <ctype.h>
72 574ed2c3 2017-11-29 stsp #include <err.h>
73 574ed2c3 2017-11-29 stsp #include <errno.h>
74 574ed2c3 2017-11-29 stsp #include <fcntl.h>
75 574ed2c3 2017-11-29 stsp #include <paths.h>
76 cb74ff21 2017-11-30 stsp #include <stdarg.h>
77 574ed2c3 2017-11-29 stsp #include <stddef.h>
78 574ed2c3 2017-11-29 stsp #include <stdint.h>
79 574ed2c3 2017-11-29 stsp #include <stdio.h>
80 574ed2c3 2017-11-29 stsp #include <stdlib.h>
81 574ed2c3 2017-11-29 stsp #include <string.h>
82 574ed2c3 2017-11-29 stsp #include <unistd.h>
83 574ed2c3 2017-11-29 stsp #include <limits.h>
84 7d283eee 2017-11-29 stsp #include <sha1.h>
85 7d283eee 2017-11-29 stsp #include <zlib.h>
87 7d283eee 2017-11-29 stsp #include "got_error.h"
88 7d283eee 2017-11-29 stsp #include "got_object.h"
89 7d283eee 2017-11-29 stsp #include "got_diff.h"
91 718b3ab0 2018-03-17 stsp #include "got_lib_diff.h"
93 574ed2c3 2017-11-29 stsp #define MINIMUM(a, b) (((a) < (b)) ? (a) : (b))
94 574ed2c3 2017-11-29 stsp #define MAXIMUM(a, b) (((a) > (b)) ? (a) : (b))
97 574ed2c3 2017-11-29 stsp * diff - compare two files.
101 574ed2c3 2017-11-29 stsp * Uses an algorithm due to Harold Stone, which finds
102 574ed2c3 2017-11-29 stsp * a pair of longest identical subsequences in the two
105 574ed2c3 2017-11-29 stsp * The major goal is to generate the match vector J.
106 574ed2c3 2017-11-29 stsp * J[i] is the index of the line in file1 corresponding
107 574ed2c3 2017-11-29 stsp * to line i file0. J[i] = 0 if there is no
108 574ed2c3 2017-11-29 stsp * such line in file1.
110 574ed2c3 2017-11-29 stsp * Lines are hashed so as to work in core. All potential
111 574ed2c3 2017-11-29 stsp * matches are located by sorting the lines of each file
112 574ed2c3 2017-11-29 stsp * on the hash (called ``value''). In particular, this
113 574ed2c3 2017-11-29 stsp * collects the equivalence classes in file1 together.
114 574ed2c3 2017-11-29 stsp * Subroutine equiv replaces the value of each line in
115 574ed2c3 2017-11-29 stsp * file0 by the index of the first element of its
116 574ed2c3 2017-11-29 stsp * matching equivalence in (the reordered) file1.
117 574ed2c3 2017-11-29 stsp * To save space equiv squeezes file1 into a single
118 574ed2c3 2017-11-29 stsp * array member in which the equivalence classes
119 574ed2c3 2017-11-29 stsp * are simply concatenated, except that their first
120 574ed2c3 2017-11-29 stsp * members are flagged by changing sign.
122 574ed2c3 2017-11-29 stsp * Next the indices that point into member are unsorted into
123 574ed2c3 2017-11-29 stsp * array class according to the original order of file0.
125 574ed2c3 2017-11-29 stsp * The cleverness lies in routine stone. This marches
126 574ed2c3 2017-11-29 stsp * through the lines of file0, developing a vector klist
127 574ed2c3 2017-11-29 stsp * of "k-candidates". At step i a k-candidate is a matched
128 574ed2c3 2017-11-29 stsp * pair of lines x,y (x in file0 y in file1) such that
129 574ed2c3 2017-11-29 stsp * there is a common subsequence of length k
130 574ed2c3 2017-11-29 stsp * between the first i lines of file0 and the first y
131 574ed2c3 2017-11-29 stsp * lines of file1, but there is no such subsequence for
132 574ed2c3 2017-11-29 stsp * any smaller y. x is the earliest possible mate to y
133 574ed2c3 2017-11-29 stsp * that occurs in such a subsequence.
135 574ed2c3 2017-11-29 stsp * Whenever any of the members of the equivalence class of
136 574ed2c3 2017-11-29 stsp * lines in file1 matable to a line in file0 has serial number
137 574ed2c3 2017-11-29 stsp * less than the y of some k-candidate, that k-candidate
138 574ed2c3 2017-11-29 stsp * with the smallest such y is replaced. The new
139 574ed2c3 2017-11-29 stsp * k-candidate is chained (via pred) to the current
140 574ed2c3 2017-11-29 stsp * k-1 candidate so that the actual subsequence can
141 574ed2c3 2017-11-29 stsp * be recovered. When a member has serial number greater
142 574ed2c3 2017-11-29 stsp * that the y of all k-candidates, the klist is extended.
143 574ed2c3 2017-11-29 stsp * At the end, the longest subsequence is pulled out
144 574ed2c3 2017-11-29 stsp * and placed in the array J by unravel
146 574ed2c3 2017-11-29 stsp * With J in hand, the matches there recorded are
147 574ed2c3 2017-11-29 stsp * check'ed against reality to assure that no spurious
148 574ed2c3 2017-11-29 stsp * matches have crept in due to hashing. If they have,
149 574ed2c3 2017-11-29 stsp * they are broken, and "jackpot" is recorded--a harmless
150 574ed2c3 2017-11-29 stsp * matter except that a true match for a spuriously
151 574ed2c3 2017-11-29 stsp * mated line may now be unnecessarily reported as a change.
153 574ed2c3 2017-11-29 stsp * Much of the complexity of the program comes simply
154 574ed2c3 2017-11-29 stsp * from trying to minimize core utilization and
155 574ed2c3 2017-11-29 stsp * maximize the range of doable problems by dynamically
156 574ed2c3 2017-11-29 stsp * allocating what is needed and reusing what is not.
157 574ed2c3 2017-11-29 stsp * The core requirements for problems larger than somewhat
158 574ed2c3 2017-11-29 stsp * are (in words) 2*length(file0) + length(file1) +
159 574ed2c3 2017-11-29 stsp * 3*(number of k-candidates installed), typically about
160 574ed2c3 2017-11-29 stsp * 6n words for files of length n.
163 574ed2c3 2017-11-29 stsp struct cand {
169 574ed2c3 2017-11-29 stsp struct line {
170 574ed2c3 2017-11-29 stsp int serial;
175 574ed2c3 2017-11-29 stsp * The following struct is used to record change information when
176 574ed2c3 2017-11-29 stsp * doing a "context" or "unified" diff. (see routine "change" to
177 574ed2c3 2017-11-29 stsp * understand the highly mnemonic field names)
179 574ed2c3 2017-11-29 stsp struct context_vec {
180 574ed2c3 2017-11-29 stsp int a; /* start line in old file */
181 574ed2c3 2017-11-29 stsp int b; /* end line in old file */
182 574ed2c3 2017-11-29 stsp int c; /* start line in new file */
183 574ed2c3 2017-11-29 stsp int d; /* end line in new file */
186 cb74ff21 2017-11-30 stsp static void diff_output(FILE *, const char *, ...);
187 322260e1 2018-01-26 mpi static int output(FILE *, struct got_diff_state *, struct got_diff_args *, const char *, FILE *, const char *, FILE *, int);
188 ed9e98a8 2017-11-29 stsp static void check(struct got_diff_state *, FILE *, FILE *, int);
189 cb74ff21 2017-11-30 stsp static void uni_range(FILE *, int, int);
190 cb74ff21 2017-11-30 stsp static void dump_unified_vec(FILE *, struct got_diff_state *, struct got_diff_args *, FILE *, FILE *, int);
191 322260e1 2018-01-26 mpi static int prepare(struct got_diff_state *, int, FILE *, off_t, int);
192 ed9e98a8 2017-11-29 stsp static void prune(struct got_diff_state *);
193 574ed2c3 2017-11-29 stsp static void equiv(struct line *, int, struct line *, int, int *);
194 ed9e98a8 2017-11-29 stsp static void unravel(struct got_diff_state *, int);
195 322260e1 2018-01-26 mpi static int unsort(struct line *, int, int *);
196 322260e1 2018-01-26 mpi static int change(FILE *, struct got_diff_state *, struct got_diff_args *, const char *, FILE *, const char *, FILE *, int, int, int, int, int *);
197 574ed2c3 2017-11-29 stsp static void sort(struct line *, int);
198 cb74ff21 2017-11-30 stsp static void print_header(FILE *, struct got_diff_state *, struct got_diff_args *, const char *, const char *);
199 574ed2c3 2017-11-29 stsp static int asciifile(FILE *);
200 cb74ff21 2017-11-30 stsp static int fetch(FILE *, struct got_diff_state *, struct got_diff_args *, long *, int, int, FILE *, int, int, int);
201 322260e1 2018-01-26 mpi static int newcand(struct got_diff_state *, int, int, int, int *);
202 ed9e98a8 2017-11-29 stsp static int search(struct got_diff_state *, int *, int, int);
203 574ed2c3 2017-11-29 stsp static int skipline(FILE *);
204 574ed2c3 2017-11-29 stsp static int isqrt(int);
205 ed9e98a8 2017-11-29 stsp static int stone(struct got_diff_state *, int *, int, int *, int *, int);
206 ed9e98a8 2017-11-29 stsp static int readhash(struct got_diff_state *, FILE *, int);
207 1c7f0520 2017-11-29 stsp static int files_differ(struct got_diff_state *, FILE *, FILE *, int);
208 ed9e98a8 2017-11-29 stsp static char *match_function(struct got_diff_state *, const long *, int, FILE *);
211 574ed2c3 2017-11-29 stsp * chrtran points to one of 2 translation tables: cup2low if folding upper to
212 574ed2c3 2017-11-29 stsp * lower case clow2low if not folding case
214 574ed2c3 2017-11-29 stsp u_char clow2low[256] = {
215 574ed2c3 2017-11-29 stsp 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a,
216 574ed2c3 2017-11-29 stsp 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15,
217 574ed2c3 2017-11-29 stsp 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x20,
218 574ed2c3 2017-11-29 stsp 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b,
219 574ed2c3 2017-11-29 stsp 0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36,
220 574ed2c3 2017-11-29 stsp 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, 0x40, 0x41,
221 574ed2c3 2017-11-29 stsp 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48, 0x49, 0x4a, 0x4b, 0x4c,
222 574ed2c3 2017-11-29 stsp 0x4d, 0x4e, 0x4f, 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57,
223 574ed2c3 2017-11-29 stsp 0x58, 0x59, 0x5a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, 0x60, 0x61, 0x62,
224 574ed2c3 2017-11-29 stsp 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d,
225 574ed2c3 2017-11-29 stsp 0x6e, 0x6f, 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78,
226 574ed2c3 2017-11-29 stsp 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, 0x80, 0x81, 0x82, 0x83,
227 574ed2c3 2017-11-29 stsp 0x84, 0x85, 0x86, 0x87, 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e,
228 574ed2c3 2017-11-29 stsp 0x8f, 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x99,
229 574ed2c3 2017-11-29 stsp 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, 0xa0, 0xa1, 0xa2, 0xa3, 0xa4,
230 574ed2c3 2017-11-29 stsp 0xa5, 0xa6, 0xa7, 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
231 574ed2c3 2017-11-29 stsp 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, 0xb8, 0xb9, 0xba,
232 574ed2c3 2017-11-29 stsp 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5,
233 574ed2c3 2017-11-29 stsp 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, 0xd0,
234 574ed2c3 2017-11-29 stsp 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda, 0xdb,
235 574ed2c3 2017-11-29 stsp 0xdc, 0xdd, 0xde, 0xdf, 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6,
236 574ed2c3 2017-11-29 stsp 0xe7, 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, 0xf0, 0xf1,
237 574ed2c3 2017-11-29 stsp 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9, 0xfa, 0xfb, 0xfc,
238 574ed2c3 2017-11-29 stsp 0xfd, 0xfe, 0xff
241 574ed2c3 2017-11-29 stsp u_char cup2low[256] = {
242 574ed2c3 2017-11-29 stsp 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a,
243 574ed2c3 2017-11-29 stsp 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15,
244 574ed2c3 2017-11-29 stsp 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x20,
245 574ed2c3 2017-11-29 stsp 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b,
246 574ed2c3 2017-11-29 stsp 0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36,
247 574ed2c3 2017-11-29 stsp 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, 0x60, 0x61,
248 574ed2c3 2017-11-29 stsp 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c,
249 574ed2c3 2017-11-29 stsp 0x6d, 0x6e, 0x6f, 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
250 574ed2c3 2017-11-29 stsp 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, 0x60, 0x61, 0x62,
251 574ed2c3 2017-11-29 stsp 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d,
252 574ed2c3 2017-11-29 stsp 0x6e, 0x6f, 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78,
253 574ed2c3 2017-11-29 stsp 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, 0x80, 0x81, 0x82, 0x83,
254 574ed2c3 2017-11-29 stsp 0x84, 0x85, 0x86, 0x87, 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e,
255 574ed2c3 2017-11-29 stsp 0x8f, 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x99,
256 574ed2c3 2017-11-29 stsp 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, 0xa0, 0xa1, 0xa2, 0xa3, 0xa4,
257 574ed2c3 2017-11-29 stsp 0xa5, 0xa6, 0xa7, 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
258 574ed2c3 2017-11-29 stsp 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, 0xb8, 0xb9, 0xba,
259 574ed2c3 2017-11-29 stsp 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5,
260 574ed2c3 2017-11-29 stsp 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, 0xd0,
261 574ed2c3 2017-11-29 stsp 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda, 0xdb,
262 574ed2c3 2017-11-29 stsp 0xdc, 0xdd, 0xde, 0xdf, 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6,
263 574ed2c3 2017-11-29 stsp 0xe7, 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, 0xf0, 0xf1,
264 574ed2c3 2017-11-29 stsp 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9, 0xfa, 0xfb, 0xfc,
265 574ed2c3 2017-11-29 stsp 0xfd, 0xfe, 0xff
268 cb74ff21 2017-11-30 stsp static void
269 cb74ff21 2017-11-30 stsp diff_output(FILE *outfile, const char *fmt, ...)
271 cb74ff21 2017-11-30 stsp va_list ap;
273 cb74ff21 2017-11-30 stsp va_start(ap, fmt);
274 cb74ff21 2017-11-30 stsp vfprintf(outfile, fmt, ap);
275 cb74ff21 2017-11-30 stsp va_end(ap);
278 7d283eee 2017-11-29 stsp const struct got_error *
279 f9d67749 2017-11-30 stsp got_diffreg(int *rval, FILE *f1, FILE *f2, int flags,
280 cb74ff21 2017-11-30 stsp struct got_diff_args *args, struct got_diff_state *ds, FILE *outfile)
282 7d283eee 2017-11-29 stsp const struct got_error *err = NULL;
286 7d283eee 2017-11-29 stsp *rval = D_SAME;
287 ed9e98a8 2017-11-29 stsp ds->anychange = 0;
288 ed9e98a8 2017-11-29 stsp ds->lastline = 0;
289 ed9e98a8 2017-11-29 stsp ds->lastmatchline = 0;
290 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr = ds->context_vec_start - 1;
291 76735683 2018-04-02 stsp ds->max_context = 64;
292 ed9e98a8 2017-11-29 stsp if (flags & D_IGNORECASE)
293 ed9e98a8 2017-11-29 stsp ds->chrtran = cup2low;
295 ed9e98a8 2017-11-29 stsp ds->chrtran = clow2low;
296 1c7f0520 2017-11-29 stsp if (S_ISDIR(ds->stb1.st_mode) != S_ISDIR(ds->stb2.st_mode)) {
297 1c7f0520 2017-11-29 stsp *rval = (S_ISDIR(ds->stb1.st_mode) ? D_MISMATCH1 : D_MISMATCH2);
298 7d283eee 2017-11-29 stsp return NULL;
300 ecf6e46e 2018-04-01 stsp if (flags & D_EMPTY1) {
301 574ed2c3 2017-11-29 stsp f1 = fopen(_PATH_DEVNULL, "r");
302 bb5dcc10 2018-04-01 stsp if (f1 == NULL) {
303 bb5dcc10 2018-04-01 stsp err = got_error_from_errno();
304 bb5dcc10 2018-04-01 stsp goto closem;
307 f9d67749 2017-11-30 stsp else if (f1 == NULL) {
308 8ba9a219 2017-11-29 stsp args->status |= 2;
309 574ed2c3 2017-11-29 stsp goto closem;
312 ecf6e46e 2018-04-01 stsp if (flags & D_EMPTY2) {
313 574ed2c3 2017-11-29 stsp f2 = fopen(_PATH_DEVNULL, "r");
314 bb5dcc10 2018-04-01 stsp if (f2 == NULL) {
315 bb5dcc10 2018-04-01 stsp err = got_error_from_errno();
316 bb5dcc10 2018-04-01 stsp goto closem;
318 ecf6e46e 2018-04-01 stsp } else if (f2 == NULL) {
319 8ba9a219 2017-11-29 stsp args->status |= 2;
320 574ed2c3 2017-11-29 stsp goto closem;
323 1c7f0520 2017-11-29 stsp switch (files_differ(ds, f1, f2, flags)) {
325 574ed2c3 2017-11-29 stsp goto closem;
329 574ed2c3 2017-11-29 stsp /* error */
330 8ba9a219 2017-11-29 stsp args->status |= 2;
331 574ed2c3 2017-11-29 stsp goto closem;
334 574ed2c3 2017-11-29 stsp if ((flags & D_FORCEASCII) == 0 &&
335 574ed2c3 2017-11-29 stsp (!asciifile(f1) || !asciifile(f2))) {
336 7d283eee 2017-11-29 stsp *rval = D_BINARY;
337 8ba9a219 2017-11-29 stsp args->status |= 1;
338 574ed2c3 2017-11-29 stsp goto closem;
340 322260e1 2018-01-26 mpi if (prepare(ds, 0, f1, ds->stb1.st_size, flags)) {
341 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
342 322260e1 2018-01-26 mpi goto closem;
344 322260e1 2018-01-26 mpi if (prepare(ds, 1, f2, ds->stb2.st_size, flags)) {
345 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
346 322260e1 2018-01-26 mpi goto closem;
350 ed9e98a8 2017-11-29 stsp sort(ds->sfile[0], ds->slen[0]);
351 ed9e98a8 2017-11-29 stsp sort(ds->sfile[1], ds->slen[1]);
353 ed9e98a8 2017-11-29 stsp ds->member = (int *)ds->file[1];
354 ed9e98a8 2017-11-29 stsp equiv(ds->sfile[0], ds->slen[0], ds->sfile[1], ds->slen[1], ds->member);
355 df51fc4e 2018-04-02 stsp p = reallocarray(ds->member, ds->slen[1] + 2, sizeof(*ds->member));
356 df51fc4e 2018-04-02 stsp if (p == NULL) {
357 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
358 7d283eee 2017-11-29 stsp goto closem;
360 df51fc4e 2018-04-02 stsp ds->member = p;
362 ed9e98a8 2017-11-29 stsp ds->class = (int *)ds->file[0];
363 322260e1 2018-01-26 mpi if (unsort(ds->sfile[0], ds->slen[0], ds->class)) {
364 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
365 322260e1 2018-01-26 mpi goto closem;
367 df51fc4e 2018-04-02 stsp p = reallocarray(ds->class, ds->slen[0] + 2, sizeof(*ds->class));
368 df51fc4e 2018-04-02 stsp if (p == NULL) {
369 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
370 7d283eee 2017-11-29 stsp goto closem;
372 df51fc4e 2018-04-02 stsp ds->class = p;
374 ed9e98a8 2017-11-29 stsp ds->klist = calloc(ds->slen[0] + 2, sizeof(*ds->klist));
375 ed9e98a8 2017-11-29 stsp if (ds->klist == NULL) {
376 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
377 7d283eee 2017-11-29 stsp goto closem;
379 ed9e98a8 2017-11-29 stsp ds->clen = 0;
380 ed9e98a8 2017-11-29 stsp ds->clistlen = 100;
381 ed9e98a8 2017-11-29 stsp ds->clist = calloc(ds->clistlen, sizeof(*ds->clist));
382 ed9e98a8 2017-11-29 stsp if (ds->clist == NULL) {
383 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
384 7d283eee 2017-11-29 stsp goto closem;
386 ed9e98a8 2017-11-29 stsp i = stone(ds, ds->class, ds->slen[0], ds->member, ds->klist, flags);
387 0a585a0d 2018-03-17 stsp if (i < 0) {
388 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
389 322260e1 2018-01-26 mpi goto closem;
392 df51fc4e 2018-04-02 stsp p = reallocarray(ds->J, ds->len[0] + 2, sizeof(*ds->J));
393 df51fc4e 2018-04-02 stsp if (p == NULL) {
394 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
395 7d283eee 2017-11-29 stsp goto closem;
398 ed9e98a8 2017-11-29 stsp unravel(ds, ds->klist[i]);
400 df51fc4e 2018-04-02 stsp lp = reallocarray(ds->ixold, ds->len[0] + 2, sizeof(*ds->ixold));
401 df51fc4e 2018-04-02 stsp if (lp == NULL) {
402 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
403 7d283eee 2017-11-29 stsp goto closem;
405 df51fc4e 2018-04-02 stsp ds->ixold = lp;
406 df51fc4e 2018-04-02 stsp lp = reallocarray(ds->ixnew, ds->len[1] + 2, sizeof(*ds->ixnew));
407 df51fc4e 2018-04-02 stsp if (lp == NULL) {
408 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
409 7d283eee 2017-11-29 stsp goto closem;
411 df51fc4e 2018-04-02 stsp ds->ixnew = lp;
412 ed9e98a8 2017-11-29 stsp check(ds, f1, f2, flags);
413 322260e1 2018-01-26 mpi if (output(outfile, ds, args, args->label[0], f1, args->label[1], f2,
415 0a585a0d 2018-03-17 stsp err = got_error_from_errno();
417 7b366981 2018-04-02 stsp free(ds->J);
418 9b98f34b 2018-04-02 stsp free(ds->member);
419 9b98f34b 2018-04-02 stsp free(ds->class);
420 6b59e13c 2018-04-02 stsp free(ds->clist);
421 6b59e13c 2018-04-02 stsp free(ds->klist);
422 5a7ffad5 2018-04-02 stsp free(ds->ixold);
423 5a7ffad5 2018-04-02 stsp free(ds->ixnew);
424 ed9e98a8 2017-11-29 stsp if (ds->anychange) {
425 8ba9a219 2017-11-29 stsp args->status |= 1;
426 7d283eee 2017-11-29 stsp if (*rval == D_SAME)
427 7d283eee 2017-11-29 stsp *rval = D_DIFFER;
429 574ed2c3 2017-11-29 stsp if (f1 != NULL)
430 574ed2c3 2017-11-29 stsp fclose(f1);
431 574ed2c3 2017-11-29 stsp if (f2 != NULL)
432 574ed2c3 2017-11-29 stsp fclose(f2);
434 7d283eee 2017-11-29 stsp return (err);
438 574ed2c3 2017-11-29 stsp * Check to see if the given files differ.
439 574ed2c3 2017-11-29 stsp * Returns 0 if they are the same, 1 if different, and -1 on error.
440 574ed2c3 2017-11-29 stsp * XXX - could use code from cmp(1) [faster]
443 1c7f0520 2017-11-29 stsp files_differ(struct got_diff_state *ds, FILE *f1, FILE *f2, int flags)
445 574ed2c3 2017-11-29 stsp char buf1[BUFSIZ], buf2[BUFSIZ];
446 574ed2c3 2017-11-29 stsp size_t i, j;
448 1c7f0520 2017-11-29 stsp if ((flags & (D_EMPTY1|D_EMPTY2)) || ds->stb1.st_size != ds->stb2.st_size ||
449 1c7f0520 2017-11-29 stsp (ds->stb1.st_mode & S_IFMT) != (ds->stb2.st_mode & S_IFMT))
450 574ed2c3 2017-11-29 stsp return (1);
452 574ed2c3 2017-11-29 stsp i = fread(buf1, 1, sizeof(buf1), f1);
453 574ed2c3 2017-11-29 stsp j = fread(buf2, 1, sizeof(buf2), f2);
454 574ed2c3 2017-11-29 stsp if ((!i && ferror(f1)) || (!j && ferror(f2)))
455 574ed2c3 2017-11-29 stsp return (-1);
456 574ed2c3 2017-11-29 stsp if (i != j)
457 574ed2c3 2017-11-29 stsp return (1);
458 574ed2c3 2017-11-29 stsp if (i == 0)
459 574ed2c3 2017-11-29 stsp return (0);
460 574ed2c3 2017-11-29 stsp if (memcmp(buf1, buf2, i) != 0)
461 574ed2c3 2017-11-29 stsp return (1);
466 ed9e98a8 2017-11-29 stsp prepare(struct got_diff_state *ds, int i, FILE *fd, off_t filesize, int flags)
468 df51fc4e 2018-04-02 stsp struct line *p, *q;
472 574ed2c3 2017-11-29 stsp rewind(fd);
474 574ed2c3 2017-11-29 stsp sz = (filesize <= SIZE_MAX ? filesize : SIZE_MAX) / 25;
475 574ed2c3 2017-11-29 stsp if (sz < 100)
478 322260e1 2018-01-26 mpi p = calloc(sz + 3, sizeof(*p));
479 322260e1 2018-01-26 mpi if (p == NULL)
480 322260e1 2018-01-26 mpi return (-1);
481 ed9e98a8 2017-11-29 stsp for (j = 0; (h = readhash(ds, fd, flags));) {
482 574ed2c3 2017-11-29 stsp if (j == sz) {
483 574ed2c3 2017-11-29 stsp sz = sz * 3 / 2;
484 df51fc4e 2018-04-02 stsp q = reallocarray(p, sz + 3, sizeof(*p));
485 df51fc4e 2018-04-02 stsp if (q == NULL) {
487 322260e1 2018-01-26 mpi return (-1);
491 574ed2c3 2017-11-29 stsp p[++j].value = h;
493 ed9e98a8 2017-11-29 stsp ds->len[i] = j;
494 ed9e98a8 2017-11-29 stsp ds->file[i] = p;
499 574ed2c3 2017-11-29 stsp static void
500 ed9e98a8 2017-11-29 stsp prune(struct got_diff_state *ds)
504 ed9e98a8 2017-11-29 stsp for (ds->pref = 0; ds->pref < ds->len[0] && ds->pref < ds->len[1] &&
505 ed9e98a8 2017-11-29 stsp ds->file[0][ds->pref + 1].value == ds->file[1][ds->pref + 1].value;
506 ed9e98a8 2017-11-29 stsp ds->pref++)
508 ed9e98a8 2017-11-29 stsp for (ds->suff = 0; ds->suff < ds->len[0] - ds->pref && ds->suff < ds->len[1] - ds->pref &&
509 ed9e98a8 2017-11-29 stsp ds->file[0][ds->len[0] - ds->suff].value == ds->file[1][ds->len[1] - ds->suff].value;
510 ed9e98a8 2017-11-29 stsp ds->suff++)
512 574ed2c3 2017-11-29 stsp for (j = 0; j < 2; j++) {
513 ed9e98a8 2017-11-29 stsp ds->sfile[j] = ds->file[j] + ds->pref;
514 ed9e98a8 2017-11-29 stsp ds->slen[j] = ds->len[j] - ds->pref - ds->suff;
515 ed9e98a8 2017-11-29 stsp for (i = 0; i <= ds->slen[j]; i++)
516 ed9e98a8 2017-11-29 stsp ds->sfile[j][i].serial = i;
520 574ed2c3 2017-11-29 stsp static void
521 574ed2c3 2017-11-29 stsp equiv(struct line *a, int n, struct line *b, int m, int *c)
526 574ed2c3 2017-11-29 stsp while (i <= n && j <= m) {
527 574ed2c3 2017-11-29 stsp if (a[i].value < b[j].value)
528 574ed2c3 2017-11-29 stsp a[i++].value = 0;
529 574ed2c3 2017-11-29 stsp else if (a[i].value == b[j].value)
530 574ed2c3 2017-11-29 stsp a[i++].value = j;
534 574ed2c3 2017-11-29 stsp while (i <= n)
535 574ed2c3 2017-11-29 stsp a[i++].value = 0;
536 574ed2c3 2017-11-29 stsp b[m + 1].value = 0;
538 574ed2c3 2017-11-29 stsp while (++j <= m) {
539 574ed2c3 2017-11-29 stsp c[j] = -b[j].serial;
540 574ed2c3 2017-11-29 stsp while (b[j + 1].value == b[j].value) {
542 574ed2c3 2017-11-29 stsp c[j] = b[j].serial;
548 574ed2c3 2017-11-29 stsp /* Code taken from ping.c */
550 574ed2c3 2017-11-29 stsp isqrt(int n)
552 574ed2c3 2017-11-29 stsp int y, x = 1;
554 574ed2c3 2017-11-29 stsp if (n == 0)
555 574ed2c3 2017-11-29 stsp return (0);
557 574ed2c3 2017-11-29 stsp do { /* newton was a stinker */
562 574ed2c3 2017-11-29 stsp } while ((x - y) > 1 || (x - y) < -1);
564 574ed2c3 2017-11-29 stsp return (x);
568 ed9e98a8 2017-11-29 stsp stone(struct got_diff_state *ds, int *a, int n, int *b, int *c, int flags)
570 574ed2c3 2017-11-29 stsp int i, k, y, j, l;
571 574ed2c3 2017-11-29 stsp int oldc, tc, oldl, sq;
572 574ed2c3 2017-11-29 stsp u_int numtries, bound;
575 574ed2c3 2017-11-29 stsp if (flags & D_MINIMAL)
576 574ed2c3 2017-11-29 stsp bound = UINT_MAX;
578 574ed2c3 2017-11-29 stsp sq = isqrt(n);
579 574ed2c3 2017-11-29 stsp bound = MAXIMUM(256, sq);
583 322260e1 2018-01-26 mpi c[0] = newcand(ds, 0, 0, 0, &error);
586 574ed2c3 2017-11-29 stsp for (i = 1; i <= n; i++) {
588 574ed2c3 2017-11-29 stsp if (j == 0)
592 574ed2c3 2017-11-29 stsp oldc = c[0];
593 574ed2c3 2017-11-29 stsp numtries = 0;
595 ed9e98a8 2017-11-29 stsp if (y <= ds->clist[oldc].y)
597 ed9e98a8 2017-11-29 stsp l = search(ds, c, k, y);
598 574ed2c3 2017-11-29 stsp if (l != oldl + 1)
599 574ed2c3 2017-11-29 stsp oldc = c[l - 1];
600 574ed2c3 2017-11-29 stsp if (l <= k) {
601 ed9e98a8 2017-11-29 stsp if (ds->clist[c[l]].y <= y)
604 322260e1 2018-01-26 mpi c[l] = newcand(ds, i, y, oldc, &error);
609 574ed2c3 2017-11-29 stsp numtries++;
611 322260e1 2018-01-26 mpi c[l] = newcand(ds, i, y, oldc, &error);
617 574ed2c3 2017-11-29 stsp } while ((y = b[++j]) > 0 && numtries < bound);
619 574ed2c3 2017-11-29 stsp return (k);
623 322260e1 2018-01-26 mpi newcand(struct got_diff_state *ds, int x, int y, int pred, int *errorp)
625 574ed2c3 2017-11-29 stsp struct cand *q;
627 ed9e98a8 2017-11-29 stsp if (ds->clen == ds->clistlen) {
628 ed9e98a8 2017-11-29 stsp ds->clistlen = ds->clistlen * 11 / 10;
629 df51fc4e 2018-04-02 stsp q = reallocarray(ds->clist, ds->clistlen, sizeof(*ds->clist));
630 df51fc4e 2018-04-02 stsp if (q == NULL) {
631 322260e1 2018-01-26 mpi *errorp = -1;
632 df51fc4e 2018-04-02 stsp free(ds->clist);
633 df51fc4e 2018-04-02 stsp ds->clist = NULL;
636 df51fc4e 2018-04-02 stsp ds->clist = q;
638 ed9e98a8 2017-11-29 stsp q = ds->clist + ds->clen;
641 574ed2c3 2017-11-29 stsp q->pred = pred;
642 322260e1 2018-01-26 mpi *errorp = 0;
643 ed9e98a8 2017-11-29 stsp return (ds->clen++);
647 ed9e98a8 2017-11-29 stsp search(struct got_diff_state *ds, int *c, int k, int y)
649 574ed2c3 2017-11-29 stsp int i, j, l, t;
651 ed9e98a8 2017-11-29 stsp if (ds->clist[c[k]].y < y) /* quick look for typical case */
652 574ed2c3 2017-11-29 stsp return (k + 1);
656 574ed2c3 2017-11-29 stsp l = (i + j) / 2;
657 574ed2c3 2017-11-29 stsp if (l <= i)
659 ed9e98a8 2017-11-29 stsp t = ds->clist[c[l]].y;
662 574ed2c3 2017-11-29 stsp else if (t < y)
665 574ed2c3 2017-11-29 stsp return (l);
667 574ed2c3 2017-11-29 stsp return (l + 1);
670 574ed2c3 2017-11-29 stsp static void
671 ed9e98a8 2017-11-29 stsp unravel(struct got_diff_state *ds, int p)
673 574ed2c3 2017-11-29 stsp struct cand *q;
676 ed9e98a8 2017-11-29 stsp for (i = 0; i <= ds->len[0]; i++)
677 ed9e98a8 2017-11-29 stsp ds->J[i] = i <= ds->pref ? i :
678 ed9e98a8 2017-11-29 stsp i > ds->len[0] - ds->suff ? i + ds->len[1] - ds->len[0] : 0;
679 ed9e98a8 2017-11-29 stsp for (q = ds->clist + p; q->y != 0; q = ds->clist + q->pred)
680 ed9e98a8 2017-11-29 stsp ds->J[q->x + ds->pref] = q->y + ds->pref;
684 574ed2c3 2017-11-29 stsp * Check does double duty:
685 574ed2c3 2017-11-29 stsp * 1. ferret out any fortuitous correspondences due
686 574ed2c3 2017-11-29 stsp * to confounding by hashing (which result in "jackpot")
687 574ed2c3 2017-11-29 stsp * 2. collect random access indexes to the two files
689 574ed2c3 2017-11-29 stsp static void
690 ed9e98a8 2017-11-29 stsp check(struct got_diff_state *ds, FILE *f1, FILE *f2, int flags)
692 574ed2c3 2017-11-29 stsp int i, j, jackpot, c, d;
693 574ed2c3 2017-11-29 stsp long ctold, ctnew;
695 574ed2c3 2017-11-29 stsp rewind(f1);
696 574ed2c3 2017-11-29 stsp rewind(f2);
698 ed9e98a8 2017-11-29 stsp ds->ixold[0] = ds->ixnew[0] = 0;
699 574ed2c3 2017-11-29 stsp jackpot = 0;
700 574ed2c3 2017-11-29 stsp ctold = ctnew = 0;
701 ed9e98a8 2017-11-29 stsp for (i = 1; i <= ds->len[0]; i++) {
702 ed9e98a8 2017-11-29 stsp if (ds->J[i] == 0) {
703 ed9e98a8 2017-11-29 stsp ds->ixold[i] = ctold += skipline(f1);
706 ed9e98a8 2017-11-29 stsp while (j < ds->J[i]) {
707 ed9e98a8 2017-11-29 stsp ds->ixnew[j] = ctnew += skipline(f2);
710 574ed2c3 2017-11-29 stsp if (flags & (D_FOLDBLANKS|D_IGNOREBLANKS|D_IGNORECASE)) {
712 574ed2c3 2017-11-29 stsp c = getc(f1);
713 574ed2c3 2017-11-29 stsp d = getc(f2);
715 574ed2c3 2017-11-29 stsp * GNU diff ignores a missing newline
716 574ed2c3 2017-11-29 stsp * in one file for -b or -w.
718 574ed2c3 2017-11-29 stsp if (flags & (D_FOLDBLANKS|D_IGNOREBLANKS)) {
719 574ed2c3 2017-11-29 stsp if (c == EOF && d == '\n') {
722 574ed2c3 2017-11-29 stsp } else if (c == '\n' && d == EOF) {
729 574ed2c3 2017-11-29 stsp if ((flags & D_FOLDBLANKS) && isspace(c) &&
730 574ed2c3 2017-11-29 stsp isspace(d)) {
732 574ed2c3 2017-11-29 stsp if (c == '\n')
735 574ed2c3 2017-11-29 stsp } while (isspace(c = getc(f1)));
737 574ed2c3 2017-11-29 stsp if (d == '\n')
740 574ed2c3 2017-11-29 stsp } while (isspace(d = getc(f2)));
741 574ed2c3 2017-11-29 stsp } else if ((flags & D_IGNOREBLANKS)) {
742 574ed2c3 2017-11-29 stsp while (isspace(c) && c != '\n') {
743 574ed2c3 2017-11-29 stsp c = getc(f1);
746 574ed2c3 2017-11-29 stsp while (isspace(d) && d != '\n') {
747 574ed2c3 2017-11-29 stsp d = getc(f2);
751 ed9e98a8 2017-11-29 stsp if (ds->chrtran[c] != ds->chrtran[d]) {
753 ed9e98a8 2017-11-29 stsp ds->J[i] = 0;
754 574ed2c3 2017-11-29 stsp if (c != '\n' && c != EOF)
755 574ed2c3 2017-11-29 stsp ctold += skipline(f1);
756 574ed2c3 2017-11-29 stsp if (d != '\n' && c != EOF)
757 574ed2c3 2017-11-29 stsp ctnew += skipline(f2);
760 574ed2c3 2017-11-29 stsp if (c == '\n' || c == EOF)
767 574ed2c3 2017-11-29 stsp if ((c = getc(f1)) != (d = getc(f2))) {
768 574ed2c3 2017-11-29 stsp /* jackpot++; */
769 ed9e98a8 2017-11-29 stsp ds->J[i] = 0;
770 574ed2c3 2017-11-29 stsp if (c != '\n' && c != EOF)
771 574ed2c3 2017-11-29 stsp ctold += skipline(f1);
772 574ed2c3 2017-11-29 stsp if (d != '\n' && c != EOF)
773 574ed2c3 2017-11-29 stsp ctnew += skipline(f2);
776 574ed2c3 2017-11-29 stsp if (c == '\n' || c == EOF)
780 ed9e98a8 2017-11-29 stsp ds->ixold[i] = ctold;
781 ed9e98a8 2017-11-29 stsp ds->ixnew[j] = ctnew;
784 ed9e98a8 2017-11-29 stsp for (; j <= ds->len[1]; j++)
785 ed9e98a8 2017-11-29 stsp ds->ixnew[j] = ctnew += skipline(f2);
787 574ed2c3 2017-11-29 stsp * if (jackpot)
788 574ed2c3 2017-11-29 stsp * fprintf(stderr, "jackpot\n");
792 574ed2c3 2017-11-29 stsp /* shellsort CACM #201 */
793 574ed2c3 2017-11-29 stsp static void
794 574ed2c3 2017-11-29 stsp sort(struct line *a, int n)
796 574ed2c3 2017-11-29 stsp struct line *ai, *aim, w;
797 574ed2c3 2017-11-29 stsp int j, m = 0, k;
799 574ed2c3 2017-11-29 stsp if (n == 0)
801 574ed2c3 2017-11-29 stsp for (j = 1; j <= n; j *= 2)
802 574ed2c3 2017-11-29 stsp m = 2 * j - 1;
803 574ed2c3 2017-11-29 stsp for (m /= 2; m != 0; m /= 2) {
805 574ed2c3 2017-11-29 stsp for (j = 1; j <= k; j++) {
806 574ed2c3 2017-11-29 stsp for (ai = &a[j]; ai > a; ai -= m) {
807 574ed2c3 2017-11-29 stsp aim = &ai[m];
808 574ed2c3 2017-11-29 stsp if (aim < ai)
809 574ed2c3 2017-11-29 stsp break; /* wraparound */
810 574ed2c3 2017-11-29 stsp if (aim->value > ai[0].value ||
811 574ed2c3 2017-11-29 stsp (aim->value == ai[0].value &&
812 574ed2c3 2017-11-29 stsp aim->serial > ai[0].serial))
814 574ed2c3 2017-11-29 stsp w.value = ai[0].value;
815 574ed2c3 2017-11-29 stsp ai[0].value = aim->value;
816 574ed2c3 2017-11-29 stsp aim->value = w.value;
817 574ed2c3 2017-11-29 stsp w.serial = ai[0].serial;
818 574ed2c3 2017-11-29 stsp ai[0].serial = aim->serial;
819 574ed2c3 2017-11-29 stsp aim->serial = w.serial;
826 574ed2c3 2017-11-29 stsp unsort(struct line *f, int l, int *b)
830 322260e1 2018-01-26 mpi a = calloc(l + 1, sizeof(*a));
831 322260e1 2018-01-26 mpi if (a == NULL)
832 322260e1 2018-01-26 mpi return (-1);
833 574ed2c3 2017-11-29 stsp for (i = 1; i <= l; i++)
834 574ed2c3 2017-11-29 stsp a[f[i].serial] = f[i].value;
835 574ed2c3 2017-11-29 stsp for (i = 1; i <= l; i++)
836 574ed2c3 2017-11-29 stsp b[i] = a[i];
843 574ed2c3 2017-11-29 stsp skipline(FILE *f)
847 574ed2c3 2017-11-29 stsp for (i = 1; (c = getc(f)) != '\n' && c != EOF; i++)
849 574ed2c3 2017-11-29 stsp return (i);
853 cb74ff21 2017-11-30 stsp output(FILE *outfile, struct got_diff_state *ds, struct got_diff_args *args,
854 f9d67749 2017-11-30 stsp const char *file1, FILE *f1, const char *file2, FILE *f2, int flags)
856 574ed2c3 2017-11-29 stsp int m, i0, i1, j0, j1;
857 322260e1 2018-01-26 mpi int error = 0;
859 574ed2c3 2017-11-29 stsp rewind(f1);
860 574ed2c3 2017-11-29 stsp rewind(f2);
861 ed9e98a8 2017-11-29 stsp m = ds->len[0];
862 ed9e98a8 2017-11-29 stsp ds->J[0] = 0;
863 ed9e98a8 2017-11-29 stsp ds->J[m + 1] = ds->len[1] + 1;
864 0165cdf0 2018-04-02 stsp for (i0 = 1; i0 <= m; i0 = i1 + 1) {
865 0165cdf0 2018-04-02 stsp while (i0 <= m && ds->J[i0] == ds->J[i0 - 1] + 1)
867 0165cdf0 2018-04-02 stsp j0 = ds->J[i0 - 1] + 1;
868 0165cdf0 2018-04-02 stsp i1 = i0 - 1;
869 0165cdf0 2018-04-02 stsp while (i1 < m && ds->J[i1 + 1] == 0)
871 0165cdf0 2018-04-02 stsp j1 = ds->J[i1 + 1] - 1;
872 0165cdf0 2018-04-02 stsp ds->J[i1] = j1;
873 0165cdf0 2018-04-02 stsp error = change(outfile, ds, args, file1, f1, file2, f2,
874 0165cdf0 2018-04-02 stsp i0, i1, j0, j1, &flags);
876 0165cdf0 2018-04-02 stsp return (error);
878 322260e1 2018-01-26 mpi if (m == 0) {
879 322260e1 2018-01-26 mpi error = change(outfile, ds, args, file1, f1, file2, f2, 1, 0,
880 322260e1 2018-01-26 mpi 1, ds->len[1], &flags);
882 322260e1 2018-01-26 mpi return (error);
884 84e11851 2018-04-02 stsp if (ds->anychange != 0)
885 84e11851 2018-04-02 stsp dump_unified_vec(outfile, ds, args, f1, f2, flags);
890 574ed2c3 2017-11-29 stsp static void
891 cb74ff21 2017-11-30 stsp uni_range(FILE *outfile, int a, int b)
894 cb74ff21 2017-11-30 stsp diff_output(outfile, "%d,%d", a, b - a + 1);
895 574ed2c3 2017-11-29 stsp else if (a == b)
896 cb74ff21 2017-11-30 stsp diff_output(outfile, "%d", b);
898 cb74ff21 2017-11-30 stsp diff_output(outfile, "%d,0", b);
902 574ed2c3 2017-11-29 stsp * Indicate that there is a difference between lines a and b of the from file
903 574ed2c3 2017-11-29 stsp * to get to lines c to d of the to file. If a is greater then b then there
904 574ed2c3 2017-11-29 stsp * are no lines in the from file involved and this means that there were
905 574ed2c3 2017-11-29 stsp * lines appended (beginning at b). If c is greater than d then there are
906 574ed2c3 2017-11-29 stsp * lines missing from the to file.
909 cb74ff21 2017-11-30 stsp change(FILE *outfile, struct got_diff_state *ds, struct got_diff_args *args,
910 f9d67749 2017-11-30 stsp const char *file1, FILE *f1, const char *file2, FILE *f2,
911 ed9e98a8 2017-11-29 stsp int a, int b, int c, int d, int *pflags)
915 c48ceb4c 2018-04-02 stsp if (a > b && c > d)
918 574ed2c3 2017-11-29 stsp if (*pflags & D_HEADER) {
919 cb74ff21 2017-11-30 stsp diff_output(outfile, "%s %s %s\n", args->diffargs, file1, file2);
920 574ed2c3 2017-11-29 stsp *pflags &= ~D_HEADER;
922 84e11851 2018-04-02 stsp if (args->diff_format == D_UNIFIED) {
924 574ed2c3 2017-11-29 stsp * Allocate change records as needed.
926 ed9e98a8 2017-11-29 stsp if (ds->context_vec_ptr == ds->context_vec_end - 1) {
927 df51fc4e 2018-04-02 stsp struct context_vec *cvp;
928 76735683 2018-04-02 stsp ptrdiff_t offset;
929 76735683 2018-04-02 stsp offset = ds->context_vec_ptr - ds->context_vec_start;
930 76735683 2018-04-02 stsp ds->max_context <<= 1;
931 322260e1 2018-01-26 mpi ds->context_vec_start =
932 df51fc4e 2018-04-02 stsp cvp = reallocarray(ds->context_vec_start,
933 df51fc4e 2018-04-02 stsp ds->max_context, sizeof(*ds->context_vec_start));
934 df51fc4e 2018-04-02 stsp if (cvp == NULL) {
935 df51fc4e 2018-04-02 stsp free(ds->context_vec_start);
936 322260e1 2018-01-26 mpi return (-1);
938 df51fc4e 2018-04-02 stsp ds->context_vec_start = cvp;
939 76735683 2018-04-02 stsp ds->context_vec_end = ds->context_vec_start +
940 76735683 2018-04-02 stsp ds->max_context;
941 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr = ds->context_vec_start + offset;
943 ed9e98a8 2017-11-29 stsp if (ds->anychange == 0) {
945 574ed2c3 2017-11-29 stsp * Print the context/unidiff header first time through.
947 cb74ff21 2017-11-30 stsp print_header(outfile, ds, args, file1, file2);
948 ed9e98a8 2017-11-29 stsp ds->anychange = 1;
949 8ba9a219 2017-11-29 stsp } else if (a > ds->context_vec_ptr->b + (2 * args->diff_context) + 1 &&
950 8ba9a219 2017-11-29 stsp c > ds->context_vec_ptr->d + (2 * args->diff_context) + 1) {
952 574ed2c3 2017-11-29 stsp * If this change is more than 'diff_context' lines from the
953 574ed2c3 2017-11-29 stsp * previous change, dump the record and reset it.
955 84e11851 2018-04-02 stsp dump_unified_vec(outfile, ds, args, f1, f2, *pflags);
957 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr++;
958 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr->a = a;
959 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr->b = b;
960 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr->c = c;
961 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr->d = d;
964 ed9e98a8 2017-11-29 stsp if (ds->anychange == 0)
965 ed9e98a8 2017-11-29 stsp ds->anychange = 1;
966 1afa8e43 2018-04-02 stsp if (args->diff_format == D_BRIEF)
968 119f8600 2018-04-02 stsp i = fetch(outfile, ds, args, ds->ixnew, c, d, f2, '\0', 0, *pflags);
973 cb74ff21 2017-11-30 stsp fetch(FILE *outfile, struct got_diff_state *ds, struct got_diff_args *args,
974 8ba9a219 2017-11-29 stsp long *f, int a, int b, FILE *lb, int ch, int oldfile, int flags)
976 574ed2c3 2017-11-29 stsp int i, j, c, lastc, col, nc;
979 574ed2c3 2017-11-29 stsp return (0);
980 574ed2c3 2017-11-29 stsp for (i = a; i <= b; i++) {
981 574ed2c3 2017-11-29 stsp fseek(lb, f[i - 1], SEEK_SET);
982 574ed2c3 2017-11-29 stsp nc = f[i] - f[i - 1];
983 c48ceb4c 2018-04-02 stsp if (ch != '\0') {
984 cb74ff21 2017-11-30 stsp diff_output(outfile, "%c", ch);
985 119f8600 2018-04-02 stsp if (args->Tflag && args->diff_format == D_UNIFIED)
986 cb74ff21 2017-11-30 stsp diff_output(outfile, "\t");
987 8ba9a219 2017-11-29 stsp else if (args->diff_format != D_UNIFIED)
988 cb74ff21 2017-11-30 stsp diff_output(outfile, " ");
991 574ed2c3 2017-11-29 stsp for (j = 0, lastc = '\0'; j < nc; j++, lastc = c) {
992 574ed2c3 2017-11-29 stsp if ((c = getc(lb)) == EOF) {
993 1afa8e43 2018-04-02 stsp diff_output(outfile, "\n\\ No newline at end of "
995 574ed2c3 2017-11-29 stsp return (0);
997 574ed2c3 2017-11-29 stsp if (c == '\t' && (flags & D_EXPANDTABS)) {
999 cb74ff21 2017-11-30 stsp diff_output(outfile, " ");
1000 574ed2c3 2017-11-29 stsp } while (++col & 7);
1002 cb74ff21 2017-11-30 stsp diff_output(outfile, "%c", c);
1007 574ed2c3 2017-11-29 stsp return (0);
1011 574ed2c3 2017-11-29 stsp * Hash function taken from Robert Sedgewick, Algorithms in C, 3d ed., p 578.
1013 574ed2c3 2017-11-29 stsp static int
1014 ed9e98a8 2017-11-29 stsp readhash(struct got_diff_state *ds, FILE *f, int flags)
1016 574ed2c3 2017-11-29 stsp int i, t, space;
1020 574ed2c3 2017-11-29 stsp space = 0;
1021 574ed2c3 2017-11-29 stsp if ((flags & (D_FOLDBLANKS|D_IGNOREBLANKS)) == 0) {
1022 574ed2c3 2017-11-29 stsp if (flags & D_IGNORECASE)
1023 574ed2c3 2017-11-29 stsp for (i = 0; (t = getc(f)) != '\n'; i++) {
1024 574ed2c3 2017-11-29 stsp if (t == EOF) {
1025 574ed2c3 2017-11-29 stsp if (i == 0)
1026 574ed2c3 2017-11-29 stsp return (0);
1029 ed9e98a8 2017-11-29 stsp sum = sum * 127 + ds->chrtran[t];
1032 574ed2c3 2017-11-29 stsp for (i = 0; (t = getc(f)) != '\n'; i++) {
1033 574ed2c3 2017-11-29 stsp if (t == EOF) {
1034 574ed2c3 2017-11-29 stsp if (i == 0)
1035 574ed2c3 2017-11-29 stsp return (0);
1038 574ed2c3 2017-11-29 stsp sum = sum * 127 + t;
1041 574ed2c3 2017-11-29 stsp for (i = 0;;) {
1042 574ed2c3 2017-11-29 stsp switch (t = getc(f)) {
1043 574ed2c3 2017-11-29 stsp case '\t':
1044 574ed2c3 2017-11-29 stsp case '\r':
1045 574ed2c3 2017-11-29 stsp case '\v':
1046 574ed2c3 2017-11-29 stsp case '\f':
1051 574ed2c3 2017-11-29 stsp if (space && (flags & D_IGNOREBLANKS) == 0) {
1053 574ed2c3 2017-11-29 stsp space = 0;
1055 ed9e98a8 2017-11-29 stsp sum = sum * 127 + ds->chrtran[t];
1059 574ed2c3 2017-11-29 stsp if (i == 0)
1060 574ed2c3 2017-11-29 stsp return (0);
1061 574ed2c3 2017-11-29 stsp /* FALLTHROUGH */
1062 574ed2c3 2017-11-29 stsp case '\n':
1069 574ed2c3 2017-11-29 stsp * There is a remote possibility that we end up with a zero sum.
1070 574ed2c3 2017-11-29 stsp * Zero is used as an EOF marker, so return 1 instead.
1072 574ed2c3 2017-11-29 stsp return (sum == 0 ? 1 : sum);
1075 574ed2c3 2017-11-29 stsp static int
1076 574ed2c3 2017-11-29 stsp asciifile(FILE *f)
1078 574ed2c3 2017-11-29 stsp unsigned char buf[BUFSIZ];
1079 574ed2c3 2017-11-29 stsp size_t cnt;
1081 574ed2c3 2017-11-29 stsp if (f == NULL)
1082 574ed2c3 2017-11-29 stsp return (1);
1084 574ed2c3 2017-11-29 stsp rewind(f);
1085 574ed2c3 2017-11-29 stsp cnt = fread(buf, 1, sizeof(buf), f);
1086 574ed2c3 2017-11-29 stsp return (memchr(buf, '\0', cnt) == NULL);
1089 574ed2c3 2017-11-29 stsp #define begins_with(s, pre) (strncmp(s, pre, sizeof(pre)-1) == 0)
1091 574ed2c3 2017-11-29 stsp static char *
1092 ed9e98a8 2017-11-29 stsp match_function(struct got_diff_state *ds, const long *f, int pos, FILE *fp)
1094 574ed2c3 2017-11-29 stsp unsigned char buf[FUNCTION_CONTEXT_SIZE];
1095 574ed2c3 2017-11-29 stsp size_t nc;
1096 ed9e98a8 2017-11-29 stsp int last = ds->lastline;
1097 574ed2c3 2017-11-29 stsp char *state = NULL;
1099 ed9e98a8 2017-11-29 stsp ds->lastline = pos;
1100 574ed2c3 2017-11-29 stsp while (pos > last) {
1101 574ed2c3 2017-11-29 stsp fseek(fp, f[pos - 1], SEEK_SET);
1102 574ed2c3 2017-11-29 stsp nc = f[pos] - f[pos - 1];
1103 574ed2c3 2017-11-29 stsp if (nc >= sizeof(buf))
1104 574ed2c3 2017-11-29 stsp nc = sizeof(buf) - 1;
1105 574ed2c3 2017-11-29 stsp nc = fread(buf, 1, nc, fp);
1106 574ed2c3 2017-11-29 stsp if (nc > 0) {
1107 574ed2c3 2017-11-29 stsp buf[nc] = '\0';
1108 574ed2c3 2017-11-29 stsp buf[strcspn(buf, "\n")] = '\0';
1109 574ed2c3 2017-11-29 stsp if (isalpha(buf[0]) || buf[0] == '_' || buf[0] == '$') {
1110 574ed2c3 2017-11-29 stsp if (begins_with(buf, "private:")) {
1111 574ed2c3 2017-11-29 stsp if (!state)
1112 574ed2c3 2017-11-29 stsp state = " (private)";
1113 574ed2c3 2017-11-29 stsp } else if (begins_with(buf, "protected:")) {
1114 574ed2c3 2017-11-29 stsp if (!state)
1115 574ed2c3 2017-11-29 stsp state = " (protected)";
1116 574ed2c3 2017-11-29 stsp } else if (begins_with(buf, "public:")) {
1117 574ed2c3 2017-11-29 stsp if (!state)
1118 574ed2c3 2017-11-29 stsp state = " (public)";
1120 ed9e98a8 2017-11-29 stsp strlcpy(ds->lastbuf, buf, sizeof ds->lastbuf);
1121 574ed2c3 2017-11-29 stsp if (state)
1122 ed9e98a8 2017-11-29 stsp strlcat(ds->lastbuf, state,
1123 ed9e98a8 2017-11-29 stsp sizeof ds->lastbuf);
1124 ed9e98a8 2017-11-29 stsp ds->lastmatchline = pos;
1125 ed9e98a8 2017-11-29 stsp return ds->lastbuf;
1131 ed9e98a8 2017-11-29 stsp return ds->lastmatchline > 0 ? ds->lastbuf : NULL;
1134 574ed2c3 2017-11-29 stsp /* dump accumulated "unified" diff changes */
1135 574ed2c3 2017-11-29 stsp static void
1136 cb74ff21 2017-11-30 stsp dump_unified_vec(FILE *outfile, struct got_diff_state *ds, struct got_diff_args *args,
1137 8ba9a219 2017-11-29 stsp FILE *f1, FILE *f2, int flags)
1139 ed9e98a8 2017-11-29 stsp struct context_vec *cvp = ds->context_vec_start;
1140 574ed2c3 2017-11-29 stsp int lowa, upb, lowc, upd;
1141 574ed2c3 2017-11-29 stsp int a, b, c, d;
1142 574ed2c3 2017-11-29 stsp char ch, *f;
1144 ed9e98a8 2017-11-29 stsp if (ds->context_vec_start > ds->context_vec_ptr)
1147 574ed2c3 2017-11-29 stsp b = d = 0; /* gcc */
1148 8ba9a219 2017-11-29 stsp lowa = MAXIMUM(1, cvp->a - args->diff_context);
1149 8ba9a219 2017-11-29 stsp upb = MINIMUM(ds->len[0], ds->context_vec_ptr->b + args->diff_context);
1150 8ba9a219 2017-11-29 stsp lowc = MAXIMUM(1, cvp->c - args->diff_context);
1151 8ba9a219 2017-11-29 stsp upd = MINIMUM(ds->len[1], ds->context_vec_ptr->d + args->diff_context);
1153 cb74ff21 2017-11-30 stsp diff_output(outfile, "@@ -");
1154 cb74ff21 2017-11-30 stsp uni_range(outfile, lowa, upb);
1155 cb74ff21 2017-11-30 stsp diff_output(outfile, " +");
1156 cb74ff21 2017-11-30 stsp uni_range(outfile, lowc, upd);
1157 cb74ff21 2017-11-30 stsp diff_output(outfile, " @@");
1158 574ed2c3 2017-11-29 stsp if ((flags & D_PROTOTYPE)) {
1159 ed9e98a8 2017-11-29 stsp f = match_function(ds, ds->ixold, lowa-1, f1);
1160 574ed2c3 2017-11-29 stsp if (f != NULL)
1161 cb74ff21 2017-11-30 stsp diff_output(outfile, " %s", f);
1163 cb74ff21 2017-11-30 stsp diff_output(outfile, "\n");
1166 574ed2c3 2017-11-29 stsp * Output changes in "unified" diff format--the old and new lines
1167 574ed2c3 2017-11-29 stsp * are printed together.
1169 ed9e98a8 2017-11-29 stsp for (; cvp <= ds->context_vec_ptr; cvp++) {
1170 574ed2c3 2017-11-29 stsp a = cvp->a;
1171 574ed2c3 2017-11-29 stsp b = cvp->b;
1172 574ed2c3 2017-11-29 stsp c = cvp->c;
1173 574ed2c3 2017-11-29 stsp d = cvp->d;
1176 574ed2c3 2017-11-29 stsp * c: both new and old changes
1177 574ed2c3 2017-11-29 stsp * d: only changes in the old file
1178 574ed2c3 2017-11-29 stsp * a: only changes in the new file
1180 574ed2c3 2017-11-29 stsp if (a <= b && c <= d)
1183 574ed2c3 2017-11-29 stsp ch = (a <= b) ? 'd' : 'a';
1185 574ed2c3 2017-11-29 stsp switch (ch) {
1187 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixold, lowa, a - 1, f1, ' ', 0, flags);
1188 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixold, a, b, f1, '-', 0, flags);
1189 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixnew, c, d, f2, '+', 0, flags);
1192 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixold, lowa, a - 1, f1, ' ', 0, flags);
1193 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixold, a, b, f1, '-', 0, flags);
1196 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixnew, lowc, c - 1, f2, ' ', 0, flags);
1197 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixnew, c, d, f2, '+', 0, flags);
1200 574ed2c3 2017-11-29 stsp lowa = b + 1;
1201 574ed2c3 2017-11-29 stsp lowc = d + 1;
1203 cb74ff21 2017-11-30 stsp fetch(outfile, ds, args, ds->ixnew, d + 1, upd, f2, ' ', 0, flags);
1205 ed9e98a8 2017-11-29 stsp ds->context_vec_ptr = ds->context_vec_start - 1;
1208 574ed2c3 2017-11-29 stsp static void
1209 cb74ff21 2017-11-30 stsp print_header(FILE *outfile, struct got_diff_state *ds, struct got_diff_args *args,
1210 8ba9a219 2017-11-29 stsp const char *file1, const char *file2)
1212 8ba9a219 2017-11-29 stsp if (args->label[0] != NULL)
1213 84e11851 2018-04-02 stsp diff_output(outfile, "--- %s\n", args->label[0]);
1215 84e11851 2018-04-02 stsp diff_output(outfile, "--- %s\t%s", file1,
1216 84e11851 2018-04-02 stsp ctime(&ds->stb1.st_mtime));
1217 8ba9a219 2017-11-29 stsp if (args->label[1] != NULL)
1218 84e11851 2018-04-02 stsp diff_output(outfile, "+++ %s\n", args->label[1]);
1220 84e11851 2018-04-02 stsp diff_output(outfile, "+++ %s\t%s", file2,
1221 84e11851 2018-04-02 stsp ctime(&ds->stb2.st_mtime));
