RFR: JDK-8323186: A faster algorithm for MutablebigInteger.divWord(long, int) [v2]

[fabioromano1]

> The method `MutableBigInteger.divWord(long, int)` can use the algorithm of Hacker's Delight (2nd ed), section 9.3, the same used in `Long.divideUnsigned(long, long)` and `Long.remainderUnsigned(long, long)`, to get the computation faster.

fabioromano1 has updated the pull request with a new target base due to a merge or a rebase. The incremental webrev excludes the unrelated changes brought in by the merge/rebase. The pull request contains five additional commits since the last revision:

 - Merge branch 'patch-BigIntegerDivision' of https://github.com/fabioromano1/jdk into patch-BigIntegerDivision
 - Merge branch 'openjdk:master' into patch-BigIntegerDivision
 - Merge branch 'openjdk:master' into patch-BigIntegerDivision
 - Added file to estimate divWord running time
 - Implementation of divWord(long, int) changed

-------------

Changes:
  - all: https://git.openjdk.org/jdk/pull/17291/files
  - new: https://git.openjdk.org/jdk/pull/17291/files/5345d6d8..2d432f8d

Webrevs:
 - full: https://webrevs.openjdk.org/?repo=jdk&pr=17291&range=01
 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=17291&range=00-01

  Stats: 11455 lines in 120 files changed: 9221 ins; 991 del; 1243 mod
  Patch: https://git.openjdk.org/jdk/pull/17291.diff
  Fetch: git fetch https://git.openjdk.org/jdk.git pull/17291/head:pull/17291

PR: https://git.openjdk.org/jdk/pull/17291