-
Paul Adenot authored
Bug 1821362 - Replace EuclidGCD by a binary gcd algorithm using intrinsics. r=media-playback-reviewers,alwu Perf notes: https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/ Differential Revision: https://phabricator.services.mozilla.com/D173315
Paul Adenot authoredBug 1821362 - Replace EuclidGCD by a binary gcd algorithm using intrinsics. r=media-playback-reviewers,alwu Perf notes: https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/ Differential Revision: https://phabricator.services.mozilla.com/D173315