RFR: 8276660: Scalability bottleneck in java.security.Provider.getService() [v2]

Weijun Wang weijun at openjdk.java.net
Wed Dec 1 01:01:31 UTC 2021

On Wed, 24 Nov 2021 21:17:34 GMT, Valerie Peng <valeriep at openjdk.org> wrote:

>> It is observed that when running crypto benchmark with large number of threads, a lot of time is spent on the synchronized block inside the Provider.getService() method. The cause for this is that Provider.getService() method first uses the 'serviceMap' field to find the requested service. However, when the requested service is not supported by this provider, e.g. requesting Cipher.RSA from SUN provider, the impl continues to try searching the legacy registrations whose processing is guarded by the "synchronized" keyword. When apps use getInstance() calls without the provider argument, Provider class has to iterate through existing providers trying to find one that supports the requested service.
>> Now that the parent class of Provider no longer synchronizes all of its methods, Provider class should follow suit and de-synchronize its methods. Parsing of the legacy registration is done eagerly (at the time of put(...) calls) instead of lazily (at the time of getService(...) calls). This also makes "legacyStrings" redundant as the registration is parsed and stored directly into "legacyMap". 
>> The bug reporter has confirmed that the changes resolve the performance bottleneck and all regression tests pass.
>> Please review and thanks in advance,
>> Valerie
> Valerie Peng has updated the pull request incrementally with one additional commit since the last revision:
>   Updated to use pattern matching with instanceof operator.

Since all legacy registration are done eagerly, I assume the original `ensureLegacyParsed()` method should be super fast now. Maybe we don't need to change any synchronized keyword.


PR: https://git.openjdk.java.net/jdk/pull/6513

More information about the security-dev mailing list