git/regex at 188960b4d68e0b77e31481592b86306a9ce37632 - git

Tree: 188960b4d6

Derrick Stolee 19716b21a4 cleanup: fix possible overflow errors in binary search A common mistake when writing binary search is to allow possible integer overflow by using the simple average: mid = (min + max) / 2; Instead, use the overflow-safe version: mid = min + (max - min) / 2; This translation is safe since the operation occurs inside a loop conditioned on "min < max". The included changes were found using the following git grep: git grep '/ 2;' '.c' Making this cleanup will prevent future review friction when a new binary search is contructed based on existing code. Signed-off-by: Derrick Stolee <dstolee@microsoft.com> Reviewed-by: Jeff King <peff@peff.net> Signed-off-by: Junio C Hamano <gitster@pobox.com>		7 years ago
..
regcomp.c	…
regex.c	…
regex.h	…
regex_internal.c	cleanup: fix possible overflow errors in binary search	7 years ago
regex_internal.h	…
regexec.c	cleanup: fix possible overflow errors in binary search	7 years ago