diff options
| author | Junio C Hamano <gitster@pobox.com> | 2017-07-13 00:18:23 +0200 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2017-07-13 00:18:23 +0200 |
| commit | f056cde60e7b095edf1530554a8c9528bd8b374b (patch) | |
| tree | 1507f5729cc2a2718b59712b0aac3a7350c2144f /sha1_name.c | |
| parent | Merge branch 'kn/ref-filter-branch-list' (diff) | |
| parent | use DIV_ROUND_UP (diff) | |
| download | git-f056cde60e7b095edf1530554a8c9528bd8b374b.tar.xz git-f056cde60e7b095edf1530554a8c9528bd8b374b.zip | |
Merge branch 'rs/use-div-round-up'
Code cleanup.
* rs/use-div-round-up:
use DIV_ROUND_UP
Diffstat (limited to 'sha1_name.c')
| -rw-r--r-- | sha1_name.c | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/sha1_name.c b/sha1_name.c index e7f7b12ceb..74fcb6d788 100644 --- a/sha1_name.c +++ b/sha1_name.c @@ -489,10 +489,9 @@ int find_unique_abbrev_r(char *hex, const unsigned char *sha1, int len) * We now know we have on the order of 2^len objects, which * expects a collision at 2^(len/2). But we also care about hex * chars, not bits, and there are 4 bits per hex. So all - * together we need to divide by 2; but we also want to round - * odd numbers up, hence adding one before dividing. + * together we need to divide by 2 and round up. */ - len = (len + 1) / 2; + len = DIV_ROUND_UP(len, 2); /* * For very small repos, we stick with our regular fallback. */ |