tree 96c02e1a9c22a7995012578fb25a4244bb7674d3
parent a6df011a099f2c56bc6ae66975a0d019b94bc3b6
author Mads Ager <ager@google.com> 1527757207 +0200
committer Mads Ager <ager@google.com> 1527757207 +0200

Use binary search to find the split covering an instruction.

When there are many splits the linear search ends up taking
a significant portion of the overall dexing time.

R=christofferqa@google.com

Bug: 75353458
Change-Id: I76b401b01e773f34b6c643e42fb39b9ad255c5b8