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 574ed2c3 2017-11-29 stsp #include <stddef.h>
77 574ed2c3 2017-11-29 stsp #include <stdint.h>
78 574ed2c3 2017-11-29 stsp #include <stdio.h>
79 574ed2c3 2017-11-29 stsp #include <stdlib.h>
80 574ed2c3 2017-11-29 stsp #include <string.h>
81 574ed2c3 2017-11-29 stsp #include <unistd.h>
82 574ed2c3 2017-11-29 stsp #include <limits.h>
83 7d283eee 2017-11-29 stsp #include <sha1.h>
84 7d283eee 2017-11-29 stsp #include <zlib.h>
86 7d283eee 2017-11-29 stsp #include "got_error.h"
87 7d283eee 2017-11-29 stsp #include "got_object.h"
88 7d283eee 2017-11-29 stsp #include "got_diff.h"
90 574ed2c3 2017-11-29 stsp #include "diff.h"
91 574ed2c3 2017-11-29 stsp #include "xmalloc.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;
172 574ed2c3 2017-11-29 stsp } *file[2];
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 574ed2c3 2017-11-29 stsp #define diff_output printf
187 574ed2c3 2017-11-29 stsp static FILE *opentemp(const char *);
188 574ed2c3 2017-11-29 stsp static void output(char *, FILE *, char *, FILE *, int);
189 574ed2c3 2017-11-29 stsp static void check(FILE *, FILE *, int);
190 574ed2c3 2017-11-29 stsp static void range(int, int, char *);
191 574ed2c3 2017-11-29 stsp static void uni_range(int, int);
192 574ed2c3 2017-11-29 stsp static void dump_context_vec(FILE *, FILE *, int);
193 574ed2c3 2017-11-29 stsp static void dump_unified_vec(FILE *, FILE *, int);
194 574ed2c3 2017-11-29 stsp static void prepare(int, FILE *, off_t, int);
195 574ed2c3 2017-11-29 stsp static void prune(void);
196 574ed2c3 2017-11-29 stsp static void equiv(struct line *, int, struct line *, int, int *);
197 574ed2c3 2017-11-29 stsp static void unravel(int);
198 574ed2c3 2017-11-29 stsp static void unsort(struct line *, int, int *);
199 574ed2c3 2017-11-29 stsp static void change(char *, FILE *, char *, FILE *, int, int, int, int, int *);
200 574ed2c3 2017-11-29 stsp static void sort(struct line *, int);
201 574ed2c3 2017-11-29 stsp static void print_header(const char *, const char *);
202 574ed2c3 2017-11-29 stsp static int ignoreline(char *);
203 574ed2c3 2017-11-29 stsp static int asciifile(FILE *);
204 574ed2c3 2017-11-29 stsp static int fetch(long *, int, int, FILE *, int, int, int);
205 574ed2c3 2017-11-29 stsp static int newcand(int, int, int);
206 574ed2c3 2017-11-29 stsp static int search(int *, int, int);
207 574ed2c3 2017-11-29 stsp static int skipline(FILE *);
208 574ed2c3 2017-11-29 stsp static int isqrt(int);
209 574ed2c3 2017-11-29 stsp static int stone(int *, int, int *, int *, int);
210 574ed2c3 2017-11-29 stsp static int readhash(FILE *, int);
211 574ed2c3 2017-11-29 stsp static int files_differ(FILE *, FILE *, int);
212 574ed2c3 2017-11-29 stsp static char *match_function(const long *, int, FILE *);
213 574ed2c3 2017-11-29 stsp static char *preadline(int, size_t, off_t);
215 574ed2c3 2017-11-29 stsp static int *J; /* will be overlaid on class */
216 574ed2c3 2017-11-29 stsp static int *class; /* will be overlaid on file[0] */
217 574ed2c3 2017-11-29 stsp static int *klist; /* will be overlaid on file[0] after class */
218 574ed2c3 2017-11-29 stsp static int *member; /* will be overlaid on file[1] */
219 574ed2c3 2017-11-29 stsp static int clen;
220 574ed2c3 2017-11-29 stsp static int inifdef; /* whether or not we are in a #ifdef block */
221 574ed2c3 2017-11-29 stsp static int len[2];
222 574ed2c3 2017-11-29 stsp static int pref, suff; /* length of prefix and suffix */
223 574ed2c3 2017-11-29 stsp static int slen[2];
224 574ed2c3 2017-11-29 stsp static int anychange;
225 574ed2c3 2017-11-29 stsp static long *ixnew; /* will be overlaid on file[1] */
226 574ed2c3 2017-11-29 stsp static long *ixold; /* will be overlaid on klist */
227 574ed2c3 2017-11-29 stsp static struct cand *clist; /* merely a free storage pot for candidates */
228 574ed2c3 2017-11-29 stsp static int clistlen; /* the length of clist */
229 574ed2c3 2017-11-29 stsp static struct line *sfile[2]; /* shortened by pruning common prefix/suffix */
230 574ed2c3 2017-11-29 stsp static u_char *chrtran; /* translation table for case-folding */
231 574ed2c3 2017-11-29 stsp static struct context_vec *context_vec_start;
232 574ed2c3 2017-11-29 stsp static struct context_vec *context_vec_end;
233 574ed2c3 2017-11-29 stsp static struct context_vec *context_vec_ptr;
235 574ed2c3 2017-11-29 stsp #define FUNCTION_CONTEXT_SIZE 55
236 574ed2c3 2017-11-29 stsp static char lastbuf[FUNCTION_CONTEXT_SIZE];
237 574ed2c3 2017-11-29 stsp static int lastline;
238 574ed2c3 2017-11-29 stsp static int lastmatchline;
240 7d283eee 2017-11-29 stsp int Nflag, Pflag, rflag, sflag, Tflag;
241 7d283eee 2017-11-29 stsp int diff_format, diff_context, status;
242 7d283eee 2017-11-29 stsp char *start, *ifdefname, *diffargs, *label[2], *ignore_pats;
243 7d283eee 2017-11-29 stsp struct stat stb1, stb2;
247 574ed2c3 2017-11-29 stsp * chrtran points to one of 2 translation tables: cup2low if folding upper to
248 574ed2c3 2017-11-29 stsp * lower case clow2low if not folding case
250 574ed2c3 2017-11-29 stsp u_char clow2low[256] = {
251 574ed2c3 2017-11-29 stsp 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a,
252 574ed2c3 2017-11-29 stsp 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15,
253 574ed2c3 2017-11-29 stsp 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x20,
254 574ed2c3 2017-11-29 stsp 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b,
255 574ed2c3 2017-11-29 stsp 0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36,
256 574ed2c3 2017-11-29 stsp 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, 0x40, 0x41,
257 574ed2c3 2017-11-29 stsp 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48, 0x49, 0x4a, 0x4b, 0x4c,
258 574ed2c3 2017-11-29 stsp 0x4d, 0x4e, 0x4f, 0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57,
259 574ed2c3 2017-11-29 stsp 0x58, 0x59, 0x5a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, 0x60, 0x61, 0x62,
260 574ed2c3 2017-11-29 stsp 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d,
261 574ed2c3 2017-11-29 stsp 0x6e, 0x6f, 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78,
262 574ed2c3 2017-11-29 stsp 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, 0x80, 0x81, 0x82, 0x83,
263 574ed2c3 2017-11-29 stsp 0x84, 0x85, 0x86, 0x87, 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e,
264 574ed2c3 2017-11-29 stsp 0x8f, 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x99,
265 574ed2c3 2017-11-29 stsp 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, 0xa0, 0xa1, 0xa2, 0xa3, 0xa4,
266 574ed2c3 2017-11-29 stsp 0xa5, 0xa6, 0xa7, 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
267 574ed2c3 2017-11-29 stsp 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, 0xb8, 0xb9, 0xba,
268 574ed2c3 2017-11-29 stsp 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5,
269 574ed2c3 2017-11-29 stsp 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, 0xd0,
270 574ed2c3 2017-11-29 stsp 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda, 0xdb,
271 574ed2c3 2017-11-29 stsp 0xdc, 0xdd, 0xde, 0xdf, 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6,
272 574ed2c3 2017-11-29 stsp 0xe7, 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, 0xf0, 0xf1,
273 574ed2c3 2017-11-29 stsp 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9, 0xfa, 0xfb, 0xfc,
274 574ed2c3 2017-11-29 stsp 0xfd, 0xfe, 0xff
277 574ed2c3 2017-11-29 stsp u_char cup2low[256] = {
278 574ed2c3 2017-11-29 stsp 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a,
279 574ed2c3 2017-11-29 stsp 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15,
280 574ed2c3 2017-11-29 stsp 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x20,
281 574ed2c3 2017-11-29 stsp 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b,
282 574ed2c3 2017-11-29 stsp 0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36,
283 574ed2c3 2017-11-29 stsp 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, 0x60, 0x61,
284 574ed2c3 2017-11-29 stsp 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c,
285 574ed2c3 2017-11-29 stsp 0x6d, 0x6e, 0x6f, 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
286 574ed2c3 2017-11-29 stsp 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, 0x60, 0x61, 0x62,
287 574ed2c3 2017-11-29 stsp 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d,
288 574ed2c3 2017-11-29 stsp 0x6e, 0x6f, 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78,
289 574ed2c3 2017-11-29 stsp 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, 0x80, 0x81, 0x82, 0x83,
290 574ed2c3 2017-11-29 stsp 0x84, 0x85, 0x86, 0x87, 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e,
291 574ed2c3 2017-11-29 stsp 0x8f, 0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x99,
292 574ed2c3 2017-11-29 stsp 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, 0xa0, 0xa1, 0xa2, 0xa3, 0xa4,
293 574ed2c3 2017-11-29 stsp 0xa5, 0xa6, 0xa7, 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
294 574ed2c3 2017-11-29 stsp 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, 0xb8, 0xb9, 0xba,
295 574ed2c3 2017-11-29 stsp 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5,
296 574ed2c3 2017-11-29 stsp 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, 0xd0,
297 574ed2c3 2017-11-29 stsp 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda, 0xdb,
298 574ed2c3 2017-11-29 stsp 0xdc, 0xdd, 0xde, 0xdf, 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6,
299 574ed2c3 2017-11-29 stsp 0xe7, 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, 0xf0, 0xf1,
300 574ed2c3 2017-11-29 stsp 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9, 0xfa, 0xfb, 0xfc,
301 574ed2c3 2017-11-29 stsp 0xfd, 0xfe, 0xff
304 7d283eee 2017-11-29 stsp const struct got_error *
305 7d283eee 2017-11-29 stsp got_diffreg(int *rval, char *file1, char *file2, int flags)
307 7d283eee 2017-11-29 stsp const struct got_error *err = NULL;
308 574ed2c3 2017-11-29 stsp FILE *f1, *f2;
311 7d283eee 2017-11-29 stsp diff_format = D_UNIFIED;
313 7d283eee 2017-11-29 stsp if (strcmp(file1, "-") == 0)
314 7d283eee 2017-11-29 stsp fstat(STDIN_FILENO, &stb1);
315 7d283eee 2017-11-29 stsp else if (stat(file1, &stb1) != 0)
316 7d283eee 2017-11-29 stsp return got_error(GOT_ERR_BAD_PATH);
318 7d283eee 2017-11-29 stsp if (strcmp(file2, "-") == 0)
319 7d283eee 2017-11-29 stsp fstat(STDIN_FILENO, &stb2);
320 7d283eee 2017-11-29 stsp else if (stat(file2, &stb2) != 0)
321 7d283eee 2017-11-29 stsp return got_error(GOT_ERR_BAD_PATH);
323 574ed2c3 2017-11-29 stsp f1 = f2 = NULL;
324 7d283eee 2017-11-29 stsp *rval = D_SAME;
325 574ed2c3 2017-11-29 stsp anychange = 0;
326 574ed2c3 2017-11-29 stsp lastline = 0;
327 574ed2c3 2017-11-29 stsp lastmatchline = 0;
328 574ed2c3 2017-11-29 stsp context_vec_ptr = context_vec_start - 1;
329 574ed2c3 2017-11-29 stsp if (flags & D_IGNORECASE)
330 574ed2c3 2017-11-29 stsp chrtran = cup2low;
332 574ed2c3 2017-11-29 stsp chrtran = clow2low;
333 7d283eee 2017-11-29 stsp if (S_ISDIR(stb1.st_mode) != S_ISDIR(stb2.st_mode)) {
334 7d283eee 2017-11-29 stsp *rval = (S_ISDIR(stb1.st_mode) ? D_MISMATCH1 : D_MISMATCH2);
335 7d283eee 2017-11-29 stsp return NULL;
337 574ed2c3 2017-11-29 stsp if (strcmp(file1, "-") == 0 && strcmp(file2, "-") == 0)
338 574ed2c3 2017-11-29 stsp goto closem;
340 574ed2c3 2017-11-29 stsp if (flags & D_EMPTY1)
341 574ed2c3 2017-11-29 stsp f1 = fopen(_PATH_DEVNULL, "r");
343 574ed2c3 2017-11-29 stsp if (!S_ISREG(stb1.st_mode)) {
344 574ed2c3 2017-11-29 stsp if ((f1 = opentemp(file1)) == NULL ||
345 574ed2c3 2017-11-29 stsp fstat(fileno(f1), &stb1) < 0) {
346 574ed2c3 2017-11-29 stsp status |= 2;
347 574ed2c3 2017-11-29 stsp goto closem;
349 574ed2c3 2017-11-29 stsp } else if (strcmp(file1, "-") == 0)
350 574ed2c3 2017-11-29 stsp f1 = stdin;
352 574ed2c3 2017-11-29 stsp f1 = fopen(file1, "r");
354 574ed2c3 2017-11-29 stsp if (f1 == NULL) {
355 574ed2c3 2017-11-29 stsp status |= 2;
356 574ed2c3 2017-11-29 stsp goto closem;
359 574ed2c3 2017-11-29 stsp if (flags & D_EMPTY2)
360 574ed2c3 2017-11-29 stsp f2 = fopen(_PATH_DEVNULL, "r");
362 574ed2c3 2017-11-29 stsp if (!S_ISREG(stb2.st_mode)) {
363 574ed2c3 2017-11-29 stsp if ((f2 = opentemp(file2)) == NULL ||
364 574ed2c3 2017-11-29 stsp fstat(fileno(f2), &stb2) < 0) {
365 574ed2c3 2017-11-29 stsp status |= 2;
366 574ed2c3 2017-11-29 stsp goto closem;
368 574ed2c3 2017-11-29 stsp } else if (strcmp(file2, "-") == 0)
369 574ed2c3 2017-11-29 stsp f2 = stdin;
371 574ed2c3 2017-11-29 stsp f2 = fopen(file2, "r");
373 574ed2c3 2017-11-29 stsp if (f2 == NULL) {
374 574ed2c3 2017-11-29 stsp status |= 2;
375 574ed2c3 2017-11-29 stsp goto closem;
378 574ed2c3 2017-11-29 stsp switch (files_differ(f1, f2, flags)) {
380 574ed2c3 2017-11-29 stsp goto closem;
384 574ed2c3 2017-11-29 stsp /* error */
385 574ed2c3 2017-11-29 stsp status |= 2;
386 574ed2c3 2017-11-29 stsp goto closem;
389 574ed2c3 2017-11-29 stsp if ((flags & D_FORCEASCII) == 0 &&
390 574ed2c3 2017-11-29 stsp (!asciifile(f1) || !asciifile(f2))) {
391 7d283eee 2017-11-29 stsp *rval = D_BINARY;
392 574ed2c3 2017-11-29 stsp status |= 1;
393 574ed2c3 2017-11-29 stsp goto closem;
395 574ed2c3 2017-11-29 stsp prepare(0, f1, stb1.st_size, flags);
396 574ed2c3 2017-11-29 stsp prepare(1, f2, stb2.st_size, flags);
399 574ed2c3 2017-11-29 stsp sort(sfile[0], slen[0]);
400 574ed2c3 2017-11-29 stsp sort(sfile[1], slen[1]);
402 574ed2c3 2017-11-29 stsp member = (int *)file[1];
403 574ed2c3 2017-11-29 stsp equiv(sfile[0], slen[0], sfile[1], slen[1], member);
404 7d283eee 2017-11-29 stsp member = reallocarray(member, slen[1] + 2, sizeof(*member));
405 7d283eee 2017-11-29 stsp if (member == NULL) {
406 7d283eee 2017-11-29 stsp err = got_error(GOT_ERR_NO_MEM);
407 7d283eee 2017-11-29 stsp goto closem;
410 574ed2c3 2017-11-29 stsp class = (int *)file[0];
411 574ed2c3 2017-11-29 stsp unsort(sfile[0], slen[0], class);
412 7d283eee 2017-11-29 stsp class = reallocarray(class, slen[0] + 2, sizeof(*class));
413 7d283eee 2017-11-29 stsp if (class == NULL) {
414 7d283eee 2017-11-29 stsp err = got_error(GOT_ERR_NO_MEM);
415 7d283eee 2017-11-29 stsp goto closem;
418 7d283eee 2017-11-29 stsp klist = calloc(slen[0] + 2, sizeof(*klist));
419 7d283eee 2017-11-29 stsp if (klist == NULL) {
420 7d283eee 2017-11-29 stsp err = got_error(GOT_ERR_NO_MEM);
421 7d283eee 2017-11-29 stsp goto closem;
424 574ed2c3 2017-11-29 stsp clistlen = 100;
425 7d283eee 2017-11-29 stsp clist = calloc(clistlen, sizeof(*clist));
426 7d283eee 2017-11-29 stsp if (clist == NULL) {
427 7d283eee 2017-11-29 stsp err = got_error(GOT_ERR_NO_MEM);
428 7d283eee 2017-11-29 stsp goto closem;
430 574ed2c3 2017-11-29 stsp i = stone(class, slen[0], member, klist, flags);
431 574ed2c3 2017-11-29 stsp free(member);
432 574ed2c3 2017-11-29 stsp free(class);
434 7d283eee 2017-11-29 stsp J = reallocarray(J, len[0] + 2, sizeof(*J));
435 7d283eee 2017-11-29 stsp if (J == NULL) {
436 7d283eee 2017-11-29 stsp err = got_error(GOT_ERR_NO_MEM);
437 7d283eee 2017-11-29 stsp goto closem;
439 574ed2c3 2017-11-29 stsp unravel(klist[i]);
440 574ed2c3 2017-11-29 stsp free(clist);
441 7d283eee 2017-11-29 stsp clist = NULL;
442 574ed2c3 2017-11-29 stsp free(klist);
443 7d283eee 2017-11-29 stsp klist = NULL;
445 7d283eee 2017-11-29 stsp ixold = reallocarray(ixold, len[0] + 2, sizeof(*ixold));
446 7d283eee 2017-11-29 stsp if (ixold == NULL) {
447 7d283eee 2017-11-29 stsp err = got_error(GOT_ERR_NO_MEM);
448 7d283eee 2017-11-29 stsp goto closem;
450 7d283eee 2017-11-29 stsp ixnew = reallocarray(ixnew, len[1] + 2, sizeof(*ixnew));
451 7d283eee 2017-11-29 stsp if (ixnew == NULL) {
452 7d283eee 2017-11-29 stsp err = got_error(GOT_ERR_NO_MEM);
453 7d283eee 2017-11-29 stsp goto closem;
455 574ed2c3 2017-11-29 stsp check(f1, f2, flags);
456 574ed2c3 2017-11-29 stsp output(file1, f1, file2, f2, flags);
458 574ed2c3 2017-11-29 stsp if (anychange) {
459 574ed2c3 2017-11-29 stsp status |= 1;
460 7d283eee 2017-11-29 stsp if (*rval == D_SAME)
461 7d283eee 2017-11-29 stsp *rval = D_DIFFER;
463 574ed2c3 2017-11-29 stsp if (f1 != NULL)
464 574ed2c3 2017-11-29 stsp fclose(f1);
465 574ed2c3 2017-11-29 stsp if (f2 != NULL)
466 574ed2c3 2017-11-29 stsp fclose(f2);
468 7d283eee 2017-11-29 stsp return (err);
472 574ed2c3 2017-11-29 stsp * Check to see if the given files differ.
473 574ed2c3 2017-11-29 stsp * Returns 0 if they are the same, 1 if different, and -1 on error.
474 574ed2c3 2017-11-29 stsp * XXX - could use code from cmp(1) [faster]
477 574ed2c3 2017-11-29 stsp files_differ(FILE *f1, FILE *f2, int flags)
479 574ed2c3 2017-11-29 stsp char buf1[BUFSIZ], buf2[BUFSIZ];
480 574ed2c3 2017-11-29 stsp size_t i, j;
482 574ed2c3 2017-11-29 stsp if ((flags & (D_EMPTY1|D_EMPTY2)) || stb1.st_size != stb2.st_size ||
483 574ed2c3 2017-11-29 stsp (stb1.st_mode & S_IFMT) != (stb2.st_mode & S_IFMT))
484 574ed2c3 2017-11-29 stsp return (1);
486 574ed2c3 2017-11-29 stsp i = fread(buf1, 1, sizeof(buf1), f1);
487 574ed2c3 2017-11-29 stsp j = fread(buf2, 1, sizeof(buf2), f2);
488 574ed2c3 2017-11-29 stsp if ((!i && ferror(f1)) || (!j && ferror(f2)))
489 574ed2c3 2017-11-29 stsp return (-1);
490 574ed2c3 2017-11-29 stsp if (i != j)
491 574ed2c3 2017-11-29 stsp return (1);
492 574ed2c3 2017-11-29 stsp if (i == 0)
493 574ed2c3 2017-11-29 stsp return (0);
494 574ed2c3 2017-11-29 stsp if (memcmp(buf1, buf2, i) != 0)
495 574ed2c3 2017-11-29 stsp return (1);
499 574ed2c3 2017-11-29 stsp static FILE *
500 574ed2c3 2017-11-29 stsp opentemp(const char *file)
502 574ed2c3 2017-11-29 stsp char buf[BUFSIZ], tempfile[PATH_MAX];
503 574ed2c3 2017-11-29 stsp ssize_t nread;
504 574ed2c3 2017-11-29 stsp int ifd, ofd;
506 574ed2c3 2017-11-29 stsp if (strcmp(file, "-") == 0)
507 574ed2c3 2017-11-29 stsp ifd = STDIN_FILENO;
508 574ed2c3 2017-11-29 stsp else if ((ifd = open(file, O_RDONLY, 0644)) < 0)
509 574ed2c3 2017-11-29 stsp return (NULL);
511 574ed2c3 2017-11-29 stsp (void)strlcpy(tempfile, _PATH_TMP "/diff.XXXXXXXX", sizeof(tempfile));
513 574ed2c3 2017-11-29 stsp if ((ofd = mkstemp(tempfile)) < 0) {
514 574ed2c3 2017-11-29 stsp close(ifd);
515 574ed2c3 2017-11-29 stsp return (NULL);
517 574ed2c3 2017-11-29 stsp unlink(tempfile);
518 574ed2c3 2017-11-29 stsp while ((nread = read(ifd, buf, BUFSIZ)) > 0) {
519 574ed2c3 2017-11-29 stsp if (write(ofd, buf, nread) != nread) {
520 574ed2c3 2017-11-29 stsp close(ifd);
521 574ed2c3 2017-11-29 stsp close(ofd);
522 574ed2c3 2017-11-29 stsp return (NULL);
525 574ed2c3 2017-11-29 stsp close(ifd);
526 574ed2c3 2017-11-29 stsp lseek(ofd, (off_t)0, SEEK_SET);
527 574ed2c3 2017-11-29 stsp return (fdopen(ofd, "r"));
531 574ed2c3 2017-11-29 stsp splice(char *dir, char *file)
533 574ed2c3 2017-11-29 stsp char *tail, *buf;
534 574ed2c3 2017-11-29 stsp size_t dirlen;
536 574ed2c3 2017-11-29 stsp dirlen = strlen(dir);
537 574ed2c3 2017-11-29 stsp while (dirlen != 0 && dir[dirlen - 1] == '/')
539 574ed2c3 2017-11-29 stsp if ((tail = strrchr(file, '/')) == NULL)
540 574ed2c3 2017-11-29 stsp tail = file;
543 574ed2c3 2017-11-29 stsp xasprintf(&buf, "%.*s/%s", (int)dirlen, dir, tail);
544 574ed2c3 2017-11-29 stsp return (buf);
547 574ed2c3 2017-11-29 stsp static void
548 574ed2c3 2017-11-29 stsp prepare(int i, FILE *fd, off_t filesize, int flags)
550 574ed2c3 2017-11-29 stsp struct line *p;
554 574ed2c3 2017-11-29 stsp rewind(fd);
556 574ed2c3 2017-11-29 stsp sz = (filesize <= SIZE_MAX ? filesize : SIZE_MAX) / 25;
557 574ed2c3 2017-11-29 stsp if (sz < 100)
560 574ed2c3 2017-11-29 stsp p = xcalloc(sz + 3, sizeof(*p));
561 574ed2c3 2017-11-29 stsp for (j = 0; (h = readhash(fd, flags));) {
562 574ed2c3 2017-11-29 stsp if (j == sz) {
563 574ed2c3 2017-11-29 stsp sz = sz * 3 / 2;
564 574ed2c3 2017-11-29 stsp p = xreallocarray(p, sz + 3, sizeof(*p));
566 574ed2c3 2017-11-29 stsp p[++j].value = h;
568 574ed2c3 2017-11-29 stsp len[i] = j;
569 574ed2c3 2017-11-29 stsp file[i] = p;
572 574ed2c3 2017-11-29 stsp static void
573 574ed2c3 2017-11-29 stsp prune(void)
577 574ed2c3 2017-11-29 stsp for (pref = 0; pref < len[0] && pref < len[1] &&
578 574ed2c3 2017-11-29 stsp file[0][pref + 1].value == file[1][pref + 1].value;
581 574ed2c3 2017-11-29 stsp for (suff = 0; suff < len[0] - pref && suff < len[1] - pref &&
582 574ed2c3 2017-11-29 stsp file[0][len[0] - suff].value == file[1][len[1] - suff].value;
585 574ed2c3 2017-11-29 stsp for (j = 0; j < 2; j++) {
586 574ed2c3 2017-11-29 stsp sfile[j] = file[j] + pref;
587 574ed2c3 2017-11-29 stsp slen[j] = len[j] - pref - suff;
588 574ed2c3 2017-11-29 stsp for (i = 0; i <= slen[j]; i++)
589 574ed2c3 2017-11-29 stsp sfile[j][i].serial = i;
593 574ed2c3 2017-11-29 stsp static void
594 574ed2c3 2017-11-29 stsp equiv(struct line *a, int n, struct line *b, int m, int *c)
599 574ed2c3 2017-11-29 stsp while (i <= n && j <= m) {
600 574ed2c3 2017-11-29 stsp if (a[i].value < b[j].value)
601 574ed2c3 2017-11-29 stsp a[i++].value = 0;
602 574ed2c3 2017-11-29 stsp else if (a[i].value == b[j].value)
603 574ed2c3 2017-11-29 stsp a[i++].value = j;
607 574ed2c3 2017-11-29 stsp while (i <= n)
608 574ed2c3 2017-11-29 stsp a[i++].value = 0;
609 574ed2c3 2017-11-29 stsp b[m + 1].value = 0;
611 574ed2c3 2017-11-29 stsp while (++j <= m) {
612 574ed2c3 2017-11-29 stsp c[j] = -b[j].serial;
613 574ed2c3 2017-11-29 stsp while (b[j + 1].value == b[j].value) {
615 574ed2c3 2017-11-29 stsp c[j] = b[j].serial;
621 574ed2c3 2017-11-29 stsp /* Code taken from ping.c */
623 574ed2c3 2017-11-29 stsp isqrt(int n)
625 574ed2c3 2017-11-29 stsp int y, x = 1;
627 574ed2c3 2017-11-29 stsp if (n == 0)
628 574ed2c3 2017-11-29 stsp return (0);
630 574ed2c3 2017-11-29 stsp do { /* newton was a stinker */
635 574ed2c3 2017-11-29 stsp } while ((x - y) > 1 || (x - y) < -1);
637 574ed2c3 2017-11-29 stsp return (x);
641 574ed2c3 2017-11-29 stsp stone(int *a, int n, int *b, int *c, int flags)
643 574ed2c3 2017-11-29 stsp int i, k, y, j, l;
644 574ed2c3 2017-11-29 stsp int oldc, tc, oldl, sq;
645 574ed2c3 2017-11-29 stsp u_int numtries, bound;
647 574ed2c3 2017-11-29 stsp if (flags & D_MINIMAL)
648 574ed2c3 2017-11-29 stsp bound = UINT_MAX;
650 574ed2c3 2017-11-29 stsp sq = isqrt(n);
651 574ed2c3 2017-11-29 stsp bound = MAXIMUM(256, sq);
655 574ed2c3 2017-11-29 stsp c[0] = newcand(0, 0, 0);
656 574ed2c3 2017-11-29 stsp for (i = 1; i <= n; i++) {
658 574ed2c3 2017-11-29 stsp if (j == 0)
662 574ed2c3 2017-11-29 stsp oldc = c[0];
663 574ed2c3 2017-11-29 stsp numtries = 0;
665 574ed2c3 2017-11-29 stsp if (y <= clist[oldc].y)
667 574ed2c3 2017-11-29 stsp l = search(c, k, y);
668 574ed2c3 2017-11-29 stsp if (l != oldl + 1)
669 574ed2c3 2017-11-29 stsp oldc = c[l - 1];
670 574ed2c3 2017-11-29 stsp if (l <= k) {
671 574ed2c3 2017-11-29 stsp if (clist[c[l]].y <= y)
674 574ed2c3 2017-11-29 stsp c[l] = newcand(i, y, oldc);
677 574ed2c3 2017-11-29 stsp numtries++;
679 574ed2c3 2017-11-29 stsp c[l] = newcand(i, y, oldc);
683 574ed2c3 2017-11-29 stsp } while ((y = b[++j]) > 0 && numtries < bound);
685 574ed2c3 2017-11-29 stsp return (k);
689 574ed2c3 2017-11-29 stsp newcand(int x, int y, int pred)
691 574ed2c3 2017-11-29 stsp struct cand *q;
693 574ed2c3 2017-11-29 stsp if (clen == clistlen) {
694 574ed2c3 2017-11-29 stsp clistlen = clistlen * 11 / 10;
695 574ed2c3 2017-11-29 stsp clist = xreallocarray(clist, clistlen, sizeof(*clist));
697 574ed2c3 2017-11-29 stsp q = clist + clen;
700 574ed2c3 2017-11-29 stsp q->pred = pred;
701 574ed2c3 2017-11-29 stsp return (clen++);
705 574ed2c3 2017-11-29 stsp search(int *c, int k, int y)
707 574ed2c3 2017-11-29 stsp int i, j, l, t;
709 574ed2c3 2017-11-29 stsp if (clist[c[k]].y < y) /* quick look for typical case */
710 574ed2c3 2017-11-29 stsp return (k + 1);
714 574ed2c3 2017-11-29 stsp l = (i + j) / 2;
715 574ed2c3 2017-11-29 stsp if (l <= i)
717 574ed2c3 2017-11-29 stsp t = clist[c[l]].y;
720 574ed2c3 2017-11-29 stsp else if (t < y)
723 574ed2c3 2017-11-29 stsp return (l);
725 574ed2c3 2017-11-29 stsp return (l + 1);
728 574ed2c3 2017-11-29 stsp static void
729 574ed2c3 2017-11-29 stsp unravel(int p)
731 574ed2c3 2017-11-29 stsp struct cand *q;
734 574ed2c3 2017-11-29 stsp for (i = 0; i <= len[0]; i++)
735 574ed2c3 2017-11-29 stsp J[i] = i <= pref ? i :
736 574ed2c3 2017-11-29 stsp i > len[0] - suff ? i + len[1] - len[0] : 0;
737 574ed2c3 2017-11-29 stsp for (q = clist + p; q->y != 0; q = clist + q->pred)
738 574ed2c3 2017-11-29 stsp J[q->x + pref] = q->y + pref;
742 574ed2c3 2017-11-29 stsp * Check does double duty:
743 574ed2c3 2017-11-29 stsp * 1. ferret out any fortuitous correspondences due
744 574ed2c3 2017-11-29 stsp * to confounding by hashing (which result in "jackpot")
745 574ed2c3 2017-11-29 stsp * 2. collect random access indexes to the two files
747 574ed2c3 2017-11-29 stsp static void
748 574ed2c3 2017-11-29 stsp check(FILE *f1, FILE *f2, int flags)
750 574ed2c3 2017-11-29 stsp int i, j, jackpot, c, d;
751 574ed2c3 2017-11-29 stsp long ctold, ctnew;
753 574ed2c3 2017-11-29 stsp rewind(f1);
754 574ed2c3 2017-11-29 stsp rewind(f2);
756 574ed2c3 2017-11-29 stsp ixold[0] = ixnew[0] = 0;
757 574ed2c3 2017-11-29 stsp jackpot = 0;
758 574ed2c3 2017-11-29 stsp ctold = ctnew = 0;
759 574ed2c3 2017-11-29 stsp for (i = 1; i <= len[0]; i++) {
760 574ed2c3 2017-11-29 stsp if (J[i] == 0) {
761 574ed2c3 2017-11-29 stsp ixold[i] = ctold += skipline(f1);
764 574ed2c3 2017-11-29 stsp while (j < J[i]) {
765 574ed2c3 2017-11-29 stsp ixnew[j] = ctnew += skipline(f2);
768 574ed2c3 2017-11-29 stsp if (flags & (D_FOLDBLANKS|D_IGNOREBLANKS|D_IGNORECASE)) {
770 574ed2c3 2017-11-29 stsp c = getc(f1);
771 574ed2c3 2017-11-29 stsp d = getc(f2);
773 574ed2c3 2017-11-29 stsp * GNU diff ignores a missing newline
774 574ed2c3 2017-11-29 stsp * in one file for -b or -w.
776 574ed2c3 2017-11-29 stsp if (flags & (D_FOLDBLANKS|D_IGNOREBLANKS)) {
777 574ed2c3 2017-11-29 stsp if (c == EOF && d == '\n') {
780 574ed2c3 2017-11-29 stsp } else if (c == '\n' && d == EOF) {
787 574ed2c3 2017-11-29 stsp if ((flags & D_FOLDBLANKS) && isspace(c) &&
788 574ed2c3 2017-11-29 stsp isspace(d)) {
790 574ed2c3 2017-11-29 stsp if (c == '\n')
793 574ed2c3 2017-11-29 stsp } while (isspace(c = getc(f1)));
795 574ed2c3 2017-11-29 stsp if (d == '\n')
798 574ed2c3 2017-11-29 stsp } while (isspace(d = getc(f2)));
799 574ed2c3 2017-11-29 stsp } else if ((flags & D_IGNOREBLANKS)) {
800 574ed2c3 2017-11-29 stsp while (isspace(c) && c != '\n') {
801 574ed2c3 2017-11-29 stsp c = getc(f1);
804 574ed2c3 2017-11-29 stsp while (isspace(d) && d != '\n') {
805 574ed2c3 2017-11-29 stsp d = getc(f2);
809 574ed2c3 2017-11-29 stsp if (chrtran[c] != chrtran[d]) {
812 574ed2c3 2017-11-29 stsp if (c != '\n' && c != EOF)
813 574ed2c3 2017-11-29 stsp ctold += skipline(f1);
814 574ed2c3 2017-11-29 stsp if (d != '\n' && c != EOF)
815 574ed2c3 2017-11-29 stsp ctnew += skipline(f2);
818 574ed2c3 2017-11-29 stsp if (c == '\n' || c == EOF)
825 574ed2c3 2017-11-29 stsp if ((c = getc(f1)) != (d = getc(f2))) {
826 574ed2c3 2017-11-29 stsp /* jackpot++; */
828 574ed2c3 2017-11-29 stsp if (c != '\n' && c != EOF)
829 574ed2c3 2017-11-29 stsp ctold += skipline(f1);
830 574ed2c3 2017-11-29 stsp if (d != '\n' && c != EOF)
831 574ed2c3 2017-11-29 stsp ctnew += skipline(f2);
834 574ed2c3 2017-11-29 stsp if (c == '\n' || c == EOF)
838 574ed2c3 2017-11-29 stsp ixold[i] = ctold;
839 574ed2c3 2017-11-29 stsp ixnew[j] = ctnew;
842 574ed2c3 2017-11-29 stsp for (; j <= len[1]; j++)
843 574ed2c3 2017-11-29 stsp ixnew[j] = ctnew += skipline(f2);
845 574ed2c3 2017-11-29 stsp * if (jackpot)
846 574ed2c3 2017-11-29 stsp * fprintf(stderr, "jackpot\n");
850 574ed2c3 2017-11-29 stsp /* shellsort CACM #201 */
851 574ed2c3 2017-11-29 stsp static void
852 574ed2c3 2017-11-29 stsp sort(struct line *a, int n)
854 574ed2c3 2017-11-29 stsp struct line *ai, *aim, w;
855 574ed2c3 2017-11-29 stsp int j, m = 0, k;
857 574ed2c3 2017-11-29 stsp if (n == 0)
859 574ed2c3 2017-11-29 stsp for (j = 1; j <= n; j *= 2)
860 574ed2c3 2017-11-29 stsp m = 2 * j - 1;
861 574ed2c3 2017-11-29 stsp for (m /= 2; m != 0; m /= 2) {
863 574ed2c3 2017-11-29 stsp for (j = 1; j <= k; j++) {
864 574ed2c3 2017-11-29 stsp for (ai = &a[j]; ai > a; ai -= m) {
865 574ed2c3 2017-11-29 stsp aim = &ai[m];
866 574ed2c3 2017-11-29 stsp if (aim < ai)
867 574ed2c3 2017-11-29 stsp break; /* wraparound */
868 574ed2c3 2017-11-29 stsp if (aim->value > ai[0].value ||
869 574ed2c3 2017-11-29 stsp (aim->value == ai[0].value &&
870 574ed2c3 2017-11-29 stsp aim->serial > ai[0].serial))
872 574ed2c3 2017-11-29 stsp w.value = ai[0].value;
873 574ed2c3 2017-11-29 stsp ai[0].value = aim->value;
874 574ed2c3 2017-11-29 stsp aim->value = w.value;
875 574ed2c3 2017-11-29 stsp w.serial = ai[0].serial;
876 574ed2c3 2017-11-29 stsp ai[0].serial = aim->serial;
877 574ed2c3 2017-11-29 stsp aim->serial = w.serial;
883 574ed2c3 2017-11-29 stsp static void
884 574ed2c3 2017-11-29 stsp unsort(struct line *f, int l, int *b)
888 574ed2c3 2017-11-29 stsp a = xcalloc(l + 1, sizeof(*a));
889 574ed2c3 2017-11-29 stsp for (i = 1; i <= l; i++)
890 574ed2c3 2017-11-29 stsp a[f[i].serial] = f[i].value;
891 574ed2c3 2017-11-29 stsp for (i = 1; i <= l; i++)
892 574ed2c3 2017-11-29 stsp b[i] = a[i];
897 574ed2c3 2017-11-29 stsp skipline(FILE *f)
901 574ed2c3 2017-11-29 stsp for (i = 1; (c = getc(f)) != '\n' && c != EOF; i++)
903 574ed2c3 2017-11-29 stsp return (i);
906 574ed2c3 2017-11-29 stsp static void
907 574ed2c3 2017-11-29 stsp output(char *file1, FILE *f1, char *file2, FILE *f2, int flags)
909 574ed2c3 2017-11-29 stsp int m, i0, i1, j0, j1;
911 574ed2c3 2017-11-29 stsp rewind(f1);
912 574ed2c3 2017-11-29 stsp rewind(f2);
913 574ed2c3 2017-11-29 stsp m = len[0];
915 574ed2c3 2017-11-29 stsp J[m + 1] = len[1] + 1;
916 574ed2c3 2017-11-29 stsp if (diff_format != D_EDIT) {
917 574ed2c3 2017-11-29 stsp for (i0 = 1; i0 <= m; i0 = i1 + 1) {
918 574ed2c3 2017-11-29 stsp while (i0 <= m && J[i0] == J[i0 - 1] + 1)
920 574ed2c3 2017-11-29 stsp j0 = J[i0 - 1] + 1;
921 574ed2c3 2017-11-29 stsp i1 = i0 - 1;
922 574ed2c3 2017-11-29 stsp while (i1 < m && J[i1 + 1] == 0)
924 574ed2c3 2017-11-29 stsp j1 = J[i1 + 1] - 1;
925 574ed2c3 2017-11-29 stsp J[i1] = j1;
926 574ed2c3 2017-11-29 stsp change(file1, f1, file2, f2, i0, i1, j0, j1, &flags);
929 574ed2c3 2017-11-29 stsp for (i0 = m; i0 >= 1; i0 = i1 - 1) {
930 574ed2c3 2017-11-29 stsp while (i0 >= 1 && J[i0] == J[i0 + 1] - 1 && J[i0] != 0)
932 574ed2c3 2017-11-29 stsp j0 = J[i0 + 1] - 1;
933 574ed2c3 2017-11-29 stsp i1 = i0 + 1;
934 574ed2c3 2017-11-29 stsp while (i1 > 1 && J[i1 - 1] == 0)
936 574ed2c3 2017-11-29 stsp j1 = J[i1 - 1] + 1;
937 574ed2c3 2017-11-29 stsp J[i1] = j1;
938 574ed2c3 2017-11-29 stsp change(file1, f1, file2, f2, i1, i0, j1, j0, &flags);
941 574ed2c3 2017-11-29 stsp if (m == 0)
942 574ed2c3 2017-11-29 stsp change(file1, f1, file2, f2, 1, 0, 1, len[1], &flags);
943 574ed2c3 2017-11-29 stsp if (diff_format == D_IFDEF) {
945 574ed2c3 2017-11-29 stsp #define c i0
946 574ed2c3 2017-11-29 stsp if ((c = getc(f1)) == EOF)
948 574ed2c3 2017-11-29 stsp diff_output("%c", c);
952 574ed2c3 2017-11-29 stsp if (anychange != 0) {
953 574ed2c3 2017-11-29 stsp if (diff_format == D_CONTEXT)
954 574ed2c3 2017-11-29 stsp dump_context_vec(f1, f2, flags);
955 574ed2c3 2017-11-29 stsp else if (diff_format == D_UNIFIED)
956 574ed2c3 2017-11-29 stsp dump_unified_vec(f1, f2, flags);
960 574ed2c3 2017-11-29 stsp static void
961 574ed2c3 2017-11-29 stsp range(int a, int b, char *separator)
963 574ed2c3 2017-11-29 stsp diff_output("%d", a > b ? b : a);
965 574ed2c3 2017-11-29 stsp diff_output("%s%d", separator, b);
968 574ed2c3 2017-11-29 stsp static void
969 574ed2c3 2017-11-29 stsp uni_range(int a, int b)
972 574ed2c3 2017-11-29 stsp diff_output("%d,%d", a, b - a + 1);
973 574ed2c3 2017-11-29 stsp else if (a == b)
974 574ed2c3 2017-11-29 stsp diff_output("%d", b);
976 574ed2c3 2017-11-29 stsp diff_output("%d,0", b);
979 574ed2c3 2017-11-29 stsp static char *
980 574ed2c3 2017-11-29 stsp preadline(int fd, size_t rlen, off_t off)
982 574ed2c3 2017-11-29 stsp char *line;
983 574ed2c3 2017-11-29 stsp ssize_t nr;
985 574ed2c3 2017-11-29 stsp line = xmalloc(rlen + 1);
986 574ed2c3 2017-11-29 stsp if ((nr = pread(fd, line, rlen, off)) < 0)
987 574ed2c3 2017-11-29 stsp err(2, "preadline");
988 574ed2c3 2017-11-29 stsp if (nr > 0 && line[nr-1] == '\n')
990 574ed2c3 2017-11-29 stsp line[nr] = '\0';
991 574ed2c3 2017-11-29 stsp return (line);
995 574ed2c3 2017-11-29 stsp ignoreline(char *line)
997 7d283eee 2017-11-29 stsp return 0; /* do not ignore any lines */
1001 574ed2c3 2017-11-29 stsp * Indicate that there is a difference between lines a and b of the from file
1002 574ed2c3 2017-11-29 stsp * to get to lines c to d of the to file. If a is greater then b then there
1003 574ed2c3 2017-11-29 stsp * are no lines in the from file involved and this means that there were
1004 574ed2c3 2017-11-29 stsp * lines appended (beginning at b). If c is greater than d then there are
1005 574ed2c3 2017-11-29 stsp * lines missing from the to file.
1007 574ed2c3 2017-11-29 stsp static void
1008 574ed2c3 2017-11-29 stsp change(char *file1, FILE *f1, char *file2, FILE *f2, int a, int b, int c, int d,
1009 574ed2c3 2017-11-29 stsp int *pflags)
1011 574ed2c3 2017-11-29 stsp static size_t max_context = 64;
1015 574ed2c3 2017-11-29 stsp if (diff_format != D_IFDEF && a > b && c > d)
1017 574ed2c3 2017-11-29 stsp if (ignore_pats != NULL) {
1018 574ed2c3 2017-11-29 stsp char *line;
1020 574ed2c3 2017-11-29 stsp * All lines in the change, insert, or delete must
1021 574ed2c3 2017-11-29 stsp * match an ignore pattern for the change to be
1022 574ed2c3 2017-11-29 stsp * ignored.
1024 574ed2c3 2017-11-29 stsp if (a <= b) { /* Changes and deletes. */
1025 574ed2c3 2017-11-29 stsp for (i = a; i <= b; i++) {
1026 574ed2c3 2017-11-29 stsp line = preadline(fileno(f1),
1027 574ed2c3 2017-11-29 stsp ixold[i] - ixold[i - 1], ixold[i - 1]);
1028 574ed2c3 2017-11-29 stsp if (!ignoreline(line))
1029 574ed2c3 2017-11-29 stsp goto proceed;
1032 574ed2c3 2017-11-29 stsp if (a > b || c <= d) { /* Changes and inserts. */
1033 574ed2c3 2017-11-29 stsp for (i = c; i <= d; i++) {
1034 574ed2c3 2017-11-29 stsp line = preadline(fileno(f2),
1035 574ed2c3 2017-11-29 stsp ixnew[i] - ixnew[i - 1], ixnew[i - 1]);
1036 574ed2c3 2017-11-29 stsp if (!ignoreline(line))
1037 574ed2c3 2017-11-29 stsp goto proceed;
1043 574ed2c3 2017-11-29 stsp if (*pflags & D_HEADER) {
1044 574ed2c3 2017-11-29 stsp diff_output("%s %s %s\n", diffargs, file1, file2);
1045 574ed2c3 2017-11-29 stsp *pflags &= ~D_HEADER;
1047 574ed2c3 2017-11-29 stsp if (diff_format == D_CONTEXT || diff_format == D_UNIFIED) {
1049 574ed2c3 2017-11-29 stsp * Allocate change records as needed.
1051 574ed2c3 2017-11-29 stsp if (context_vec_ptr == context_vec_end - 1) {
1052 574ed2c3 2017-11-29 stsp ptrdiff_t offset = context_vec_ptr - context_vec_start;
1053 574ed2c3 2017-11-29 stsp max_context <<= 1;
1054 574ed2c3 2017-11-29 stsp context_vec_start = xreallocarray(context_vec_start,
1055 574ed2c3 2017-11-29 stsp max_context, sizeof(*context_vec_start));
1056 574ed2c3 2017-11-29 stsp context_vec_end = context_vec_start + max_context;
1057 574ed2c3 2017-11-29 stsp context_vec_ptr = context_vec_start + offset;
1059 574ed2c3 2017-11-29 stsp if (anychange == 0) {
1061 574ed2c3 2017-11-29 stsp * Print the context/unidiff header first time through.
1063 574ed2c3 2017-11-29 stsp print_header(file1, file2);
1064 574ed2c3 2017-11-29 stsp anychange = 1;
1065 574ed2c3 2017-11-29 stsp } else if (a > context_vec_ptr->b + (2 * diff_context) + 1 &&
1066 574ed2c3 2017-11-29 stsp c > context_vec_ptr->d + (2 * diff_context) + 1) {
1068 574ed2c3 2017-11-29 stsp * If this change is more than 'diff_context' lines from the
1069 574ed2c3 2017-11-29 stsp * previous change, dump the record and reset it.
1071 574ed2c3 2017-11-29 stsp if (diff_format == D_CONTEXT)
1072 574ed2c3 2017-11-29 stsp dump_context_vec(f1, f2, *pflags);
1074 574ed2c3 2017-11-29 stsp dump_unified_vec(f1, f2, *pflags);
1076 574ed2c3 2017-11-29 stsp context_vec_ptr++;
1077 574ed2c3 2017-11-29 stsp context_vec_ptr->a = a;
1078 574ed2c3 2017-11-29 stsp context_vec_ptr->b = b;
1079 574ed2c3 2017-11-29 stsp context_vec_ptr->c = c;
1080 574ed2c3 2017-11-29 stsp context_vec_ptr->d = d;
1083 574ed2c3 2017-11-29 stsp if (anychange == 0)
1084 574ed2c3 2017-11-29 stsp anychange = 1;
1085 574ed2c3 2017-11-29 stsp switch (diff_format) {
1086 574ed2c3 2017-11-29 stsp case D_BRIEF:
1088 574ed2c3 2017-11-29 stsp case D_NORMAL:
1089 574ed2c3 2017-11-29 stsp case D_EDIT:
1090 574ed2c3 2017-11-29 stsp range(a, b, ",");
1091 574ed2c3 2017-11-29 stsp diff_output("%c", a > b ? 'a' : c > d ? 'd' : 'c');
1092 574ed2c3 2017-11-29 stsp if (diff_format == D_NORMAL)
1093 574ed2c3 2017-11-29 stsp range(c, d, ",");
1094 574ed2c3 2017-11-29 stsp diff_output("\n");
1096 574ed2c3 2017-11-29 stsp case D_REVERSE:
1097 574ed2c3 2017-11-29 stsp diff_output("%c", a > b ? 'a' : c > d ? 'd' : 'c');
1098 574ed2c3 2017-11-29 stsp range(a, b, " ");
1099 574ed2c3 2017-11-29 stsp diff_output("\n");
1101 574ed2c3 2017-11-29 stsp case D_NREVERSE:
1102 574ed2c3 2017-11-29 stsp if (a > b)
1103 574ed2c3 2017-11-29 stsp diff_output("a%d %d\n", b, d - c + 1);
1105 574ed2c3 2017-11-29 stsp diff_output("d%d %d\n", a, b - a + 1);
1106 574ed2c3 2017-11-29 stsp if (!(c > d))
1107 574ed2c3 2017-11-29 stsp /* add changed lines */
1108 574ed2c3 2017-11-29 stsp diff_output("a%d %d\n", b, d - c + 1);
1112 574ed2c3 2017-11-29 stsp if (diff_format == D_NORMAL || diff_format == D_IFDEF) {
1113 574ed2c3 2017-11-29 stsp fetch(ixold, a, b, f1, '<', 1, *pflags);
1114 574ed2c3 2017-11-29 stsp if (a <= b && c <= d && diff_format == D_NORMAL)
1115 574ed2c3 2017-11-29 stsp diff_output("---\n");
1117 574ed2c3 2017-11-29 stsp i = fetch(ixnew, c, d, f2, diff_format == D_NORMAL ? '>' : '\0', 0, *pflags);
1118 574ed2c3 2017-11-29 stsp if (i != 0 && diff_format == D_EDIT) {
1120 574ed2c3 2017-11-29 stsp * A non-zero return value for D_EDIT indicates that the
1121 574ed2c3 2017-11-29 stsp * last line printed was a bare dot (".") that has been
1122 574ed2c3 2017-11-29 stsp * escaped as ".." to prevent ed(1) from misinterpreting
1123 574ed2c3 2017-11-29 stsp * it. We have to add a substitute command to change this
1124 574ed2c3 2017-11-29 stsp * back and restart where we left off.
1126 574ed2c3 2017-11-29 stsp diff_output(".\n");
1127 574ed2c3 2017-11-29 stsp diff_output("%ds/.//\n", a + i - 1);
1128 574ed2c3 2017-11-29 stsp b = a + i - 1;
1129 574ed2c3 2017-11-29 stsp a = b + 1;
1131 574ed2c3 2017-11-29 stsp goto restart;
1133 574ed2c3 2017-11-29 stsp if ((diff_format == D_EDIT || diff_format == D_REVERSE) && c <= d)
1134 574ed2c3 2017-11-29 stsp diff_output(".\n");
1135 574ed2c3 2017-11-29 stsp if (inifdef) {
1136 574ed2c3 2017-11-29 stsp diff_output("#endif /* %s */\n", ifdefname);
1137 574ed2c3 2017-11-29 stsp inifdef = 0;
1141 574ed2c3 2017-11-29 stsp static int
1142 574ed2c3 2017-11-29 stsp fetch(long *f, int a, int b, FILE *lb, int ch, int oldfile, int flags)
1144 574ed2c3 2017-11-29 stsp int i, j, c, lastc, col, nc;
1147 574ed2c3 2017-11-29 stsp * When doing #ifdef's, copy down to current line
1148 574ed2c3 2017-11-29 stsp * if this is the first file, so that stuff makes it to output.
1150 574ed2c3 2017-11-29 stsp if (diff_format == D_IFDEF && oldfile) {
1151 574ed2c3 2017-11-29 stsp long curpos = ftell(lb);
1152 574ed2c3 2017-11-29 stsp /* print through if append (a>b), else to (nb: 0 vs 1 orig) */
1153 574ed2c3 2017-11-29 stsp nc = f[a > b ? b : a - 1] - curpos;
1154 574ed2c3 2017-11-29 stsp for (i = 0; i < nc; i++)
1155 574ed2c3 2017-11-29 stsp diff_output("%c", getc(lb));
1157 574ed2c3 2017-11-29 stsp if (a > b)
1158 574ed2c3 2017-11-29 stsp return (0);
1159 574ed2c3 2017-11-29 stsp if (diff_format == D_IFDEF) {
1160 574ed2c3 2017-11-29 stsp if (inifdef) {
1161 574ed2c3 2017-11-29 stsp diff_output("#else /* %s%s */\n",
1162 574ed2c3 2017-11-29 stsp oldfile == 1 ? "!" : "", ifdefname);
1164 574ed2c3 2017-11-29 stsp if (oldfile)
1165 574ed2c3 2017-11-29 stsp diff_output("#ifndef %s\n", ifdefname);
1167 574ed2c3 2017-11-29 stsp diff_output("#ifdef %s\n", ifdefname);
1169 574ed2c3 2017-11-29 stsp inifdef = 1 + oldfile;
1171 574ed2c3 2017-11-29 stsp for (i = a; i <= b; i++) {
1172 574ed2c3 2017-11-29 stsp fseek(lb, f[i - 1], SEEK_SET);
1173 574ed2c3 2017-11-29 stsp nc = f[i] - f[i - 1];
1174 574ed2c3 2017-11-29 stsp if (diff_format != D_IFDEF && ch != '\0') {
1175 574ed2c3 2017-11-29 stsp diff_output("%c", ch);
1176 574ed2c3 2017-11-29 stsp if (Tflag && (diff_format == D_NORMAL || diff_format == D_CONTEXT
1177 574ed2c3 2017-11-29 stsp || diff_format == D_UNIFIED))
1178 574ed2c3 2017-11-29 stsp diff_output("\t");
1179 574ed2c3 2017-11-29 stsp else if (diff_format != D_UNIFIED)
1180 574ed2c3 2017-11-29 stsp diff_output(" ");
1183 574ed2c3 2017-11-29 stsp for (j = 0, lastc = '\0'; j < nc; j++, lastc = c) {
1184 574ed2c3 2017-11-29 stsp if ((c = getc(lb)) == EOF) {
1185 574ed2c3 2017-11-29 stsp if (diff_format == D_EDIT || diff_format == D_REVERSE ||
1186 574ed2c3 2017-11-29 stsp diff_format == D_NREVERSE)
1187 574ed2c3 2017-11-29 stsp warnx("No newline at end of file");
1189 574ed2c3 2017-11-29 stsp diff_output("\n\\ No newline at end of "
1190 574ed2c3 2017-11-29 stsp "file\n");
1191 574ed2c3 2017-11-29 stsp return (0);
1193 574ed2c3 2017-11-29 stsp if (c == '\t' && (flags & D_EXPANDTABS)) {
1195 574ed2c3 2017-11-29 stsp diff_output(" ");
1196 574ed2c3 2017-11-29 stsp } while (++col & 7);
1198 574ed2c3 2017-11-29 stsp if (diff_format == D_EDIT && j == 1 && c == '\n'
1199 574ed2c3 2017-11-29 stsp && lastc == '.') {
1201 574ed2c3 2017-11-29 stsp * Don't print a bare "." line
1202 574ed2c3 2017-11-29 stsp * since that will confuse ed(1).
1203 574ed2c3 2017-11-29 stsp * Print ".." instead and return,
1204 574ed2c3 2017-11-29 stsp * giving the caller an offset
1205 574ed2c3 2017-11-29 stsp * from which to restart.
1207 574ed2c3 2017-11-29 stsp diff_output(".\n");
1208 574ed2c3 2017-11-29 stsp return (i - a + 1);
1210 574ed2c3 2017-11-29 stsp diff_output("%c", c);
1215 574ed2c3 2017-11-29 stsp return (0);
1219 574ed2c3 2017-11-29 stsp * Hash function taken from Robert Sedgewick, Algorithms in C, 3d ed., p 578.
1221 574ed2c3 2017-11-29 stsp static int
1222 574ed2c3 2017-11-29 stsp readhash(FILE *f, int flags)
1224 574ed2c3 2017-11-29 stsp int i, t, space;
1228 574ed2c3 2017-11-29 stsp space = 0;
1229 574ed2c3 2017-11-29 stsp if ((flags & (D_FOLDBLANKS|D_IGNOREBLANKS)) == 0) {
1230 574ed2c3 2017-11-29 stsp if (flags & D_IGNORECASE)
1231 574ed2c3 2017-11-29 stsp for (i = 0; (t = getc(f)) != '\n'; i++) {
1232 574ed2c3 2017-11-29 stsp if (t == EOF) {
1233 574ed2c3 2017-11-29 stsp if (i == 0)
1234 574ed2c3 2017-11-29 stsp return (0);
1237 574ed2c3 2017-11-29 stsp sum = sum * 127 + chrtran[t];
1240 574ed2c3 2017-11-29 stsp for (i = 0; (t = getc(f)) != '\n'; i++) {
1241 574ed2c3 2017-11-29 stsp if (t == EOF) {
1242 574ed2c3 2017-11-29 stsp if (i == 0)
1243 574ed2c3 2017-11-29 stsp return (0);
1246 574ed2c3 2017-11-29 stsp sum = sum * 127 + t;
1249 574ed2c3 2017-11-29 stsp for (i = 0;;) {
1250 574ed2c3 2017-11-29 stsp switch (t = getc(f)) {
1251 574ed2c3 2017-11-29 stsp case '\t':
1252 574ed2c3 2017-11-29 stsp case '\r':
1253 574ed2c3 2017-11-29 stsp case '\v':
1254 574ed2c3 2017-11-29 stsp case '\f':
1259 574ed2c3 2017-11-29 stsp if (space && (flags & D_IGNOREBLANKS) == 0) {
1261 574ed2c3 2017-11-29 stsp space = 0;
1263 574ed2c3 2017-11-29 stsp sum = sum * 127 + chrtran[t];
1267 574ed2c3 2017-11-29 stsp if (i == 0)
1268 574ed2c3 2017-11-29 stsp return (0);
1269 574ed2c3 2017-11-29 stsp /* FALLTHROUGH */
1270 574ed2c3 2017-11-29 stsp case '\n':
1277 574ed2c3 2017-11-29 stsp * There is a remote possibility that we end up with a zero sum.
1278 574ed2c3 2017-11-29 stsp * Zero is used as an EOF marker, so return 1 instead.
1280 574ed2c3 2017-11-29 stsp return (sum == 0 ? 1 : sum);
1283 574ed2c3 2017-11-29 stsp static int
1284 574ed2c3 2017-11-29 stsp asciifile(FILE *f)
1286 574ed2c3 2017-11-29 stsp unsigned char buf[BUFSIZ];
1287 574ed2c3 2017-11-29 stsp size_t cnt;
1289 574ed2c3 2017-11-29 stsp if (f == NULL)
1290 574ed2c3 2017-11-29 stsp return (1);
1292 574ed2c3 2017-11-29 stsp rewind(f);
1293 574ed2c3 2017-11-29 stsp cnt = fread(buf, 1, sizeof(buf), f);
1294 574ed2c3 2017-11-29 stsp return (memchr(buf, '\0', cnt) == NULL);
1297 574ed2c3 2017-11-29 stsp #define begins_with(s, pre) (strncmp(s, pre, sizeof(pre)-1) == 0)
1299 574ed2c3 2017-11-29 stsp static char *
1300 574ed2c3 2017-11-29 stsp match_function(const long *f, int pos, FILE *fp)
1302 574ed2c3 2017-11-29 stsp unsigned char buf[FUNCTION_CONTEXT_SIZE];
1303 574ed2c3 2017-11-29 stsp size_t nc;
1304 574ed2c3 2017-11-29 stsp int last = lastline;
1305 574ed2c3 2017-11-29 stsp char *state = NULL;
1307 574ed2c3 2017-11-29 stsp lastline = pos;
1308 574ed2c3 2017-11-29 stsp while (pos > last) {
1309 574ed2c3 2017-11-29 stsp fseek(fp, f[pos - 1], SEEK_SET);
1310 574ed2c3 2017-11-29 stsp nc = f[pos] - f[pos - 1];
1311 574ed2c3 2017-11-29 stsp if (nc >= sizeof(buf))
1312 574ed2c3 2017-11-29 stsp nc = sizeof(buf) - 1;
1313 574ed2c3 2017-11-29 stsp nc = fread(buf, 1, nc, fp);
1314 574ed2c3 2017-11-29 stsp if (nc > 0) {
1315 574ed2c3 2017-11-29 stsp buf[nc] = '\0';
1316 574ed2c3 2017-11-29 stsp buf[strcspn(buf, "\n")] = '\0';
1317 574ed2c3 2017-11-29 stsp if (isalpha(buf[0]) || buf[0] == '_' || buf[0] == '$') {
1318 574ed2c3 2017-11-29 stsp if (begins_with(buf, "private:")) {
1319 574ed2c3 2017-11-29 stsp if (!state)
1320 574ed2c3 2017-11-29 stsp state = " (private)";
1321 574ed2c3 2017-11-29 stsp } else if (begins_with(buf, "protected:")) {
1322 574ed2c3 2017-11-29 stsp if (!state)
1323 574ed2c3 2017-11-29 stsp state = " (protected)";
1324 574ed2c3 2017-11-29 stsp } else if (begins_with(buf, "public:")) {
1325 574ed2c3 2017-11-29 stsp if (!state)
1326 574ed2c3 2017-11-29 stsp state = " (public)";
1328 574ed2c3 2017-11-29 stsp strlcpy(lastbuf, buf, sizeof lastbuf);
1329 574ed2c3 2017-11-29 stsp if (state)
1330 574ed2c3 2017-11-29 stsp strlcat(lastbuf, state,
1331 574ed2c3 2017-11-29 stsp sizeof lastbuf);
1332 574ed2c3 2017-11-29 stsp lastmatchline = pos;
1333 574ed2c3 2017-11-29 stsp return lastbuf;
1339 574ed2c3 2017-11-29 stsp return lastmatchline > 0 ? lastbuf : NULL;
1342 574ed2c3 2017-11-29 stsp /* dump accumulated "context" diff changes */
1343 574ed2c3 2017-11-29 stsp static void
1344 574ed2c3 2017-11-29 stsp dump_context_vec(FILE *f1, FILE *f2, int flags)
1346 574ed2c3 2017-11-29 stsp struct context_vec *cvp = context_vec_start;
1347 574ed2c3 2017-11-29 stsp int lowa, upb, lowc, upd, do_output;
1348 574ed2c3 2017-11-29 stsp int a, b, c, d;
1349 574ed2c3 2017-11-29 stsp char ch, *f;
1351 574ed2c3 2017-11-29 stsp if (context_vec_start > context_vec_ptr)
1354 574ed2c3 2017-11-29 stsp b = d = 0; /* gcc */
1355 574ed2c3 2017-11-29 stsp lowa = MAXIMUM(1, cvp->a - diff_context);
1356 574ed2c3 2017-11-29 stsp upb = MINIMUM(len[0], context_vec_ptr->b + diff_context);
1357 574ed2c3 2017-11-29 stsp lowc = MAXIMUM(1, cvp->c - diff_context);
1358 574ed2c3 2017-11-29 stsp upd = MINIMUM(len[1], context_vec_ptr->d + diff_context);
1360 574ed2c3 2017-11-29 stsp diff_output("***************");
1361 574ed2c3 2017-11-29 stsp if ((flags & D_PROTOTYPE)) {
1362 574ed2c3 2017-11-29 stsp f = match_function(ixold, lowa-1, f1);
1363 574ed2c3 2017-11-29 stsp if (f != NULL)
1364 574ed2c3 2017-11-29 stsp diff_output(" %s", f);
1366 574ed2c3 2017-11-29 stsp diff_output("\n*** ");
1367 574ed2c3 2017-11-29 stsp range(lowa, upb, ",");
1368 574ed2c3 2017-11-29 stsp diff_output(" ****\n");
1371 574ed2c3 2017-11-29 stsp * Output changes to the "old" file. The first loop suppresses
1372 574ed2c3 2017-11-29 stsp * output if there were no changes to the "old" file (we'll see
1373 574ed2c3 2017-11-29 stsp * the "old" lines as context in the "new" list).
1375 574ed2c3 2017-11-29 stsp do_output = 0;
1376 574ed2c3 2017-11-29 stsp for (; cvp <= context_vec_ptr; cvp++)
1377 574ed2c3 2017-11-29 stsp if (cvp->a <= cvp->b) {
1378 574ed2c3 2017-11-29 stsp cvp = context_vec_start;
1379 574ed2c3 2017-11-29 stsp do_output++;
1382 574ed2c3 2017-11-29 stsp if (do_output) {
1383 574ed2c3 2017-11-29 stsp while (cvp <= context_vec_ptr) {
1384 574ed2c3 2017-11-29 stsp a = cvp->a;
1385 574ed2c3 2017-11-29 stsp b = cvp->b;
1386 574ed2c3 2017-11-29 stsp c = cvp->c;
1387 574ed2c3 2017-11-29 stsp d = cvp->d;
1389 574ed2c3 2017-11-29 stsp if (a <= b && c <= d)
1392 574ed2c3 2017-11-29 stsp ch = (a <= b) ? 'd' : 'a';
1394 574ed2c3 2017-11-29 stsp if (ch == 'a')
1395 574ed2c3 2017-11-29 stsp fetch(ixold, lowa, b, f1, ' ', 0, flags);
1397 574ed2c3 2017-11-29 stsp fetch(ixold, lowa, a - 1, f1, ' ', 0, flags);
1398 574ed2c3 2017-11-29 stsp fetch(ixold, a, b, f1,
1399 574ed2c3 2017-11-29 stsp ch == 'c' ? '!' : '-', 0, flags);
1401 574ed2c3 2017-11-29 stsp lowa = b + 1;
1404 574ed2c3 2017-11-29 stsp fetch(ixold, b + 1, upb, f1, ' ', 0, flags);
1406 574ed2c3 2017-11-29 stsp /* output changes to the "new" file */
1407 574ed2c3 2017-11-29 stsp diff_output("--- ");
1408 574ed2c3 2017-11-29 stsp range(lowc, upd, ",");
1409 574ed2c3 2017-11-29 stsp diff_output(" ----\n");
1411 574ed2c3 2017-11-29 stsp do_output = 0;
1412 574ed2c3 2017-11-29 stsp for (cvp = context_vec_start; cvp <= context_vec_ptr; cvp++)
1413 574ed2c3 2017-11-29 stsp if (cvp->c <= cvp->d) {
1414 574ed2c3 2017-11-29 stsp cvp = context_vec_start;
1415 574ed2c3 2017-11-29 stsp do_output++;
1418 574ed2c3 2017-11-29 stsp if (do_output) {
1419 574ed2c3 2017-11-29 stsp while (cvp <= context_vec_ptr) {
1420 574ed2c3 2017-11-29 stsp a = cvp->a;
1421 574ed2c3 2017-11-29 stsp b = cvp->b;
1422 574ed2c3 2017-11-29 stsp c = cvp->c;
1423 574ed2c3 2017-11-29 stsp d = cvp->d;
1425 574ed2c3 2017-11-29 stsp if (a <= b && c <= d)
1428 574ed2c3 2017-11-29 stsp ch = (a <= b) ? 'd' : 'a';
1430 574ed2c3 2017-11-29 stsp if (ch == 'd')
1431 574ed2c3 2017-11-29 stsp fetch(ixnew, lowc, d, f2, ' ', 0, flags);
1433 574ed2c3 2017-11-29 stsp fetch(ixnew, lowc, c - 1, f2, ' ', 0, flags);
1434 574ed2c3 2017-11-29 stsp fetch(ixnew, c, d, f2,
1435 574ed2c3 2017-11-29 stsp ch == 'c' ? '!' : '+', 0, flags);
1437 574ed2c3 2017-11-29 stsp lowc = d + 1;
1440 574ed2c3 2017-11-29 stsp fetch(ixnew, d + 1, upd, f2, ' ', 0, flags);
1442 574ed2c3 2017-11-29 stsp context_vec_ptr = context_vec_start - 1;
1445 574ed2c3 2017-11-29 stsp /* dump accumulated "unified" diff changes */
1446 574ed2c3 2017-11-29 stsp static void
1447 574ed2c3 2017-11-29 stsp dump_unified_vec(FILE *f1, FILE *f2, int flags)
1449 574ed2c3 2017-11-29 stsp struct context_vec *cvp = context_vec_start;
1450 574ed2c3 2017-11-29 stsp int lowa, upb, lowc, upd;
1451 574ed2c3 2017-11-29 stsp int a, b, c, d;
1452 574ed2c3 2017-11-29 stsp char ch, *f;
1454 574ed2c3 2017-11-29 stsp if (context_vec_start > context_vec_ptr)
1457 574ed2c3 2017-11-29 stsp b = d = 0; /* gcc */
1458 574ed2c3 2017-11-29 stsp lowa = MAXIMUM(1, cvp->a - diff_context);
1459 574ed2c3 2017-11-29 stsp upb = MINIMUM(len[0], context_vec_ptr->b + diff_context);
1460 574ed2c3 2017-11-29 stsp lowc = MAXIMUM(1, cvp->c - diff_context);
1461 574ed2c3 2017-11-29 stsp upd = MINIMUM(len[1], context_vec_ptr->d + diff_context);
1463 574ed2c3 2017-11-29 stsp diff_output("@@ -");
1464 574ed2c3 2017-11-29 stsp uni_range(lowa, upb);
1465 574ed2c3 2017-11-29 stsp diff_output(" +");
1466 574ed2c3 2017-11-29 stsp uni_range(lowc, upd);
1467 574ed2c3 2017-11-29 stsp diff_output(" @@");
1468 574ed2c3 2017-11-29 stsp if ((flags & D_PROTOTYPE)) {
1469 574ed2c3 2017-11-29 stsp f = match_function(ixold, lowa-1, f1);
1470 574ed2c3 2017-11-29 stsp if (f != NULL)
1471 574ed2c3 2017-11-29 stsp diff_output(" %s", f);
1473 574ed2c3 2017-11-29 stsp diff_output("\n");
1476 574ed2c3 2017-11-29 stsp * Output changes in "unified" diff format--the old and new lines
1477 574ed2c3 2017-11-29 stsp * are printed together.
1479 574ed2c3 2017-11-29 stsp for (; cvp <= context_vec_ptr; cvp++) {
1480 574ed2c3 2017-11-29 stsp a = cvp->a;
1481 574ed2c3 2017-11-29 stsp b = cvp->b;
1482 574ed2c3 2017-11-29 stsp c = cvp->c;
1483 574ed2c3 2017-11-29 stsp d = cvp->d;
1486 574ed2c3 2017-11-29 stsp * c: both new and old changes
1487 574ed2c3 2017-11-29 stsp * d: only changes in the old file
1488 574ed2c3 2017-11-29 stsp * a: only changes in the new file
1490 574ed2c3 2017-11-29 stsp if (a <= b && c <= d)
1493 574ed2c3 2017-11-29 stsp ch = (a <= b) ? 'd' : 'a';
1495 574ed2c3 2017-11-29 stsp switch (ch) {
1497 574ed2c3 2017-11-29 stsp fetch(ixold, lowa, a - 1, f1, ' ', 0, flags);
1498 574ed2c3 2017-11-29 stsp fetch(ixold, a, b, f1, '-', 0, flags);
1499 574ed2c3 2017-11-29 stsp fetch(ixnew, c, d, f2, '+', 0, flags);
1502 574ed2c3 2017-11-29 stsp fetch(ixold, lowa, a - 1, f1, ' ', 0, flags);
1503 574ed2c3 2017-11-29 stsp fetch(ixold, a, b, f1, '-', 0, flags);
1506 574ed2c3 2017-11-29 stsp fetch(ixnew, lowc, c - 1, f2, ' ', 0, flags);
1507 574ed2c3 2017-11-29 stsp fetch(ixnew, c, d, f2, '+', 0, flags);
1510 574ed2c3 2017-11-29 stsp lowa = b + 1;
1511 574ed2c3 2017-11-29 stsp lowc = d + 1;
1513 574ed2c3 2017-11-29 stsp fetch(ixnew, d + 1, upd, f2, ' ', 0, flags);
1515 574ed2c3 2017-11-29 stsp context_vec_ptr = context_vec_start - 1;
1518 574ed2c3 2017-11-29 stsp static void
1519 574ed2c3 2017-11-29 stsp print_header(const char *file1, const char *file2)
1521 574ed2c3 2017-11-29 stsp if (label[0] != NULL)
1522 574ed2c3 2017-11-29 stsp diff_output("%s %s\n", diff_format == D_CONTEXT ? "***" : "---",
1523 574ed2c3 2017-11-29 stsp label[0]);
1525 574ed2c3 2017-11-29 stsp diff_output("%s %s\t%s", diff_format == D_CONTEXT ? "***" : "---",
1526 574ed2c3 2017-11-29 stsp file1, ctime(&stb1.st_mtime));
1527 574ed2c3 2017-11-29 stsp if (label[1] != NULL)
1528 574ed2c3 2017-11-29 stsp diff_output("%s %s\n", diff_format == D_CONTEXT ? "---" : "+++",
1529 574ed2c3 2017-11-29 stsp label[1]);
1531 574ed2c3 2017-11-29 stsp diff_output("%s %s\t%s", diff_format == D_CONTEXT ? "---" : "+++",
1532 574ed2c3 2017-11-29 stsp file2, ctime(&stb2.st_mtime));
