JDK-8134150 : Make Nashorn Timing class both threadsafe and efficient
- Type: Bug
- Component: core-libs
- Sub-Component: jdk.nashorn
- Affected Version: 9
- Priority: P4
- Status: Resolved
- Resolution: Fixed
- OS: generic
- CPU: generic
- Submitted: 2015-08-21
- Updated: 2016-01-14
- Resolved: 2015-08-24
The Version table provides details related to the release that this issue/RFE will be addressed.
Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.
To download the current JDK release, click here.
Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.
To download the current JDK release, click here.
| JDK 8 | JDK 9 |
|---|---|
8u72Fixed  |
9 b80Fixed |
Description
Timing.java in Nashorn currently uses a LinkedHashMap<String, Long> to record compilation timings. This is grossly inefficient (not to mention not being thread safe). The solution is to switch to using a ConcurrentHashMap<String, LongAdder> instead; with a separate LinkedBlockingQueue<String> to preserve ordering of stats.