🌐 AI搜索 & 代理 主页
blob: bc49c708c1854a0f67c25e4fd2b77a9ad50ff511 [file] [log] [blame]
Junio C Hamanobe3cfa82005-04-26 16:25:051/*
2 * Copyright (C) 2005 Junio C Hamano
3 */
Junio C Hamano86436c22005-04-26 01:22:474#include "cache.h"
Junio C Hamano6fb737b2005-07-08 06:58:325#include "quote.h"
Junio C Hamano6973dca2006-04-22 06:57:456#include "commit.h"
Junio C Hamano86436c22005-04-26 01:22:477#include "diff.h"
Junio C Hamano427dcb42005-05-21 09:39:098#include "diffcore.h"
Junio C Hamano6973dca2006-04-22 06:57:459#include "revision.h"
Junio C Hamano1cfe7732007-01-30 09:11:0810#include "cache-tree.h"
Linus Torvaldsd1f2d7e2008-01-20 01:27:1211#include "unpack-trees.h"
Junio C Hamano948dd342008-03-31 00:29:4812#include "refs.h"
Jens Lehmannee6fc512010-01-16 17:42:2413#include "submodule.h"
Nguyễn Thái Ngọc Duy429bb402014-01-24 13:40:2814#include "dir.h"
Junio C Hamano427dcb42005-05-21 09:39:0915
Junio C Hamanob46f0b62005-05-04 08:45:2416/*
Junio C Hamano6973dca2006-04-22 06:57:4517 * diff-files
Junio C Hamanob46f0b62005-05-04 08:45:2418 */
Junio C Hamano6973dca2006-04-22 06:57:4519
Junio C Hamano948dd342008-03-31 00:29:4820/*
Junio C Hamano1392a372008-05-04 00:04:4221 * Has the work tree entity been removed?
22 *
23 * Return 1 if it was removed from the work tree, 0 if an entity to be
24 * compared with the cache entry ce still exists (the latter includes
25 * the case where a directory that is not a submodule repository
26 * exists for ce that is a submodule -- it is a submodule that is not
27 * checked out). Return negative for an error.
Junio C Hamano948dd342008-03-31 00:29:4828 */
Linus Torvaldsc40641b2008-05-09 16:21:0729static int check_removed(const struct cache_entry *ce, struct stat *st)
Junio C Hamano948dd342008-03-31 00:29:4830{
31 if (lstat(ce->name, st) < 0) {
32 if (errno != ENOENT && errno != ENOTDIR)
33 return -1;
34 return 1;
35 }
Kjetil Barvik57199892009-02-09 20:54:0636 if (has_symlink_leading_path(ce->name, ce_namelen(ce)))
Junio C Hamano948dd342008-03-31 00:29:4837 return 1;
38 if (S_ISDIR(st->st_mode)) {
39 unsigned char sub[20];
Junio C Hamano1392a372008-05-04 00:04:4240
41 /*
42 * If ce is already a gitlink, we can have a plain
43 * directory (i.e. the submodule is not checked out),
44 * or a checked out submodule. Either case this is not
45 * a case where something was removed from the work tree,
46 * so we will return 0.
47 *
48 * Otherwise, if the directory is not a submodule
49 * repository, that means ce which was a blob turned into
50 * a directory --- the blob was removed!
51 */
52 if (!S_ISGITLINK(ce->ce_mode) &&
53 resolve_gitlink_ref(ce->name, "HEAD", sub))
Junio C Hamano948dd342008-03-31 00:29:4854 return 1;
55 }
56 return 0;
57}
Johannes Schindelind516c2d2007-02-22 20:50:1058
Jens Lehmannae6d5c12010-03-11 21:50:2559/*
60 * Has a file changed or has a submodule new commits or a dirty work tree?
61 *
62 * Return 1 when changes are detected, 0 otherwise. If the DIRTY_SUBMODULES
63 * option is set, the caller does not only want to know if a submodule is
64 * modified at all but wants to know all the conditions that are met (new
65 * commits, untracked content and/or modified content).
66 */
67static int match_stat_with_submodule(struct diff_options *diffopt,
René Scharfeeb9ae4b2013-06-02 15:46:5568 const struct cache_entry *ce,
69 struct stat *st, unsigned ce_option,
70 unsigned *dirty_submodule)
Jens Lehmannae6d5c12010-03-11 21:50:2571{
72 int changed = ce_match_stat(ce, st, ce_option);
Jens Lehmannaee9c7d2010-08-05 22:39:2573 if (S_ISGITLINK(ce->ce_mode)) {
74 unsigned orig_flags = diffopt->flags;
75 if (!DIFF_OPT_TST(diffopt, OVERRIDE_SUBMODULE_CONFIG))
76 set_diffopt_flags_from_submodule_config(diffopt, ce->name);
77 if (DIFF_OPT_TST(diffopt, IGNORE_SUBMODULES))
78 changed = 0;
79 else if (!DIFF_OPT_TST(diffopt, IGNORE_DIRTY_SUBMODULES)
80 && (!changed || DIFF_OPT_TST(diffopt, DIRTY_SUBMODULES)))
81 *dirty_submodule = is_submodule_modified(ce->name, DIFF_OPT_TST(diffopt, IGNORE_UNTRACKED_IN_SUBMODULES));
82 diffopt->flags = orig_flags;
Jens Lehmannae6d5c12010-03-11 21:50:2583 }
84 return changed;
85}
86
Junio C Hamano4bd5b7d2007-11-10 08:15:0387int run_diff_files(struct rev_info *revs, unsigned int option)
Junio C Hamanob46f0b62005-05-04 08:45:2488{
Junio C Hamano6973dca2006-04-22 06:57:4589 int entries, i;
90 int diff_unmerged_stage = revs->max_count;
Junio C Hamanofb63d7f2007-11-10 02:22:5291 unsigned ce_option = ((option & DIFF_RACY_IS_MODIFIED)
92 ? CE_MATCH_RACY_IS_DIRTY : 0);
Junio C Hamano5c975582005-05-19 10:32:3593
Junio C Hamanoa5a818e2008-08-19 03:08:0994 diff_set_mnemonic_prefix(&revs->diffopt, "i/", "w/");
95
Junio C Hamano6973dca2006-04-22 06:57:4596 if (diff_unmerged_stage < 0)
97 diff_unmerged_stage = 2;
Junio C Hamanob4e1e4a2007-02-10 02:51:4098 entries = active_nr;
Junio C Hamano6973dca2006-04-22 06:57:4599 for (i = 0; i < entries; i++) {
Junio C Hamano6973dca2006-04-22 06:57:45100 unsigned int oldmode, newmode;
101 struct cache_entry *ce = active_cache[i];
102 int changed;
Jens Lehmanne3d42c42010-01-18 20:26:18103 unsigned dirty_submodule = 0;
Junio C Hamano0b86fe82014-12-11 21:11:06104 const unsigned char *old_sha1, *new_sha1;
Junio C Hamanof0c6b2a2005-05-27 22:56:38105
Junio C Hamano28b92642011-05-31 16:14:17106 if (diff_can_quit_early(&revs->diffopt))
Junio C Hamano822cac02007-03-14 18:12:51107 break;
108
Nguyễn Thái Ngọc Duy429bb402014-01-24 13:40:28109 if (!ce_path_match(ce, &revs->prune_data, NULL))
Linus Torvalds8676eb42006-02-26 23:51:24110 continue;
Linus Torvalds8676eb42006-02-26 23:51:24111
Junio C Hamano6973dca2006-04-22 06:57:45112 if (ce_stage(ce)) {
Florian Forsterb4b15502006-06-18 15:18:05113 struct combine_diff_path *dpath;
Junio C Hamano095ce952011-04-22 23:19:27114 struct diff_filepair *pair;
115 unsigned int wt_mode = 0;
Junio C Hamano6973dca2006-04-22 06:57:45116 int num_compare_stages = 0;
Florian Forsterb4b15502006-06-18 15:18:05117 size_t path_len;
Jeff King53048102014-05-14 22:13:06118 struct stat st;
Linus Torvalds8676eb42006-02-26 23:51:24119
Florian Forsterb4b15502006-06-18 15:18:05120 path_len = ce_namelen(ce);
121
Junio C Hamano4fc970c2007-02-26 06:24:47122 dpath = xmalloc(combine_diff_path_size(5, path_len));
Florian Forsterb4b15502006-06-18 15:18:05123 dpath->path = (char *) &(dpath->parent[5]);
124
125 dpath->next = NULL;
Florian Forsterb4b15502006-06-18 15:18:05126 memcpy(dpath->path, ce->name, path_len);
127 dpath->path[path_len] = '\0';
brian m. carlson1ff57c12015-03-13 23:39:33128 oidclr(&dpath->oid);
Florian Forsterb4b15502006-06-18 15:18:05129 memset(&(dpath->parent[0]), 0,
Junio C Hamano4fc970c2007-02-26 06:24:47130 sizeof(struct combine_diff_parent)*5);
131
Linus Torvaldsc40641b2008-05-09 16:21:07132 changed = check_removed(ce, &st);
Junio C Hamanof58dbf22008-03-31 00:30:08133 if (!changed)
Junio C Hamano095ce952011-04-22 23:19:27134 wt_mode = ce_mode_from_stat(ce, st.st_mode);
Junio C Hamanof58dbf22008-03-31 00:30:08135 else {
136 if (changed < 0) {
Junio C Hamano4fc970c2007-02-26 06:24:47137 perror(ce->name);
138 continue;
139 }
Junio C Hamano095ce952011-04-22 23:19:27140 wt_mode = 0;
Junio C Hamano4fc970c2007-02-26 06:24:47141 }
Junio C Hamano095ce952011-04-22 23:19:27142 dpath->mode = wt_mode;
Junio C Hamanobe3cfa82005-04-26 16:25:05143
Junio C Hamano6973dca2006-04-22 06:57:45144 while (i < entries) {
145 struct cache_entry *nce = active_cache[i];
146 int stage;
Junio C Hamanobe3cfa82005-04-26 16:25:05147
Junio C Hamano6973dca2006-04-22 06:57:45148 if (strcmp(ce->name, nce->name))
149 break;
Junio C Hamanobe3cfa82005-04-26 16:25:05150
Junio C Hamano6973dca2006-04-22 06:57:45151 /* Stage #2 (ours) is the first parent,
152 * stage #3 (theirs) is the second.
153 */
154 stage = ce_stage(nce);
155 if (2 <= stage) {
Linus Torvalds7a51ed62008-01-15 00:03:17156 int mode = nce->ce_mode;
Junio C Hamano6973dca2006-04-22 06:57:45157 num_compare_stages++;
brian m. carlson1ff57c12015-03-13 23:39:33158 hashcpy(dpath->parent[stage-2].oid.hash, nce->sha1);
Linus Torvalds7a51ed62008-01-15 00:03:17159 dpath->parent[stage-2].mode = ce_mode_from_stat(nce, mode);
Florian Forsterb4b15502006-06-18 15:18:05160 dpath->parent[stage-2].status =
Junio C Hamano6973dca2006-04-22 06:57:45161 DIFF_STATUS_MODIFIED;
162 }
Junio C Hamanocebff982006-03-26 07:12:17163
Junio C Hamano6973dca2006-04-22 06:57:45164 /* diff against the proper unmerged stage */
165 if (stage == diff_unmerged_stage)
166 ce = nce;
167 i++;
H. Peter Anvin1b1480f2005-11-21 22:17:12168 }
Junio C Hamano6973dca2006-04-22 06:57:45169 /*
170 * Compensate for loop update
171 */
172 i--;
Junio C Hamano0e3994f2005-06-03 08:37:54173
Junio C Hamano6973dca2006-04-22 06:57:45174 if (revs->combine_merges && num_compare_stages == 2) {
Florian Forsterb4b15502006-06-18 15:18:05175 show_combined_diff(dpath, 2,
Junio C Hamano6973dca2006-04-22 06:57:45176 revs->dense_combined_merges,
177 revs);
Florian Forsterb4b15502006-06-18 15:18:05178 free(dpath);
Junio C Hamano15d061b2005-05-27 22:55:55179 continue;
180 }
Florian Forsterb4b15502006-06-18 15:18:05181 free(dpath);
182 dpath = NULL;
Junio C Hamano6973dca2006-04-22 06:57:45183
184 /*
185 * Show the diff for the 'ce' if we found the one
186 * from the desired stage.
Junio C Hamano25d5ea42005-05-24 08:10:48187 */
Junio C Hamano095ce952011-04-22 23:19:27188 pair = diff_unmerge(&revs->diffopt, ce->name);
189 if (wt_mode)
190 pair->two->mode = wt_mode;
Junio C Hamano6973dca2006-04-22 06:57:45191 if (ce_stage(ce) != diff_unmerged_stage)
192 continue;
193 }
194
Junio C Hamano125fd982010-01-24 08:10:20195 if (ce_uptodate(ce) || ce_skip_worktree(ce))
Linus Torvaldsd1f2d7e2008-01-20 01:27:12196 continue;
Junio C Hamanof58dbf22008-03-31 00:30:08197
Nguyễn Thái Ngọc Duy540e6942009-08-11 15:43:59198 /* If CE_VALID is set, don't look at workdir for file removal */
Jeff King53048102014-05-14 22:13:06199 if (ce->ce_flags & CE_VALID) {
200 changed = 0;
201 newmode = ce->ce_mode;
202 } else {
203 struct stat st;
204
205 changed = check_removed(ce, &st);
206 if (changed) {
207 if (changed < 0) {
208 perror(ce->name);
209 continue;
210 }
211 diff_addremove(&revs->diffopt, '-', ce->ce_mode,
212 ce->sha1, !is_null_sha1(ce->sha1),
213 ce->name, 0);
Junio C Hamano6973dca2006-04-22 06:57:45214 continue;
Junio C Hamano25d5ea42005-05-24 08:10:48215 }
Jeff King53048102014-05-14 22:13:06216
217 changed = match_stat_with_submodule(&revs->diffopt, ce, &st,
218 ce_option, &dirty_submodule);
219 newmode = ce_mode_from_stat(ce, st.st_mode);
Junio C Hamanobceafe72005-05-24 01:14:03220 }
Jeff King53048102014-05-14 22:13:06221
Jens Lehmann85adbf22010-03-12 21:23:52222 if (!changed && !dirty_submodule) {
Junio C Hamano8fa29602008-03-30 19:39:25223 ce_mark_uptodate(ce);
224 if (!DIFF_OPT_TST(&revs->diffopt, FIND_COPIES_HARDER))
225 continue;
226 }
Linus Torvalds7a51ed62008-01-15 00:03:17227 oldmode = ce->ce_mode;
Junio C Hamano0b86fe82014-12-11 21:11:06228 old_sha1 = ce->sha1;
229 new_sha1 = changed ? null_sha1 : ce->sha1;
Junio C Hamano6973dca2006-04-22 06:57:45230 diff_change(&revs->diffopt, oldmode, newmode,
Junio C Hamano0b86fe82014-12-11 21:11:06231 old_sha1, new_sha1,
232 !is_null_sha1(old_sha1),
233 !is_null_sha1(new_sha1),
Jens Lehmanne3d42c42010-01-18 20:26:18234 ce->name, 0, dirty_submodule);
Junio C Hamano6973dca2006-04-22 06:57:45235
Junio C Hamanobceafe72005-05-24 01:14:03236 }
Junio C Hamano6973dca2006-04-22 06:57:45237 diffcore_std(&revs->diffopt);
238 diff_flush(&revs->diffopt);
239 return 0;
Junio C Hamanobceafe72005-05-24 01:14:03240}
241
Junio C Hamanoe09ad6e2006-04-22 09:43:00242/*
243 * diff-index
244 */
245
246/* A file entry went away or appeared */
247static void diff_index_show_file(struct rev_info *revs,
248 const char *prefix,
René Scharfeeb9ae4b2013-06-02 15:46:55249 const struct cache_entry *ce,
Jeff Kinge5450102012-07-28 15:03:01250 const unsigned char *sha1, int sha1_valid,
251 unsigned int mode,
Jens Lehmanne3d42c42010-01-18 20:26:18252 unsigned dirty_submodule)
Junio C Hamanoe09ad6e2006-04-22 09:43:00253{
Linus Torvalds7a51ed62008-01-15 00:03:17254 diff_addremove(&revs->diffopt, prefix[0], mode,
Jeff Kinge5450102012-07-28 15:03:01255 sha1, sha1_valid, ce->name, dirty_submodule);
Junio C Hamanoe09ad6e2006-04-22 09:43:00256}
257
René Scharfeeb9ae4b2013-06-02 15:46:55258static int get_stat_data(const struct cache_entry *ce,
Junio C Hamanoc8c16f22008-03-02 08:57:26259 const unsigned char **sha1p,
Junio C Hamanoe09ad6e2006-04-22 09:43:00260 unsigned int *modep,
Jens Lehmanne3d42c42010-01-18 20:26:18261 int cached, int match_missing,
Jens Lehmann4d344772010-01-23 16:37:26262 unsigned *dirty_submodule, struct diff_options *diffopt)
Junio C Hamanoe09ad6e2006-04-22 09:43:00263{
Junio C Hamanoc8c16f22008-03-02 08:57:26264 const unsigned char *sha1 = ce->sha1;
Junio C Hamanoe09ad6e2006-04-22 09:43:00265 unsigned int mode = ce->ce_mode;
266
Linus Torvalds658dd482009-05-09 21:57:30267 if (!cached && !ce_uptodate(ce)) {
Junio C Hamanoe09ad6e2006-04-22 09:43:00268 int changed;
269 struct stat st;
Linus Torvaldsc40641b2008-05-09 16:21:07270 changed = check_removed(ce, &st);
Junio C Hamano948dd342008-03-31 00:29:48271 if (changed < 0)
272 return -1;
273 else if (changed) {
274 if (match_missing) {
Junio C Hamanoe09ad6e2006-04-22 09:43:00275 *sha1p = sha1;
276 *modep = mode;
277 return 0;
278 }
279 return -1;
280 }
Jens Lehmannae6d5c12010-03-11 21:50:25281 changed = match_stat_with_submodule(diffopt, ce, &st,
282 0, dirty_submodule);
Junio C Hamanoe09ad6e2006-04-22 09:43:00283 if (changed) {
Junio C Hamano185c9752007-02-17 06:43:48284 mode = ce_mode_from_stat(ce, st.st_mode);
Junio C Hamanoc8c16f22008-03-02 08:57:26285 sha1 = null_sha1;
Junio C Hamanoe09ad6e2006-04-22 09:43:00286 }
287 }
288
289 *sha1p = sha1;
290 *modep = mode;
291 return 0;
292}
293
Kjetil Barvikff7e6aa2009-01-11 18:36:42294static void show_new_file(struct rev_info *revs,
René Scharfeeb9ae4b2013-06-02 15:46:55295 const struct cache_entry *new,
Junio C Hamanoe09ad6e2006-04-22 09:43:00296 int cached, int match_missing)
297{
Junio C Hamanoc8c16f22008-03-02 08:57:26298 const unsigned char *sha1;
Junio C Hamanoe09ad6e2006-04-22 09:43:00299 unsigned int mode;
Jens Lehmanne3d42c42010-01-18 20:26:18300 unsigned dirty_submodule = 0;
Junio C Hamanoe09ad6e2006-04-22 09:43:00301
Junio C Hamano948dd342008-03-31 00:29:48302 /*
303 * New file in the index: it might actually be different in
Carlos Martín Nietof7d650c2011-09-20 20:25:57304 * the working tree.
Junio C Hamanoe09ad6e2006-04-22 09:43:00305 */
Jens Lehmanne3d42c42010-01-18 20:26:18306 if (get_stat_data(new, &sha1, &mode, cached, match_missing,
Jens Lehmann4d344772010-01-23 16:37:26307 &dirty_submodule, &revs->diffopt) < 0)
Junio C Hamanoe09ad6e2006-04-22 09:43:00308 return;
309
Jeff Kinge5450102012-07-28 15:03:01310 diff_index_show_file(revs, "+", new, sha1, !is_null_sha1(sha1), mode, dirty_submodule);
Junio C Hamanoe09ad6e2006-04-22 09:43:00311}
312
Kjetil Barvikff7e6aa2009-01-11 18:36:42313static int show_modified(struct rev_info *revs,
René Scharfeeb9ae4b2013-06-02 15:46:55314 const struct cache_entry *old,
315 const struct cache_entry *new,
Junio C Hamanoe09ad6e2006-04-22 09:43:00316 int report_missing,
317 int cached, int match_missing)
318{
319 unsigned int mode, oldmode;
Junio C Hamanoc8c16f22008-03-02 08:57:26320 const unsigned char *sha1;
Jens Lehmanne3d42c42010-01-18 20:26:18321 unsigned dirty_submodule = 0;
Junio C Hamanoe09ad6e2006-04-22 09:43:00322
Jens Lehmanne3d42c42010-01-18 20:26:18323 if (get_stat_data(new, &sha1, &mode, cached, match_missing,
Jens Lehmann4d344772010-01-23 16:37:26324 &dirty_submodule, &revs->diffopt) < 0) {
Junio C Hamanoe09ad6e2006-04-22 09:43:00325 if (report_missing)
326 diff_index_show_file(revs, "-", old,
Jeff Kinge5450102012-07-28 15:03:01327 old->sha1, 1, old->ce_mode, 0);
Junio C Hamanoe09ad6e2006-04-22 09:43:00328 return -1;
329 }
330
Paul Mackerrascb2b9f52006-09-04 11:38:40331 if (revs->combine_merges && !cached &&
332 (hashcmp(sha1, old->sha1) || hashcmp(old->sha1, new->sha1))) {
333 struct combine_diff_path *p;
334 int pathlen = ce_namelen(new);
335
336 p = xmalloc(combine_diff_path_size(2, pathlen));
337 p->path = (char *) &p->parent[2];
338 p->next = NULL;
Paul Mackerrascb2b9f52006-09-04 11:38:40339 memcpy(p->path, new->name, pathlen);
340 p->path[pathlen] = 0;
Linus Torvalds7a51ed62008-01-15 00:03:17341 p->mode = mode;
brian m. carlson1ff57c12015-03-13 23:39:33342 oidclr(&p->oid);
Paul Mackerrascb2b9f52006-09-04 11:38:40343 memset(p->parent, 0, 2 * sizeof(struct combine_diff_parent));
344 p->parent[0].status = DIFF_STATUS_MODIFIED;
Linus Torvalds7a51ed62008-01-15 00:03:17345 p->parent[0].mode = new->ce_mode;
brian m. carlson1ff57c12015-03-13 23:39:33346 hashcpy(p->parent[0].oid.hash, new->sha1);
Paul Mackerrascb2b9f52006-09-04 11:38:40347 p->parent[1].status = DIFF_STATUS_MODIFIED;
Linus Torvalds7a51ed62008-01-15 00:03:17348 p->parent[1].mode = old->ce_mode;
brian m. carlson1ff57c12015-03-13 23:39:33349 hashcpy(p->parent[1].oid.hash, old->sha1);
Paul Mackerrascb2b9f52006-09-04 11:38:40350 show_combined_diff(p, 2, revs->dense_combined_merges, revs);
351 free(p);
352 return 0;
353 }
354
Junio C Hamanoe09ad6e2006-04-22 09:43:00355 oldmode = old->ce_mode;
Jens Lehmann85adbf22010-03-12 21:23:52356 if (mode == oldmode && !hashcmp(sha1, old->sha1) && !dirty_submodule &&
Pierre Habouzit8f67f8a2007-11-10 19:05:14357 !DIFF_OPT_TST(&revs->diffopt, FIND_COPIES_HARDER))
Junio C Hamanoe09ad6e2006-04-22 09:43:00358 return 0;
359
Junio C Hamanoe09ad6e2006-04-22 09:43:00360 diff_change(&revs->diffopt, oldmode, mode,
Jeff Kinge5450102012-07-28 15:03:01361 old->sha1, sha1, 1, !is_null_sha1(sha1),
362 old->name, 0, dirty_submodule);
Junio C Hamanoe09ad6e2006-04-22 09:43:00363 return 0;
364}
365
Junio C Hamanoe09ad6e2006-04-22 09:43:00366/*
Linus Torvaldsd1f2d7e2008-01-20 01:27:12367 * This gets a mix of an existing index and a tree, one pathname entry
368 * at a time. The index entry may be a single stage-0 one, but it could
369 * also be multiple unmerged entries (in which case idx_pos/idx_nr will
370 * give you the position and number of entries in the index).
371 */
372static void do_oneway_diff(struct unpack_trees_options *o,
René Scharfeeb9ae4b2013-06-02 15:46:55373 const struct cache_entry *idx,
374 const struct cache_entry *tree)
Junio C Hamanoe09ad6e2006-04-22 09:43:00375{
Kjetil Barvikff7e6aa2009-01-11 18:36:42376 struct rev_info *revs = o->unpack_data;
Linus Torvaldsd1f2d7e2008-01-20 01:27:12377 int match_missing, cached;
Junio C Hamano5c21ac02006-04-22 10:58:04378
Nguyễn Thái Ngọc Duy540e6942009-08-11 15:43:59379 /* if the entry is not checked out, don't examine work tree */
Nguyễn Thái Ngọc Duyb4d16902009-08-20 13:46:58380 cached = o->index_only ||
381 (idx && ((idx->ce_flags & CE_VALID) || ce_skip_worktree(idx)));
Junio C Hamanoa6080a02007-06-07 07:04:01382 /*
Junio C Hamano5c21ac02006-04-22 10:58:04383 * Backward compatibility wart - "diff-index -m" does
Linus Torvaldsd1f2d7e2008-01-20 01:27:12384 * not mean "do not ignore merges", but "match_missing".
385 *
386 * But with the revision flag parsing, that's found in
387 * "!revs->ignore_merges".
Junio C Hamano5c21ac02006-04-22 10:58:04388 */
Linus Torvaldsd1f2d7e2008-01-20 01:27:12389 match_missing = !revs->ignore_merges;
390
391 if (cached && idx && ce_stage(idx)) {
Junio C Hamanofa7b2902011-04-22 23:05:58392 struct diff_filepair *pair;
393 pair = diff_unmerge(&revs->diffopt, idx->name);
Junio C Hamanoff00b682011-07-14 04:36:29394 if (tree)
Jeff Kinge5450102012-07-28 15:03:01395 fill_filespec(pair->one, tree->sha1, 1, tree->ce_mode);
Linus Torvaldsd1f2d7e2008-01-20 01:27:12396 return;
397 }
398
399 /*
400 * Something added to the tree?
401 */
402 if (!tree) {
Kjetil Barvikff7e6aa2009-01-11 18:36:42403 show_new_file(revs, idx, cached, match_missing);
Linus Torvaldsd1f2d7e2008-01-20 01:27:12404 return;
405 }
406
407 /*
408 * Something removed from the tree?
409 */
410 if (!idx) {
Jeff Kinge5450102012-07-28 15:03:01411 diff_index_show_file(revs, "-", tree, tree->sha1, 1, tree->ce_mode, 0);
Linus Torvaldsd1f2d7e2008-01-20 01:27:12412 return;
413 }
414
415 /* Show difference between old and new */
Kjetil Barvikff7e6aa2009-01-11 18:36:42416 show_modified(revs, tree, idx, 1, cached, match_missing);
Linus Torvaldsd1f2d7e2008-01-20 01:27:12417}
418
419/*
Linus Torvaldsd1f2d7e2008-01-20 01:27:12420 * The unpack_trees() interface is designed for merging, so
421 * the different source entries are designed primarily for
422 * the source trees, with the old index being really mainly
423 * used for being replaced by the result.
424 *
425 * For diffing, the index is more important, and we only have a
426 * single tree.
427 *
Junio C Hamanoda8ba5e2009-09-18 05:12:17428 * We're supposed to advance o->pos to skip what we have already processed.
Linus Torvaldsd1f2d7e2008-01-20 01:27:12429 *
430 * This wrapper makes it all more readable, and takes care of all
431 * the fairly complex unpack_trees() semantic requirements, including
432 * the skipping, the path matching, the type conflict cases etc.
433 */
René Scharfe5828e832013-06-02 15:46:56434static int oneway_diff(const struct cache_entry * const *src,
435 struct unpack_trees_options *o)
Linus Torvaldsd1f2d7e2008-01-20 01:27:12436{
René Scharfeeb9ae4b2013-06-02 15:46:55437 const struct cache_entry *idx = src[0];
438 const struct cache_entry *tree = src[1];
Kjetil Barvikff7e6aa2009-01-11 18:36:42439 struct rev_info *revs = o->unpack_data;
Linus Torvaldsd1f2d7e2008-01-20 01:27:12440
Linus Torvaldsd1f2d7e2008-01-20 01:27:12441 /*
442 * Unpack-trees generates a DF/conflict entry if
443 * there was a directory in the index and a tree
444 * in the tree. From a diff standpoint, that's a
445 * delete of the tree and a create of the file.
446 */
447 if (tree == o->df_conflict_entry)
448 tree = NULL;
449
Nguyễn Thái Ngọc Duy429bb402014-01-24 13:40:28450 if (ce_path_match(idx ? idx : tree, &revs->prune_data, NULL)) {
Linus Torvalds34110cd2008-03-07 02:12:28451 do_oneway_diff(o, idx, tree);
Junio C Hamanob4194822011-05-31 17:06:44452 if (diff_can_quit_early(&revs->diffopt)) {
453 o->exiting_early = 1;
454 return -1;
455 }
456 }
Linus Torvaldsd1f2d7e2008-01-20 01:27:12457
Linus Torvalds34110cd2008-03-07 02:12:28458 return 0;
Linus Torvaldsd1f2d7e2008-01-20 01:27:12459}
460
Junio C Hamanobf979c02011-07-14 01:57:42461static int diff_cache(struct rev_info *revs,
462 const unsigned char *tree_sha1,
463 const char *tree_name,
464 int cached)
Linus Torvaldsd1f2d7e2008-01-20 01:27:12465{
Linus Torvaldsd1f2d7e2008-01-20 01:27:12466 struct tree *tree;
Linus Torvaldsd1f2d7e2008-01-20 01:27:12467 struct tree_desc t;
Junio C Hamanobf979c02011-07-14 01:57:42468 struct unpack_trees_options opts;
Junio C Hamanoe09ad6e2006-04-22 09:43:00469
Junio C Hamanobf979c02011-07-14 01:57:42470 tree = parse_tree_indirect(tree_sha1);
Junio C Hamanoe09ad6e2006-04-22 09:43:00471 if (!tree)
Junio C Hamanobf979c02011-07-14 01:57:42472 return error("bad tree object %s",
473 tree_name ? tree_name : sha1_to_hex(tree_sha1));
Linus Torvaldsd1f2d7e2008-01-20 01:27:12474 memset(&opts, 0, sizeof(opts));
475 opts.head_idx = 1;
476 opts.index_only = cached;
Junio C Hamanoa0919ce2009-05-23 06:14:25477 opts.diff_index_cached = (cached &&
478 !DIFF_OPT_TST(&revs->diffopt, FIND_COPIES_HARDER));
Linus Torvaldsd1f2d7e2008-01-20 01:27:12479 opts.merge = 1;
480 opts.fn = oneway_diff;
Kjetil Barvikff7e6aa2009-01-11 18:36:42481 opts.unpack_data = revs;
Linus Torvalds34110cd2008-03-07 02:12:28482 opts.src_index = &the_index;
483 opts.dst_index = NULL;
Junio C Hamano2f88c192011-08-29 20:34:08484 opts.pathspec = &revs->diffopt.pathspec;
Nguyen Thai Ngoc Duy48382372012-01-15 10:03:27485 opts.pathspec->recursive = 1;
Linus Torvaldsd1f2d7e2008-01-20 01:27:12486
487 init_tree_desc(&t, tree->buffer, tree->size);
Junio C Hamanobf979c02011-07-14 01:57:42488 return unpack_trees(1, &t, &opts);
489}
490
491int run_diff_index(struct rev_info *revs, int cached)
492{
493 struct object_array_entry *ent;
494
495 ent = revs->pending.objects;
brian m. carlsoned1c9972015-11-10 02:22:29496 if (diff_cache(revs, ent->item->oid.hash, ent->name, cached))
Daniel Barkalow203a2fe2008-02-07 16:39:48497 exit(128);
Linus Torvaldsd1f2d7e2008-01-20 01:27:12498
Junio C Hamanoa5a818e2008-08-19 03:08:09499 diff_set_mnemonic_prefix(&revs->diffopt, "c/", cached ? "i/" : "w/");
Junio C Hamano730f7282009-09-20 07:03:39500 diffcore_fix_diff_index(&revs->diffopt);
Junio C Hamanoe09ad6e2006-04-22 09:43:00501 diffcore_std(&revs->diffopt);
502 diff_flush(&revs->diffopt);
Linus Torvaldsd1f2d7e2008-01-20 01:27:12503 return 0;
Junio C Hamanoe09ad6e2006-04-22 09:43:00504}
Junio C Hamano1cfe7732007-01-30 09:11:08505
506int do_diff_cache(const unsigned char *tree_sha1, struct diff_options *opt)
507{
Junio C Hamano1cfe7732007-01-30 09:11:08508 struct rev_info revs;
Junio C Hamano1cfe7732007-01-30 09:11:08509
510 init_revisions(&revs, NULL);
Nguyễn Thái Ngọc Duy9a087272013-07-14 08:35:59511 copy_pathspec(&revs.prune_data, &opt->pathspec);
Junio C Hamanobf979c02011-07-14 01:57:42512 revs.diffopt = *opt;
Johannes Schindelin204ce972008-01-20 15:19:56513
Junio C Hamanobf979c02011-07-14 01:57:42514 if (diff_cache(&revs, tree_sha1, NULL, 1))
Daniel Barkalow203a2fe2008-02-07 16:39:48515 exit(128);
Johannes Schindelin204ce972008-01-20 15:19:56516 return 0;
Junio C Hamano1cfe7732007-01-30 09:11:08517}
Stephan Beyer75f3ff22009-02-10 14:30:35518
519int index_differs_from(const char *def, int diff_flags)
520{
521 struct rev_info rev;
Junio C Hamano32962c92010-03-09 06:58:09522 struct setup_revision_opt opt;
Stephan Beyer75f3ff22009-02-10 14:30:35523
524 init_revisions(&rev, NULL);
Junio C Hamano32962c92010-03-09 06:58:09525 memset(&opt, 0, sizeof(opt));
526 opt.def = def;
527 setup_revisions(0, NULL, &rev, &opt);
Junio C Hamano90b19942009-05-23 08:15:35528 DIFF_OPT_SET(&rev.diffopt, QUICK);
Stephan Beyer75f3ff22009-02-10 14:30:35529 DIFF_OPT_SET(&rev.diffopt, EXIT_WITH_STATUS);
530 rev.diffopt.flags |= diff_flags;
531 run_diff_index(&rev, 1);
532 if (rev.pending.alloc)
533 free(rev.pending.objects);
534 return (DIFF_OPT_TST(&rev.diffopt, HAS_CHANGES) != 0);
535}