@matheusbsbs / matheus-bagliano / commits / 5f46e610cb
Fork 0

diff: check for merge bases before assigning sym->base

In symdiff_prepare(), we iterate over the set of parsed objects to pick out any symmetric differences, including the left, right, and base elements. We assign the results into pointers in a "struct symdiff", and then complain if we didn't find a base, like so: sym->left = rev->pending.objects[lpos].name; sym->right = rev->pending.objects[rpos].name; sym->base = rev->pending.objects[basepos].name; if (basecount == 0) die(_("%s...%s: no merge base"), sym->left, sym->right); But the least lines are backwards. If basecount is 0, then basepos will be -1, and we will access memory outside of the pending array. This isn't usually that big a deal, since we don't do anything besides a single pointer-sized read before exiting anyway, but it does violate the C standard, and of course memory-checking tools like ASan complain. Let's put the basecount check first. Note that we haveto split it from the other assignments, since the die() relies on sym->left and sym->right having been assigned (this isn't strictly necessary, but is easier to read than dereferencing the pending array again). Reported-by: brian m. carlson <sandals@crustytoothpaste.net> Signed-off-by: Jeff King <peff@peff.net> Signed-off-by: Junio C Hamano <gitster@pobox.com>

Jeff King committed Jul 8, 2020 at 00:38 UTC 5f46e610cb43496612d7ec030d142b6b8515399d
1 file changed +1 -1
builtin/diff.c
+1 -1
@@ -355,9 +355,9 @@ static void symdiff_prepare(struct rev_info *rev, struct symdiff *sym)
355
356 sym->left = rev->pending.objects[lpos].name;
357 sym->right = rev->pending.objects[rpos].name;
358 - sym->base = rev->pending.objects[basepos].name;
358 if (basecount == 0)
359 die(_("%s...%s: no merge base"), sym->left, sym->right);
360 + sym->base = rev->pending.objects[basepos].name;
361 bitmap_unset(map, basepos); /* unmark the base we want */
362 sym->warn = basecount > 1;
363 sym->skip = map;